Binary Search
文章平均质量分 66
QihaoD
留个言吧,会很开心的,哈哈
展开
-
[LeetCode] Find Peak Element
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 its index.You may imagine that num[-1] = num[n] = -原创 2014-12-06 02:36:45 · 496 阅读 · 0 评论 -
[leetCode] 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.You may assume no duplicates in the array.原创 2015-05-11 12:06:00 · 402 阅读 · 0 评论 -
[leetCode] Search for a Range
Given a sorted array of integers, 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 not found原创 2015-05-11 22:30:04 · 312 阅读 · 0 评论 -
[leetCode] Search a 2D Matrix
Write an efficient algorithm that searches for a value in an m x n matrix. This matrix has the following properties:Integers in each row are sorted from left to right.The first integer of each原创 2015-05-11 22:42:37 · 372 阅读 · 0 评论 -
[leetCode] Minimum Size Subarray Sum
Given an array of n positive integers and a positive integer s, find the minimal length of a subarray of which the sum ≥ s. If there isn't one, return 0 instead.For example, given the array [2,3原创 2015-05-15 07:41:48 · 328 阅读 · 0 评论