分治
i-Blue
抱平常心走平常路
展开
-
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原创 2016-09-04 17:30:45 · 946 阅读 · 0 评论 -
Count of Smaller Numbers After Self
You are given an integer array nums and you have to return a new counts array. The counts array has the property where counts[i] is the number of smaller elements to the right of nums[i].Example:原创 2016-09-21 22:59:16 · 267 阅读 · 0 评论 -
最大子序列和问题的解_
问题:有数n1,n2,......,ns。求一个连续的子序列,这个序列的和最大。这个问题有O(n^3)、O(n^2)、O(n*lgn)以及O(n)时间复杂度的解法。下面主要说下O(n*lgn)和O(n)的解法。原创 2016-12-14 19:47:43 · 496 阅读 · 0 评论