[leetcode] 1313. Decompress Run-Length Encoded List

Description

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[2i], nums[2i+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]
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:

1. 2 <= nums.length <= 100.
2. nums.length % 2 == 0.
3. 1 <= nums[i] <= 100.

分析

题目的意思是：给你一个数组，数组是以频率，值，这样的方式排列的，然后要把它还原成原来的数组。看懂题目的意思以后，就很直接了，直接按照频率，值的顺序遍历解析就行了哈。

代码

class Solution:
    def decompressRLElist(self, nums: List[int]) -> List[int]:
        n=len(nums)
        res=[]
        for i in range(0,n,2):
            feq=nums[i]
            val=nums[i+1]
            res+=[val]*feq
        return res