leetcode - 69.Sqrt(x)
2017-03-13 13:42
435 查看
Sqrt(x)
Implement int sqrt(int x).Compute and return the square root of x.
Solution1:
better
public int mySqrt(int x) { long r = x; while (r * r > x) { r = (r + x / r) / 2; } return (int) r; }
Solution2:
public int mySqrt(int x) { if (x == 0) return 0; int left = 1, right = Integer.MAX_VALUE; while (true) { int mid = left + (right - left) / 2; if (mid > x / mid) { right = mid - 1; } else { if (mid + 1 > x / (mid + 1)) return mid; left = mid + 1; } } }
相关文章推荐
- 【LeetCode】69. Sqrt(x)
- Leetcode 69. Sqrt(x)
- 【LeetCode】C# 69、Sqrt(x)
- [leetcode]69. Sqrt(x)
- leetcode ----69. Sqrt(x)
- leetcode_69题——Sqrt(x)(二分查找,还有个溢出问题的研究)
- [Leetcode 69, Medium] Sqrt(x)
- Leetcode——69. Sqrt(x)
- (java)leetcode-69:Sqrt(x)
- LeetCode(69)Sqrt
- 【LeetCode 69】Sqrt(x)
- leetcode oj java 69. Sqrt(x)
- LeetCode69 Sqrt(x)
- leetcode 69. Sqrt(x)
- leetcode解题之69.Sqrt(x) & 367. Valid Perfect Square Java版 (求一个数的平方根)
- LeetCode 69 Sqrt(x)
- LeetCode-69. Sqrt(x)
- Leetcode 69 Sqrt(x) 二分查找(二分答案)
- leetcode69---Sqrt(x)(求x的平方根)
- Leetcode 69 sqrt(x)