Leecode 53. Maximum Subarray

LEECODE 53. Maximum Subarray

• 题目
• 代码块
• 想法

---

Description

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.

代码

class Solution {
public:
    int maxSubArray(vector<int>& nums) {
        int maxnum = nums.at(0);
        int tempsum= nums.at(0);
        tempsum = max(0,tempsum);
        for(int i = 1; i < nums.size(); i++){
            tempsum += nums.at(i);
            maxnum = max(tempsum,maxnum);
            tempsum = max(0,tempsum);

        }
        return maxnum;
    }
};

想法

要保存最大子数组值，考虑到暂时保存的值有正数和负数，但是暂时保存的值如果是负数，肯定是不取，暂时保存的值不能小于0，如果中断了，暂时保存值被强行置0，从下次正数开始保存.并把高于最大子数组值的暂时值保存返回.