java数据结构--栈
package stack;import java.util.Random;public class simpleStack {private int top;private int size;private Object[] array;private Object[] arrays;simpleStack(int size){this.size = size;array = new Object[size];top = -1;}public void initSimpleStack(int max){arrays = array;array = new Object[max];for (int i = 0; i <arrays.length ; i++) {array[i] = arrays[i];}size++;}public void push(Object data){if(top+1==size){initSimpleStack(size+1);}if(top < size-1){array[++top] = data;}}public Object pop(){return array[top--];}public Object peck(){return array[top];}public boolean isEmpty(){return (top == -1);}public static void main(String[] args) {simpleStack simpleStack = new simpleStack(10);Random random = new Random();for (int i = 0; i <15 ; i++) {simpleStack.Int(1000));}System.out.println(simpleStack.peck());while(!simpleStack.isEmpty()){System.out.println(simpleStack.pop());}}
}
本文发布于:2024-02-02 00:09:45,感谢您对本站的认可!
本文链接:https://www.4u4v.net/it/170680956140077.html
版权声明:本站内容均来自互联网,仅供演示用,请勿用于商业和其他非法用途。如果侵犯了您的权益请与我们联系,我们将在24小时内删除。
留言与评论(共有 0 条评论) |