moonlightshadow123
4/10/2017 - 1:47 PM

153-Find-Minimum-in-Rotated-Sorted-Array.md

class Solution(object):
    def findMin(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        start = 0
        end = len(nums) - 1
        while start < end and nums[start] > nums[end]:
            mid = (start + end) / 2
            if nums[mid] < nums[end]:
                end = mid
            else:
                start = mid + 1
        return nums[start]

https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.

(i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2).

Find the minimum element.

You may assume no duplicate exists in the array.