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.
class Solution(object):
def findMin(self, nums):
"""
:type nums: List[int]
:rtype: int
"""
l=len(nums)
a=nums[0]
for i in range(1,l):
if a >nums[i]:
a=nums[i]
return a