摘要： public class Queue { private int[] data; private final int MAXSIZE=20; private int front,rear; public void InitQueue(){ data=new int[MAXSIZE]; front=rear=0; } public void push(int i){ if((rear+1)%MAXSIZE==front){ System.out.println("Queue is full!");... 阅读全文

摘要： public class Demo { private Object[] data; private int top; private int size; public void InitStack(){ size=10; data=new Object[size]; top=0; } public void push(Object o){ if(top==size){ Object[] newdata=new Object[size*2]; for(int ... 阅读全文