顺序队列

最近在巩固数据结构，以及数据处理。所以就从最简单的顺序队列开始说起吧：

package com.example.queue;public class Qdata {int front = 0;//队头指针int size = 0;//队列长度int[] arr = new int[10];public Qdata() {// TODO Auto-generated constructor stub}private boolean Full() {return front + size == arr.length;}private boolean Empty() {return front == size;}public boolean InputQueue(int b) {// TODO Auto-generated method stubif (!Full()) {    arr[size] = b;    size++;    return true;}else {return false;}}public boolean OutQueue() {// TODO Auto-generated method stubif (!Empty()) {front ++;size --;return true;}else {return false;}}public int FrontQueue() {// TODO Auto-generated method stubreturn arr[front];}}

很简单的一个顺序队列。应该都能看懂！