algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 12:58:42 +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/swift/chapter_stack_and_queue/array_queue.swift
View File

@ -31,7 +31,7 @@ class ArrayQueue {
}
/* 入队 */
func offer(num: Int) {
func push(num: Int) {
if size() == capacity() {
print("队列已满")
return
@ -82,11 +82,11 @@ enum _ArrayQueue {
let queue = ArrayQueue(capacity: capacity)
/* 元素入队 */
queue.offer(num: 1)
queue.offer(num: 3)
queue.offer(num: 2)
queue.offer(num: 5)
queue.offer(num: 4)
queue.push(num: 1)
queue.push(num: 3)
queue.push(num: 2)
queue.push(num: 5)
queue.push(num: 4)
print("队列 queue = \(queue.toArray())")
/* 访问队首元素 */
@ -107,7 +107,7 @@ enum _ArrayQueue {
/* 测试环形数组 */
for i in 0 ..< 10 {
queue.offer(num: i)
queue.push(num: i)
queue.poll()
print("第 \(i) 轮入队 + 出队后 queue = \(queue.toArray())")
}

12
codes/swift/chapter_stack_and_queue/linkedlist_queue.swift
View File

@ -25,7 +25,7 @@ class LinkedListQueue {
}
/* 入队 */
func offer(num: Int) {
func push(num: Int) {
// 尾结点后添加 num
let node = ListNode(x: num)
// 如果队列为空，则令头、尾结点都指向该结点
@ -79,11 +79,11 @@ enum _LinkedListQueue {
let queue = LinkedListQueue()
/* 元素入队 */
queue.offer(num: 1)
queue.offer(num: 3)
queue.offer(num: 2)
queue.offer(num: 5)
queue.offer(num: 4)
queue.push(num: 1)
queue.push(num: 3)
queue.push(num: 2)
queue.push(num: 5)
queue.push(num: 4)
print("队列 queue = \(queue.toArray())")
/* 访问队首元素 */