Leetcode - 69. Sqrt(x) (二分)

最新推荐文章于 2021-11-09 08:49:06 发布

BUPT-WT

最新推荐文章于 2021-11-09 08:49:06 发布

阅读量69

点赞数

分类专栏：秋招

本文链接：https://blog.csdn.net/weixin_41362649/article/details/99889519

版权

秋招专栏收录该内容

179 篇文章 2 订阅

订阅专栏

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.

def mysqrt(x):

    left = 0
    right = x

    while left < right:

        mid = left + (right-left) // 2
        
        if mid **2 <= x < (mid+1)**2:
            return mid

        elif (mid+1)**2 <= x:

            left = mid + 1

        else:
            right = mid - 1