线性结构之一:栈
栈是一个先入后出的有序列表
栈的元素不能从列表中间增加和删除,
只能从顶端增删数据,称为栈顶;
底端为固定的一端不进行元素的增删,称为栈底
数组模拟栈
栈类MyStackInt :
属性:
栈大小
数组模拟栈
栈顶(top = -1)
方法:
判断栈是否满:用栈顶的标记值top == 栈大小 - 1
判断栈是否空:top == - 1
入栈 top ++
出栈 top --
显示栈所有数据
显示栈顶元素
构造器:初始化数组大小
package stack;
public class MyStackInt {
private int maxSize;
private int[] stack;
private int top = -1;
public MyStackInt() {
super();
}
public MyStackInt(int maxSize) {
super();
this.maxSize = maxSize;
this.stack = new int[maxSize];
}
public boolean isFull() {
return top == maxSize - 1;
}
public boolean isEmpty() {
return top == -1;
}
public void push(int i) {
if (isFull()) {
System.out.println("栈已经满了!");
return;
}
top++;
stack[top] = i;
System.out.println("添加成功!");
}
public int pop() {
if (isEmpty()) {
throw new RuntimeException("栈已经空了");
}
int temp = stack[top];
top--;
System.out.println("取值成功! " + temp);
return temp;
}
public int peek() {
if (isEmpty()) {
throw new RuntimeException("栈已经空了");
}
return stack[top];
}
public void list() {
if (isEmpty()) {
System.out.println("栈已经空了");
return;
}
for (int i = top; i >= 0; i--) {
System.out.println(stack[i]);
}
}
}