京东自营 618 + 国补 iPhone 历史最低价
Java 创建自己的堆栈
创建自己的堆栈
实例源码：
源代码：
执行
执行中...
x
1
/* 来 自 时 代 J a v a 公 众 号 - N o w J a v a . c o m*/2
3
4
5
public class _02CustomLinkedList {6
7
public static void main(String[] args) {8
9
Stack stack = new Stack(3);10
11
stack.push(1);12
13
stack.push(2);14
15
stack.push(3);16
17
// stack.push(4);18
19
20
System.out.println(stack.pop());21
22
System.out.println(stack.pop());23
24
System.out.println(stack.pop());25
26
// System.out.println(stack.pop());27
/**来自 28
n o w j a v a . c o m**/29
30
}31
32
}33
34
35
class Stack {36
37
private int size;38
39
private int[] stackAr;40
41
private int top; // top of stack42
43
44
/**45
46
* Constructor for initializing Array.47
48
*/49
50
public Stack(int size) {51
52
this.size = size;53
54
stackAr = new int[size]; // Creation of Stack array55
56
top = -1; // initialize Stack to with -157
58
}59
60
61
/**62
63
* Push items in stack, it will put items on top of Stack.64
65
*/66
67
public void push(int value) {68
69
if (isFull()) {70
71
throw new StackFullException("Cannot push " + value + ", Stack is full");72
73
}74
75
stackAr[++top] = value;76
77
}78
79
80
/**81
82
* Pop items in stack, it will remove items from top of Stack.83
84
*/85
86
public int pop() {87
88
if (isEmpty()) {89
90
throw new StackEmptyException("Stack is empty");91
92
}93
94
return stackAr[top--]; // remove item and decrement top as well.95
96
}97
98
99
/**100
101
* @return true if Stack is empty102
103
*/104
105
public boolean isEmpty() {106
107
return (top == -1);108
109
}110
111
112
/**113
114
* @return true if stack is full115
116
*/117
118
119
public boolean isFull() {120
121
return (top == size - 1);122
123
}124
125
126
}127
128
129
class StackFullException extends RuntimeException {130
131
132
public StackFullException() {133
/**代码未完, 请加载全部代码(NowJava.com).**/执行结果：
本文系作者在时代Java发表，未经许可，不得转载。如有侵权，请联系nowjava@qq.com删除。
编辑于
关注时代Java