[leetcode] 370. 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 ]

Hint:

1. Thinking of using advanced data structures? You are thinking it too complicated.
2. For each update operation, do you really need to update all elements between i and j?
3. Update only the first and end element is sufficient.
4. The optimal time complexity is O(k + n) and uses O(1) extra space.

思路1

在序列[1,3,2]中1是start,3是end，2是value值。在原数组基础上对res[start,end]加上value值，最后是第一个数不变，当前值与前面累加值的和更新为最新值。

代码：

public int[] getModifiedArray(int length, int[][] updates) {
int[] res = new int[length];
for (int[] target : updates) {
int start = target[0];
int end = target[1];
int value = target[2];
if (end < length) {
for (int i = start; i <= end; i++) {
res[i] = res[i] + value;
}
} else if (end == length) {
for (int i = start; i < end; i++) {
res[i] = res[i] + value;
}
}
}
return res;
}

时间复杂度 O（m*n）

思路2

考虑到时间复杂度，进行优化，做法就是在开头坐标startIndex位置加上inc，而在结束位置加1的地方加上-inc，最后再进行当前值与前面累加值的和更新为最新值

代码：

public int[] getModifiedArray(int length,int[][]updates){
int[]res = new int[length];
for(int[]update:updates){
int start = update[0];
int end = update[1];
int value = update[2];
res[start]+= value;
if(end < length-1)
res[end+1]+=-value;
}
int sum = 0;
for(int i = 0 ; i < length;i++){
sum+=res[i];
res[i] =sum;
}
return res;
}