Easiest Solution in leetcode #Python3
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def findMin(self, nums: List[int]) -> int:\n        low=0\n        high=len(nums)-1\n        while low<high:\n            mid=(low+high)//2\n            if nums[mid]>nums[high]:\n                low=mid+1\n            else:\n                high=mid\n        return nums[low]\n                \n```
['Python3']