1.有效元素的个数:
(rear+maxSize-front)%maxSize
2.输出队列
public void showQueue(){
if(isEmpty()){
System.out.println("队列无元素");
return;
}
for(int i=front;i<front+((rear+maxSize-front)%maxSize);i++){
System.out.printf("arr[%d]=%d\n", i % maxSize, arr[i % maxSize]);
}
}