-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathArrayList.Java
More file actions
158 lines (136 loc) · 3.37 KB
/
ArrayList.Java
File metadata and controls
158 lines (136 loc) · 3.37 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
149
150
151
152
153
154
155
156
157
158
class ArrayList implements Iterable {
int[] values = new int[1];
int size = 1;
int length = 0;
void insert(int index, int value) {
if (index > length) throw new ArrayIndexOutOfBoundsException(index);
else {
if (length == size) {
var values2 = values;
values = new int[size*2];
for (var i = 0; i < values2.length; i++) {
values[i] = values2[i];
}
}
if(index == length) {
values[index] = value;
length++;
}
else {
for (var i = length-1; i >=index; i--) {
values[i+1] = values[i];
}
values[index] = value;
length++;
}
}
}
void delete(int index) {
if (index >= length) throw new ArrayIndexOutOfBoundsException(index);
else {
for (var i = index; i < length-1; i++) {
values[i] = values[i+1];
}
length--;
}
}
int get(int index) {
if (index < 0) index = this.length + index;
if (index >= length) throw new ArrayIndexOutOfBoundsException(index);
else {
return values[index];
}
}
void set(int index, int value) {
if (index < 0) index = this.length + index;
if (index >= length) throw new ArrayIndexOutOfBoundsException(index);
else {
values[index] = value;
}
}
int find(int value) {
for (var i = 0; i < this.length; i++) {
if (this.values[i] == value) return i;
}
return -1;
}
int front() {
return this.get(0);
}
int back() {
return this.get(length-1);
}
void pushFront(int value) {
insert(0,value);
}
void pushBack(int value) {
insert(length, value);
}
void popFront() {
delete(0);
}
void popBack() {
delete(length-1);
}
boolean empty() {
return length == 0;
}
int length() {
return length;
}
void clear() {
length = 0;
}
void sort() {
for (var i = length-1; i > 0; i--) {
for (var j = 0; j < i; j++) {
if (values[j] > values[j+1]) {
var l = values[j];
values[j] = values[j+1];
values[j+1] = l;
}
}
}
}
void reverse () {
for (var i = 0; i < length/2-1; i++) {
var l = values[i];
values[i] = values[length-1-i];
values[length-1-i] = l;
}
}
void print() {
System.out.print("[");
if (this.length > 0) {
System.out.printf("%d", this.values[0]);
}
for (var i = 1; i < this.length; i++) {
System.out.printf(", %d", this.values[i]);
}
System.out.println("]");
}
public static void main(String[] args) {
var l = new ArrayList();
l.insert(0, 1);
l.insert(0, 2);
for (var v: l) {
System.out.println(v);
}
// for (var i = 0; i < l.length(); i++) {
// System.out.println(l.get(i));
// }
// for (var i = 0; i < l.length(); i++) {
// System.out.println(l.get(i));
// }
// System.out.println(l.get(-3));
// l.insert(0,7);
// l.insert(0,5);
// l.insert(2,3);
// l.insert(3,4);
// l.insert(4,2);
// l.insert(3,1);
// l.delete(2);
// l.get(3);
l.print();
}
}