Description
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
Analysis
暴力搜索会超时,估计test case也不强,使用了一个性质筛选了一下就过了。该性质是:
完全平方数的末位数只能是0,1,4,5,6,9.
Code
class Solution {
public:
bool isPerfectSquare(int num) {
switch (num % 10){
case 2:
case 3:
case 7:
case 8:return false; break;
default:break;
}
int i = 0;
while (true){
if (i * i < num) i++;
else if (i * i > num) return false;
else return true;
}
return false;
}
};
Appendix
- Link: https://leetcode.com/problems/valid-perfect-square/
- Run Time: 0ms