摘要: 题目描述: A peak element is an element that is greater than its neighbors. Given an input array where num[i] ≠ num[i+1], find a peak element and return it 阅读全文
posted @ 2018-04-01 18:29 宵夜在哪 阅读(80) 评论(0) 推荐(0) 编辑
摘要: 题目描述: Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand. (i.e., 0 1 2 4 5 6 7 might become 4 5 6 7 0 1 2). 阅读全文
posted @ 2018-04-01 00:25 宵夜在哪 阅读(84) 评论(0) 推荐(0) 编辑