Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Stack implementation
//'main' method must be in a class 'Rextester'. //Compiler version 1.8.0_111 import java.util.*; import java.lang.*; class Rextester { int top; public void push(int stack[],int i,int n){ if(top==n-1){ System.out.println("Stack overflow"); } else { top=top+1; stack[top]=i; } } public void pop(int stack[]){ if(top==-1){ System.out.println("Stack underflow"); } else{ top-=1; } } public static void main(String args[]){ Rextester r = new Rextester(); int stack[] = new int[4]; r.top=-1; r.push(stack,1,stack.length); r.push(stack,2,stack.length); r.push(stack,3,stack.length); r.push(stack,4,stack.length); r.pop(stack); r.pop(stack); for(int i=0;i<=r.top;i++){ System.out.println(stack[i]); } } }
run
|
edit
|
history
|
help
0
練習3-6
Coding Numbers - Duplicate - HashSet
Sum of ODD and EVEN numbers in an array
Coding Challenge - 01 (Even numbers)
Compare three ways to clear a String in java
Task2
Increment Operator
PE #5
vampires number Eckel B. Thinking in Java
else if statement