algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2025-07-14 09:22:32 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update StackArrayList.java

Browse Source
This commit is contained in:
Libin Yang
2019-01-06 09:01:33 +08:00
committed by GitHub
parent fc64d05b5c
commit 7c33d2e313
1 changed files with 78 additions and 77 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
DataStructures/Stacks/StackArrayList.java
View File

@ -2,15 +2,14 @@ import java.util.ArrayList;
/** /**
* This class implements a Stack using an ArrayList. * This class implements a Stack using an ArrayList.
* * <p>
* A stack is exactly what it sounds like. An element gets added to the top of * A stack is exactly what it sounds like. An element gets added to the top of
* the stack and only the element on the top may be removed. * the stack and only the element on the top may be removed.
* * <p>
* This is an ArrayList Implementation of a stack, where size is not * This is an ArrayList Implementation of a stack, where size is not
* a problem we can extend the stack as much as we want. * a problem we can extend the stack as much as we want.
* *
* @author Unknown * @author Unknown
*
*/ */
public class StackArrayList { public class StackArrayList {
@ -20,8 +19,9 @@ public class StackArrayList{
* @param args Command line arguments * @param args Command line arguments
*/ */
public static void main(String[] args) { public static void main(String[] args) {
StackArrayList myStackArrayList = new StackArrayList(); //Declare a stack of maximum size 4
//Populate the stack StackArrayList myStackArrayList = new StackArrayList();
myStackArrayList.push(5); myStackArrayList.push(5);
myStackArrayList.push(8); myStackArrayList.push(8);
myStackArrayList.push(2); myStackArrayList.push(2);
@ -35,7 +35,9 @@ public class StackArrayList{
System.out.println(myStackArrayList.pop()); // will print 2 System.out.println(myStackArrayList.pop()); // will print 2
} }
/** ArrayList representation of the stack */ /**
* ArrayList representation of the stack
*/
private ArrayList<Integer> stackList; private ArrayList<Integer> stackList;
/** /**
@ -64,13 +66,12 @@ public class StackArrayList{
public int pop() { public int pop() {
if (!isEmpty()) { // checks for an empty Stack if (!isEmpty()) { // checks for an empty Stack
int popValue = stackList.get(stackList.size() - 1); int popValue = stackList.get(stackList.size() - 1);
stackList.remove(stackList.size() - 1); // removes the poped element from the list stackList.remove(stackList.size() - 1); // removes the poped element from the list
return popValue; return popValue;
} }
System.out.print("The stack is already empty "); System.out.print("The stack is already empty!");
return -1; return -1;
} }