[LeetCode 903] Range Addition

Assume you have an array of length n initialized with all 0's and are given kupdate 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]
]
return [-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 ]

分析

这一题不需要对每一个update都做一次首尾的遍历。只需要记录每一个update的左右坐标left， right。初始化数组array(length+1, 0)，每一个update都将array[left] += update[0], array[right+1] += -update[0]。然后从前到后遍历array， array[i] = array[i] + array[i-1]即可。最后将最后一个多余的元素弹出。

Code

class Solution {
public:
    /**
     * @param length: the length of the array
     * @param updates: update operations
     * @return: the modified array after all k operations were executed
     */
    vector<int> getModifiedArray(int length, vector<vector<int>> &updates) {
        // Write your code here
        vector<int> array(length+1, 0);
        
        for (int i = 0; i < updates.size(); i ++)
        {
            array[updates[i][0]] += updates[i][2];
            array[updates[i][1] + 1] += -updates[i][2];
        }
        
        for (int i = 1; i < length; i ++)
        {
            array[i] = array[i-1] + array[i];
        }
        
        array.pop_back();
        return array;
    }
};

 

运行效率 

Your submission beats 93.79% Submissions!