leetcode - 69.Sqrt(x)

最新推荐文章于 2023-06-21 03:38:16 发布

xiedacon

最新推荐文章于 2023-06-21 03:38:16 发布

阅读量138

点赞数

分类专栏： leetcode题集文章标签： leetcode

本文链接：https://blog.csdn.net/qq_27350929/article/details/61916363

版权

leetcode题集专栏收录该内容

96 篇文章 0 订阅

订阅专栏

Sqrt(x)

Implement int sqrt(int x).

Compute and return the square root of x.

Solution1:

better

  public int mySqrt(int x) {
    long r = x;
    while (r * r > x) {
      r = (r + x / r) / 2;
    }
    return (int) r;
  }

Solution2:

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