-
Notifications
You must be signed in to change notification settings - Fork 0
/
Array.java
79 lines (67 loc) · 1.93 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
package com.brian.portfolio.datastructures;
public class Array {
private byte count;
private int[] items;
public Array(int length) {
this.items = new int[length];
count = 0;
}
public void insert(int item) {
items[count++] = item;
if (count == items.length) {
int[] newItems = new int[items.length * 2];
for (int x = 0; x <= items.length - 1; x++)
newItems[x] = items[x];
items = newItems;
}
}
public void removeAt(int index) {
if (index < 0 || index >= count)
throw new IllegalArgumentException();
for (int i = index; i < count; i++)
items[i] = items[i + 1];
count--;
}
public int indexOf(int item) {
for (int i = 0; i < count; i++)
if (items[i] == item)
return i;
return -1;
}
public int max() {
int largest = 0;
for (int item : items)
if (item > largest)
largest = item;
return largest;
}
public int[] intersect (int[] list) {
int x = 0;
var common = new int[count];
for (int i = 0; i <= count - 1; i++) {
for (int y = 0; y <= count - 1; y++)
if (items[i] == list[y]) {
common[x++] = items[i];
break;
}
}
return common;
}
public int[] reverse () {
var reverse = new int[count];
for (int i = count - 1, y = 0; i >= 0; i--, y++)
reverse[y] = items[i];
return reverse;
}
public void insertAt(int item, int index) {
if (items[index] == 0)
count++;
for (int i = 0; i <= items.length - 1; i++)
if (i == index)
items[i] = item;
}
public void print() {
for (int i = 0; i <= count -1; i++)
System.out.println(items[i]);
}
}