-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathprogram43.java
More file actions
73 lines (44 loc) · 1.75 KB
/
program43.java
File metadata and controls
73 lines (44 loc) · 1.75 KB
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
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
/*
1313. Decompress Run-Length Encoded List
Easy
1.1K
1.3K
Companies
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].
Example 2:
Input: nums = [1,1,2,3]
Output: [1,3,3]
*/
package LeetCode;
public class program43 {
static int[] decompressRLElist(int[] nums) {
int size = 0;
for(int i=0;i<nums.length;i=i+2){
size +=nums[i];
}
int res[] = new int[size];
int x=0;
for(int i=0;i<nums.length;i=i+2){
for(int j=nums[i];j>=1;j--){
res[x] = nums[i+1];
x++;
}
}
return res;
}
public static void main(String[] args) {
int[] nums = {1,1,2,3};
int[] a = decompressRLElist(nums);
for(int i=0;i<a.length;i++){
System.out.print(a[i]+" ");
}
}
}