@@ -0,0 +1,867 @@
+%22%22%22Leetcode 33. Search in Rotated Sorted Array%0AMedium%0A%0AURL: https://leetcode.com/problems/search-in-rotated-sorted-array/%0A%0ASuppose an array sorted in ascending order is rotated at some pivot unknown %0Ato you beforehand.%0A(i.e., %5B0,1,2,4,5,6,7%5D might become %5B4,5,6,7,0,1,2%5D).%0A%0AYou are given a target value to search. If found in the array return its index, %0Aotherwise return -1.%0A%0AYou may assume no duplicate exists in the array.%0A%0AYour algorithm's runtime complexity must be in the order of O(log n).%0A%0AExample 1:%0AInput: nums = %5B4,5,6,7,0,1,2%5D, target = 0%0AOutput: 4%0A%0AExample 2:%0AInput: nums = %5B4,5,6,7,0,1,2%5D, target = 3%0AOutput: -1%0A%22%22%22%0A%0Aclass Solution(object):%0A    def search(self, nums, target):%0A        %22%22%22%0A        :type nums: List%5Bint%5D%0A        :type target: int%0A        :rtype: int%0A        %22%22%22%0A        pass%0A%0A%0Adef main():%0A    pass%0A%0A%0Aif __name__ == '__main__':%0A    main()%0A

Add lc033_search_in_rotated_sorted_array.py