题解 | #子数组的最大累加和问题#

记录

import java.util.*;


public class Solution {
    /**
     * max sum of the subarray
     * @param arr int整型一维数组 the array
     * @return int整型
     */
    public int maxsumofSubarray (int[] arr) {
        // write code here
        int max = arr[0];

        for (int i = 1; i < arr.length; i++){
            arr[i] = Math.max(arr[i - 1] + arr[i], arr[i]);
            max = Math.max(max, arr[i]);
        }
        return max;
    }
}