class Solution {
public:
bool isPerfectSquare(int num) {
int l = 0, r = num, mid;
while (l < r) {
mid = (l + r) >> 1;
if ((long long ) mid * mid >= num)
r = mid;
else
l = mid + 1;
}
if ((long long )l * l == num)
return true;
else
return false;
}
};
注意范围!不用(longlong), 会溢出