Easy 16 Sqrt(x)(69)
2017-04-18 16:14
281 查看
Description
Implement int sqrt(int x).
Compute and return the square root of x.
Solution
返回整型的平方根,可以二分查找0-x。当然,还可以用牛顿迭代法求平方根,可以到任意精度。
推到下牛顿迭代法求平方根:
Implement int sqrt(int x).
Compute and return the square root of x.
Solution
返回整型的平方根,可以二分查找0-x。当然,还可以用牛顿迭代法求平方根,可以到任意精度。
class Solution { public: int mySqrt(int x) { double ne1=0,ne2=x; while(abs(ne2-ne1)>0.1){ ne1=ne2; ne2=(ne1+x/ne1)/2;//牛顿迭代法 } return ne2; } };
推到下牛顿迭代法求平方根:
相关文章推荐
- Leetcode 69. Sqrt(x) (Easy)
- Leetcode OJ 69 Sqrt(x) [Easy]
- LeetCode-69.Sqrt(x)
- LeetCode --- 69. Sqrt(x)
- Leetcode 69 sqrt(x)
- [Leetcode]69. Sqrt(x)解析@Python
- [Leetcode 69, Medium] Sqrt(x)
- 69. Sqrt(x)
- [LeetCode-69] Sqrt(x)(求解平方根)
- [69]Sqrt(x)
- 【leetcode】:leetcode 69 Sqrt(x) 牛顿迭代法
- 69. Sqrt(x)
- [Leetcode]@python 69. Sqrt(x)
- Math-69-Sqrt(x)
- 69. Sqrt(x)
- 【LeetCode】69. Sqrt(x)
- leetcode:69. Sqrt(x)
- 69. Sqrt(x)
- LeetCode_OJ【69】Sqrt(x)
- [leetcode]69. Sqrt(x)