[Leetcode By Python]69. Sqrt(x)
2018-01-29 19:22
579 查看
题目:
Implement
Compute and return the square root of x.
x is guaranteed to be a non-negative integer.
Example 1:
Example 2:
代码+调试:
class Solution(object):
def mySqrt(self, x):
"""
:type x: int
:rtype: int
"""
if x==0:
return 0
i = 1;j=x/2+1
while i<=j:
mid = (i+j)/2
if mid**2 == x:
return mid
elif mid**2>x:
j = mid-1
else:
i = mid+1
return j
a = Solution()
print a.mySqrt(8)
Implement
int sqrt(int x).
Compute and return the square root of x.
x is guaranteed to be a non-negative integer.
Example 1:
Input: 4 Output: 2
Example 2:
Input: 8 Output: 2 Explanation: The square root of 8 is 2.82842..., and since we want to return an integer, the decimal part will be truncated.
代码+调试:
class Solution(object):
def mySqrt(self, x):
"""
:type x: int
:rtype: int
"""
if x==0:
return 0
i = 1;j=x/2+1
while i<=j:
mid = (i+j)/2
if mid**2 == x:
return mid
elif mid**2>x:
j = mid-1
else:
i = mid+1
return j
a = Solution()
print a.mySqrt(8)
相关文章推荐
- [Leetcode]@python 69. Sqrt(x)
- LeetCode 69 — Sqrt(x)(C++ Java Python)
- [Leetcode]69. Sqrt(x)解析@Python
- LeetCode-69-Sqrt(x) Python要用math.sqrt()
- 【leetcode】69. Sqrt(x)(Python & C++)
- LeetCode---69. Sqrt(x)---Python实现
- 【LeetCode 69】Sqrt(x) (Python)
- [leetcode:python]69.Sqrt(x)
- [LeetCode By Python]108. Convert Sorted Array to Binary Search Tree
- [LeetCode]69. Sqrt(x)
- LeetCode 69. Sqrt(x)
- LeetCode 第 69 题 (Sqrt(x))
- LeetCode 69 - Sqrt(x)
- LeetCode | 69. Sqrt(x) 数学技巧题
- leetcode69 Sqrt(x)
- Leetcode 69 Sqrt(x)
- LeetCode 69 Sqrt(x)
- 【一天一道LeetCode】#69. Sqrt(x)
- [LeetCode By Python]118. Pascal's Triangle
- 【LeetCode】69. Sqrt(x)