标签:input update incr operation new ... star solution for
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: Input: length = 5, updates = [[1,3,2],[2,4,3],[0,2,-2]] Output: [-2,0,3,5,3] class Solution { 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 change = update[2]; for(int i = start; i <= end; i++){ res[i] += change; } } return res; } }
标签:input update incr operation new ... star solution for
原文地址:https://www.cnblogs.com/tobeabetterpig/p/9929997.html