Stack is an extension of the java.util.Vector class that provided a LIFO (last-in-first-out) data structure. This class provide the usual method such as push() and pop(). The peek method is used the get the top element of the stack without removing the item.
package org.kodejava.util;
import java.util.Stack;
public class StackExample {
public static void main(String[] args) {
Stack<Integer> stack = new Stack<>();
// We stored some values in the stack object.
for (int i = 0; i < 10; i++) {
stack.push(i);
System.out.print(i + " ");
}
System.out.println();
// Searching for an item in the stack. The position returned
// as the distance from the top of the stack. Here we search
// for the 3 number in the stack which is in the 7th row of
// the stack.
int position = stack.search(3);
System.out.println("Search result position: " + position);
// The current top value of the stack
System.out.println("Stack top: " + stack.peek());
// Here we're popping out all the stack object items.
while (!stack.empty()) {
System.out.print(stack.pop() + " ");
}
}
}
The result of the code snippet:
0 1 2 3 4 5 6 7 8 9
Search result position: 7
Stack top: 9
9 8 7 6 5 4 3 2 1 0
Founder at Kode Java Org
A programmer, recreational runner and diver, live in the island of Bali, Indonesia. Programming in Java, Spring, Hibernate / JPA. You can support me working on this project, buy me a cup of coffee ☕ every little bit helps, thank you 🙏
Latest posts by Wayan (see all)
- How do I create a string of repeated characters? - September 1, 2023
- How do I convert datetime string with optional part to a date object? - August 28, 2023
- How do I split large excel file into multiple smaller files? - April 15, 2023