[LeetCode]153.Find Minimum in Rotated Sorted Array

【題目】 Suppose a sorted array is rotated at some pivot unknown to you beforehand. (i.e.,0 1 2 4 5 6 7might become4 5 6 7 0 1 2). Find the minimum element. You may assume no duplicate exists in the array
相關文章
相關標籤/搜索