-
Notifications
You must be signed in to change notification settings - Fork 19.7k
/
Copy pathSmallestElementConstantTime.java
74 lines (66 loc) · 2.04 KB
/
SmallestElementConstantTime.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
package com.thealgorithms.stacks;
import java.util.NoSuchElementException;
import java.util.Stack;
/**
* A class that implements a stack that gives the minimum element in O(1) time.
* The mainStack is used to store the all the elements of the stack
* While the minStack stores the minimum elements
* When we want to get a minimum element, we call the top of the minimum stack
*
* Problem: https://www.baeldung.com/cs/stack-constant-time
*/
public class SmallestElementConstantTime {
private Stack<Integer> mainStack; // initialize a mainStack
private Stack<Integer> minStack; // initialize a minStack
/**
* Constructs two empty stacks
*/
public SmallestElementConstantTime() {
mainStack = new Stack<>();
minStack = new Stack<>();
}
/**
* Pushes an element onto the top of the stack.
* Checks if the element is the minimum or not
* If so, then pushes to the minimum stack
* @param data The element to be pushed onto the stack.
*/
public void push(int data) {
if (mainStack.isEmpty()) {
mainStack.push(data);
minStack.push(data);
return;
}
mainStack.push(data);
if (data < minStack.peek()) {
minStack.push(data);
}
}
/**
* Pops an element from the stack.
* Checks if the element to be popped is the minimum or not
* If so, then pop from the minStack
*
* @throws NoSuchElementException if the stack is empty.
*/
public void pop() {
if (mainStack.isEmpty()) {
throw new NoSuchElementException("Stack is empty");
}
int ele = mainStack.pop();
if (ele == minStack.peek()) {
minStack.pop();
}
}
/**
* Returns the minimum element present in the stack
*
* @return The element at the top of the minStack, or null if the stack is empty.
*/
public Integer getMinimumElement() {
if (minStack.isEmpty()) {
return null;
}
return minStack.peek();
}
}