【LeetCode】370.Range Addition(Medium)解题报告

最新推荐文章于 2023-11-09 22:09:53 发布

郝春雨

最新推荐文章于 2023-11-09 22:09:53 发布

阅读量239

点赞数

分类专栏： LeetCode Array 文章标签： leetcode

本文链接：https://blog.csdn.net/haoxiaoxiaoyu/article/details/79339626

版权

LeetCode 同时被 2 个专栏收录

183 篇文章 0 订阅

订阅专栏

Array

65 篇文章 0 订阅

订阅专栏

【LeetCode】370.Range Addition(Medium)解题报告

题目地址：https://leetcode.com/problems/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 ]

可以暴力解。也有一种简便方法如下，但此种比较单一。

Solution:

//time:O(k+n)
//space:O(n)
class Solution {
    public int[] getModifiedArray(int length,int[][] updates){
        int[] res = new int[length];
        for(int[] update :updates){
            int value = updates[2];
            int start = updates[0];
            int end = updates[1];
            res[start] += value;
            if(end+1 < length){
                res[end+1] -=value;
            }
        }
        for(int i=1 ; i<length ; i++){
            res[i] += res[i-1];
        }
        return res;
    }
}