题解 | #连续子数组的最大和(二)#

import java.util.*;


public class Solution {
    /**
     * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
     *
     * 
     * @param array int整型一维数组 
     * @return int整型一维数组
     */
    public int[] FindGreatestSumOfSubArray (int[] array) {
        if(array.length == 1) return array;
        // write code here
        int snapLeft = 0,snapRight = 0;
        int left = 0, right = 0;
        int maxSum = Integer.MIN_VALUE, maxLength = 0;
        int dp[] = new int[array.length];
        dp[0] = array[0];
        for(int i = 1; i < array.length; i++) {
            right ++;
            dp[i] = Math.max(dp[i-1] + array[i],array[i]);
            if(dp[i-1] + array[i] < array[i]) left = right;
            // 快照
            if(dp[i] > maxSum || dp[i] == maxSum && right - left + 1 > maxLength) {
                snapLeft = left;
                snapRight = right;
                maxSum = dp[i];
                maxLength = right - left + 1;
            }
        }
        int[] res = new int[maxLength];
        for(int i = 0; i < maxLength; i++) {
            res[i] = array[snapLeft++];
        }
        return res;
    }
}