leetcode - Maximum Subarray

最新推荐文章于 2024-09-15 22:03:14 发布

weixin_30832143

最新推荐文章于 2024-09-15 22:03:14 发布

阅读量71

点赞数

文章标签： c/c++ 数据结构与算法

原文链接：http://www.cnblogs.com/shnj/p/4744708.html

版权

leetcode - 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,2,1] has the largest sum = 6.

class Solution {
public:
    int maxSubArray(vector<int>& nums) {
        int tempSum = nums[0];
        int maxSum = tempSum;
        for(int i = 1; i < nums.size(); i++){
            if(tempSum < 0) tempSum = nums[i];
            else{
                tempSum += nums[i];
            }
            if(tempSum > maxSum)
                maxSum = tempSum;
        }
        return maxSum;
    }
};