[LintCode] Continuous Subarray Sum

Given an integer array, find a continuous subarray where the sum of numbers is the biggest. Your code should return the index of the first number and the index of the last number. (If their are duplicate answer, return the minimum one in lexicographical order)

Example

Example 1:

Input: [-3, 1, 3, -3, 4]
Output: [1, 4]

Example 2:

Input: [0, 1, 0, 1]
Output: [0, 3]
Explanation: The minimum one in lexicographical order.

思路：用prefixsum来做，求最大，那么就跟股票那题一样，存一个最小，然后每次跟最小比差，如果大，记录下来。注意prefixsum的index默认是+1了的，所以result是[start, i - 1];

是因为sum[i, j] = S[j] - S[i - 1], = prefixsum[j + 1] - prefixsum[i], prefixsum里面的index是原来数组的index + 1所形成。所以在prefixsum的index要还原成原来array的index都要减去1，然而，S[j] - S[i - 1] == Sum[i,j]，所以求i的范围，需要把start +1,这样start + 1 - 1=start, end - 1，就是对应原来数组的index了；

public class Solution {
    /*
     * @param A: An integer array
     * @return: A list of integers includes the index of the first number and the index of the last number
     */
    public List<Integer> continuousSubarraySum(int[] A) {
        List<Integer> res = new ArrayList<>();
        if(A == null || A.length == 0) {
            return res;
        }
        int n = A.length;
        int[] prefixSum = new int[n + 1];
        for(int i = 1; i <= n; i++) {
            prefixSum[i] = prefixSum[i - 1] + A[i - 1];
        }
        res.add(0); res.add(0);
        int sum = 0;
        int start = 0; int end = 0;
        int minsum = 0;
        int max = Integer.MIN_VALUE;
        for(int i = 1; i <= n; i++) {
            if(prefixSum[i] - minsum > max) {
                max = prefixSum[i] - minsum;
                res.set(0, start);
                res.set(1, i - 1);
            }
            if(prefixSum[i] < minsum) {
                minsum = prefixSum[i];
                start = i;
            }
        }
        return res;
    }
}