LeetCode 70 X的平方和
LeetCode 70 X的平方和
class Solution {
public int mySqrt(int x) {
long l = 0;
long r = x;
while(l<r){
long mid = l + r + 1 >> 1;
if(mid*mid<=x){
l = mid;
}else{
r = mid - 1;
}
}
return (int)l;
}
}

浙公网安备 33010602011771号