leetcode
liuwxye
这个作者很懒,什么都没留下…
展开
-
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 in th原创 2017-11-18 12:57:33 · 229 阅读 · 0 评论 -
Search in Rotated Sorted Array
Suppose a sorted array 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 given a target value to search. If found in the array return its原创 2017-11-29 09:57:12 · 147 阅读 · 0 评论 -
Container With Most Water
问题: Given n non-negative integers a1,a2...ana_1,a_2...a_n where each represents a point at coordinate a1,a2...ana_1,a_2...a_n vertical lines are drawn such that the two endpoints of line i is at (i,ai原创 2017-11-26 17:50:57 · 160 阅读 · 0 评论