[LeetCode] 69. Sqrt(x)_Easy tag: Binary Search

发布时间：2020-12-14 03:47:37 所属栏目：大数据来源：网络整理

导读：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 re

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.


Code

class Solution:
    def sqrt(self,num):
        ans = num
        while ans*ans > num:
            ans = (ans + num//ans)//2
        return ans

（编辑：李大同）

【声明】本站内容均来自网络，其相关言论仅代表作者个人观点，不代表本站立场。若无意侵犯到您的权利，请及时与联系站长删除相关内容!