二分查找
huhuixinxing
这个作者很懒,什么都没留下…
展开
-
LeetCode 33. Search in Rotated Sorted Array && 81. Search in Rotated Sorted Array II
###LeetCode 33. Search in Rotated Sorted Array 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).You are gi原创 2017-12-02 17:36:04 · 235 阅读 · 0 评论 -
LeetCode 34. Search for a Range
Given an array of integers sorted in ascending order, find the starting and ending position of a given target value.Your algorithm’s runtime complexity must be in the order of O(log n).If the target is原创 2017-12-02 17:36:51 · 186 阅读 · 0 评论 -
LeetCode 35. Search Insert Position
Given a sorted array and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order.在一个有序数组中寻找目标值,如果找到就返回下标,找不到就返回它在有序数组中应该插入的位置。原创 2017-12-02 17:37:45 · 198 阅读 · 0 评论