algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-01 20:12:07 +08:00
Code Issues Packages Projects Releases Wiki Activity

Unify the function naming of

Browse Source 
queue from `offer()` to `push()`
This commit is contained in:
Yudong Jin
2023-02-02 01:43:01 +08:00
parent a0ee691475
commit 7d14c9440e
29 changed files with 184 additions and 189 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
codes/java/chapter_stack_and_queue/array_queue.java
View File

@ -35,7 +35,7 @@ class ArrayQueue {
}
/* 入队 */
public void offer(int num) {
public void push(int num) {
if (queSize == capacity()) {
System.out.println("队列已满");
return;
@ -82,11 +82,11 @@ public class array_queue {
ArrayQueue queue = new ArrayQueue(capacity);
/* 元素入队 */
queue.offer(1);
queue.offer(3);
queue.offer(2);
queue.offer(5);
queue.offer(4);
queue.push(1);
queue.push(3);
queue.push(2);
queue.push(5);
queue.push(4);
System.out.println("队列 queue = " + Arrays.toString(queue.toArray()));
/* 访问队首元素 */
@ -107,7 +107,7 @@ public class array_queue {
/* 测试环形数组 */
for (int i = 0; i < 10; i++) {
queue.offer(i);
queue.push(i);
queue.poll();
System.out.println("第 " + i + " 轮入队 + 出队后 queue = " + Arrays.toString(queue.toArray()));
}

20
codes/java/chapter_stack_and_queue/linkedlist_deque.java
View File

@ -39,7 +39,7 @@ class LinkedListDeque {
}
/* 入队操作 */
private void offer(int num, boolean isFront) {
private void push(int num, boolean isFront) {
ListNode node = new ListNode(num);
// 若链表为空，则令 front, rear 都指向 node
if (isEmpty())
@ -61,13 +61,13 @@ class LinkedListDeque {
}
/* 队首入队 */
public void offerFirst(int num) {
offer(num, true);
public void pushFirst(int num) {
push(num, true);
}
/* 队尾入队 */
public void offerLast(int num) {
offer(num, false);
public void pushLast(int num) {
push(num, false);
}
/* 出队操作 */
@ -141,9 +141,9 @@ public class linkedlist_deque {
public static void main(String[] args) {
/* 初始化双向队列 */
LinkedListDeque deque = new LinkedListDeque();
deque.offerLast(3);
deque.offerLast(2);
deque.offerLast(5);
deque.pushLast(3);
deque.pushLast(2);
deque.pushLast(5);
System.out.print("双点队列 deque = ");
deque.print();
@ -154,10 +154,10 @@ public class linkedlist_deque {
System.out.println("队尾元素 peekLast = " + peekLast);
/* 元素入队 */
deque.offerLast(4);
deque.pushLast(4);
System.out.print("元素 4 队尾入队后 deque = ");
deque.print();
deque.offerFirst(1);
deque.pushFirst(1);
System.out.print("元素 1 队首入队后 deque = ");
deque.print();

13
codes/java/chapter_stack_and_queue/linkedlist_queue.java
View File

@ -7,7 +7,6 @@
package chapter_stack_and_queue;
import java.util.*;
import include.*;
/* 基于链表实现的队列 */
class LinkedListQueue {
@ -30,7 +29,7 @@ class LinkedListQueue {
}
/* 入队 */
public void offer(int num) {
public void push(int num) {
// 尾结点后添加 num
ListNode node = new ListNode(num);
// 如果队列为空，则令头、尾结点都指向该结点
@ -79,11 +78,11 @@ public class linkedlist_queue {
LinkedListQueue queue = new LinkedListQueue();
/* 元素入队 */
queue.offer(1);
queue.offer(3);
queue.offer(2);
queue.offer(5);
queue.offer(4);
queue.push(1);
queue.push(3);
queue.push(2);
queue.push(5);
queue.push(4);
System.out.println("队列 queue = " + Arrays.toString(queue.toArray()));
/* 访问队首元素 */