【LEETCODE】153-Find Minimum in Rotated Sorted Array

Suppose a sorted array 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.


题意:

给一个数组,找到最小值,数组里没有重复的数字


思路:

逐个比较,留下最小的


class Solution(object):
    def findMin(self, nums):
        """
        :type nums: List[int]
        :rtype: int
        """
        minx=nums[0]
        n=len(nums)
        
        if n==1:
            return nums[0]
            
        for i in range(1,n):
            minx=min(minx,nums[i])
        
        return minx
            


你可能感兴趣的:(LeetCode,python)