description:
Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
Note:
Example:
Example:
Input: [-2,1,-3,4,-1,2,1,-5,4],
Output: 6
Explanation: [4,-1,2,1] has the largest sum = 6.
answer:
class Solution {
public:
int maxSubArray(vector<int>& nums) {
int res = INT_MIN, cur = 0;
for (int num: nums) {
cur = max(cur + num, num);
res = max(cur, res);
}
return res;
}
};
relative point get√：
hint :
follow up：分治法