Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
54 lines (50 loc) · 1.28 KB

File metadata and controls

54 lines (50 loc) · 1.28 KB
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
public class A003StackArray{
int size , top;
int[] stack ;
A003StackArray(int size){
this.size = size;
top = -1 ;
stack = new int[size];
}
public void push(int data ){
if(top < size -1 ){
stack[++top] = data;
}else{
System.out.println("Stack overflow!!");
}
}
public int pop(){
//int data = INTEGER.MIN;
if(top > -1 ){
return stack[top--];
}else{
System.out.println("stack underFlow");
return 0;
}
}
public int peak(){
if(!isEmpty()){
return stack[top];
}
else{
System.out.println("stack is Empty ");
return 0;
}
}
public boolean isEmpty(){
if(top > -1 ){
return false;
}else{
return true;
}
}
//java A003StackArray 4 1 2 3
public static void main(String[] args) {
int size = java.lang.Integer.parseInt(args[0]);
A003StackArray stack = new A003StackArray(size);
for (int i = 1 ; i < size; i++ ) {
stack.push(java.lang.Integer.parseInt(args[i]));
}
System.out.println(stack.pop());
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.