1
class Solution {
2
public:
3
bool isPerfectSquare(int num) {
4
if (num == 1) return true;
5
long long l = 1, h = num / 2;
6

7
while (l <= h) {
8
long long mid = l + (h - l) / 2;
9
long long midSqr = mid * mid;
10

11
if (midSqr == num) return true;
12

13
if (num < midSqr) {
14
h = mid - 1;
15
} else {
16
l = mid + 1;
17
}
18
}
19
return false;
20
}
21
};

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0