京东自营 618 + 国补 iPhone 历史最低价
Java 为int值创建堆栈
为int值创建堆栈
实例源码：
源代码：
执行
执行中...
x
1
2
public class StackOfInts {3
4
/*来自 5
n o w j a v a . c o m*/6
7
private int[] stack;8
9
private int next = 0; // index of last item in stack + 110
11
12
public StackOfInts(int size) {13
14
//create an array large enough to hold the stack15
16
stack = new int[size];17
18
}19
20
21
public void push(int on) {22
23
if (next < stack.length)24
25
stack[next++] = on;26
27
}28
29
30
public boolean isEmpty() {31
32
return (next == 0);33
34
}35
36
37
public int pop() {38
39
if (!isEmpty())40
41
return stack[--next]; // top item on stack/* from 时 代 J a v a - nowjava.com*/42
43
else44
45
return 0;46
47
}48
49
50
public int getStackSize() {51
52
return next;53
54
}55
56
57
private class StepThrough {58
59
// start stepping through at i=060
61
private int i = 0;62
63
64
// increment index65
66
public void increment() {67
68
if (i < stack.length)69
70
i++;71
72
}73
74
75
// retrieve current element76
77
public int current() {78
79
return stack[i];80
81
}82
83
84
// last element on stack?85
86
public boolean isLast() {87
88
if (i == getStackSize() - 1)89
90
return true;91
92
else93
94
return false;95
96
}97
98
}99
100
101
public StepThrough stepThrough() {102
103
return new StepThrough();104
105
}106
107
108
public static void main(String[] args) {109
110
111
// instantiate outer class as "stackOne"112
113
StackOfInts stackOne = new StackOfInts(15);114
115
116
// populate stackOne117
118
for (int j = 0; j < 15; j++) {119
120
stackOne.push(2 * j);121
122
}123
124
125
// instantiate inner class as "iterator"126
127
StepThrough iterator = stackOne.stepThrough();128
129
130
// print out stackOne[i], one per line131
132
while (!iterator.isLast()) {133
134
System.out.print(iterator.current() + " ");135
136
iterator.increment();137
138
}139
140
System.out.println();141
142
143
}144
145
146
}147
148
149
/*150
151
* Copyright (c) 1995, 2008, Oracle and/or its affiliates. All rights reserved.152
153
*154
155
* Redistribution and use in source and binary forms, with or without156
157
* modification, are permitted provided that the following conditions158
159
* are met:160
161
*162
163
* - Redistributions of source code must retain the above copyright164
165
* notice, this list of conditions and the following disclaimer.166
167
*168
169
* - Redistributions in binary form must reproduce the above copyright170
171
* notice, this list of conditions and the following disclaimer in the172
173
* documentation and/or other materials provided with the distribution.174
175
*176
177
* - Neither the name of Oracle or the names of its178
179
* contributors may be used to endorse or promote products derived180
181
* from this software without specific prior written permission.182
183
*184
185
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS186
187
* IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,188
189
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR190
/**代码未完, 请加载全部代码(NowJava.com).**/执行结果：
本文系作者在时代Java发表，未经许可，不得转载。如有侵权，请联系nowjava@qq.com删除。
编辑于
关注时代Java