Leetcode - Decompress Run-Length Encoded List

https://leetcode.com/problems/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]
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].

func decompressRLElist(nums []int) []int {
    if len(nums) == 0 {
        return []int{}
    }
    result := []int{}
    for i := 0; 2*i+1 < len(nums); i++ {
        freq := nums[2*i]
        val := nums[2*i+1]
        for freq > 0 {
            result = append(result, val)
            freq--
        }
    }
    return result
}

• 相关文章
• 全局相关文章