class Solution {
public:
bool isPerfectSquare(int num) {
int left=0,right=INT_MAX;
while(left<=right){ //二分查找
long long mid=left+(right-left)/2; //注意long long
if(mid*mid==num) return true;
else if(mid*mid<num) left=mid+1;
else right=mid-1;
}
return false;
}
};
LeetCode-367. 有效的完全平方数-easy
最新推荐文章于 2024-05-21 23:16:53 发布