1. Assume you have an array of length 'n' initialized with all 0's and are given 'q' queries to update. 2. Each query is represented as a triplet: [startIndex, endIndex, inc] which increments each element of subarray A[startIndex ... endIndex] (startIndex and endIndex inclusive) with inc. 3. Return the modified array after all 'q' queries were executed.
Input Format
length = 5, updates = { {1, 3, 2}, {2, 4, 3}, {0, 2, -2} }
Output Format
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 }
Constraints
0 <= n <= 10^5 0 <= q <= 10^5
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach
1. You should first read the question and watch the question video.
2. Think of a solution approach, then try and submit the question on editor tab.
3. We strongly advise you to watch the solution video for prescribed approach
Example
Input
12 4 2 6 4 0 5 3 1 4 -2 6 9 1
Output
3 1 5 5 5 7 5 1 1 1 0 0