Lower bound1 [LeetCode] Valid Perfect Square 파이썬 (Binary Search, +Lower Bound) 이렇게 풀어도 되지만 사실은 Binary Search 를 사용하는 것이 문제의 의도. class Solution: def isPerfectSquare(self, num: int) -> bool: sq = num ** 0.5 if sq == int(qs): return True return False Binary Search class Solution: def isPerfectSquare(self, num: int) -> bool: if num == 1: return True left, right = 1, num while left search right side start = mid + 1 else: end = mid # greater or equal to -> not -1 that normally do.. 2021. 4. 14. 이전 1 다음