GoLang Solution For LeetCode Problem: Decompress Run Length Encoded List
Solving Decompress Run Length Encoded List in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.
Return the decompressed list.
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 . The second pair [3,4] means we have freq = 3 and val = 4 so we generate [4,4,4]. At the end the concatenation  + [4,4,4] is [2,4,4,4].
Input: nums = [1,1,2,3] Output: [1,3,3]
2 <= nums.length <= 100
nums.length % 2 == 0
1 <= nums[i] <= 100
See the full details of the problem Decompress Run Length Encoded List at LeetCode
Originally posted at: @github.com/halfrost/LeetCode-Go