LeetCode-69. Sqrt(x)

Description

Example 1

Example 2

Solution 1(C++)

class Solution {
public:
    int mySqrt(int x) {
        long r = x;
        while (r*r > x)
            r = (r + x/r) / 2;
        return r;
    }
};

Solution 2(Java)

class Solution {
    public int mySqrt(int x) {
        long r = x;
        while (r*r > x)
            r = (r + x/r) / 2;
        return (int) r;
    }
}

算法分析

牛顿迭代法来实现求平方根。很典型很简单，必须记住。

程序分析

略。