题目描述
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 largest sum = 6
.
解题思路
动态规划的算法,时间复杂度O(n)
具体实现
class Solution {
public:
int maxSubArray(vector<int>& nums) {
vector<int> sum(nums.size(), 0);
sum[0] = nums[0];
int max = nums[0];
for (int i = 1; i < nums.size(); i++) {
if (sum[i-1] > 0) sum[i] = sum[i-1]+nums[i];
else sum[i] = nums[i];
if (sum[i] > max) max = sum[i];
}
return max;
}
};
提交结果
202/202 test cases passed.
Status: Accept
Runtime: 12 ms