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:
Java Program to Implement Gauss Jordan Elimination
Java Program to Implement Depth-limited Search
Consuming RESTful Web Services
A Guide to TreeSet in Java
The DAO with Spring and Hibernate
SOAP Web service: Upload và Download file sử dụng MTOM trong JAX-WS
Intersection of Two Lists in Java
Custom Error Pages with Spring MVC
Java Program to Implement Coppersmith Freivald’s Algorithm
A Guide to Java HashMap
CharSequence vs. String in Java
Java Program to Implement Gauss Seidel Method
Java Program to Check whether Graph is a Bipartite using 2 Color Algorithm
Date Time trong Java 8
Hướng dẫn Java Design Pattern – Interpreter
Guide to the Volatile Keyword in Java
HttpClient 4 Cookbook
Java Program to Search for an Element in a Binary Search Tree
Java Program to Generate Random Numbers Using Multiply with Carry Method
Java Program to Implement Merge Sort on n Numbers Without tail-recursion
Java Program to implement Array Deque
The Basics of Java Security
Java – InputStream to Reader
More Jackson Annotations
Spring MVC Async vs Spring WebFlux
Java Program to Solve the Fractional Knapsack Problem
Truyền giá trị và tham chiếu trong java
A Guide to HashSet in Java
Spring MVC + Thymeleaf 3.0: New Features
Immutable Objects in Java
Java Program to Find the Vertex Connectivity of a Graph
Java Program to Implement Hash Tree