简单题。
二分法
class Solution {
public:
int bsearch(int x, int low, int high){
return -1;
}
int mySqrt(int x) {
if(x == 1 || x == 0) return x;
int low = 0;
int high = x;
long tmp;
while(low <= high){
long mid = low + (high - low)/2;
tmp = mid*mid;
if(tmp <= x && (mid+1)*(mid+1)>x) return mid;
else if(tmp > x) high = mid;
else low = mid;
}
return -1;
}
};