LeetCode 69 Sqrt(x)
2016-07-28 22:24
465 查看
Implement
Compute and return the square root of x.
牛顿迭代法：关于牛顿迭代法，详解http://blog.csdn.net/niuooniuoo/article/details/51787807
二分查找法
详解参考：http://www.cnblogs.com/AnnieKim/archive/2013/04/18/3028607.html
int sqrt(int x).
Compute and return the square root of x.
牛顿迭代法：关于牛顿迭代法，详解http://blog.csdn.net/niuooniuoo/article/details/51787807
public int mySqrt(int x) {
if (x == 0) return 0;
double last = 0.0;
double res = 1.0;
while (res != last) {
last = res;
res = (res + x / res) / 2;
}
return (int) res;
}二分查找法
int sqrt(int x) {
long i = 0, j = x / 2 + 1;
while (i <= j) {
long mid = (i + j) / 2;
long sq = mid * mid;
if (sq == x) return (int) mid;
else if (sq < x) i = mid + 1;
else j = mid - 1;
}
return (int) j;
}详解参考：http://www.cnblogs.com/AnnieKim/archive/2013/04/18/3028607.html
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- leetcode 179 Largest Number
- leetcode 24 Swap Nodes in Pairs
- leetcode 2 Add Two Numbers 方法1
- leetcode 2 Add Two Numbers 方法2
- leetcode----Longest Substring Without Repeating Characters
- [LeetCode]47 Permutations II
- [LeetCode]65 Valid Number
- [LeetCode]123 Best Time to Buy and Sell Stock III
- [LeetCode] String Reorder Distance Apart
- [LeetCode] Sliding Window Maximum
- [LeetCode] Find the k-th Smallest Element in the Union of Two Sorted Arrays
- [LeetCode] Determine If Two Rectangles Overlap
- [LeetCode] A Distance Maximizing Problem
- leetcode_linearList
- leetcode_linearList02
- 021-Merge Two Sorted Lists（合并两个排好序的单链表）;leetcode
- LeetCode[Day 1] Two Sum 题解
- LeetCode[Day 2] Median of Two Sorted Arrays 题解
- LeetCode[Day 3] Longest Substring Without... 题解
- LeetCode [Day 4] Add Two Numbers 题解