[leetcode]367. Valid Perfect Square
Analysis
雨很大~—— [ummm~]
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.
判断一个数是否是完全平方数,不能用sqrt等函数。
Implement
方法一:(二分法查找,但是要注意有些中间变量的类型需定义为long,不然会越界。)
class Solution {
public:
bool isPerfectSquare(int num) {
if(num == 1)
return true;
long k = num/2;
long tmp = k * k;
while(tmp > num){
k = k / 2;
tmp = k * k;
}
for(int i=k; i<=k*2; i++){
if(i*i == num)
return true;
}
return false;
}
};
方法二:(从大神那里看到的,效率高一点,因为搜索范围变小了,从1到sqrt(x))
class Solution {
public:
bool isPerfectSquare(int num) {
if(num == 1)
return true;
for(int i=1; i<=num/i; i++){
if(i*i == num)
return true;
}
return false;
}
};