public class Test {
private int maxSize;
private long[] stackA;
private int top;
public Test(int s) {
maxSize = s;
stackA = new long[maxSize];
top = -1;
}
public void push(long j) {
stackA[++top] = j;
}
public long pop() {
return stackA[top--];
}
public long peek() {
return stackA[top];
}
public boolean isEmpty() {
return (top == -1);
}
public boolean isFull() {
return (top == maxSize - 1);
}
public static void main(String[] args) {
Test theStack = new Test(10);
theStack.push(10);
theStack.push(20);
theStack.push(30);
theStack.push(40);
theStack.push(50);
while (!theStack.isEmpty()) {
long value = theStack.pop();
System.out.print(value);
System.out.print(" ");
}
System.out.println("");
}
}
如果您发现该资源为电子书等存在侵权的资源或对该资源描述不正确等,可点击“私信”按钮向作者进行反馈;如作者无回复可进行平台仲裁,我们会在第一时间进行处理!
加入交流群
请使用微信扫一扫!