學習筆記 | 搜索旋轉排序數組、二分查找

class Solution(object):
    def search(self, nums, target):
        """
        :type nums: List[int]
        :type target: int
        :rtype: int
        """
        low = 0
        high = len(nums)-1
        while low <= high:
            mid = low + (high-low)/2
            
            if nums[mid] == target:
                return mid
            
            # 假設前半段有序
            if nums[low] <= nums[mid]:
                if nums[low] <= target and nums[mid] > target:
                    high = mid-1
                else:
                    low = mid+1
            else:
                if nums[mid] < target and nums[high] >= target:
                    low = mid + 1
                else:
                    high = mid-1
        return -1