LeetCode "Sqrt(x)"
2014-07-23 05:41
295 查看
2 solutions: bin-search and Newton iteration.
class Solution {
public:
int _sqrt(long long tgt, long long i0, long long i1)
{
long long cand = (i0 + i1) / 2;
if (cand * cand == tgt) return cand;
if (cand * cand > tgt) return _sqrt(tgt, i0, cand);
else if(cand * cand < tgt)
{
if((cand + 1)*(cand + 1) > tgt) return cand;
if((cand + 1)*(cand + 1) == tgt) return cand + 1;
return _sqrt(tgt, cand + 1, i1);
}
}
int sqrt(int x) {
if (x == 1) return 1;
return _sqrt(x, 1, x/2);
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode "450. Delete Node in a BST"
- leetcode — sqrtx
- 【leetcode】【69】Sqrt(x)
- LeetCode 69. Sqrt(x)
- [LeetCode] Sqrt(x) 解题报告
- LeetCode - Sqrt(x)
- LeetCode69 Sqrt(x)**
- LeetCode "Course Schedule"
- leetcode - Sqrt(x) -- 再看
- Leetcode之sqrt(x)
- 【Leetcode】Sqrt(x)
- 【LeetCode】69. Sqrt(x)
- LeetCode 69. Sqrt(x)
- LeetCode "Merge Two Sorted Lists"
- LeetCode "Binary Tree Longest Consecutive Sequence"
- leetcode 69. Sqrt(x)
- LeetCode "House Robber II"
- [leetcode]69. Sqrt(x)
- LeetCode "Longest Consecutive Sequence"
- https://leetcode.com/problems/sqrtx/