2024年最全【LeetCode刷题日记】[622，2024年最新阿里技术专家

最新推荐文章于 2024-07-24 18:05:10 发布

2401_84923269

最新推荐文章于 2024-07-24 18:05:10 发布

阅读量770

点赞数 14

文章标签： go 学习面试

本文链接：https://blog.csdn.net/2401_84923269/article/details/138885418

版权

网上学习资料一大堆，但如果学到的知识不成体系，遇到问题时只是浅尝辄止，不再深入研究，那么很难做到真正的技术提升。

需要这份系统化的资料的朋友，可以添加戳这里获取

一个人可以走的很快，但一群人才能走的更远！不论你是正从事IT行业的老鸟或是对IT行业感兴趣的新人，都欢迎加入我们的的圈子（技术交流、学习资源、职场吐槽、大厂内推、面试辅导），让我们一起学习成长！

private int headIndex;
private int count;
private int capacity;

/** Initialize your data structure here. Set the size of the queue to be k. */
public MyCircularQueue(int k) {
this.capacity = k;
this.queue = new int[k];
this.headIndex = 0;
this.count = 0;
}

/** Insert an element into the circular queue. Return true if the operation is successful. */
public boolean enQueue(int value) {
if (this.count == this.capacity)
return false;
this.queue[(this.headIndex + this.count) % this.capacity] = value;
this.count += 1;
return true;
}

/** Delete an element from the circular queue. Return true if the operation is successful. */
public boolean deQueue() {
if (this.count == 0)
return false;
this.headIndex = (this.headIndex + 1) % this.capacity;
this.count -= 1;
return true;
}

/** Get the front item from the queue. */
public int Front() {
if (this.count == 0)
return -1;
return this.queue[this.headIndex];
}

/** Get the last item from the queue. */
public int Rear() {
if (this.count == 0)
return -1;
int tailIndex = (this.headIndex + this.count - 1) % this.capacity;
return this.queue[tailIndex];
}

/** Checks whether the circular queue is empty or not. */
public boolean isEmpty() {
return (this.count == 0);
}

/** Checks whether the circular queue is full or not. */
public boolean isFull() {
return (this.count == this.capacity);
}
}


[外链图片转存失败,源站可能有防盗链机制,建议将图片保存下来直接上传(img-aCFxitz0-1628524273771)(https://raw.githubusercontent.com/xkyvvv/blogpic/main/pic1/image-20210808163823903.png)]

class Node {
public int value;
public Node nextNode;

public Node(int value) {
this.value = value;
this.nextNode = null;
}
}

class MyCircularQueue {

private Node head, tail;
private int count;
private int capacity;

/** Initialize your data structure here. Set the size of the queue to be k. */
public MyCircularQueue(int k) {
this.capacity = k;
}

/** Insert an element into the circular queue. Return true if the operation is successful. */
public boolean enQueue(int value) {
if (this.count == this.capacity)
return false;

Node newNode = new Node(value);
if (this.count == 0) {
  head = tail = newNode;
} else {
  tail.nextNode = newNode;
  tail = newNode;
}
this.count += 1;
return true;

}

/** Delete an element from the circular queue. Return true if the operation is successful. */
public boolean deQueue() {
if (this.count == 0)
return false;
this.head = this.head.nextNode;
this.count -= 1;
return true;
}

/** Get the front item from the queue. */
public int Front() {
if (this.count == 0)
return -1;
else
return this.head.value;
}

/** Get the last item from the queue. */
public int Rear() {
if (this.count == 0)
return -1;
else
return this.tail.value;
}

/** Checks whether the circular queue is empty or not. */
public boolean isEmpty() {