描述
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]
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]
Note:
2 <= nums.length <= 100
nums.length % 2 == 0
1 <= nums[i] <= 100
解析
根据题意很简单，就是将 nums 从前到后两两看成一对（i，j），在列表 r 中追加 i 个 j 元素，遍历完之后得到 r 即为结果。
解答
class Solution(object):
def decompressRLElist(self, nums):
"""
:type nums: List[int]
:rtype: List[int]
"""
r = []
for i in range(0,len(nums),2):
r.extend(nums[i]*[nums[i+1]])
return r
运行结果
Runtime: 52 ms, faster than 81.84% of Python online submissions for Decompress Run-Length Encoded List.
Memory Usage: 13.9 MB, less than 23.03% of Python online submissions for Decompress Run-Length Encoded List.
原题链接：leetcode.com/problems/de…
您的支持是我最大的动力
