-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathFillArray.java
More file actions
54 lines (47 loc) · 1.31 KB
/
Copy pathFillArray.java
File metadata and controls
54 lines (47 loc) · 1.31 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
import java.util.Arrays;
public class FillArray {
public static void main(String[] args) {
System.out.println(Arrays.toString(fill(new int[]{1, 2, 3, 5, 9, 12, -2, -1}, 3, 10)));
System.out.println(Arrays.toString(fill(new int[]{4, 2, -3, 12}, 1, 5)));
System.out.println(Arrays.toString(fill(new int[]{2, 6, 9, 0, -3}, 0, 4)));
}
static int[] fill(int[] arr, int k, int n) {
if(k <= 0 || n <= 0)
return null;
int[] arr2 = new int[n];
int index = 0;
for(int i = index * k, j = 0; i < n; i++, j++) {
if(j == k) {
index++;
j = 0;
}
arr2[i] = arr[j];
}
return arr2;
}
static int[] fill1(int[] arr, int k, int n) {
if(k <= 0 || n <= 0)
return null;
int[] arr2 = new int[n];
int index = 0;
for(int i = 0; i < n; i++) {
if(index == k)
index = 0;
arr2[i] = arr[index];
index++;
}
return arr2;
}
static int[] fill2(int[] arr, int k, int n) {
if (k <= 0 || n <= 0)
return null;
int[] arr2 = new int[n];
for (int i = 0; i < n; ) {
for (int j = 0; j < k && i < n; j++) {
arr2[i] = arr[j];
i++;
}
}
return arr2;
}
}