Algorithms/JavaAlgorithms
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Added a few edge cases in the stack class

Browse Source 
Added an if statement to:
>The push method to make sure the stack wasn't full.
>The pop method to make sure the stack wasn't empty.
> The peek method to make sure the stack wasn't empty.
This commit is contained in:
cosmeoes 2017-06-20 23:13:22 -06:00 committed by GitHub
parent 4c6ea58203
commit cc5c1fe62e
1 changed files with 18 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

22
data_structures/Stacks.java
View File

@ -38,8 +38,12 @@ class Stack{
* @param value The element added
*/
public void push(int value){
top++;
stackArray[top] = value;
if(!isFull()){ //Checks for a full stack
top++;
stackArray[top] = value;
}else{
System.out.prinln("The stack is full, can't insert value");
}
}
/**
@ -48,7 +52,12 @@ class Stack{
* @return value popped off the Stack
*/
public int pop(){
return stackArray[top--];
if(!isEmpty()){ //Checks for an empty stack
return stackArray[top--];
}else{
System.out.println("The stack is already empty");
return -1;
}
}
/**
@ -57,7 +66,12 @@ class Stack{
* @return element at the top of the stack
*/
public int peek(){
return stackArray[top];
if(!isEmpty()){ //Checks for an empty stack
return stackArray[top];
}else{
System.out.println("The stack is empty, cant peek");
return -1;
}
}
/**