-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathNamArray.java
More file actions
72 lines (64 loc) · 1.59 KB
/
Copy pathNamArray.java
File metadata and controls
72 lines (64 loc) · 1.59 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
import java.util.*;
/**
* NamArray is the same as an array, but with 4 improvements
* 1- Cannot remove elements
* 2- Can only add elements to the end
* 3- Is bounded
* 4- For every 3 elements added, another "Nam" gets added to NamString
* @param <T>
*/
class NamArray<T> {
public int max;
private final ArrayList<T> a;
private String ns;
private int count;
public NamArray(int max) {
this.max = max;
this.a = new ArrayList<>(max);
this.ns = "";
this.count = 0;
}
public int Size() {
return count;
}
public List<T> getS() {
return a;
}
public String getNamString() {
return ns;
}
public void Append(T x) {
if (this.Size() == this.max) {
System.out.println("NamArray reached max size");
return;
}
a.add(x);
char char_to_add;
if (count % 3 == 0) {
char_to_add = 'N';
} else if (count % 3 == 1) {
char_to_add = 'a';
} else {
char_to_add = 'm';
}
ns = ns + char_to_add;
count++;
}
}
class run {
static void main() {
NamArray<Integer> na = new NamArray<>(10);
System.out.println(na.Size());
System.out.println(na.getS());
System.out.println(na.getNamString());
na.Append(1);
na.Append(2);
na.Append(3);
na.Append(4);
na.Append(5);
na.Append(6);
System.out.println(na.Size());
System.out.println(na.getS());
System.out.println(na.getNamString());
}
}