LeetCode 69. Sqrt(x)

最新推荐文章于 2022-01-08 19:00:18 发布

qq_34344061

最新推荐文章于 2022-01-08 19:00:18 发布

阅读量228

点赞数

分类专栏： leetcode 文章标签：二分查找求平方根

本文链接：https://blog.csdn.net/qq_34344061/article/details/79196449

版权

leetcode 专栏收录该内容

40 篇文章 0 订阅

订阅专栏

LeetCode 69. Sqrt(x)

Implement int sqrt(int x).

Compute and return the square root of x.

x is guaranteed to be a non-negative integer.

Example 1:

Input: 4
Output: 2

Example 2:

Input: 8
Output: 2
Explanation: The square root of 8 is 2.82842..., and since we want to return an integer, the decimal part will be truncated.

public int mySqrt(int x) {                 //直接使用暴力法找超时，考虑使用二分查找
        int left=1; 
        int right=x;
        while(left<=right){
            int mid=left+(right-left)/2;
            if(mid==x/mid)
                return mid;
            else if(mid>x/mid)
                right=mid-1;
            else {
                left=mid+1;
            }
        }
        return right;               //举个例子可以得出应该返回right
    }