题目描述(Easy)
Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
题目链接
https://leetcode.com/problems/maximum-subarray/description/
Example 1:
Input: [-2,1,-3,4,-1,2,1,-5,4],
Output: 6
Explanation: [4,-1,2,1] has the largest sum = 6.
算法分析
提交代码：
class Solution {
public:
int maxSubArray(vector<int>& nums) {
int maxSum = INT_MIN, sum = 0;
for (int i = 0; i < nums.size(); ++i) {
sum = max(nums[i] + sum, nums[i]);
maxSum = max(maxSum, sum);
}
return maxSum;
}
};