forked from TheAlgorithms/Java
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMinStackUsingTwoStacksTest.java
More file actions
112 lines (89 loc) · 3.32 KB
/
MinStackUsingTwoStacksTest.java
File metadata and controls
112 lines (89 loc) · 3.32 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
package com.thealgorithms.stacks;
import static org.junit.jupiter.api.Assertions.assertEquals;
import static org.junit.jupiter.api.Assertions.assertThrows;
import java.util.EmptyStackException;
import org.junit.jupiter.api.Test;
public class MinStackUsingTwoStacksTest {
@Test
public void testBasicOperations() {
MinStackUsingTwoStacks minStack = new MinStackUsingTwoStacks();
minStack.push(3);
minStack.push(5);
assertEquals(3, minStack.getMin(), "Min should be 3");
minStack.push(2);
minStack.push(1);
assertEquals(1, minStack.getMin(), "Min should be 1");
minStack.pop();
assertEquals(2, minStack.getMin(), "Min should be 2 after popping 1");
assertEquals(2, minStack.top(), "Top should be 2");
}
@Test
public void testPushDuplicateMins() {
MinStackUsingTwoStacks minStack = new MinStackUsingTwoStacks();
minStack.push(2);
minStack.push(2);
minStack.push(1);
minStack.push(1);
assertEquals(1, minStack.getMin(), "Min should be 1");
minStack.pop();
assertEquals(1, minStack.getMin(), "Min should still be 1 after popping one 1");
minStack.pop();
assertEquals(2, minStack.getMin(), "Min should be 2 after popping both 1s");
minStack.pop();
assertEquals(2, minStack.getMin(), "Min should still be 2 after popping one 2");
minStack.pop();
// Now stack is empty, expect exception on getMin
assertThrows(EmptyStackException.class, minStack::getMin);
}
@Test
public void testPopOnEmptyStack() {
MinStackUsingTwoStacks minStack = new MinStackUsingTwoStacks();
assertThrows(EmptyStackException.class, minStack::pop);
}
@Test
public void testTopOnEmptyStack() {
MinStackUsingTwoStacks minStack = new MinStackUsingTwoStacks();
assertThrows(EmptyStackException.class, minStack::top);
}
@Test
public void testGetMinOnEmptyStack() {
MinStackUsingTwoStacks minStack = new MinStackUsingTwoStacks();
assertThrows(EmptyStackException.class, minStack::getMin);
}
@Test
public void testSingleElementStack() {
MinStackUsingTwoStacks minStack = new MinStackUsingTwoStacks();
minStack.push(10);
assertEquals(10, minStack.getMin());
assertEquals(10, minStack.top());
minStack.pop();
assertThrows(EmptyStackException.class, minStack::getMin);
}
@Test
public void testIncreasingSequence() {
MinStackUsingTwoStacks minStack = new MinStackUsingTwoStacks();
minStack.push(1);
minStack.push(2);
minStack.push(3);
minStack.push(4);
assertEquals(1, minStack.getMin());
assertEquals(4, minStack.top());
minStack.pop();
minStack.pop();
assertEquals(1, minStack.getMin());
assertEquals(2, minStack.top());
}
@Test
public void testDecreasingSequence() {
MinStackUsingTwoStacks minStack = new MinStackUsingTwoStacks();
minStack.push(4);
minStack.push(3);
minStack.push(2);
minStack.push(1);
assertEquals(1, minStack.getMin());
assertEquals(1, minStack.top());
minStack.pop();
assertEquals(2, minStack.getMin());
assertEquals(2, minStack.top());
}
}