LeetCode 69. Sqrt(x)

最新推荐文章于 2024-01-24 13:20:24 发布

炼丹大法

最新推荐文章于 2024-01-24 13:20:24 发布

阅读量82

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/weixin_40275300/article/details/88204944

版权

LeetCode 专栏收录该内容

22 篇文章 0 订阅

订阅专栏

题目描述
Implement int sqrt(int x).
Compute and return the square root of x, where x is guaranteed to be a non-negative integer.
Since the return type is an integer, the decimal digits are truncated and only the integer part of the result is returned.

Example 1:
Input: 4
Output: 2

Example 2:
Input: 8
Output: 2
Explanation: The square root of 8 is 2.82842…, and since the decimal part is truncated, 2 is returned.
解题思路
一个正整数(除了0和1)的平方根一定是从1到x/2，之间的某一个数，所以就相当于查找算法，所以采用二分法即可需要注意的是，我们的寻找条件，如果mid * mid > x right = mid - 1;否则：此时mid * mid <= x，还满足，（mid+1） * （mid+1）> x 此时mid即可返回;否则：left = mid +1。
代码

public int mySqrt(int x) {
	if (x <= 1)
   	   return x;
    int left = 1, right = x/2;
    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;
       }
    }    
  }