游戏陪玩系统源码，java实现环形队列
游戏陪玩系统源码java实现环形队列环形队列队列是一种先进先出的数据结构代码思路用数组存放队列的数据front指向队首元素rear指向队尾元素num存放当前已经存在的元素个数有了num判断队列是否为空是否存满比较方便publicclassDemo2{publicstaticvoidmain(String[]args){ArrayQueuequeuenewArrayQueue(5);queue.addNum(10001);queue.addNum(10002);queue.addNum(10003);queue.addNum(10004);queue.addNum(10005);System.out.println(queue.getNum());System.out.println(queue.getNum());queue.addNum(1);queue.addNum(2);queue.addNum(3);queue.showQueue();System.out.println(queue.getNum());System.out.println(queue.getNum());System.out.println(queue.getNum());System.out.println(queue.getNum());System.out.println(queue.getNum());System.out.println(queue.getNum());}}classArrayQueue{//队列的大小intmaxSize;//用数组来实现队列int[]arr;//指向队列首元素intfront;//指向队列尾元素intrear;//当前队列的元素的个数intnum;publicArrayQueue(intmaxSize){this.maxSizemaxSize;this.arrnewint[this.maxSize];front-1;rear-1;}publicbooleanisFull(){returnnummaxSize;}publicbooleanisEmpty(){returnnum0;}publicvoidaddNum(intnum){if(isFull()){System.out.println(队列已满无法在进行入队操作);return;}//队尾标记后移指向要放入的元素的位置if(front-1rear-1){front0;rear0;}else{rearrear1;}if(rearmaxSize){rear0;}arr[rear]num;this.num;}publicintgetNum(){if(isEmpty()){thrownewRuntimeException(队列为空无法出队);}//队首标记后移指向队首元素System.out.print(出队元素是);this.num--;intresarr[front];front;if(frontmaxSize){front0;}returnres;}publicvoidshowQueue(){if(isEmpty()){thrownewRuntimeException(队列为空无法遍历);}System.out.println(遍历队列);if(rearfront){for(intstartfront;startrear;start){System.out.println(arr[start]);}}else{for(intstartfront;startmaxSize-1;start){System.out.println(arr[start]);}for(intstart0;startrear;start){System.out.println(arr[start]);}}}}以上就是游戏陪玩系统源码java实现环形队列 更多内容欢迎关注之后的文章
)
