9-line python clean code
Just use binary search\n\n    class Solution(object):\n        def findMin(self, nums):\n            """\n            :type nums: List[int]\n            :rtype:
Just use binary search\n\n    class Solution(object):\n        def findMin(self, nums):\n            """\n            :type nums: List[int]\n            :rtype: int\n            """\n            i = 0\n            j = len(nums) - 1\n            while i < j:\n                m = i + (j - i) / 2\n                if nums[m] > nums[j]:\n                    i = m + 1\n                else:\n                    j = m\n            return nums[i]
[]