【leetcode】Sqrt(x)

Sqrt(x)

class Solution {
public:
int mySqrt(int x) {
if(x<=1) return x;
int left=1, right=x;
while(left<=right)
{
int mid=(left+right)/2;
if(mid==x/mid) return mid;
if(mid > x/mid) right=mid-1;
else left=mid+1;
}
return right;
}
};