Stack data structure : Stack « Collections Data Structure « Java

1. Java
2. Collections Data Structure
3. Stack

Stack data structure

publicclass MyStack { privateint maxSize; privatelong[] stackArray; privateint top; public MyStack(int s) { maxSize = s; stackArray = newlong[maxSize]; top = -1; } publicvoid push(long j) { stackArray[++top] = j; } publiclong pop() { return stackArray[top--]; } publiclong peek() { return stackArray[top]; } publicboolean isEmpty() { return (top == -1); } publicboolean isFull() { return (top == maxSize - 1); } publicstaticvoid main(String[] args) { MyStack theStack = new MyStack(10); // make new stack  theStack.push(20); theStack.push(40); theStack.push(60); theStack.push(80); while (!theStack.isEmpty()) { long value = theStack.pop(); System.out.print(value); System.out.print(" "); } System.out.println(""); } } 

Related examples in the same category

1.	Demonstration of Stack Class
2.	Stack in java.util
3.	Bracket Checker
4.	String Reverser Through Stack
5.	Link stack
6.	Triangular numbers
7.	Triangular numbers with stack replaces recursion
8.	Show String Reversals
9.	Generic stack demo with annotation
10.	Character Stack
11.	A faster, smaller stack implementation.
12.	Growable Object stack with type specific access methods
13.	Growable int stack with type specific access methods
14.	Stack for boolean values
15.	extends ArrayList to create Stack
16.	Growable String stack with type specific access methods.
17.	A simple integer based stack.
18.	A very simple unsynchronized stack. This one is faster than the java.util-Version.
19.	Pop an empty stack ntry times and catch the resulting exception
20.	Object Stack
21.	Fast stack