LeetCode 370. Range Addition
来源:互联网 发布:监控电脑屏幕的软件 编辑:程序博客网 时间:2024/05/17 21:45
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 ]
Hint:
Thinking of using advanced data structures? You are thinking it too complicated.
For each update operation, do you really need to update all elements between i and j?
Update only the first and end element is sufficient.
The optimal time complexity is O(k + n) and uses O(1) extra space.
思路:
1. 最直接粗暴的方法是:对k次操作,每一次都遍历n长的vector,这样复杂度o(nk)。但是,考虑到每个操作,比如[1,3,2]是对1到3这个区间的数加2,增加的都是相同的数,因此,没必要一个一个的去增加这个区间的数,一定存在更快的方法!
2. 需要提取记录的信息:把k次操作对应的首尾坐标,标记在vector上!最后复杂度o(k+n)
2. 先对给定的K次操作预处理:把每次操作的开始和结束坐标标记在n长的vector上, 比如:[1,3,2],就在index=1处加2,index=4减2,把所有的k次操作都这么处理,然后遍历一遍vecotor,index=i的位置上的最终值等于vector[0,i]这个区间上所有值累加!!
3. 例如: length = 5,
updates = [
[1, 3, 2],
[2, 4, 3],
[0, 2, -2]
]
initially, nums=[0,0,0,0,0];
after [1,3,2], nums=[0,2,0,0,-2];
after [2,4,3], nums=[0,2,3,0,-2];
after [0,2,-2],nums=[-2,2,3,2,-2]。所以,最终累加结果[-2,0,3,5,3].
vector<int> getModifiedArray(int length, vector<vector<int>>& updates) { vector<int> res(length,0); for(auto&op:updates){//预处理 res[op[0]]+=op[2]; if(op[1]+1<length) res[op[1]+1]-=op[2]; } for(int i=1;i<length;i++){//累加 res[i]+=res[i-1]; } return res;}
- LeetCode 370. Range Addition
- Leetcode 370. Range Addition
- [leetcode] 370. Range Addition
- LeetCode 370. Range Addition
- [leetcode] 370. Range Addition 解题报告
- Leetcode 370. Range Addition (Medium) (cpp)
- [Leetcode] 370. Range Addition 解题报告
- leetcode Range Addition
- leetcode[Range Addition II]
- Range Addition II(leetcode)
- 370. Range Addition
- [leetcode]598. Range Addition II
- [leetcode]: 598. Range Addition II
- leetcode 598. Range Addition II
- [LeetCode]598. Range Addition II
- LeetCode 598. Range Addition II
- Leetcode 598 Range Addition II
- leetcode-598. Range Addition II
- UVa OJ 10441 Catenyms
- Windows核心编程笔记(八)用户模式下的线程同步
- Subsets
- Leetcode First Missing Positive
- windows mysql 自动备份的几种方法
- LeetCode 370. Range Addition
- Java之Redis队列+Websocket+定时器实现跑马灯实时刷新
- T-SQL概述(常量变量运算符)
- Palindrome Linked List
- 【LeetCode】 319. Bulb Switcher
- 在行为树(Behavior Tree)中使用黑板(BlackBoard)
- 【LeetCode】 328. Odd Even Linked List
- VS_Enterprise2017RC初体验-安装篇
- 237. Delete Node in a Linked List