环形链表实现队列java,数组实现的环形队列

基本思想:

环形展开成链表,在链表上模拟环形队列;

head 和tail只增不减,add 、remove、size都很好理解;

初始容量是2的n次方; PS,优秀的数据结构肯定是结构和数据都很巧妙的~

public class CirQueue {

Integer[] container;

//head指向next坑位

int head = 0;

//tail指向最后一个有效坑位

int tail = -1;

int size = 4;

public CirQueue() {

//初始化size最好是2^n,当head增长到特比大的时候,head和tail一块右移

this.container = new Integer[4];

}

public boolean add(Integer x) {

if (size() >= size) {

return false;

}

//因为size=2^n,所以与操作最方便了

//tail和head只增不减,但是你会发现,tail和head的低位才真正起作用。

container[head & (size - 1)] = x;

head++;

if (tail == -1) {

//初始化,tail

tail++;

}

return true;

}

public Integer removeHead() {

if (head <= 0) {

//未开始

return null;

}

if (head <= tail) {

//已结束

return null;

}

Integer t= container[(this.head - 1) & (size - 1)];

container[(this.head - 1) & (size - 1)] = null;

this.head--;

return t;

}

public Integer removeTail() {

if (tail >= head) {

return null;

}

Integer tail = container[this.tail & (size - 1)];

container[this.tail & (size - 1) & (size - 1)] = null;

this.tail++;

return tail;

}

public int size() {

return head - tail-1;

}

public static void main(String[] args) {

CirQueue cirQueue = new CirQueue();

System.out.println(cirQueue.add(1));

System.out.println(Arrays.toString(cirQueue.container));

System.out.println(cirQueue.size());

System.out.println(cirQueue.add(2));

System.out.println(Arrays.toString(cirQueue.container));

System.out.println(cirQueue.size());

System.out.println(cirQueue.add(3));

System.out.println(Arrays.toString(cirQueue.container));

System.out.println(cirQueue.size());

System.out.println(cirQueue.add(4));

System.out.println(Arrays.toString(cirQueue.container));

System.out.println(cirQueue.size());

System.out.println(cirQueue.add(5));

System.out.println(Arrays.toString(cirQueue.container));

System.out.println(cirQueue.size());

System.out.println(cirQueue.removeHead());

System.out.println(Arrays.toString(cirQueue.container));

System.out.println(cirQueue.size());

System.out.println(cirQueue.removeTail());

System.out.println(Arrays.toString(cirQueue.container));

System.out.println(cirQueue.size());

System.out.println(cirQueue.add(6));

System.out.println(Arrays.toString(cirQueue.container));

System.out.println(cirQueue.size());

System.out.println(cirQueue.add(7));

System.out.println(Arrays.toString(cirQueue.container));

System.out.println(cirQueue.size());

System.out.println(cirQueue.removeHead());

System.out.println(Arrays.toString(cirQueue.container));

System.out.println(cirQueue.size());

System.out.println(cirQueue.removeHead());

System.out.println(Arrays.toString(cirQueue.container));

System.out.println(cirQueue.size());

System.out.println(cirQueue.removeHead());

System.out.println(Arrays.toString(cirQueue.container));

System.out.println(cirQueue.size());

System.out.println(cirQueue.removeHead());

System.out.println(Arrays.toString(cirQueue.container));

System.out.println(cirQueue.size());

System.out.println(cirQueue.add(8));

System.out.println(Arrays.toString(cirQueue.container));

System.out.println(cirQueue.size());

System.out.println(cirQueue.add(9));

System.out.println(Arrays.toString(cirQueue.container));

System.out.println(cirQueue.size());

System.out.println(cirQueue.add(10));

System.out.println(Arrays.toString(cirQueue.container));

System.out.println(cirQueue.size());

System.out.println(cirQueue.add(11));

System.out.println(Arrays.toString(cirQueue.container));

System.out.println(cirQueue.size());

System.out.println(cirQueue.removeTail());

System.out.println(Arrays.toString(cirQueue.container));

System.out.println(cirQueue.size());

System.out.println(cirQueue.removeTail());

System.out.println(Arrays.toString(cirQueue.container));

System.out.println(cirQueue.size());

System.out.println(cirQueue.removeHead());

System.out.println(Arrays.toString(cirQueue.container));

System.out.println(cirQueue.size());

}

}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
做一门精致,全面详细的 java数据结构与算法!!!让天下没有难学的数据结构,让天下没有难学的算法,不吹不黑,我们的讲师及其敬业,可以看到课程视频,课件,代码的录制撰写,都是在深夜,如此用心,其心可鉴,他不掉头发,谁掉头发???总之你知道的,不知道的,我们都讲,并且持续更新,走过路过,不要错过,不敢说是史上最全的课程,怕违反广告法,总而言之,言而总之,这门课你值得拥有,好吃不贵,对于你知识的渴求,我们管够管饱话不多说,牛不多吹,我们要讲的本门课程内容:稀疏数组、单向队列环形队列、单向链表、双向链表环形链表、约瑟夫问题、栈、前缀、中缀、后缀表达式、中缀表达式转换为后缀表达式、递归与回溯、迷宫问题、八皇后问题、算法的时间复杂度、冒泡排序、选择排序、插入排序、快速排序、归并排序、希尔排序、基数排序(桶排序)、堆排序、排序速度分析、二分查找、插值查找、斐波那契查找、散列、哈希表、二叉树、二叉树与数组转换、二叉排序树(BST)、AVL树、线索二叉树、赫夫曼树、赫夫曼编码、多路查找树(B树B+树和B*树)、图、图的DFS算法和BFS、程序员常用10大算法、二分查找算法(非递归)、分治算法、动态规划算法、KMP算法、贪心算法、普里姆算法、克鲁斯卡尔算法、迪杰斯特拉算法、弗洛伊德算法马踏棋盘算法。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值