-
Notifications
You must be signed in to change notification settings - Fork 0
/
Main.java
169 lines (133 loc) · 5.97 KB
/
Main.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
161
162
163
164
165
166
167
168
169
public class Main {
public static void main(String[] args) {
System.out.print("\n");
testMyArrayList();
testMyHashMap();
testMyLinkedList();
testMyStack();
testMyQueue();
}
public static void testMyArrayList() {
MyArrayList<Integer> list = new MyArrayList<>();
// Test add() and size()
list.add(10);
list.add(20);
list.add(30);
System.out.println("ArrayList size after adding elements: " + list.size()); // Output: 3
// Test get()
System.out.println("Element at index 1: " + list.get(1)); // Output: 20
// Test set()
list.set(2, 40);
System.out.println("Updated element at index 2: " + list.get(2)); // Output: 40
// Test remove()
boolean removed = list.remove(0);
System.out.println("ArrayList size after removing an element: " + list.size()); // Output: 2
System.out.println("Removed element at index 0: " + removed); // Output: true
// Test toString()
System.out.println("ArrayList contents: " + list.toString()); // Output: [ 20, 40 ]
// New line
System.out.print("\n");
}
public static void testMyHashMap() {
MyHashMap<String, Integer> map = new MyHashMap<>();
// Test put() and size()
map.put("one", 1);
map.put("two", 2);
map.put("three", 3);
System.out.println("HashMap size after adding entries: " + map.size()); // Output: 3
// Test get()
System.out.println("Value for key 'two': " + map.get("two")); // Output: 2
// Test remove()
boolean removed = map.remove("two");
System.out.println("HashMap size after removing an entry: " + map.size()); // Output: 2
System.out.println("Removed element at key 'two': " + removed); // Output: true
// Test toString()
System.out.println("HashMap contents: " + map.toString());
/*
* Output:
* {
* [ "one" : 1 ]
* [ "three" : 3 ]
* }
*/
// New line
System.out.print("\n");
}
public static void testMyLinkedList() {
MyLinkedList<Integer> linkedList = new MyLinkedList<>();
// Test append() and size()
linkedList.append(10);
linkedList.append(20);
linkedList.append(30);
System.out.println("LinkedList size after appending elements: " + linkedList.size()); // Output: 3
// Test prepend() and size()
linkedList.prepend(5);
System.out.println("LinkedList size after prepending an element: " + linkedList.size()); // Output: 4
// Test get()
System.out.println("Element at index 1: " + linkedList.get(1)); // Output: 10
// Test insert()
linkedList.insert(15, 2);
System.out.println("LinkedList size after inserting an element at index 2: " + linkedList.size()); // Output: 5
// Test remove() by value
boolean removedByValue = linkedList.remove(Integer.valueOf(20));
System.out.println("LinkedList size after removing an element by value: " + linkedList.size()); // Output: 4
System.out.println("Element 20 removed: " + removedByValue); // Output: true
// Test remove() by index
Integer removedByIndex = linkedList.remove(2);
System.out.println("LinkedList size after removing an element by index: " + linkedList.size()); // Output: 3
System.out.println("Element removed at index 2: " + removedByIndex); // Output: 15
// Test toString()
System.out.println("LinkedList contents: " + linkedList.toString());
// Output: [ 5 ] --> [ 10 ] --> [ 30 ]
// New line
System.out.print("\n");
}
public static void testMyStack() {
MyStack<Integer> stack = new MyStack<>();
// Test push() and size()
stack.push(10);
stack.push(20);
stack.push(30);
System.out.println("Stack size after pushing elements: " + stack.size()); // Output: 3
// Test peek()
System.out.println("Top element in the stack: " + stack.peek()); // Output: 30
// Test pop()
Integer poppedElement = stack.pop();
System.out.println("Popped element from the stack: " + poppedElement); // Output: 30
System.out.println("Stack size after popping an element: " + stack.size()); // Output: 2
// Test toString()
System.out.println("Stack contents: " + stack.toString());
// Output: [ 20 ] --> [ 10 ]
// Test pop() when stack is empty
stack.pop();
stack.pop();
System.out.println("Stack size after popping from an empty stack: " + stack.size()); // Output: 0
System.out.println("Popped element from an empty stack: " + stack.pop()); // Output: null
// New line
System.out.print("\n");
}
public static void testMyQueue() {
MyQueue<Integer> queue = new MyQueue<>();
// Test enqueue() and size()
queue.enqueue(10);
queue.enqueue(20);
queue.enqueue(30);
System.out.println("Queue size after enqueueing elements: " + queue.size()); // Output: 3
// Test peek()
System.out.println("Front element in the queue: " + queue.peek()); // Output: 10
// Test dequeue()
Integer dequeuedElement = queue.dequeue();
System.out.println("Dequeued element from the queue: " + dequeuedElement); // Output: 10
System.out.println("Queue size after dequeuing an element: " + queue.size()); // Output: 2
// Test toString()
System.out.println("Queue contents: " + queue.toString());
// Output: [ 20 ] --> [ 30 ]
// Test dequeue() when queue is empty
queue.dequeue();
queue.dequeue();
System.out.println("Queue size after dequeuing from an empty queue: " + queue.size()); // Output: 0
System.out.println("Dequeued element from an empty queue: " + queue.dequeue()); // Output: null
// New line
System.out.print("\n");
}
}