LeetCode 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

class Solution {public:    bool isPerfectSquare(int num) {        int count=1;        if(num==1)return true;        while(num/count>=count){            if(num%count==0&&num/count==count){                return true;}            count++;            }        return false;    }};