LeetCode : 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

//连续的奇数之和即为平方数
class Solution {
public:
    bool isPerfectSquare(int num) {
       for(int i=1;num>0;i+=2)
       {
           num -= i;
       }
       return num==0;
    }
};