algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-12-19 07:17:54 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add code source blocks to the chapter Graph.

Browse Source 
Fix "函数" and "方法"
This commit is contained in:
krahets
2023-02-10 01:04:26 +08:00
parent d37c71b928
commit 300016393b
47 changed files with 106 additions and 409 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
codes/swift/chapter_array_and_linkedlist/my_list.swift
View File

@@ -11,7 +11,7 @@ class MyList {
private var _size = 0 // 列表长度（即当前元素数量）
private let extendRatio = 2 // 每次列表扩容的倍数
/* 构造函数 */
/* 构造方法 */
init() {
nums = Array(repeating: 0, count: _capacity)
}

2
codes/swift/chapter_graph/graph_adjacency_matrix.swift
View File

@@ -11,7 +11,7 @@ class GraphAdjMat {
private var vertices: [Int] // 顶点列表，元素代表“顶点值”，索引代表“顶点索引”
private var adjMat: [[Int]] // 邻接矩阵，行列索引对应“顶点索引”
/* 构造函数 */
/* 构造方法 */
init(vertices: [Int], edges: [[Int]]) {
self.vertices = []
adjMat = []

2
codes/swift/chapter_heap/my_heap.swift
View File

@@ -10,7 +10,7 @@ import utils
class MaxHeap {
private var maxHeap: [Int]
/* 构造函数，根据输入列表建堆 */
/* 构造方法，根据输入列表建堆 */
init(nums: [Int]) {
// 将列表元素原封不动添加进堆
maxHeap = nums

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

@@ -95,7 +95,7 @@ class AVLTree {
return root
}
/* 递归插入结点（辅助函数） */
/* 递归插入结点（辅助方法） */
private func insertHelper(node: TreeNode?, val: Int) -> TreeNode? {
var node = node
if node == nil {
@@ -123,7 +123,7 @@ class AVLTree {
return root
}
/* 递归删除结点（辅助函数） */
/* 递归删除结点（辅助方法） */
private func removeHelper(node: TreeNode?, val: Int) -> TreeNode? {
var node = node
if node == nil {