Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Stack implementation
Language:
Ada
Assembly
Bash
C#
C++ (gcc)
C++ (clang)
C++ (vc++)
C (gcc)
C (clang)
C (vc)
Client Side
Clojure
Common Lisp
D
Elixir
Erlang
F#
Fortran
Go
Haskell
Java
Javascript
Kotlin
Lua
MySql
Node.js
Ocaml
Octave
Objective-C
Oracle
Pascal
Perl
Php
PostgreSQL
Prolog
Python
Python 3
R
Rust
Ruby
Scala
Scheme
Sql Server
Swift
Tcl
Visual Basic
Layout:
Vertical
Horizontal
//'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]); } } }
[
+
]
Show input
Compilation time: 0.73 sec, absolute running time: 0.14 sec, cpu time: 0.1 sec, memory peak: 18 Mb, absolute service time: 0,87 sec
edit mode
|
history
|
discussion
1 2 3