栈的特点: 先进后出,只能访问栈顶的数据
- 我们需要先声明一个数组来模拟栈
- 通过一个指针来让数据出栈和入栈
代码
public class Stack {private int[] arr&#61;new int[10];private int flag;public void add(int x){if (flag&#61;&#61;arr.length){int[] brr&#61;new int[arr.length*2];for (int i &#61; 0; i < brr.length; i&#43;&#43;) {brr[i]&#61;arr[i];}arr&#61;brr;}arr[flag]&#61;x;flag&#43;&#43;;}public Integer get() {if (flag&#61;&#61;0){return null;}int re&#61;arr[flag-1];flag--;return re;}}
输出代码
public class Main {public static void main(String[] args) {Stack s&#61;new Stack();for (int i&#61;0;i<10;i&#43;&#43;){s.add(i);}for (int i &#61; 0; i < 11; i&#43;&#43;) {System.out.println(s.get());}}}