【LeetCode】C# 69、Sqrt(x)
2017-10-15 15:22
465 查看
Implement int sqrt(int x).
Compute and return the square root of x.
求平方根。
思路是二分法。通过x/mid>mid? 来判断取左半部分还是右半部分。
Compute and return the square root of x.
求平方根。
思路是二分法。通过x/mid>mid? 来判断取左半部分还是右半部分。
public class Solution { public int MySqrt(int x) { if (x == 0) return 0; int left = 1, right = int.MaxValue; 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 69 — Sqrt(x)(C++ Java Python)
- [Leetcode]@python 69. Sqrt(x)
- leetcode 69. Sqrt(x)(C语言,牛顿迭代法求开方问题)46
- Leetcode:69. Sqrt(x)
- LeetCode(69) Sqrt(x)
- 【leetcode】: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 69.Sqrt(x)
- Leetcode-69 Sqrt(x)
- LeetCode 69. Sqrt(x)
- Leetcode 50. Pow(x, n) & 69. Sqrt(x)
- [leetcode 69] Sqrt(x)
- leetcode 69. Sqrt(x) 牛顿法求平方根
- LeetCode 69. Sqrt(x)