-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathStack.java
More file actions
90 lines (81 loc) · 1.43 KB
/
Stack.java
File metadata and controls
90 lines (81 loc) · 1.43 KB
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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
package datastructure.stackandqueue;
/**
* The type Stack.
*
* @param <V> the type parameter
*/
public class Stack <V>{
private int maxSize;
private int top;
private V arr[];
/**
* Instantiates a new Stack.
*
* @param maxSize the max size
*/
public Stack(int maxSize){
this.maxSize=maxSize;
this.top=-1;
arr = (V[]) new Object[maxSize];
}
/**
* Get max size int.
*
* @return the int
*/
public int getMaxSize(){
return maxSize;
}
/**
* Is empty boolean.
*
* @return the boolean
*/
public boolean isEmpty(){
return top==-1;
}
/**
* Is full boolean.
*
* @return the boolean
*/
public boolean isFull(){
return top==maxSize-1;
}
/**
* Top v.
*
* @return the v
*/
public V top(){
if(isEmpty())
return null;
return arr[top];
}
/**
* Push.
*
* @param value the value
*/
public void push(V value){
if(isFull()){
System.out.println("Stack is full.");
}else{
arr[++top] = value;
}
}
/**
* Pop v.
*
* @return the v
*/
public V pop(){
V val=null;
if(isEmpty()){
System.out.println("Stack is empty");
}else{
val=arr[top--];
}
return val;
}
}