[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.

python解法

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

Runtime: 40 ms, faster than 82.19% of Python3 online submissions for Sqrt(x).
Memory Usage: 13.8 MB, less than 6.45% of Python3 online submissions for Sqrt(x).
题后反思：无

C语言解法

int mySqrt(int x){
    return (int)(sqrt(x));
}

Runtime: 4 ms, faster than 74.55% of C online submissions for Sqrt(x).
Memory Usage: 6.8 MB, less than 66.67% of C online submissions for Sqrt(x).
题后反思：无

文中都是我个人的理解，如有错误的地方欢迎下方评论告诉我，我及时更正，大家共同进步