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

fix: compiler error and reset root (#570)

Browse Source
This commit is contained in:
nuomi1
2023-06-30 05:05:07 +08:00
committed by GitHub
parent be8912073e
commit 9611a8f135
2 changed files with 3 additions and 3 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
codes/swift/chapter_sorting/bucket_sort.swift
View File

@ -12,7 +12,7 @@ func bucketSort(nums: inout [Double]) {
// 1. 将数组元素分配到各个桶中 // 1. 将数组元素分配到各个桶中
for num in nums { for num in nums {
// 输入数据范围 [0, 1)，使用 num * k 映射到索引范围 [0, k-1] // 输入数据范围 [0, 1)，使用 num * k 映射到索引范围 [0, k-1]
let i = Int(num * k) let i = Int(num * Double(k))
// 将 num 添加进桶 i // 将 num 添加进桶 i
buckets[i].append(num) buckets[i].append(num)
} }

4
codes/swift/chapter_tree/binary_search_tree.swift
View File

@ -123,7 +123,7 @@ class BinarySearchTree {
// 当子节点数量 = 0 / 1 时， child = null / 该子节点 // 当子节点数量 = 0 / 1 时， child = null / 该子节点
let child = cur?.left != nil ? cur?.left : cur?.right let child = cur?.left != nil ? cur?.left : cur?.right
// 删除节点 cur // 删除节点 cur
if cur != root { if cur !== root {
if pre?.left === cur { if pre?.left === cur {
pre?.left = child pre?.left = child
} else { } else {
@ -131,7 +131,7 @@ class BinarySearchTree {
} }
} else { } else {
// 若删除节点为根节点，则重新指定根节点 // 若删除节点为根节点，则重新指定根节点
root = cur; root = child
} }
} }
// 子节点数量 = 2 // 子节点数量 = 2