-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathList.java
More file actions
83 lines (76 loc) · 2.09 KB
/
Copy pathList.java
File metadata and controls
83 lines (76 loc) · 2.09 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
74
75
76
77
78
79
80
81
82
83
import java.util.Arrays;
public class List {
private Integer[] vect;
private int size;
public List(int size) {
vect = new Integer[size];
this.size = 0;
}
public boolean IsFull() {
return (size == vect.length);
}
public boolean isEmpty() {
return (size == 0);
}
public boolean add(int value) {
if (IsFull()) {
System.out.println("Список заповнений!!");
return false;
}
vect[size++] = value;
return true;
}
public boolean addByIndex(int index, int value) {
if (IsFull()) {
System.out.println("Список заполнен!!");
return false;
}
if (index < 0 || index > size) {
System.out.println("Некорректный индекс!");
return false;
}
for (int i = size; i > index; i--) {
vect[i] = vect[i - 1];
}
vect[index] = value;
size++;
return true;
}
public Integer remove(int index) {
if (isEmpty()) {
System.out.println("Список пустий!");
return null;
}
int temp = vect[0];
for (int i = index; i < size - 1; i++) {
vect[i] = vect[i + 1];
}
vect[--size] = null;
return temp;
}
public void show(){
for (int i = 0; i < size; i++) {
System.out.print(vect[i] + " ");
}
System.out.println();
}
public void transferEvenNumbers(DoubleLinklist list){
Integer[] evenNumbers = new Integer[size];
int evenCount = 0;
int i = 0;
while (i < size) {
if (vect[i] != null && vect[i] % 2 == 0) {
evenNumbers[evenCount++] = vect[i];
remove(i);
}
else {
i++;
}
}
evenNumbers = Arrays.copyOf(evenNumbers, evenCount);
Arrays.sort(evenNumbers);
for (int num : evenNumbers) {
list.AddLast(String.valueOf(num));
}
}
}