原题链接:Leecode 69. x 的平方根
class Solution {
public:
int mySqrt(int x) {
int l=0,r=x,res=1;
while(l<=r)
{
int mid = l + (r - l) / 2;
if ((long long) mid * mid <= x) l=mid+1;
else r=mid-1;
}
return r;
}
};