一.一道算法题
69. Sqrt(x)
题意:
Discuss
Pick One
Implement int sqrt(int x).
Compute and return the square root of x.
本题只用解出最终答案的整数位即可,故除了牛顿迭代法还有其他方法可用
二.牛顿迭代法代码
class Solution {
public:
int mySqrt(int x) {
if(x==0)
return 0;
double result=x+0.0;
while(result*result-x>0.1)
{
result = (result+(x+0.0)/result)*0.5;
}
return (int)result;
}
};
可以调整误差进而提高效率
三.类二分查找法
class Solution {
public:
int mySqrt(int x) {
if (x <= 1) return x;
int lo = 1, hi = x - 1, ans = lo;
while (lo <= hi) {
int md = lo + (hi-lo)/2;
if (md <= x/md) ans = md, lo = md + 1;
else hi = md - 1;
}
return ans;
}
};
这个方法很难想到,暂且搁置