【Leetcode】069Sqrt

题目描述

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.

给定一个整数，求其开方后的值，保留整数

---

例子

Input: 8
Output: 2
Explanation: The square root of 8 is 2.82842…, and since
the decimal part is truncated, 2 is returned.

第一想法居然还是丑陋的$O(n)$的循环遍历，羞愧…
然而，下一刻发现好像不是这么回事，有稍微简单点的…

---

双指针二分法遍历

class Solution(object):
    def mySqrt(self, x):
        """
        :type x: int
        :rtype: int
        """
        left,right = 0,x
        while(left<=right):
            mid = (left+right)//2
            tmp = mid*mid
            if tmp>x:
                 right = mid - 1
            else:
                left = mid + 1
        print(right)

S = Solution()
x = 8
S.mySqrt(x)

---

Runtime: 20 ms, faster than 91.60% of Python online submissions for Sqrt(x).
Memory Usage: 11.9 MB, less than 8.97% of Python online submissions for Sqrt(x).