[LeetCode]Sqrt(x)@python
2018-01-28 14:56
531 查看
Implement
Compute and return the square root of x.
x is guaranteed to be a non-negative integer.
Example 1:
Example 2:
方法一:暴力穷举(略)
方法二:二分法(略)
方法三:牛顿法
原理见这里
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 """ r = x while r*r > x: r = (x/r+r)/2 return r
相关文章推荐
- LeetCode-69-Sqrt(x) Python要用math.sqrt()
- [leetcode:python]69.Sqrt(x)
- 【Leetcode】【python】Sqrt(x)
- [Leetcode]@python 69. Sqrt(x)
- 【leetcode】69. Sqrt(x)(Python & C++)
- [Leetcode]69. Sqrt(x)解析@Python
- leetcode 日经贴,python code -Sqrt(x)
- LeetCode--Sqrt(x)Python
- [LeetCode]题解(python):069-Sqrt(x)
- [Leetcode By Python]69. Sqrt(x)
- 【LeetCode 69】Sqrt(x) (Python)
- LeetCode 69 — Sqrt(x)(C++ Java Python)
- [leetcode]Sqrt(x) @ Python
- LeetCode---69. Sqrt(x)---Python实现
- [LeetCode]题解(python):115-Distinct Subsequences
- LeetCode 198. House Robber(Python)
- leetcode Jump Game II python
- Leetcode 236 python
- LeetCode--Sort Colors(颜色排序)Python
- leetcode python - Reverse Integer