二分搜索法求平方根:
public class Solution {
public int mySqrt(int x) {
//既然是寻找一个数的平方根,就属于查找的方式,查找中有二分查找法
//二分查找法求平方根,记住算法,无限逼近
if (x == 0) return 0;
int left = 1, right = x, ans = 0;
while (left <= right) {
int mid = (left + right) / 2;
if(mid == x / mid) return mid;
if (mid < x / mid) {//不能写成if (mid * mid < x),否则当mid大于sqrt(x)时会溢出
left = mid + 1;
ans = mid;
}
else {
right = mid - 1;
//ans = mid; 这一句不要,因为返回的是整型,开方取地板,所以ans放在if(mid < x / mid)那里
}
}
return ans;
}
}
牛顿迭代算法:
class Solution {
public int mySqrt(int x) {
//牛顿迭代算法求平方根,记住
long r = x;
while (r * r > x)
r = (r + x / r) / 2;
return (int) r;
}
}