题目:
用牛顿迭代法求根号
代码:
class Solution(object):
def mySqrt(self, x):
"""
:type x: int
:rtype: int
"""
r = 2
while abs(r*r - x) > 1e-9:
r = (r + x/r)/2
a = int(r)
if a*a <= x and (a+1)*(a+1) > x:
return a
return int(r)