实习
文章平均质量分 64
--asx
这个作者很懒,什么都没留下…
展开
-
LC 53. Maximum Subarray
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.For example, given the array [-2,1,-3,4,-1,2,1,-5,4],the contiguous subarray [4,-1,2,1] has the ...原创 2018-03-12 23:09:48 · 135 阅读 · 0 评论 -
LC 153. Find Minimum in Rotated Sorted Array
LC 153. Find Minimum in Rotated Sorted ArraySuppose 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).Find the mini...原创 2018-03-13 08:58:30 · 118 阅读 · 0 评论