【LeetCode】69. Sqrt(x)
2017-05-29 08:22
531 查看
问题描述
https://leetcode.com/problems/sqrtx/#/descriptionImplement int
sqrt(int x).
Compute and return the square root of
x.
算法
使用折半查找即可,但要注意整型溢出代码
public int mySqrt(int x) { int left = 1, right = x; while(left<=right) { int mid = left + (right-left)/2;// 不能使用(right+left),因为有可能整数溢出 if(mid <= x/mid) { left = mid + 1; } else { right = mid - 1; } } return left-1; }
相关文章推荐
- 【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 - 50/69/367/633 - Pow(x, n)、Sqrt(x)
- leetcode 69 Sqrt(x)
- 【LeetCode】69. Sqrt(x)
- 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(x)