Range Addition

Assume you have an array of length n initialized with all 0's and are given k update operations.

Each operation is represented as a triplet: [startIndex, endIndex, inc] which increments each element of subarray A[startIndex ... endIndex] (startIndex and endIndex inclusive) with inc.

Return the modified array after all k operations were executed.

Example:

Given:

    length = 5,
    updates = [
        [1,  3,  2],
        [2,  4,  3],
        [0,  2, -2]
    ]

Output:

    [-2, 0, 3, 5, 3]

Explanation:

Initial state:
[ 0, 0, 0, 0, 0 ]

After applying operation [1, 3, 2]:
[ 0, 2, 2, 2, 0 ]

After applying operation [2, 4, 3]:
[ 0, 2, 5, 5, 3 ]

After applying operation [0, 2, -2]:
[-2, 0, 3, 5, 3 ]

按照提示，对应在开始跟结束的位置进行加法就可以了。

比如说上面例子：

[0,0,0,0,0]

[0,2,0,0,-2] (1 3 2)

[0,2,3,0,-2] (2 4 3)

[-2,2,3,2,-2] (0 2 -2)

最后对上面这一行进行加和：

[-2, 0, 3, 5 , 3]

代码：

public int[] getModifiedArray(int length, int[][] updates) {
        int[] result = new int[length];
        for(int[] item: updates){
            result[item[0]] += item[2];
            if(item[1]<result.length-1){
                result[item[1]+1] -= item[2];
            }
        }
        for(int i=1;i<result.length;i++){
            result[i] += result[i-1];
        }
        return result;
    }