leetcode

0 class Solution {

1 public:

2 vector<int> decompressRLElist(vector<int> &nums) {

3 vector<int> res;

4

5 for (int i = 0; i < size(nums); i += 2) {

6 for (int j = 0; j < nums[i]; j++) {

7 res.push_back(nums[i + 1]);

8 }

9 }

10

11 return res;

12 }

13 };