forked from onlyliuxin/coding2017
-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathArrayList.java
More file actions
216 lines (183 loc) · 4.3 KB
/
ArrayList.java
File metadata and controls
216 lines (183 loc) · 4.3 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
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
package com.basic;
public class ArrayList<E> implements List<E> {
private Object[] elements;
// 列表长度,默认10个元素
private int size = 10;
// 最后一个元素的位置
private int position = -1;
public ArrayList() {
elements = new Object[size];
}
public ArrayList(final int capacity) {
if (capacity <= 0)
throw new RuntimeException("列表长度不可小于等于0!");
elements = new Object[capacity];
}
/**
* 添加元素
*
* @param e 要添加的元素
* @return
*/
@Override
public boolean add(E e) {
if (++position > size - 1) {
grow();
}
elements[position] = e;
return true;
}
/**
* 删除指定索引的元素
*
* @param index 索引下标
* @return
*/
@Override
@SuppressWarnings("unchecked")
public E remove(int index) {
if (index < 0 || index > position || this.isEmpty())
throw new IndexOutOfBoundsException("要删除的索引不正确!");
E returnElement = (E) elements[index];
elements[index] = null;
System.arraycopy(elements, index + 1, elements, index, position + 1 - index);
position--;
return returnElement;
}
/**
* 删除指定的元素
*
* @param e
* @return
*/
@Override
public boolean remove(E e) {
if (!this.contains(e)) return false;
int removeIndex = 0;
for(int i = 0; i < this.position; i++) {
if(elements[i].equals(e)) {
removeIndex = i;
break;
}
}
remove(removeIndex);
return true;
}
/**
* 返回列表长度
*
* @return
*/
@Override
public int size() {
return position + 1;
}
/**
* 判断列表是否为空
*
* @return
*/
@Override
public boolean isEmpty() {
return position == -1;
}
/**
* 获取指定索引的元素
*
* @param index
* @return
*/
@Override
@SuppressWarnings("unchecked")
public E get(int index) {
if (index > position) return null;
return (E)elements[index];
}
/**
* 重置某个索引的元素
*
* @param index
* @param o
* @return
*/
@Override
public boolean set(int index, Object o) {
if (index > position) return false;
elements[index] = null;
elements[index] = o;
return true;
}
/**
* 判断是否包含某个元素
*
* @param o
* @return
*/
@Override
public boolean contains(Object o) {
if(this.isEmpty()) return false;
for(int i = 0; i <= position; i++) {
if (elements[i].equals(o))
return true;
}
return false;
}
/**
* 清空列表
*/
@Override
public void clear() {
for(int i = 0; i <= this.size(); i++) {
elements[i] = null;
}
position = -1;
}
/**
* 取得迭代器
*
* @return
*/
@Override
public Iterator<E> iterator() {
return new Itr();
}
/**
* 数组增长
*/
private void grow() {
Object[] newElements = new Object[size << 1];
System.arraycopy(elements, 0, newElements, 0, this.size);
size = size << 1;
elements = null;
elements = newElements;
}
private class Itr implements Iterator<E> {
private int itrIndex = 0;
@Override
public boolean hasNext() {
return get(itrIndex) != null;
}
@Override
@SuppressWarnings("unchecked")
public E next() {
return (E) elements[itrIndex++];
}
@Override
public void remove() {
ArrayList.this.remove(itrIndex);
}
}
@Override
public String toString() {
if(this.isEmpty()) {
return "[]";
}
StringBuilder strList = new StringBuilder("[");
for(int i = 0; i < this.size(); i++) {
strList.append(elements[i].toString()).append(",");
}
strList.deleteCharAt(strList.length() - 1);
strList.append("]");
return strList.toString();
}
}