leetcode:154. find minimum in rotated sorted array ii

题目概述

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.

The array may contain duplicates.

Example 1:

1
2

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

Example 2:

1
2

Input: [2,2,2,0,1]
Output: 0

同理LeetCode: 153. Find Minimum in Rotated Sorted Array

代码实现

1
2
3
4
5
6

class :
    def findMin(self, nums: 'list[int]') -> 'int':
        for i in range(1, len(nums)):
            if nums[i] < nums[i-1]:
                return nums[i]
        return nums[0]