2015年1月20日
LeetCode-Search in Rotated Sorted Array II
摘要： Analysis:For target>A[mid]:There is only one case that we should seach [start,mid-1]: Peak is in the left, i.e., A[start]>A[mid] && target>=A[start].F... 阅读全文
posted @ 2015-01-20 07:13 LiBlog 阅读(159) 评论(0) 推荐(0) 编辑