CS_learn/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2026-04-09 05:41:47 +08:00
Code Issues Packages Projects Releases Wiki Activity

refactor: Replace poll with pop in Queue and Deque (#415)

Browse Source
This commit is contained in:
Yudong Jin
2023-03-13 21:58:21 +08:00
committed by GitHub
parent 2d17ee8e92
commit 8aebbaad21
77 changed files with 261 additions and 261 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -68,7 +68,7 @@ class ArrayDeque {
}
/* 队首出队 */
func pollFirst() -> Int {
func popFirst() -> Int {
let num = peekFirst()
// 队首指针向后移动一位
front = index(i: front + 1)
@@ -77,7 +77,7 @@ class ArrayDeque {
}
/* 队尾出队 */
func pollLast() -> Int {
func popLast() -> Int {
let num = peekLast()
queSize -= 1
return num
@@ -136,10 +136,10 @@ enum _ArrayDeque {
print("元素 1 队首入队后 deque = \(deque.toArray())")
/* 元素出队 */
let pollLast = deque.pollLast()
print("队尾出队元素 = \(pollLast)，队尾出队后 deque = \(deque.toArray())")
let pollFirst = deque.pollFirst()
print("队首出队元素 = \(pollFirst)，队首出队后 deque = \(deque.toArray())")
let popLast = deque.popLast()
print("队尾出队元素 = \(popLast)，队尾出队后 deque = \(deque.toArray())")
let popFirst = deque.popFirst()
print("队首出队元素 = \(popFirst)，队首出队后 deque = \(deque.toArray())")
/* 获取双向队列的长度 */
let size = deque.size()