Class Solution
- java.lang.Object
-
- g1301_1400.s1313_decompress_run_length_encoded_list.Solution
-
public class Solution extends Object
1313 - Decompress Run-Length Encoded List.Easy
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]]
(withi >= 0
). For each such pair, there arefreq
elements with valueval
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]
Explanation: The first pair [1,2] means we have freq = 1 and val = 2 so we generate the array [2].
The second pair [3,4] means we have freq = 3 and val = 4 so we generate [4,4,4].
At the end the concatenation [2] + [4,4,4] is [2,4,4,4].
Example 2:
Input: nums = [1,1,2,3]
Output: [1,3,3]
Constraints:
2 <= nums.length <= 100
nums.length % 2 == 0
1 <= nums[i] <= 100
-
-
Constructor Summary
Constructors Constructor Description Solution()
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description int[]
decompressRLElist(int[] nums)
-