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

Review Swift codes (#1150)

Browse Source 
* feat(swift): review for chapter_computational_complexity

* feat(swift): review for chapter_data_structure

* feat(swift): review for chapter_array_and_linkedlist

* feat(swift): review for chapter_stack_and_queue

* feat(swift): review for chapter_hashing

* feat(swift): review for chapter_tree

* feat(swift): add codes for heap article

* feat(swift): review for chapter_heap

* feat(swift): review for chapter_graph

* feat(swift): review for chapter_searching

* feat(swift): review for chapter_sorting

* feat(swift): review for chapter_divide_and_conquer

* feat(swift): review for chapter_backtracking

* feat(swift): review for chapter_dynamic_programming

* feat(swift): review for chapter_greedy

* feat(swift): review for utils

* feat(swift): update ci tool

* feat(swift): trailing closure

* feat(swift): array init

* feat(swift): map index
This commit is contained in:
nuomi1
2024-03-20 21:15:39 +08:00
committed by GitHub
parent 300a781fab
commit 7359a7cb4b
55 changed files with 293 additions and 224 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -8,13 +8,13 @@
class ArrayDeque {
private var nums: [Int] // 用于存储双向队列元素的数组
private var front: Int // 队首指针，指向队首元素
private var queSize: Int // 双向队列长度
private var _size: Int // 双向队列长度
/* 构造方法 */
init(capacity: Int) {
nums = Array(repeating: 0, count: capacity)
front = 0
queSize = 0
_size = 0
}
/* 获取双向队列的容量 */
@@ -24,7 +24,7 @@ class ArrayDeque {
/* 获取双向队列的长度 */
func size() -> Int {
queSize
_size
}
/* 判断双向队列是否为空 */
@@ -51,7 +51,7 @@ class ArrayDeque {
front = index(i: front - 1)
// 将 num 添加至队首
nums[front] = num
queSize += 1
_size += 1
}
/* 队尾入队 */
@@ -64,7 +64,7 @@ class ArrayDeque {
let rear = index(i: front + size())
// 将 num 添加至队尾
nums[rear] = num
queSize += 1
_size += 1
}
/* 队首出队 */
@@ -72,14 +72,14 @@ class ArrayDeque {
let num = peekFirst()
// 队首指针向后移动一位
front = index(i: front + 1)
queSize -= 1
_size -= 1
return num
}
/* 队尾出队 */
func popLast() -> Int {
let num = peekLast()
queSize -= 1
_size -= 1
return num
}
@@ -104,11 +104,7 @@ class ArrayDeque {
/* 返回数组用于打印 */
func toArray() -> [Int] {
// 仅转换有效长度范围内的列表元素
var res = Array(repeating: 0, count: size())
for (i, j) in sequence(first: (0, front), next: { $0 < self.size() - 1 ? ($0 + 1, $1 + 1) : nil }) {
res[i] = nums[index(i: j)]
}
return res
(front ..< front + size()).map { nums[index(i: $0)] }
}
}

22
codes/swift/chapter_stack_and_queue/array_queue.swift
View File

@@ -7,12 +7,14 @@
/* 基于环形数组实现的队列 */
class ArrayQueue {
private var nums: [Int] // 用于存储队列元素的数组
private var front = 0 // 队首指针，指向队首元素
private var queSize = 0 // 队列长度
private var front: Int // 队首指针，指向队首元素
private var _size: Int // 队列长度
init(capacity: Int) {
// 初始化数组
nums = Array(repeating: 0, count: capacity)
front = 0
_size = 0
}
/* 获取队列的容量 */
@@ -22,12 +24,12 @@ class ArrayQueue {
/* 获取队列的长度 */
func size() -> Int {
queSize
_size
}
/* 判断队列是否为空 */
func isEmpty() -> Bool {
queSize == 0
size() == 0
}
/* 入队 */
@@ -38,10 +40,10 @@ class ArrayQueue {
}
// 计算队尾指针，指向队尾索引 + 1
// 通过取余操作实现 rear 越过数组尾部后回到头部
let rear = (front + queSize) % capacity()
let rear = (front + size()) % capacity()
// 将 num 添加至队尾
nums[rear] = num
queSize += 1
_size += 1
}
/* 出队 */
@@ -50,7 +52,7 @@ class ArrayQueue {
let num = peek()
// 队首指针向后移动一位，若越过尾部，则返回到数组头部
front = (front + 1) % capacity()
queSize -= 1
_size -= 1
return num
}
@@ -65,11 +67,7 @@ class ArrayQueue {
/* 返回数组 */
func toArray() -> [Int] {
// 仅转换有效长度范围内的列表元素
var res = Array(repeating: 0, count: queSize)
for (i, j) in sequence(first: (0, front), next: { $0 < self.queSize - 1 ? ($0 + 1, $1 + 1) : nil }) {
res[i] = nums[j % capacity()]
}
return res
(front ..< front + size()).map { nums[$0 % capacity()] }
}
}

28
codes/swift/chapter_stack_and_queue/linkedlist_deque.swift
View File

@@ -19,15 +19,15 @@ class ListNode {
class LinkedListDeque {
private var front: ListNode? // 头节点 front
private var rear: ListNode? // 尾节点 rear
private var queSize: Int // 双向队列的长度
private var _size: Int // 双向队列的长度
init() {
queSize = 0
_size = 0
}
/* 获取双向队列的长度 */
func size() -> Int {
queSize
_size
}
/* 判断双向队列是否为空 */
@@ -57,7 +57,7 @@ class LinkedListDeque {
node.prev = rear
rear = node // 更新尾节点
}
queSize += 1 // 更新队列长度
_size += 1 // 更新队列长度
}
/* 队首入队 */
@@ -98,7 +98,7 @@ class LinkedListDeque {
}
rear = rPrev // 更新尾节点
}
queSize -= 1 // 更新队列长度
_size -= 1 // 更新队列长度
return val
}
@@ -113,13 +113,19 @@ class LinkedListDeque {
}
/* 访问队首元素 */
func peekFirst() -> Int? {
isEmpty() ? nil : front?.val
func peekFirst() -> Int {
if isEmpty() {
fatalError("双向队列为空")
}
return front!.val
}
/* 访问队尾元素 */
func peekLast() -> Int? {
isEmpty() ? nil : rear?.val
func peekLast() -> Int {
if isEmpty() {
fatalError("双向队列为空")
}
return rear!.val
}
/* 返回数组用于打印 */
@@ -147,9 +153,9 @@ enum _LinkedListDeque {
/* 访问元素 */
let peekFirst = deque.peekFirst()
print("队首元素 peekFirst = \(peekFirst!)")
print("队首元素 peekFirst = \(peekFirst)")
let peekLast = deque.peekLast()
print("队尾元素 peekLast = \(peekLast!)")
print("队尾元素 peekLast = \(peekLast)")
/* 元素入队 */
deque.pushLast(num: 4)

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

@@ -10,9 +10,11 @@ import utils
class LinkedListQueue {
private var front: ListNode? // 头节点
private var rear: ListNode? // 尾节点
private var _size = 0
private var _size: Int
init() {}
init() {
_size = 0
}
/* 获取队列的长度 */
func size() -> Int {

10
codes/swift/chapter_stack_and_queue/linkedlist_stack.swift
View File

@@ -9,9 +9,11 @@ import utils
/* 基于链表实现的栈 */
class LinkedListStack {
private var _peek: ListNode? // 将头节点作为栈顶
private var _size = 0 // 栈的长度
private var _size: Int // 栈的长度
init() {}
init() {
_size = 0
}
/* 获取栈的长度 */
func size() -> Int {
@@ -51,8 +53,8 @@ class LinkedListStack {
/* 将 List 转化为 Array 并返回 */
func toArray() -> [Int] {
var node = _peek
var res = Array(repeating: 0, count: _size)
for i in sequence(first: res.count - 1, next: { $0 >= 0 + 1 ? $0 - 1 : nil }) {
var res = Array(repeating: 0, count: size())
for i in res.indices.reversed() {
res[i] = node!.val
node = node?.next
}