30_days_of_data_structure/binarysearch/valid_perfect_square_367.py at main · echobash/30_days_of_data_structure · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
class Solution:
    def isPerfectSquare(self, num: int) -> bool:
        if num == 0 or num == 1:
            return True

        left, right = 1, num//2+1
        while left <= right:
            mid = (left+right)//2
            if mid * mid == num:
                return True
            elif mid * mid > num:
                right = mid-1
            else:
                left = mid+1
        return False


sol = Solution()

x = 4
print(f"{x=} | {sol.isPerfectSquare(x)=}")

x = 8
print(f"{x=} | {sol.isPerfectSquare(x)=}")
x = 444
print(f"{x=} | {sol.isPerfectSquare(x)=}")
x = 24
print(f"{x=} | {sol.isPerfectSquare(x)=}")
x = 25
print(f"{x=} | {sol.isPerfectSquare(x)=}")
x = 1
print(f"{x=} | {sol.isPerfectSquare(x)=}")
x = 0
print(f"{x=} | {sol.isPerfectSquare(x)=}")

x = 16
print(f"{x=} | {sol.isPerfectSquare(x)=}")

x = 14
print(f"{x=} | {sol.isPerfectSquare(x)=}")