class Solution {
public int mySqrt(int x) {
int l = 0, r = x, mid = 0, res = -1;
while(l <= r) {
mid = l + (r - l) / 2;
if((long) mid * mid <= x) {
res = mid;
l = mid + 1;
} else {
r = mid - 1;
}
}
return res;
}
}
用left + (right - left)/2代替(right + left)/2防止right + left溢出
mid*mid是有可能超过int的范围的,可以(long)或者换成除法