class Solution:

     def findMin(self, nums: 'List[int]') -> int:

         l = 0

         h = len(nums)-1

         while l < h:

             m = l + (h-l) // 2

             if nums[m] > nums[h]:

                 l = m + 1

             else:

                 h = m

         return nums[l]

 class Solution:

     def findMin(self, nums: 'List[int]') -> int:

         base = nums[0]

         for i in range(1,len(nums)):

             if base > nums[i]:

                 return nums[i]

         return base