Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- public static int[] rangeAditionOptimal(int length, int query[][]) {
- int ans[] = new int[length];
- for (int i = 0; i < query.length; i++) {
- int si = query[i][0];
- int ei = query[i][1];
- int inc = query[i][2];
- ans[si] = ans[si] + inc;
- if (ei + 1 < length) {
- ans[ei + 1] = ans[ei + 1] - inc;
- }
- }
- // int[] PrefixSum = new int[ans.length];
- // PrefixSum[0] = ans[0];
- // for(int i=1; i<length; i++){
- // PrefixSum[i] = PrefixSum[i-1] + ans[i];
- // }
- for (int i = 1; i < length; i++) {
- ans[i] = ans[i] + ans[i - 1];
- }
- return ans;
- // return PrefixSum;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement
