Leetcode Sqrt(x) 实现求某一个数的平方根算法 Python

Leetcode 69题 Sqrt(x)
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.

---

题目大意： 求某一个数的平方根，若等于则直接返回，若大于有余数则舍去余数。

思路1：直接用math库。

import math
class Solution:
    def mySqrt(self, x: int) -> int:
        return int(math.sqrt(x))

不过这样好像不太合适。

思路2： 具体步骤实现一下。遍历判断。

class Solution:
    def mySqrt(self, x: int) -> int:
        num = 0
        while (num*num) < x:
            num += 1
        if num*num == x:
            return num
        if num*num > x:
            return num-1

很简单。

疫情中的英国，
压力太大，两周的失眠，昨晚终于睡着了！舒服！
25/04/2020