-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSuperArray.java
More file actions
126 lines (126 loc) · 2.76 KB
/
SuperArray.java
File metadata and controls
126 lines (126 loc) · 2.76 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
public class SuperArray{
private String[] arr;
private int size;
public SuperArray(String[] array){
arr = array;
size = array.length;
}
public String toString(){
String arr1 = "";
for(int i = 0; i < size; i ++){
arr1 = arr1.concat(arr[i] +",");
}
return "["+ arr1 + "]";
}
public void resize(int pivot){
String[] arr2 = new String[size + 1];
size ++;
for(int i = 0; i < pivot; i ++){
arr2[i] = arr[i];
}
for(int i = pivot; i < size; i ++){
arr2[i] = arr[i - 1];
}
arr = new String[size];
arr = arr2;
}
public void cut(int pivot){
String[] arr2 = new String[size - 1];
size --;
for(int i = 0; i < pivot; i ++){
arr2[i] = arr[i];
}
for(int i = pivot; i < size; i ++){
arr2[i] = arr[i + 1];
}
arr = new String[size];
arr = arr2;
}
public void clear(){
arr = new String[size];
}
public int size(){
return size;
}
public boolean isEmpty(){
for(int i = 0; i < size; i ++){
if(arr[i] != null){
return false;
}
}
return true;
}
public boolean add(String element){
resize(size);
arr[size - 1] = element;
return true;
}
public String get(int index){
try{
return arr[index];
}
catch(ArrayIndexOutOfBoundsException e){
return("array index out of bounds");
}
}
public String set(int index, String element){
String old = arr[index];
try{
arr[index] = element;
}
catch(ArrayIndexOutOfBoundsException e){
System.out.println("array index out of bounds");
}
return old;
}
public boolean contains(String element){
for(int i = 0; i < size; i ++){
if(arr[i].equals(element)){
return true;
}
}
return false;
}
public void add(int index, String element){
if(index > size){
System.out.println("index out of bounds");
return;
}
resize(index);
arr[index] = element;
}
public int IndexOf(String element){
for(int i = 0; i < size; i ++){
if(element == arr[i]){
return i;
}
}
return -1;
}
public int lastIndexOf(String element){
for(int i = size-1; i >= 0; i --){
if(element == arr[i]){
return i;
}
}
return -1;
}
public String remove(int index){
if(index >= size){
System.out.println("array index out of bounds");
System.exit(0);
}
String removed = arr[index];
cut(index);
return removed;
}
public boolean remove(String element){
for(int i = 0; i < size; i ++){
if(arr[i] == element){
cut(i);
return true;
}
}
return false;
}
}