JuniorArray
Decompress Run-Length Encoded List
We are given a list nums of integers representing a list compressed with run-length encoding.
Consider each adjacent pair of elements [freq, val] = [nums[2*i], nums[2*i+1]] with i >= 0. For each such pair, there are freq elements with value val concatenated in a sublist. Concatenate all the sublists from left to right to generate the decompressed list.
Return the decompressed list.
Example 1
Input
nums = [1,2,3,4]Output
[2,4,4,4]The first pair [1,2] generates [2], the second pair [3,4] generates [4,4,4], and their concatenation is [2,4,4,4].
Example 2
Input
nums = [1,1,2,3]Output
[1,3,3]The pair [1,1] generates [1] and the pair [2,3] generates [3,3], so the concatenation is [1,3,3].
Constraints
- 2 <= nums.length <= 100
- nums.length % 2 == 0
- 1 <= nums[i] <= 100