367. Valid Perfect Square

367. 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
Returns: True

Example 2:

Input: 14
Returns: False

转载于点击打开链接

解法1：如果sqrt(n)存在，则n=1+3+5+7+.....

bool isPerfectSquare(int num) {
     int i=1;
     while(num>0)
     {
         num-=i;
         i=i+2;
     }
     return num==0;
    }

时间复杂度: O(sqrt(n))

解法2：二分法

bool isPerfectSquare(int num) {
      int low=1,high=num;
      while(low<=high)
      {
          long mid=(low+high)>>1;
          if(mid*mid==num)
          return true;
          if(mid*mid<num)
          low=(int)mid+1;
          else high=(int) mid-1;
      }
       return false;
    }

时间复杂度：O(lgn)

解法3：牛顿法点击打开链接

bool isPerfectSquare(int num) {
        long x=num;
        while(x*x>num)
        {
            x=(x+num/x)>>1;
        }
        return x*x==num;
    }