LeetCode 69 Sqrt(x)
2015-04-24 15:44
344 查看
题目
分析
从0到x的遍历肯定会超时,于是考虑用二分查找。大数据计算尽量不要用int来存。
题解
class Solution { public: int mySqrt(int x) { int i=0; int j=x; long long mid = (i+j)/2; while(1){ if(mid*mid<=x && (mid+1)*(mid+1)>x) return mid; else{ if(mid*mid > x) j=mid-1; else i=mid+1; } mid=(i+j)/2; } } };
相关文章推荐
- <LeetCode OJ> 69. Sqrt(x)
- [Leetcode] 69. Sqrt(x)
- [leetcode:python]69.Sqrt(x)
- [leetcode] 69. Sqrt(x)
- LeetCode 69 Sqrt(x)
- Leetcode 69. Sqrt(x)
- 个人记录-LeetCode 69. Sqrt(x)
- LeetCode(69) Sqrt(x)
- LeetCode 69 Sqrt(x)
- LeetCode_OJ【69】Sqrt(x)
- LeetCode【69】 Sqrt(x)
- LeetCode - 50/69/367/633 - Pow(x, n)、Sqrt(x)
- 【LeetCode】69. Sqrt(x) (2 solutions)
- 【LeetCode】69. Sqrt(x)解法及注释
- The Solution to LeetCode 69 Sqrt(x)
- leetcode 69. Sqrt(x)
- Leetcode 69 Sqrt(x)
- LeetCode-69. Sqrt(x)
- LeetCode --- 69. Sqrt(x)
- Leetcode 69. Sqrt(x)