/*
* 算法思想:
* 二分法
*/
int mySqrt(int x){
unsigned long long i=1, tmp, j=x, mid;
while(i<=j) {
mid = i+(j-i)/2;
tmp = mid * mid;
if(tmp > x) {
j = mid -1;
}else if(tmp < x) {
i = mid + 1;
}else {
break;
}
}
return mid*mid > x ? mid-1 : mid;
}
leetcoe-69-x的平方根-C语言
最新推荐文章于 2023-12-31 00:05:24 发布