2019年11月4日
[LeetCode] 33. Search in Rotated Sorted Array
摘要： There is an integer array nums sorted in ascending order (with distinct values). Prior to being passed to your function, nums is rotated at an unknown 阅读全文
posted @ 2019-11-04 14:26 CNoodle 阅读(471) 评论(0) 推荐(0)
[LeetCode] 154. Find Minimum in Rotated Sorted Array II
摘要： Suppose an array of length n sorted in ascending order is rotated between 1 and n times. For example, the array nums = [0,1,4,4,5,6,7] might become: [ 阅读全文
posted @ 2019-11-04 13:39 CNoodle 阅读(380) 评论(0) 推荐(0)
[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 @ 2019-11-04 13:31 CNoodle 阅读(467) 评论(0) 推荐(0)
[LeetCode] 162. Find Peak Element
摘要： A peak element is an element that is strictly greater than its neighbors. Given a 0-indexed integer array nums, find a peak element, and return its in 阅读全文
posted @ 2019-11-04 12:41 CNoodle 阅读(337) 评论(0) 推荐(0)
[LeetCode] 34. Find First and Last Position of Element in Sorted Array
摘要： Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value. If target is not found 阅读全文
posted @ 2019-11-04 12:18 CNoodle 阅读(536) 评论(0) 推荐(0)