Leetcode 33. Search in Rotated Sorted Array(Binary Search)

https://leetcode.com/problems/search-in-rotated-sorted-array/ Search in Rotated Sorted Array - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com 얼핏보면 간단한 문제 같지만 O(logn)이라는 조건이 붙어있는만큼, Binary Tree 로 풀어야 하는 문제였습니다 class Solution: def search(self, nums: List[int], target: int) -> int: r..

원문링크 : Leetcode 33. Search in Rotated Sorted Array(Binary Search)