-
Notifications
You must be signed in to change notification settings - Fork 1
/
Array.java
160 lines (138 loc) · 3.8 KB
/
Array.java
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
/**
* @author LiYang
* @param <E>
* @DATE 2020/1/2
*/
public class Array<E> {
private E[] data;
private int size;
public Array(int capacity) {
data = (E[])new Object[capacity];
size = 0;
}
public Array(E[] arr) {
data = (E[]) new Object[arr.length];
System.arraycopy(arr, 0, data, 0, arr.length);
size = arr.length;
}
public Array() {
this(10);
}
public int getSize() {
return size;
}
public int getCapacity() {
return data.length;
}
public boolean isEmpty() {
return size == 0;
}
public void addLast(E e) {
add(size, e);
}
public void addFirst(E e) {
add(0, e);
}
private void resize(int newCapacity) {
E[] newData = (E[]) new Object[newCapacity];
System.arraycopy(data, 0, newData, 0, size);
data = newData;
}
public void add(int index, E e) {
if (size == data.length) {
resize(2 * data.length);
}
if (index < 0 || index > size) {
throw new IllegalArgumentException("addLast failed, Required index < 0 || index > size");
}
System.arraycopy(data, index, data, index + 1, size - index);
data[index] = e;
size ++;
}
E get(int index) {
if (index < 0 || index >= size) {
throw new IllegalArgumentException("get failed, Required index < 0 || index >= size");
}
return data[index];
}
E getLast() {
return get(size - 1);
}
public void swap(int i, int j) {
if (i < 0 || i >= size || j < 0 || j >= size)
throw new IllegalArgumentException("index is illegal");
E temp = data[i];
data[i] = data[j];
data[j] = temp;
}
void set(int index, E e) {
if (index < 0 || index >= size) {
throw new IllegalArgumentException("get failed, Required index < 0 || index >= size");
}
data[index] = e;
}
/**
* 通过降容降低时间复杂度
* @param index:索引值
* @return:删除的元素
*/
public E remove(int index) {
if (index < 0 || index >= size) {
throw new IllegalArgumentException("delete failed, Required index < 0 || index >= size");
}
E temp = data[index];
System.arraycopy(data, index+1, data, index, size-index-1);
size--;
data[size] = null;
if (size == data.length / 4 && data.length / 2 != 0)
resize(data.length / 2);
return temp; //返回被删除的元素
}
public E removeFirst() {
return remove(0);
}
public E removeLast() {
return remove(size-1);
}
public void removeElement(E e){
int index = find(e);
if (index != -1)
remove(index);
}
public void removeAllElement(E e) {
for (int i = 0; i < size; i++) {
if (data[i] == e) {
remove(i);
i--;
}
}
}
public boolean contains(E e){
for (int i = 0; i < size; i++) {
if (data[i].equals(e))
return true;
}
return false;
}
//如果不存在则返回 -1
public int find(E e) {
for (int i = 0; i < size; i++) {
if (data[i].equals(e)) //使用值比较
return i;
}
return -1;
}
@Override
public String toString() {
StringBuilder res = new StringBuilder();
res.append(String.format("Array size = %d, capacity = %d\n", size, data.length));
res.append("[");
for (int i = 0; i < size; i++) {
res.append(data[i]);
if (i !=size - 1)
res.append(", ");
}
res.append("]");
return res.toString();
}
}