leetcode 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 ]

Show Hint 

题目给的提示是只修改两个边界值，实际上是修改开始值和结束后的一个值，开始值取加，结束后一个值取减，这样通过一个变量进行累加就可以完成对数组所有元素进行赋值：

public int[] getModifiedArray(int length, int[][] updates) {
    int[] res=new int[length];
    for(int[] array:updates){
        int indexleft=array[0];
        int indexright=array[1];
        int val=array[2];
        res[array[0]]+=val;
        if(array[1]+1<length) res[array[1]+1]-=val;
    }
    int sum=0;
    for(int i=0;i<length;i++){
        sum+=res[i];
        res[i]=sum;
    }
    return res;
}