69. x 的平方根 //牛顿迭代法 Xn+1 = Xn + f(Xn) / f(Xn)' class Solution { public: int mySqrt(int x) { long n = x; while(n * n > x) { n = (n + x / n) / 2; } return n; } };