【Leetcode-Easy-53】Maximum Subarray

LYZ0907

于 2017-10-18 14:18:33 发布

阅读量1.4k

点赞数 1

分类专栏： Leetcode LeetCode

本文链接：https://blog.youkuaiyun.com/liyazhou0215/article/details/78272351

版权

Leetcode 同时被 2 个专栏收录

50 篇文章

订阅专栏

LeetCode

50 篇文章

订阅专栏

【Leetcode-Easy-53】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.

click to show more practice.

思路

连续子串最大和

程序

class Solution {
    public int maxSubArray(int[] nums) {

        int maxSum = nums[0];
        int currSum = 0;

        for (int num : nums){
            if (currSum < 0) currSum = 0;
            currSum += num;
            maxSum = Math.max(maxSum, currSum);
        }

        return maxSum;

    }
}