class Solution {
public:
bool isPerfectSquare(int num) {
long long low = 0,
high = num;
while ( low <= high){
long long mid= (low + high) / 2;
if ( mid * mid == num)
return true;
else if (mid * mid < num)
low = mid + 1;
else high = mid -1;
}
return false;
}
};
[leetcode] 368. Largest Divisible Subset
最新推荐文章于 2022-10-27 19:21:48 发布