class Solution {
public:
int sqrt(int x) {
int left=1,right=x/2;
int res;
if(x<2)return x;
while(left<=right)
{
int mid=(right-left)/2+left;
if(x/mid>mid)left=mid+1,res=mid;
else if(x/mid<mid)right=mid-1;
else return mid;
}
return res;
}
};
https://leetcode-cn.com/problems/sqrtx/
链接 https://leetcode-cn.com/problems/sqrtx/description/ 要求...
https://leetcode-cn.com/problems/sqrtx/submissions/[https...
来源：力扣（LeetCode）链接：https://leetcode-cn.com/problems/sqrtx ...
题目地址 https://leetcode.com/problems/sqrtx/description/[htt...
title: sqrtxtags:- sqrtx- No.69- simple- binary-search- m...
69. Sqrt(x)[https://leetcode-cn.com/problems/sqrtx/] 解题思路...
69. x 的平方根 题目来源：https://leetcode-cn.com/problems/sqrtx 题目...
问题描述 Implementint sqrt(int x).Compute and return the squa...
本文标题：sqrtx
本文链接：https://www.haomeiwen.com/subject/vxbhlctx.html
网友评论