367. Valid Perfect Squarehttps://leetcode-cn.com/problems/valid-perfect-square/
题目在上面,我已经懒得转中文了,所以就这样吧,给代码如下
class Solution {
public:
bool isPerfectSquare(int num) {
int r = num ;
int l = 0;
while(r>=l){
int mid = r + (l-r)/2;
if((long long)mid*mid>num){
r = mid -1;
}else if((long long)mid * mid <num){
l = mid+1;
}else{
return true;
}
}
return false;
}
};
这题和69基本一模一样,都很简单