leetcode【69】Sqrt(x)

Implement int sqrt(int x).

Compute and return the square root of x, where x is guaranteed to be a non-negative integer.

Since the return type is an integer, the decimal digits are truncated and only the integer part of the result is returned.

Example 1:

Input: 4
Output: 2
Example 2:

Input: 8
Output: 2
Explanation: The square root of 8 is 2.82842…, and since
the decimal part is truncated, 2 is returned.

分析
这道题考查牛顿迭代法。这里提供讲解链接：https://blog.csdn.net/ccnt_2012/article/details/81837154
本题只需要设置方程为f(x) = x^2 - n 就可以求n的平方根

class Solution {
public:
    int mySqrt(int x) {
        if(x == 0) return 0;
        double x0,x1 = 1;
        do {
            x0 = x1;
            x1 = (x0 / 2) + x / (2 * x0);
        } while(fabs(x1 - x0) > 1e-4);
        return int(x1);
    }
};