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依次check到sort(num).
class Solution {
public:
bool isPerfectSquare(int num) {
for(int i=1; i<=num/i; i++){
if(i*i==num) return true;
}
return false;
}
};
二分法。
class Solution {
public:
bool isPerfectSquare(int num) {
long left = 1;
long right = num;
while(left<=right){
long mid = left + (right-left)/2;
long t = mid*mid;
if(t==num) return true;
else if(t < num) left = mid +1;
else right = mid - 1;
}
return false;
}
};