바이너리 서치 응용 문제
class Solution:
def mySqrt(self, x: int) -> int:
def BinarySearch(start, end, x):
while start <= end:
m = (start + end) // 2
if m * m == x:
return m
elif m * m < x:
start = m +1
elif m * m > x:
end = m -1
return end
return BinarySearch(0, x, x)
'Algorithm > LeetCode 문제 풀이' 카테고리의 다른 글
[LeetCode 35. Search Insert Position] Easy 3/5 26/150 99.12% (0) | 2019.05.16 |
---|---|
[LeetCode 74. Search a 2D Matrix] 2/5 25/150 (0) | 2019.05.16 |
[LeetCode 378. Kth Smallest Element in a Sorted Matrix ] Stack Easy (19주차 9/10, 23/150) (0) | 2019.05.12 |
[LeetCode 155. Min Stack ] Stack Easy (19주차 8/10, 22/150) (0) | 2019.05.12 |
[LeetCode 20. Valid Parentheses ] Easy (19주차 7/10, 21/150) (0) | 2019.05.12 |