Implementing a Stack in Java
In this section, you will learn how to implement a
stack in Java. A Stack is like a bucket in which you can put elements one-by-one
in sequence and retrieve elements from the bucket according to the sequence of
the last entered element. Stack is a collection of data and follows the LIFO
(Last in, first out)
rule that mean you can insert the elements one-by-one in sequence and the last
inserted element can be retrieved at once from the bucket. Elements are inserted
and retrieved to/from the stack through the push() and pop() method.
This program implements a stack and follows the LIFO
rule. It asks you for the number of elements which have to be entered in the
stack and then it takes elements for insertion in the stack. All the elements
present in the stack are shown from the last inserted element to the first
inserted element.
Stack<Integer>():
Above constructor of the Stack class creates a empty stack which holds
the integer type value which is mention with the creation of stack. The Stack
class extends the Vector class and both classes are implemented from the java.util.*;
package.
Stack.push(Object obj):
Above method is used to insert or push the data or
element in the stack. It takes an object like: data or elements and push its
onto the top of the stack.
Stack.pop():
This is the method to removes the objects like:
data or elements at the top positions of stack.
Here is the code of program:
import java.io.*;
import java.util.*;
public class StackImplement{
Stack<Integer> stack;
String str;
int num, n;
public static void main(String[] args){
StackImplement q = new StackImplement();
}
public StackImplement(){
try{
stack = new Stack<Integer>();
InputStreamReader ir = new InputStreamReader(System.in);
BufferedReader bf = new BufferedReader(ir);
System.out.print("Enter number of elements : ");
str = bf.readLine();
num = Integer.parseInt(str);
for(int i = 1; i <= num; i++){
System.out.print("Enter elements : ");
str = bf.readLine();
n = Integer.parseInt(str);
stack.push(n);
}
}
catch(IOException e){}
System.out.print("Retrieved elements from the stack : ");
while (!stack.empty()){
System.out.print(stack.pop()
+ " ");
}
}
}
|
Download this example
|
Del.icio.us
Digg
Google
Spurl
Blink
Furl
Simpy
Y! MyWeb
Current Comments
4 comments so far (post your own) View All Comments Latest 10 Comments:Thanks for this program code. It help me a lot on my assignment!!!! THANKS FOR ROSEINDIA!!!
Posted by Larry Lozada on Friday, 04.18.08 @ 07:19am | #57008
Hi Guys,
I am Paramjit from india.
I want learn Java Programming.
I am having very godd logic understanding,
and devlopment experience in Visual Basic
Programming. But I want to switch to Java
Programming.
Can you help me to start
Thanks & Regards
Paramjit
Posted by Paramjit on Friday, 08.10.07 @ 20:59pm | #23112
stack.push(n) in this we should pass the object but here we are using primitive..then i am trying to use got compile time error
str = br.readLine();
n=Integer.parseInt(str);
stack.push(n);
this is not correct..........
str = br.readLine();
n=Integer.parseInt(str);
Integer n1=new Integer(n);
stack.push(n1);
this is correct
Posted by gangadhar bommasani on Wednesday, 06.27.07 @ 13:21pm | #20271
very very very good source code
t
Posted by aman on Sunday, 04.15.07 @ 21:11pm | #14258