-
Notifications
You must be signed in to change notification settings - Fork 25
/
1313-decompress-run-length-encoded-list.js
51 lines (42 loc) · 1.21 KB
/
1313-decompress-run-length-encoded-list.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
// 1313. Decompress Run-Length Encoded List
// Easy 85%
// We are given a list nums of integers representing a list compressed with
// run-length encoding.
// Consider each adjacent pair of elements [a, b] = [nums[2*i], nums[2*i+1]]
// (with i >= 0). For each such pair, there are a elements with value b in 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,4] is [2,4,4,4].
// Constraints:
// 2 <= nums.length <= 100
// nums.length % 2 == 0
// 1 <= nums[i] <= 100
/**
* @param {number[]} nums
* @return {number[]}
*/
const decompressRLElist = function(nums) {
const res = []
for (let i = 0; i < nums.length / 2; i++ ) {
for (let j = 0; j < nums[i * 2]; j++ ) {
res.push(nums[i * 2 + 1])
}
}
return res
}
;[
[1,2,3,4],
].forEach((nums) => {
console.log(decompressRLElist(nums))
})
// Solution:
// 每次遍历两个数,a, b
// 再生成 a 次 b
// Submission Result: Accepted