153. Find Minimum in Rotated Sorted Array

最新推荐文章于 2022-07-27 13:01:15 发布

niunc

最新推荐文章于 2022-07-27 13:01:15 发布

阅读量76

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/niunc/article/details/82318888

版权

LeetCode 专栏收录该内容

185 篇文章 0 订阅

订阅专栏

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

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.

Example 1:

Input: [3,4,5,1,2] 
Output: 1

Example 2:

Input: [4,5,6,7,0,1,2]
Output: 0

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