This Java program Implements Stack API.The Stack class represents a last-in-first-out (LIFO) stack of objects. It extends class Vector with five operations that allow a vector to be treated as a stack. The usual push and pop operations are provided, as well as a method to peek at the top item on the stack, a method to test for whether the stack is empty, and a method to search the stack for an item and discover how far it is from the top.
Here is the source code of the Java Program to Implement Stack API.The Java program is successfully compiled and run on a Linux system. The program output is also shown below.
import java.util.Stack; public class StackImpl<E> { private Stack<E> stack; /** Creates an empty Stack. **/ public StackImpl() { stack = new Stack<E>(); } /** Tests if this stack is empty. **/ public boolean empty() { return stack.empty(); } /** * Looks at the object at the top of this stack without removing it from the * stack. **/ public E peek() { return stack.peek(); } /** * Removes the object at the top of this stack and returns that object as * the value of this function. **/ public E pop() { return stack.pop(); } /** Pushes an item onto the top of this stack. **/ public E push(E item) { return stack.push(item); } /** Returns the 1-based position where an object is on this stack. **/ public int search(Object o) { return stack.search(o); } public static void main(String...arg) { StackImpl<Integer> stack = new StackImpl<Integer>(); System.out.println("element pushed : " + stack.push(3)); System.out.println("element pushed : " + stack.push(4)); System.out.println("element pushed : " + stack.push(-19)); System.out.println("element pushed : " + stack.push(349)); System.out.println("element pushed : " + stack.push(35)); System.out.println("element poped : " + stack.pop()); System.out.println("element poped : " + stack.pop()); System.out.println("Element peek : " + stack.peek()); System.out.println("position of element 349 " + stack.search(3)); while (!stack.empty()) { System.out.println("element poped : " + stack.pop()); } } }
$ javac StackImpl.java $ java StackImpl element pushed : 3 element pushed : 4 element pushed : -19 element pushed : 349 element pushed : 35 element poped : 35 element poped : 349 Element peek : -19 position of element 349 3 element poped : -19 element poped : 4 element poped : 3
Related posts:
Hướng dẫn Java Design Pattern – Dependency Injection
Java Program to Implement Threaded Binary Tree
The Dining Philosophers Problem in Java
Spring REST API + OAuth2 + Angular
Spring @RequestMapping New Shortcut Annotations
Java Program to Apply DFS to Perform the Topological Sorting of a Directed Acyclic Graph
Java Program to Implement Suffix Tree
Comparing Arrays in Java
Java Program to Implement Dijkstra’s Algorithm using Set
Spring Security Login Page with React
Spring Boot - Cloud Configuration Server
Java Program to Implement Ternary Tree
Assertions in JUnit 4 and JUnit 5
A Guide to JUnit 5 Extensions
Service Registration with Eureka
How to Count Duplicate Elements in Arraylist
Hướng dẫn Java Design Pattern – Builder
Java Program to Solve a Matching Problem for a Given Specific Case
Uploading MultipartFile with Spring RestTemplate
Versioning a REST API
Spring Boot - Admin Client
Notify User of Login From New Device or Location
ArrayList trong java
Java Program to Implement Variable length array
Hướng dẫn Java Design Pattern – Facade
Limiting Query Results with JPA and Spring Data JPA
Spring Boot - Build Systems
Remove the First Element from a List
Hướng dẫn Java Design Pattern – Visitor
Introduction to Spring Boot CLI
Java Program to Implement PriorityQueue API
Từ khóa static và final trong java