LeetCode69 Sqrt(x)

最新推荐文章于 2021-12-20 21:12:26 发布

zhangjun62

最新推荐文章于 2021-12-20 21:12:26 发布

阅读量145

点赞数

分类专栏： LeetCode 文章标签： LeetCode

本文链接：https://blog.csdn.net/zhangjun62/article/details/90548838

版权

LeetCode 专栏收录该内容

53 篇文章 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.

public class MySqrt {
    public static int mySqrt(int x) {
        if (x == 0){
            return 0;
        }
        int left = 1;
        int right = Integer.MAX_VALUE;
        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;
            }
        }
    }

    public static void main(String[] args) {
        System.out.println(mySqrt(125));
    }
}