class Solution {
public:
bool isPerfectSquare(int num) {
int left=0;
int right=num;
long int mid;
while(left<=right){
mid=left+(right-left)/2;
if((mid*mid)>num){
right=mid-1;
}
else if((mid*mid)<num){
left=mid+1;
}
else return true;
}
return false;
}
};
【leetcode 367. 有效的完全平方数】二分法
最新推荐文章于 2024-10-14 17:32:24 发布