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.
If using newton’s method, then
x
k
+
1
=
x
k
−
f
(
x
k
)
/
f
(
x
k
)
′
x_{k+1}=x_k-f(x_k)/f(x_k)'
xk+1=xk−f(xk)/f(xk)′, iterating until
∣
x
k
+
1
−
x
k
∣
|x_{k+1}-x_k|
∣xk+1−xk∣ is very small.
if using binary search,
- Binary search
class Solution:
def mySqrt(self, x: int) -> int:
l = 0
r = x
if x**2 == x:
return x
while True:
mid = (l+r)//2
if mid**2 == x:
return mid
elif mid**2 < x:
if (mid + 1)**2 > x:
return mid
else:
l = mid + 1
else:
r = mid - 1
- Newton’s method
class Solution:
def mySqrt(self, x: int) -> int:
a = x
if a**2 == x:
return a
while True:
# print(a, a**2)
b = a - (a**2-x)/(2*a)
if b**2 - x <= 0 or a-b < 0.00001:
return int(b)
else:
a = b