-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathDynArray.java
More file actions
148 lines (135 loc) · 4.58 KB
/
DynArray.java
File metadata and controls
148 lines (135 loc) · 4.58 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
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
import java.lang.reflect.Array;
import java.util.ArrayList;
public class DynArray<T> {
public T[] array;
public int count;
public int capacity;
public Class clazz;
public DynArray(Class clazz) {
this.clazz = clazz; // нужен для безопасного приведения типов
// new DynArray<Integer>(Integer.class);
count = 0;
makeArray(16);
}
public void makeArray(int new_capacity) {
// array = (T[]) Array.newInstance(this.clazz, new_capacity);
// ваш код
if (count == 0) {
capacity = new_capacity;
array = (T[]) Array.newInstance(this.clazz, capacity);
}
T[] temp = (T[]) Array.newInstance(this.clazz, capacity);
for (int i = 0; i < array.length; i++) {
temp[i] = array[i];
}
if (count > capacity) {
capacity = capacity * 2;
array = (T[]) Array.newInstance(this.clazz, capacity);
for (int i = 0; i < temp.length; i++) {
array[i] = temp[i];
}
} else if (count <= 16) {
capacity = 16;
array = (T[]) Array.newInstance(this.clazz, capacity);
for (int i = 0; i < count; i++) {
array[i] = temp[i];
}
} else if (count < capacity / 2) {
capacity = (int) (capacity / 1.5);
array = (T[]) Array.newInstance(this.clazz, capacity);
for (int i = 0; i < count; i++) {
array[i] = temp[i];
}
}
}
public void append(T item) {
// ваш код
count++;
if (count >= capacity) {
makeArray(array.length);
array[count - 1] = item;
} else if (count + 1 <= capacity) {
array[count - 1] = item;
}
}
public T getItem(int index) {
// ваш код
if (index < count && index >= 0) {
return array[index];
} else
throw new IndexOutOfBoundsException();
}
public void insert(T item, int index) {
// ваш код
if (index <= count && index >= 0) {
count++;
if (count >= capacity) {
makeArray(array.length);
if (index == 0) {
for (int i = count - 2; i >= 0; i--) {
array[i + 1] = array[i];
}
array[index] = item;
} else if (index == count - 2) {
T type = array[index];
array[index + 1] = type;
array[index] = item;
} else if (index == capacity - 1) {
array[index] = item;
} else {
for (int i = count - 2; i >= index; i--) {
array[i + 1] = array[i];
}
array[index] = item;
}
} else if (count + 1 <= capacity) {
if (index == 0) {
for (int i = count - 1; i >= 0; i--) {
array[i + 1] = array[i];
}
array[index] = item;
} else if (index == count - 2) {
T type = array[index];
array[index + 1] = type;
array[index] = item;
} else if (index == capacity - 1) {
array[index] = item;
} else {
for (int i = count - 1; i >= index; i--) {
array[i + 1] = array[i];
}
array[index] = item;
}
}
} else
throw new IndexOutOfBoundsException();
}
public void remove(int index) {
// ваш код
if (index < count && index >= 0) {
if (index == 0) {
for (int i = 0; i < count - 1; i++) {
array[i] = array[i + 1];
}
array[count - 1] = null;
count--;
} else if (index == count - 1) {
array[index] = null;
count--;
} else {
for (int i = index; i < count - 1; i++) {
array[i] = array[i + 1];
}
array[count - 1] = null;
count--;
}
} else
throw new IndexOutOfBoundsException();
if (count <= 16){
makeArray(16);
}
else if (count < capacity/2){
makeArray(array.length);
}
}
}