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:
A Guide to Apache Commons Collections CollectionUtils
The “final” Keyword in Java
Java Program to Implement Unrolled Linked List
Jackson Unmarshalling JSON with Unknown Properties
Mệnh đề Switch-case trong java
Properties with Spring and Spring Boot
Java Program to Find Nearest Neighbor for Static Data Set
Java Program to Implement Queue using Two Stacks
Java Program to Find the Nearest Neighbor Using K-D Tree Search
Spring WebClient Filters
New Features in Java 11
Java Program to Implement First Fit Decreasing for 1-D Objects and M Bins
How to Replace Many if Statements in Java
Overview of Spring Boot Dev Tools
Reactive Flow with MongoDB, Kotlin, and Spring WebFlux
Spring Security Logout
Java Program to Solve TSP Using Minimum Spanning Trees
Java Program to Perform Postorder Non-Recursive Traversal of a Given Binary Tree
Java Program to Implement Skip List
OAuth 2.0 Resource Server With Spring Security 5
Guide to Java Instrumentation
Java Program to Implement Miller Rabin Primality Test Algorithm
Java Program to Implement Repeated Squaring Algorithm
Một số nguyên tắc, định luật trong lập trình
Guide to Apache Commons CircularFifoQueue
Function trong Java 8
Inheritance with Jackson
Java 8 – Powerful Comparison with Lambdas
Sort a HashMap in Java
Spring Boot - OAuth2 with JWT
Java Program to Find Minimum Number of Edges to Cut to make the Graph Disconnected
Set Interface trong Java