human
Solve in Python:
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
 Can you provide a Python program to find the minimum element?
assistant
#Here is Python program to find the minimum element.

class Solution:
     def findMin(self, nums):
         """
         :type nums: List[int]
         :rtype: int
         """
         # m = nums[0]
         # for num in nums:
         #     if num < m:
         #         m = num
         # return m
         if len(nums) == 1:
             return nums[0]
         
         for i in range(1,len(nums)):
             if nums[i - 1] > nums[i]:
                 return nums[i]
             
         return nums[0]