算法题笔记-easy难度-10最大子数组和（leetcode第53题）

题目地址:leetcode.cn/problems/ma…

思路：直接看代码吧

class Solution {
    public int maxSubArray(int[] nums) {
        int sum = 0;
        int maxSum = nums[0];
        for (int a : nums) {
            sum = Math.max(sum + a, a);
            maxSum = Math.max(sum, maxSum);
        }
        return maxSum;
    }
}