LeetCode367. Valid Perfect Square

Given a positive integer num, write a function which returns True if num is a perfect square else False.

Note: Do not use any built-in library function such as sqrt.

Example 1:

Input: 16
Output: true

Example 2:

Input: 14
Output: false

---

思路： 判断一个数是否是平方数，不能用sqrt()方法。用二分查找的方法速度还可以。不过不清楚为什么下面这种写法会比先算出mid**2再进行比较会快。

class Solution:
    def isPerfectSquare(self, num):
        """
        :type num: int
        :rtype: bool
        """
        left,right = 0, num
        
        while left<right:
            mid = (left + right) // 2
            if mid**2 < num:
                left = mid + 1
            elif mid**2 > num:
                right = mid - 1
            else:
                return True
        return left**2 == num

discuss里还有其他很精彩的算法：

    def BitwiseTrick(self, num):
       root = 0
       bit = 1 << 15
       
       while bit > 0 :
           root |= bit
           if root > num // root:    
               root ^= bit                
           bit >>= 1        
       return root * root == num

  def NewtonMethod(self, num):
        r = num
        while r*r > num:
            r = (r + num/r) // 2
        return r*r == num

平方数都是1+3+5+... 所以有下面的方法

 def Math(self, num):
        i = 1
        while (num>0):
            num -= i
            i += 2       
        return num == 0