LeetCode #1313. Decompress Run-Length Encoded List

题目

1313. Decompress Run-Length Encoded List

---

解题方法

以步长为2遍历nums，把numsi+1写numsi遍。
时间复杂度：O(n*f)，f是所有val的频数总和
空间复杂度：O(f)

---

代码

class Solution:
    def decompressRLElist(self, nums: List[int]) -> List[int]:
        rat = []
        for i in range(0, len(nums), 2):
            freq = nums[i]
            val = nums[i+1]
            while freq:
                rat.append(val)
                freq -= 1
        return rat