[LeetCode] 153. Find Minimum in Rotated Sorted Array 寻找旋转有序数组的最小值

Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,2,4,5,6,7] might become: [
posted @ 2014-10-18 13:05  Grandyang  阅读(16582)  评论(14)  编辑  收藏  举报
Fork me on GitHub