mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-26 14:56:28 +08:00
40 lines
1 KiB
Swift
40 lines
1 KiB
Swift
/**
|
||
* File: queue.swift
|
||
* Created Time: 2023-01-11
|
||
* Author: nuomi1 (nuomi1@qq.com)
|
||
*/
|
||
|
||
@main
|
||
enum Queue {
|
||
/* Driver Code */
|
||
static func main() {
|
||
/* 初始化队列 */
|
||
// Swift 没有内置的队列类，可以把 Array 当作队列来使用
|
||
var queue: [Int] = []
|
||
|
||
/* 元素入队 */
|
||
queue.append(1)
|
||
queue.append(3)
|
||
queue.append(2)
|
||
queue.append(5)
|
||
queue.append(4)
|
||
print("队列 queue = \(queue)")
|
||
|
||
/* 访问队首元素 */
|
||
let peek = queue.first!
|
||
print("队首元素 peek = \(peek)")
|
||
|
||
/* 元素出队 */
|
||
// 使用 Array 模拟时 pop 的复杂度为 O(n)
|
||
let pool = queue.removeFirst()
|
||
print("出队元素 pop = \(pool)，出队后 queue = \(queue)")
|
||
|
||
/* 获取队列的长度 */
|
||
let size = queue.count
|
||
print("队列长度 size = \(size)")
|
||
|
||
/* 判断队列是否为空 */
|
||
let isEmpty = queue.isEmpty
|
||
print("队列是否为空 = \(isEmpty)")
|
||
}
|
||
}
|