Sqrt(x)

最新推荐文章于 2024-03-27 20:58:50 发布

673556617-real

最新推荐文章于 2024-03-27 20:58:50 发布

阅读量555

点赞数 1

分类专栏：算法 leetcode

本文链接：https://blog.csdn.net/awawfwfw/article/details/53128035

版权

算法同时被 2 个专栏收录

243 篇文章 0 订阅

订阅专栏

leetcode

225 篇文章 0 订阅

订阅专栏

Implement int sqrt(int x).

Compute and return the square root of x.

Subscribe to see which companies asked this question

提示是十一哦那个二分法，那么设置low = 0, high = x 进行二分查找，对于最后结果返回的low-1 还没想明白为什么...

代码：

public int mySqrt(int x) {
        //二分搜索题
        long low = 0;
        long high = x;
        while(low<=high){
            long mid = low + (high-low)/2;
            if(mid * mid == x){
                return (int)mid;
            }else if(mid * mid < x){
                low = mid +1;
            }else {
                high = mid - 1;
            }
        }
        return (int)low-1;
    }