JavaÊý¾Ý½á¹¹ºÍËã·¨ Õ»Óë¶ÓÁÐ

(1)Õ»
package ChapterOne;
public class Stack {
//Õ»Êý×é
long stackArr[];
//Õ»µÄ´óС
int maxSize;
//Õ»µÄ¶¥²¿
int top;
//³õʼ»¯Ò»¸ö´óСΪsizeµÄÕ»
public Stack(int size){
maxSize = size;
stackArr = new long[size];
top = -1;
}
//³öÕ»²Ù×÷
public long pop(){
return stackArr[top--];
}
//½øÕ»²Ù×÷
public void push(long value){
stackArr[++top] = value;
}
//ÅжÏÕ»ÊÇ·ñΪ¿Õ
public boolean isEmpty(){
return top == -1;
}
//ÅжÏÕ»ÊÇ·ñÒÑÂú
public boolean isFull(){
return top == maxSize-1;
}
//È¡Õ»¶¥ÔªËØ
public long peek(){
return stackArr[top];
}
public static void main(String[] args) {
Stack stack = new Stack(10);
while(!stack.isFull()){
long v = (long) (Math.random()*100);
stack.push(v);
System.out.print(v+" ");
}
System.out.println();
while(!stack.isEmpty()){
long topValue = stack.pop();
System.out.print(topValue+" ");
}
System.out.println();
}
}
(2)¶ÓÁÐ
package ChapterOne;
public class Queue {
//¶ÓÁÐÊý×é
private long queueArr[];
//¶ÓÁеÄÇ°¶Ëϱê
private int front;
//¶ÓÁеÄβ¶Ëϱê
private int rear;
//¶ÓÁеĴóС
private int maxSize;
//¶ÓÁÐÖÐÔªËصĸöÊý
private int nItems;
//³õʼ»¯Ò»¸ö´óСΪsizeµÄ¶ÓÁÐ
public Queue(int size){
queueArr = new long[size];
maxSize = size;
front = 0;
rear = -1;
nItems = 0;
}
//²åÈë²Ù×÷
public void insert(long value){
//¶ÓÁÐÒÑÂú
if(rear == maxSize-1)
rear = -1;
queueArr[++rear] = value;
nItems++;
}
//ɾ³ý²Ù×÷
public long remove(){
long temp = queueArr[front++];
if(front == maxSize)
front = 0;
nItems--;
return temp;
}
//·µ»Ø¶ÓÁеÚÒ»¸öÔªËØ
public long peakFront(){
return queueArr[front];
}
//ÅжÏÊÇ·ñΪ¿Õ
public boolean isEmpty(){
return nItems == 0;
}
//ÅжÏÊÇ·ñÒÑÂú
public boolean isFull(){
return nItems == maxSize;
}
//·µ»Ø¶ÓÁÐÖÐÔªËصĸöÊý
public int size(){
return nItems;
}

public void print(){
for(int i =