xmengnet/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2024-12-25 09:56:28 +08:00
Code Issues Projects Releases Packages Wiki Activity Actions

Add build scripts for C# and

Browse source 
unify the coding style.
This commit is contained in:
krahets 2023-02-08 22:18:02 +08:00
parent 38751cc5f5
commit 6dc21691ed
63 changed files with 2703 additions and 3911 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

3
codes/cpp/chapter_stack_and_queue/array_queue.cpp
View file

@ -72,11 +72,10 @@ public:
/* 将数组转化为 Vector 并返回 */
vector<int> toVector() {
int cap = queCapacity;
// 仅转换有效长度范围内的列表元素
vector<int> arr(queSize);
for (int i = 0, j = front; i < queSize; i++, j++) {
arr[i] = nums[j % cap];
arr[i] = nums[j % queCapacity];
}
return arr;
}

43
codes/csharp/chapter_array_and_linkedlist/array.cs
View file

@ -4,12 +4,12 @@
using NUnit.Framework;
namespace hello_algo.chapter_array_and_linkedlist
{
public class Array
namespace hello_algo.chapter_array_and_linkedlist;
public class array
{
/* 随机返回一个数组元素 */
public static int RandomAccess(int[] nums)
public static int randomAccess(int[] nums)
{
Random random = new();
// 在区间 [0, nums.Length) 中随机抽取一个数字
@ -20,7 +20,7 @@ namespace hello_algo.chapter_array_and_linkedlist
}
/* 扩展数组长度 */
public static int[] Extend(int[] nums, int enlarge)
public static int[] extend(int[] nums, int enlarge)
{
// 初始化一个扩展长度后的数组
int[] res = new int[nums.Length + enlarge];
@ -34,7 +34,7 @@ namespace hello_algo.chapter_array_and_linkedlist
}
/* 在数组的索引 index 处插入元素 num */
public static void Insert(int[] nums, int num, int index)
public static void insert(int[] nums, int num, int index)
{
// 把索引 index 以及之后的所有元素向后移动一位
for (int i = nums.Length - 1; i > index; i--)
@ -46,7 +46,7 @@ namespace hello_algo.chapter_array_and_linkedlist
}
/* 删除索引 index 处元素 */
public static void Remove(int[] nums, int index)
public static void remove(int[] nums, int index)
{
// 把索引 index 之后的所有元素向前移动一位
for (int i = index; i < nums.Length - 1; i++)
@ -56,7 +56,7 @@ namespace hello_algo.chapter_array_and_linkedlist
}
/* 遍历数组 */
public static void Traverse(int[] nums)
public static void traverse(int[] nums)
{
int count = 0;
// 通过索引遍历数组
@ -72,7 +72,7 @@ namespace hello_algo.chapter_array_and_linkedlist
}
/* 在数组中查找指定元素 */
public static int Find(int[] nums, int target)
public static int find(int[] nums, int target)
{
for (int i = 0; i < nums.Length; i++)
{
@ -83,7 +83,7 @@ namespace hello_algo.chapter_array_and_linkedlist
}
/* 辅助函数,数组转字符串 */
public static string ToString(int[] nums)
public static string toString(int[] nums)
{
return string.Join(",", nums);
}
@ -94,32 +94,31 @@ namespace hello_algo.chapter_array_and_linkedlist
{
// 初始化数组
int[] arr = new int[5];
Console.WriteLine("数组 arr = " + ToString(arr));
Console.WriteLine("数组 arr = " + toString(arr));
int[] nums = { 1, 3, 2, 5, 4 };
Console.WriteLine("数组 nums = " + ToString(nums));
Console.WriteLine("数组 nums = " + toString(nums));
// 随机访问
int randomNum = RandomAccess(nums);
int randomNum = randomAccess(nums);
Console.WriteLine("在 nums 中获取随机元素 " + randomNum);
// 长度扩展
nums = Extend(nums, 3);
Console.WriteLine("将数组长度扩展至 8 ，得到 nums = " + ToString(nums));
nums = extend(nums, 3);
Console.WriteLine("将数组长度扩展至 8 ，得到 nums = " + toString(nums));
// 插入元素
Insert(nums, 6, 3);
Console.WriteLine("在索引 3 处插入数字 6 ，得到 nums = " + ToString(nums));
insert(nums, 6, 3);
Console.WriteLine("在索引 3 处插入数字 6 ，得到 nums = " + toString(nums));
// 删除元素
Remove(nums, 2);
Console.WriteLine("删除索引 2 处的元素，得到 nums = " + ToString(nums));
remove(nums, 2);
Console.WriteLine("删除索引 2 处的元素，得到 nums = " + toString(nums));
// 遍历数组
Traverse(nums);
traverse(nums);
// 查找元素
int index = Find(nums, 3);
int index = find(nums, 3);
Console.WriteLine("在 nums 中查找元素 3 ，得到索引 = " + index);
}
}
}

21
codes/csharp/chapter_array_and_linkedlist/linked_list.cs
View file

@ -5,12 +5,12 @@
using hello_algo.include;
using NUnit.Framework;
namespace hello_algo.chapter_array_and_linkedlist
{
namespace hello_algo.chapter_array_and_linkedlist;
public class linked_list
{
/* 在链表的结点 n0 之后插入结点 P */
public static void Insert(ListNode n0, ListNode P)
public static void insert(ListNode n0, ListNode P)
{
ListNode? n1 = n0.next;
n0.next = P;
@ -18,7 +18,7 @@ namespace hello_algo.chapter_array_and_linkedlist
}
/* 删除链表的结点 n0 之后的首个结点 */
public static void Remove(ListNode n0)
public static void remove(ListNode n0)
{
if (n0.next == null)
return;
@ -29,7 +29,7 @@ namespace hello_algo.chapter_array_and_linkedlist
}
/* 访问链表中索引为 index 的结点 */
public static ListNode? Access(ListNode head, int index)
public static ListNode? access(ListNode head, int index)
{
for (int i = 0; i < index; i++)
{
@ -41,7 +41,7 @@ namespace hello_algo.chapter_array_and_linkedlist
}
/* 在链表中查找值为 target 的首个结点 */
public static int Find(ListNode head, int target)
public static int find(ListNode head, int target)
{
int index = 0;
while (head != null)
@ -73,20 +73,19 @@ namespace hello_algo.chapter_array_and_linkedlist
Console.WriteLine($"初始化的链表为{n0}");
// 插入结点
Insert(n0, new ListNode(0));
insert(n0, new ListNode(0));
Console.WriteLine($"插入结点后的链表为{n0}");
// 删除结点
Remove(n0);
remove(n0);
Console.WriteLine($"删除结点后的链表为{n0}");
// 访问结点
ListNode? node = Access(n0, 3);
ListNode? node = access(n0, 3);
Console.WriteLine($"链表中索引 3 处的结点的值 = {node?.val}");
// 查找结点
int index = Find(n0, 2);
int index = find(n0, 2);
Console.WriteLine($"链表中值为 2 的结点的索引 = {index}");
}
}
}

5
codes/csharp/chapter_array_and_linkedlist/list.cs
View file

@ -6,8 +6,8 @@
using NUnit.Framework;
namespace hello_algo.chapter_array_and_linkedlist
{
namespace hello_algo.chapter_array_and_linkedlist;
public class list
{
[Test]
@ -72,4 +72,3 @@ namespace hello_algo.chapter_array_and_linkedlist
Console.WriteLine("排序列表后 list = " + string.Join(",", list));
}
}
}

109
codes/csharp/chapter_array_and_linkedlist/my_list.cs
View file

@ -6,114 +6,114 @@
using NUnit.Framework;
namespace hello_algo.chapter_array_and_linkedlist
{
namespace hello_algo.chapter_array_and_linkedlist;
/* 列表类简易实现 */
class MyList
{
private int[] nums; // 数组（存储列表元素）
private int capacity = 10; // 列表容量
private int size = 0; // 列表长度（即当前元素数量）
private int numsCapacity = 10; // 列表容量
private int numsSize = 0; // 列表长度（即当前元素数量）
private int extendRatio = 2; // 每次列表扩容的倍数
/* 构造函数 */
public MyList()
{
nums = new int[capacity];
nums = new int[numsCapacity];
}
/* 获取列表长度（即当前元素数量）*/
public int Size()
public int size()
{
return size;
return numsSize;
}
/* 获取列表容量 */
public int Capacity()
public int capacity()
{
return capacity;
return numsCapacity;
}
/* 访问元素 */
public int Get(int index)
public int get(int index)
{
// 索引如果越界则抛出异常，下同
if (index < 0 || index >= size)
if (index < 0 || index >= numsSize)
throw new IndexOutOfRangeException("索引越界");
return nums[index];
}
/* 更新元素 */
public void Set(int index, int num)
public void set(int index, int num)
{
if (index < 0 || index >= size)
if (index < 0 || index >= numsSize)
throw new IndexOutOfRangeException("索引越界");
nums[index] = num;
}
/* 尾部添加元素 */
public void Add(int num)
public void add(int num)
{
// 元素数量超出容量时，触发扩容机制
if (size == Capacity())
ExtendCapacity();
nums[size] = num;
if (numsSize == numsCapacity)
extendCapacity();
nums[numsSize] = num;
// 更新元素数量
size++;
numsSize++;
}
/* 中间插入元素 */
public void Insert(int index, int num)
public void insert(int index, int num)
{
if (index < 0 || index >= size)
if (index < 0 || index >= numsSize)
throw new IndexOutOfRangeException("索引越界");
// 元素数量超出容量时，触发扩容机制
if (size == Capacity())
ExtendCapacity();
if (numsSize == numsCapacity)
extendCapacity();
// 将索引 index 以及之后的元素都向后移动一位
for (int j = size - 1; j >= index; j--)
for (int j = numsSize - 1; j >= index; j--)
{
nums[j + 1] = nums[j];
}
nums[index] = num;
// 更新元素数量
size++;
numsSize++;
}
/* 删除元素 */
public int Remove(int index)
public int remove(int index)
{
if (index < 0 || index >= size)
if (index < 0 || index >= numsSize)
throw new IndexOutOfRangeException("索引越界");
int num = nums[index];
// 将索引 index 之后的元素都向前移动一位
for (int j = index; j < size - 1; j++)
for (int j = index; j < numsSize - 1; j++)
{
nums[j] = nums[j + 1];
}
// 更新元素数量
size--;
numsSize--;
// 返回被删除元素
return num;
}
/* 列表扩容 */
public void ExtendCapacity()
public void extendCapacity()
{
// 新建一个长度为 size 的数组，并将原数组拷贝到新数组
System.Array.Resize(ref nums, Capacity() * extendRatio);
// 新建一个长度为 numsCapacity * extendRatio 的数组，并将原数组拷贝到新数组
System.Array.Resize(ref nums, numsCapacity * extendRatio);
// 更新列表容量
capacity = nums.Length;
numsCapacity = nums.Length;
}
/* 将列表转换为数组 */
public int[] ToArray()
public int[] toArray()
{
int size = Size();
// 仅转换有效长度范围内的列表元素
int[] nums = new int[size];
for (int i = 0; i < size; i++)
int[] nums = new int[numsSize];
for (int i = 0; i < numsSize; i++)
{
nums[i] = Get(i);
nums[i] = get(i);
}
return nums;
}
@ -127,38 +127,37 @@ namespace hello_algo.chapter_array_and_linkedlist
/* 初始化列表 */
MyList list = new MyList();
/* 尾部添加元素 */
list.Add(1);
list.Add(3);
list.Add(2);
list.Add(5);
list.Add(4);
Console.WriteLine("列表 list = " + string.Join(",", list.ToArray()) +
" ，容量 = " + list.Capacity() + " ，长度 = " + list.Size());
list.add(1);
list.add(3);
list.add(2);
list.add(5);
list.add(4);
Console.WriteLine("列表 list = " + string.Join(",", list.toArray()) +
" ，容量 = " + list.capacity() + " ，长度 = " + list.size());
/* 中间插入元素 */
list.Insert(3, 6);
Console.WriteLine("在索引 3 处插入数字 6 ，得到 list = " + string.Join(",", list.ToArray()));
list.insert(3, 6);
Console.WriteLine("在索引 3 处插入数字 6 ，得到 list = " + string.Join(",", list.toArray()));
/* 删除元素 */
list.Remove(3);
Console.WriteLine("删除索引 3 处的元素，得到 list = " + string.Join(",", list.ToArray()));
list.remove(3);
Console.WriteLine("删除索引 3 处的元素，得到 list = " + string.Join(",", list.toArray()));
/* 访问元素 */
int num = list.Get(1);
int num = list.get(1);
Console.WriteLine("访问索引 1 处的元素，得到 num = " + num);
/* 更新元素 */
list.Set(1, 0);
Console.WriteLine("将索引 1 处的元素更新为 0 ，得到 list = " + string.Join(",", list.ToArray()));
list.set(1, 0);
Console.WriteLine("将索引 1 处的元素更新为 0 ，得到 list = " + string.Join(",", list.toArray()));
/* 测试扩容机制 */
for (int i = 0; i < 10; i++)
{
// 在 i = 5 时，列表长度将超出列表容量，此时触发扩容机制
list.Add(i);
}
Console.WriteLine("扩容后的列表 list = " + string.Join(",", list.ToArray()) +
" ，容量 = " + list.Capacity() + " ，长度 = " + list.Size());
list.add(i);
}
Console.WriteLine("扩容后的列表 list = " + string.Join(",", list.toArray()) +
" ，容量 = " + list.capacity() + " ，长度 = " + list.size());
}
}

5
codes/csharp/chapter_computational_complexity/leetcode_two_sum.cs
View file

@ -6,8 +6,8 @@
using NUnit.Framework;
namespace hello_algo.chapter_computational_complexity
{
namespace hello_algo.chapter_computational_complexity;
public class leetcode_two_sum
{
/* 方法一：暴力枚举 */
@ -60,4 +60,3 @@ namespace hello_algo.chapter_computational_complexity
Console.WriteLine("方法二 res = " + string.Join(",", res));
}
}
}

5
codes/csharp/chapter_computational_complexity/space_complexity.cs
View file

@ -7,8 +7,8 @@
using hello_algo.include;
using NUnit.Framework;
namespace hello_algo.chapter_computational_complexity
{
namespace hello_algo.chapter_computational_complexity;
public class space_complexity
{
/* 函数 */
@ -119,4 +119,3 @@ namespace hello_algo.chapter_computational_complexity
PrintUtil.PrintTree(root);
}
}
}

5
codes/csharp/chapter_computational_complexity/time_complexity.cs
View file

@ -6,8 +6,8 @@
using NUnit.Framework;
namespace hello_algo.chapter_computational_complexity
{
namespace hello_algo.chapter_computational_complexity;
public class time_complexity
{
void algorithm(int n)
@ -229,4 +229,3 @@ namespace hello_algo.chapter_computational_complexity
Console.WriteLine("阶乘阶（递归实现）的计算操作数量 = " + count);
}
}
}

5
codes/csharp/chapter_computational_complexity/worst_best_time_complexity.cs
View file

@ -6,8 +6,8 @@
using NUnit.Framework;
namespace hello_algo.chapter_computational_complexity
{
namespace hello_algo.chapter_computational_complexity;
public class worst_best_time_complexity
{
/* 生成一个数组，元素为 { 1, 2, ..., n }，顺序被打乱 */
@ -60,4 +60,3 @@ namespace hello_algo.chapter_computational_complexity
}
}
}
}

4
codes/csharp/chapter_hashing/array_hash_map.cs
View file

@ -6,8 +6,7 @@
using NUnit.Framework;
namespace hello_algo.chapter_hashing
{
namespace hello_algo.chapter_hashing;
/* 键值对 int->String */
class Entry
@ -161,4 +160,3 @@ namespace hello_algo.chapter_hashing
}
}
}
}

16
codes/csharp/chapter_hashing/hash_map.cs
View file

@ -8,10 +8,10 @@
using hello_algo.include;
using NUnit.Framework;
namespace hello_algo.chapter_hashing
{
namespace hello_algo.chapter_hashing;
public class hash_map {
public class hash_map
{
[Test]
public void Test()
{
@ -41,17 +41,19 @@ namespace hello_algo.chapter_hashing
/* 遍历哈希表 */
Console.WriteLine("\n遍历键值对 Key->Value");
foreach (var kv in map) {
foreach (var kv in map)
{
Console.WriteLine(kv.Key + " -> " + kv.Value);
}
Console.WriteLine("\n单独遍历键 Key");
foreach (int key in map.Keys) {
foreach (int key in map.Keys)
{
Console.WriteLine(key);
}
Console.WriteLine("\n单独遍历值 Value");
foreach (String val in map.Values) {
foreach (String val in map.Values)
{
Console.WriteLine(val);
}
}
}
}

5
codes/csharp/chapter_searching/binary_search.cs
View file

@ -6,8 +6,8 @@
using NUnit.Framework;
namespace hello_algo.chapter_searching
{
namespace hello_algo.chapter_searching;
public class binary_search
{
/* 二分查找（双闭区间） */
@ -65,4 +65,3 @@ namespace hello_algo.chapter_searching
Console.WriteLine("目标元素 6 的索引 = " + index);
}
}
}

5
codes/csharp/chapter_searching/hashing_search.cs
View file

@ -7,8 +7,8 @@
using hello_algo.include;
using NUnit.Framework;
namespace hello_algo.chapter_searching
{
namespace hello_algo.chapter_searching;
public class hashing_search
{
/* 哈希查找（数组） */
@ -57,4 +57,3 @@ namespace hello_algo.chapter_searching
Console.WriteLine("目标结点值 3 的对应结点对象为 " + node);
}
}
}

5
codes/csharp/chapter_searching/linear_search.cs
View file

@ -7,8 +7,8 @@
using hello_algo.include;
using NUnit.Framework;
namespace hello_algo.chapter_searching
{
namespace hello_algo.chapter_searching;
public class linear_search
{
/* 线性查找（数组） */
@ -56,4 +56,3 @@ namespace hello_algo.chapter_searching
Console.WriteLine("目标结点值 3 的对应结点对象为 " + node);
}
}
}

5
codes/csharp/chapter_sorting/bubble_sort.cs
View file

@ -6,8 +6,8 @@
using NUnit.Framework;
namespace hello_algo.chapter_sorting
{
namespace hello_algo.chapter_sorting;
public class bubble_sort
{
/* 冒泡排序 */
@ -65,4 +65,3 @@ namespace hello_algo.chapter_sorting
Console.WriteLine("冒泡排序完成后 nums1 = " + string.Join(",", nums));
}
}
}

5
codes/csharp/chapter_sorting/insertion_sort.cs
View file

@ -6,8 +6,8 @@
using NUnit.Framework;
namespace hello_algo.chapter_sorting
{
namespace hello_algo.chapter_sorting;
public class insertion_sort
{
/* 插入排序 */
@ -35,4 +35,3 @@ namespace hello_algo.chapter_sorting
Console.WriteLine("插入排序完成后 nums = " + string.Join(",", nums));
}
}
}

13
codes/csharp/chapter_sorting/merge_sort.cs
View file

@ -6,15 +6,13 @@
using NUnit.Framework;
namespace hello_algo.chapter_sorting
{
namespace hello_algo.chapter_sorting;
public class merge_sort
{
/**
* 合并左子数组和右子数组
* 左子数组区间 [left, mid]
* 右子数组区间 [mid + 1, right]
*/
/* 合并左子数组和右子数组 */
// 左子数组区间 [left, mid]
// 右子数组区间 [mid + 1, right]
static void merge(int[] nums, int left, int mid, int right)
{
// 初始化辅助数组
@ -62,4 +60,3 @@ namespace hello_algo.chapter_sorting
Console.WriteLine("归并排序完成后 nums = " + string.Join(",", nums));
}
}
}

5
codes/csharp/chapter_sorting/quick_sort.cs
View file

@ -6,8 +6,8 @@
using NUnit.Framework;
namespace hello_algo.chapter_sorting
{
namespace hello_algo.chapter_sorting;
class QuickSort
{
/* 元素交换 */
@ -180,4 +180,3 @@ namespace hello_algo.chapter_sorting
Console.WriteLine("快速排序（尾递归优化）完成后 nums2 = " + string.Join(",", nums2));
}
}
}

4
codes/csharp/chapter_stack_and_queue/array_queue.cs
View file

@ -6,8 +6,7 @@
using NUnit.Framework;
namespace hello_algo.chapter_stack_and_queue
{
namespace hello_algo.chapter_stack_and_queue;
/* 基于环形数组实现的队列 */
class ArrayQueue
@ -129,4 +128,3 @@ namespace hello_algo.chapter_stack_and_queue
}
}
}
}

4
codes/csharp/chapter_stack_and_queue/array_stack.cs
View file

@ -6,8 +6,7 @@
using NUnit.Framework;
namespace hello_algo.chapter_stack_and_queue
{
namespace hello_algo.chapter_stack_and_queue;
/* 基于数组实现的栈 */
class ArrayStack
@ -95,4 +94,3 @@ namespace hello_algo.chapter_stack_and_queue
Console.WriteLine("栈是否为空 = " + isEmpty);
}
}
}

5
codes/csharp/chapter_stack_and_queue/deque.cs
View file

@ -6,8 +6,8 @@
using NUnit.Framework;
namespace hello_algo.chapter_stack_and_queue
{
namespace hello_algo.chapter_stack_and_queue;
public class deque
{
[Test]
@ -46,4 +46,3 @@ namespace hello_algo.chapter_stack_and_queue
Console.WriteLine("双向队列是否为空 = " + isEmpty);
}
}
}

5
codes/csharp/chapter_stack_and_queue/linkedlist_queue.cs
View file

@ -7,8 +7,8 @@
using hello_algo.include;
using NUnit.Framework;
namespace hello_algo.chapter_stack_and_queue
{
namespace hello_algo.chapter_stack_and_queue;
/* 基于链表实现的队列 */
class LinkedListQueue
{
@ -121,4 +121,3 @@ namespace hello_algo.chapter_stack_and_queue
Console.WriteLine("队列是否为空 = " + isEmpty);
}
}
}

6
codes/csharp/chapter_stack_and_queue/linkedlist_stack.cs
View file

@ -7,8 +7,9 @@
using hello_algo.include;
using NUnit.Framework;
namespace hello_algo.chapter_stack_and_queue
{
namespace hello_algo.chapter_stack_and_queue;
/* 基于链表实现的栈 */
class LinkedListStack
{
private ListNode? stackPeek; // 将头结点作为栈顶
@ -110,4 +111,3 @@ namespace hello_algo.chapter_stack_and_queue
Console.WriteLine("栈是否为空 = " + isEmpty);
}
}
}

6
codes/csharp/chapter_stack_and_queue/queue.cs
View file

@ -6,8 +6,8 @@
using NUnit.Framework;
namespace hello_algo.chapter_stack_and_queue
{
namespace hello_algo.chapter_stack_and_queue;
public class queue
{
[Test]
@ -41,5 +41,3 @@ namespace hello_algo.chapter_stack_and_queue
Console.WriteLine("队列是否为空 = " + isEmpty);
}
}
}

5
codes/csharp/chapter_stack_and_queue/stack.cs
View file

@ -6,8 +6,8 @@
using NUnit.Framework;
namespace hello_algo.chapter_stack_and_queue
{
namespace hello_algo.chapter_stack_and_queue;
public class stack
{
[Test]
@ -42,4 +42,3 @@ namespace hello_algo.chapter_stack_and_queue
Console.WriteLine("栈是否为空 = " + isEmpty);
}
}
}

5
codes/csharp/chapter_tree/avl_tree.cs
View file

@ -7,8 +7,8 @@
using hello_algo.include;
using NUnit.Framework;
namespace hello_algo.chapter_tree
{
namespace hello_algo.chapter_tree;
/* AVL 树 */
class AVLTree
{
@ -257,4 +257,3 @@ namespace hello_algo.chapter_tree
Console.WriteLine("\n查找到的结点对象为 " + node + "，结点值 = " + node?.val);
}
}
}

15
codes/csharp/chapter_tree/binary_search_tree.cs
View file

@ -7,24 +7,27 @@
using hello_algo.include;
using NUnit.Framework;
namespace hello_algo.chapter_tree
{
namespace hello_algo.chapter_tree;
class BinarySearchTree
{
TreeNode? root;
public BinarySearchTree(int[] nums) {
public BinarySearchTree(int[] nums)
{
Array.Sort(nums); // 排序数组
root = buildTree(nums, 0, nums.Length - 1); // 构建二叉搜索树
}
/* 获取二叉树根结点 */
public TreeNode? getRoot() {
public TreeNode? getRoot()
{
return root;
}
/* 构建二叉搜索树 */
public TreeNode? buildTree(int[] nums, int i, int j) {
public TreeNode? buildTree(int[] nums, int i, int j)
{
if (i > j) return null;
// 将数组中间结点作为根结点
int mid = (i + j) / 2;
@ -115,7 +118,6 @@ namespace hello_algo.chapter_tree
{
pre.right = child;
}
}
// 子结点数量 = 2
else
@ -179,4 +181,3 @@ namespace hello_algo.chapter_tree
PrintUtil.PrintTree(bst.getRoot());
}
}
}

4
codes/csharp/chapter_tree/binary_tree.cs
View file

@ -7,8 +7,7 @@
using hello_algo.include;
using NUnit.Framework;
namespace hello_algo.chapter_tree
{
namespace hello_algo.chapter_tree;
public class binary_tree
{
@ -43,4 +42,3 @@ namespace hello_algo.chapter_tree
PrintUtil.PrintTree(n1);
}
}
}

5
codes/csharp/chapter_tree/binary_tree_bfs.cs
View file

@ -7,8 +7,8 @@
using hello_algo.include;
using NUnit.Framework;
namespace hello_algo.chapter_tree
{
namespace hello_algo.chapter_tree;
public class binary_tree_bfs
{
@ -45,4 +45,3 @@ namespace hello_algo.chapter_tree
Console.WriteLine("\n层序遍历的结点打印序列 = " + string.Join(",", list.ToArray()));
}
}
}

5
codes/csharp/chapter_tree/binary_tree_dfs.cs
View file

@ -7,8 +7,8 @@
using hello_algo.include;
using NUnit.Framework;
namespace hello_algo.chapter_tree
{
namespace hello_algo.chapter_tree;
public class binary_tree_dfs
{
List<int> list = new();
@ -65,4 +65,3 @@ namespace hello_algo.chapter_tree
Console.WriteLine("\n后序遍历的结点打印序列 = " + string.Join(",", list.ToArray()));
}
}
}

2
codes/csharp/hello-algo.csproj
View file

@ -11,7 +11,7 @@
<ItemGroup>
<PackageReference Include="Microsoft.NET.Test.Sdk" Version="17.4.0" />
<PackageReference Include="NUnit" Version="3.13.3" />
<PackageReference Include="NUnit3TestAdapter" Version="4.0.0" />
<PackageReference Include="NUnit3TestAdapter" Version="4.3.1" />
<PackageReference Include="coverlet.collector" Version="3.1.0" />
</ItemGroup>

5
codes/csharp/include/ListNode.cs
View file

@ -2,8 +2,8 @@
// Created Time: 2022-12-16
// Author: mingXta (1195669834@qq.com)
namespace hello_algo.include
{
namespace hello_algo.include;
/// <summary>
/// Definition for a singly-linked list node
/// </summary>
@ -65,4 +65,3 @@ namespace hello_algo.include
return string.Join("->", list);
}
}
}

6
codes/csharp/include/PrintUtil.cs
View file

@ -4,8 +4,8 @@
* Author: haptear (haptear@hotmail.com)
*/
namespace hello_algo.include
{
namespace hello_algo.include;
public class Trunk
{
public Trunk? prev;
@ -120,5 +120,3 @@ namespace hello_algo.include
}
}
}
}

5
codes/csharp/include/TreeNode.cs
View file

@ -4,8 +4,8 @@
* Author: haptear (haptear@hotmail.com)
*/
namespace hello_algo.include
{
namespace hello_algo.include;
public class TreeNode
{
public int val; // 结点值
@ -95,4 +95,3 @@ namespace hello_algo.include
return left != null ? left : right;
}
}
}

75
docs/chapter_array_and_linkedlist/array.md
View file

@ -166,16 +166,7 @@ elementAddr = firtstElementAddr + elementLength * elementIndex
=== "C#"
```csharp title="array.cs"
/* 随机返回一个数组元素 */
int RandomAccess(int[] nums)
{
Random random=new();
// 在区间 [0, nums.Length) 中随机抽取一个数字
int randomIndex = random.Next(nums.Length);
// 获取并返回随机元素
int randomNum = nums[randomIndex];
return randomNum;
}
[class]{array}-[func]{randomAccess}
```
=== "Swift"
@ -256,19 +247,7 @@ elementAddr = firtstElementAddr + elementLength * elementIndex
=== "C#"
```csharp title="array.cs"
/* 扩展数组长度 */
int[] Extend(int[] nums, int enlarge)
{
// 初始化一个扩展长度后的数组
int[] res = new int[nums.Length + enlarge];
// 将原数组中的所有元素复制到新数组
for (int i = 0; i < nums.Length; i++)
{
res[i] = nums[i];
}
// 返回扩展后的新数组
return res;
}
[class]{array}-[func]{extend}
```
=== "Swift"
@ -373,26 +352,9 @@ elementAddr = firtstElementAddr + elementLength * elementIndex
=== "C#"
```csharp title="array.cs"
/* 在数组的索引 index 处插入元素 num */
void Insert(int[] nums, int num, int index)
{
// 把索引 index 以及之后的所有元素向后移动一位
for (int i = nums.Length - 1; i > index; i--)
{
nums[i] = nums[i - 1];
}
// 将 num 赋给 index 处元素
nums[index] = num;
}
/* 删除索引 index 处元素 */
void Remove(int[] nums, int index)
{
// 把索引 index 之后的所有元素向前移动一位
for (int i = index; i < nums.Length - 1; i++)
{
nums[i] = nums[i + 1];
}
}
[class]{array}-[func]{insert}
[class]{array}-[func]{remove}
```
=== "Swift"
@ -487,21 +449,7 @@ elementAddr = firtstElementAddr + elementLength * elementIndex
=== "C#"
```csharp title="array.cs"
/* 遍历数组 */
void Traverse(int[] nums)
{
int count = 0;
// 通过索引遍历数组
for (int i = 0; i < nums.Length; i++)
{
count++;
}
// 直接遍历数组
foreach (int num in nums)
{
count++;
}
}
[class]{array}-[func]{traverse}
```
=== "Swift"
@ -586,16 +534,7 @@ elementAddr = firtstElementAddr + elementLength * elementIndex
=== "C#"
```csharp title="array.cs"
/* 在数组中查找指定元素 */
int Find(int[] nums, int target)
{
for (int i = 0; i < nums.Length; i++)
{
if (nums[i] == target)
return i;
}
return -1;
}
[class]{array}-[func]{find}
```
=== "Swift"

45
docs/chapter_array_and_linkedlist/linked_list.md
View file

@ -435,24 +435,9 @@ comments: true
=== "C#"
```csharp title="linked_list.cs"
// 在链表的结点 n0 之后插入结点 P
void Insert(ListNode n0, ListNode P)
{
ListNode n1 = n0.next;
n0.next = P;
P.next = n1;
}
[class]{linked_list}-[func]{insert}
// 删除链表的结点 n0 之后的首个结点
void Remove(ListNode n0)
{
if (n0.next == null)
return;
// n0 -> P -> n1
ListNode P = n0.next;
ListNode n1 = P.next;
n0.next = n1;
}
[class]{linked_list}-[func]{remove}
```
=== "Swift"
@ -556,17 +541,7 @@ comments: true
=== "C#"
```csharp title="linked_list.cs"
// 访问链表中索引为 index 的结点
ListNode Access(ListNode head, int index)
{
for (int i = 0; i < index; i++)
{
if (head == null)
return null;
head = head.next;
}
return head;
}
[class]{linked_list}-[func]{access}
```
=== "Swift"
@ -652,19 +627,7 @@ comments: true
=== "C#"
```csharp title="linked_list.cs"
// 在链表中查找值为 target 的首个结点
int Find(ListNode head, int target)
{
int index = 0;
while (head != null)
{
if (head.val == target)
return index;
head = head.next;
index++;
}
return -1;
}
[class]{linked_list}-[func]{find}
```
=== "Swift"

98
docs/chapter_array_and_linkedlist/list.md
View file

@ -854,103 +854,7 @@ comments: true
=== "C#"
```csharp title="my_list.cs"
class MyList
{
private int[] nums; // 数组（存储列表元素）
private int capacity = 10; // 列表容量
private int size = 0; // 列表长度（即当前元素数量）
private int extendRatio = 2; // 每次列表扩容的倍数
/* 构造函数 */
public MyList()
{
nums = new int[capacity];
}
/* 获取列表长度（即当前元素数量）*/
public int Size()
{
return size;
}
/* 获取列表容量 */
public int Capacity()
{
return capacity;
}
/* 访问元素 */
public int Get(int index)
{
// 索引如果越界则抛出异常，下同
if (index < 0 || index >= size)
throw new IndexOutOfRangeException("索引越界");
return nums[index];
}
/* 更新元素 */
public void Set(int index, int num)
{
if (index < 0 || index >= size)
throw new IndexOutOfRangeException("索引越界");
nums[index] = num;
}
/* 尾部添加元素 */
public void Add(int num)
{
// 元素数量超出容量时，触发扩容机制
if (size == Capacity())
ExtendCapacity();
nums[size] = num;
// 更新元素数量
size++;
}
/* 中间插入元素 */
public void Insert(int index, int num)
{
if (index < 0 || index >= size)
throw new IndexOutOfRangeException("索引越界");
// 元素数量超出容量时，触发扩容机制
if (size == Capacity())
ExtendCapacity();
// 将索引 index 以及之后的元素都向后移动一位
for (int j = size - 1; j >= index; j--)
{
nums[j + 1] = nums[j];
}
nums[index] = num;
// 更新元素数量
size++;
}
/* 删除元素 */
public int Remove(int index)
{
if (index < 0 || index >= size)
throw new IndexOutOfRangeException("索引越界");
int num = nums[index];
// 将索引 index 之后的元素都向前移动一位
for (int j = index; j < size - 1; j++)
{
nums[j] = nums[j + 1];
}
// 更新元素数量
size--;
// 返回被删除元素
return num;
}
/* 列表扩容 */
public void ExtendCapacity()
{
// 新建一个长度为 size 的数组，并将原数组拷贝到新数组
System.Array.Resize(ref nums, Capacity() * extendRatio);
// 更新列表容量
capacity = nums.Length;
}
}
[class]{MyList}-[func]{}
```
=== "Swift"

84
docs/chapter_computational_complexity/space_complexity.md
View file

@ -641,25 +641,7 @@ $$
=== "C#"
```csharp title="space_complexity.cs"
/* 常数阶 */
void constant(int n)
{
// 常量、变量、对象占用 O(1) 空间
int a = 0;
int b = 0;
int[] nums = new int[10000];
ListNode node = new ListNode(0);
// 循环中的变量占用 O(1) 空间
for (int i = 0; i < n; i++)
{
int c = 0;
}
// 循环中的函数占用 O(1) 空间
for (int i = 0; i < n; i++)
{
function();
}
}
[class]{space_complexity}-[func]{constant}
```
=== "Swift"
@ -759,24 +741,7 @@ $$
=== "C#"
```csharp title="space_complexity.cs"
/* 线性阶 */
void linear(int n)
{
// 长度为 n 的数组占用 O(n) 空间
int[] nums = new int[n];
// 长度为 n 的列表占用 O(n) 空间
List<ListNode> nodes = new();
for (int i = 0; i < n; i++)
{
nodes.Add(new ListNode(i));
}
// 长度为 n 的哈希表占用 O(n) 空间
Dictionary<int, String> map = new();
for (int i = 0; i < n; i++)
{
map.Add(i, i.ToString());
}
}
[class]{space_complexity}-[func]{linear}
```
=== "Swift"
@ -866,13 +831,7 @@ $$
=== "C#"
```csharp title="space_complexity.cs"
/* 线性阶（递归实现） */
void linearRecur(int n)
{
Console.WriteLine("递归 n = " + n);
if (n == 1) return;
linearRecur(n - 1);
}
[class]{space_complexity}-[func]{linearRecur}
```
=== "Swift"
@ -952,23 +911,7 @@ $$
=== "C#"
```csharp title="space_complexity.cs"
/* 平方阶 */
void quadratic(int n)
{
// 矩阵占用 O(n^2) 空间
int[,] numMatrix = new int[n, n];
// 二维列表占用 O(n^2) 空间
List<List<int>> numList = new();
for (int i = 0; i < n; i++)
{
List<int> tmp = new();
for (int j = 0; j < n; j++)
{
tmp.Add(0);
}
numList.Add(tmp);
}
}
[class]{space_complexity}-[func]{quadratic}
```
=== "Swift"
@ -1053,14 +996,7 @@ $$
=== "C#"
```csharp title="space_complexity.cs"
/* 平方阶（递归实现） */
int quadraticRecur(int n)
{
if (n <= 0) return 0;
// 数组 nums 长度为 n, n-1, ..., 2, 1
int[] nums = new int[n];
return quadraticRecur(n - 1);
}
[class]{space_complexity}-[func]{quadraticRecur}
```
=== "Swift"
@ -1143,15 +1079,7 @@ $$
=== "C#"
```csharp title="space_complexity.cs"
/* 指数阶（建立满二叉树） */
TreeNode? buildTree(int n)
{
if (n == 0) return null;
TreeNode root = new TreeNode(0);
root.left = buildTree(n - 1);
root.right = buildTree(n - 1);
return root;
}
[class]{space_complexity}-[func]{buildTree}
```
=== "Swift"

38
docs/chapter_computational_complexity/space_time_tradeoff.md
View file

@ -86,23 +86,7 @@ comments: true
=== "C#"
```csharp title="leetcode_two_sum.cs"
class SolutionBruteForce
{
public int[] twoSum(int[] nums, int target)
{
int size = nums.Length;
// 两层循环，时间复杂度 O(n^2)
for (int i = 0; i < size - 1; i++)
{
for (int j = i + 1; j < size; j++)
{
if (nums[i] + nums[j] == target)
return new int[] { i, j };
}
}
return new int[0];
}
}
[class]{leetcode_two_sum}-[func]{twoSumBruteForce}
```
=== "Swift"
@ -195,25 +179,7 @@ comments: true
=== "C#"
```csharp title="leetcode_two_sum.cs"
class SolutionHashMap
{
public int[] twoSum(int[] nums, int target)
{
int size = nums.Length;
// 辅助哈希表，空间复杂度 O(n)
Dictionary<int, int> dic = new();
// 单层循环，时间复杂度 O(n)
for (int i = 0; i < size; i++)
{
if (dic.ContainsKey(target - nums[i]))
{
return new int[] { dic[target - nums[i]], i };
}
dic.Add(nums[i], i);
}
return new int[0];
}
}
[class]{leetcode_two_sum}-[func]{twoSumHashTable}
```
=== "Swift"

174
docs/chapter_computational_complexity/time_complexity.md
View file

@ -854,15 +854,7 @@ $$
=== "C#"
```csharp title="time_complexity.cs"
/* 常数阶 */
int constant(int n)
{
int count = 0;
int size = 100000;
for (int i = 0; i < size; i++)
count++;
return count;
}
[class]{time_complexity}-[func]{constant}
```
=== "Swift"
@ -950,14 +942,7 @@ $$
=== "C#"
```csharp title="time_complexity.cs"
/* 线性阶 */
int linear(int n)
{
int count = 0;
for (int i = 0; i < n; i++)
count++;
return count;
}
[class]{time_complexity}-[func]{linear}
```
=== "Swift"
@ -1047,17 +1032,7 @@ $$
=== "C#"
```csharp title="time_complexity.cs"
/* 线性阶（遍历数组） */
int arrayTraversal(int[] nums)
{
int count = 0;
// 循环次数与数组长度成正比
foreach(int num in nums)
{
count++;
}
return count;
}
[class]{time_complexity}-[func]{arrayTraversal}
```
=== "Swift"
@ -1149,20 +1124,7 @@ $$
=== "C#"
```csharp title="time_complexity.cs"
/* 平方阶 */
int quadratic(int n)
{
int count = 0;
// 循环次数与数组长度成平方关系
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
{
count++;
}
}
return count;
}
[class]{time_complexity}-[func]{quadratic}
```
=== "Swift"
@ -1280,29 +1242,7 @@ $$
=== "C#"
```csharp title="time_complexity.cs"
/* 平方阶（冒泡排序） */
int bubbleSort(int[] nums)
{
int count = 0; // 计数器
// 外循环：待排序元素数量为 n-1, n-2, ..., 1
for (int i = nums.Length - 1; i > 0; i--)
{
// 内循环：冒泡操作
for (int j = 0; j < i; j++)
{
if (nums[j] > nums[j + 1])
{
// 交换 nums[j] 与 nums[j + 1]
int tmp = nums[j];
nums[j] = nums[j + 1];
nums[j + 1] = tmp;
count += 3; // 元素交换包含 3 个单元操作
}
}
}
return count;
}
[class]{time_complexity}-[func]{bubbleSort}
```
=== "Swift"
@ -1414,22 +1354,7 @@ $$
=== "C#"
```csharp title="time_complexity.cs"
/* 指数阶（循环实现） */
int exponential(int n)
{
int count = 0, bas = 1;
// cell 每轮一分为二，形成数列 1, 2, 4, 8, ..., 2^(n-1)
for (int i = 0; i < n; i++)
{
for (int j = 0; j < bas; j++)
{
count++;
}
bas *= 2;
}
// count = 1 + 2 + 4 + 8 + .. + 2^(n-1) = 2^n - 1
return count;
}
[class]{time_complexity}-[func]{exponential}
```
=== "Swift"
@ -1520,12 +1445,7 @@ $$
=== "C#"
```csharp title="time_complexity.cs"
/* 指数阶（递归实现） */
int expRecur(int n)
{
if (n == 1) return 1;
return expRecur(n - 1) + expRecur(n - 1) + 1;
}
[class]{time_complexity}-[func]{expRecur}
```
=== "Swift"
@ -1613,17 +1533,7 @@ $$
=== "C#"
```csharp title="time_complexity.cs"
/* 对数阶（循环实现） */
int logarithmic(float n)
{
int count = 0;
while (n > 1)
{
n = n / 2;
count++;
}
return count;
}
[class]{time_complexity}-[func]{logarithmic}
```
=== "Swift"
@ -1710,12 +1620,7 @@ $$
=== "C#"
```csharp title="time_complexity.cs"
/* 对数阶（递归实现） */
int logRecur(float n)
{
if (n <= 1) return 0;
return logRecur(n / 2) + 1;
}
[class]{time_complexity}-[func]{logRecur}
```
=== "Swift"
@ -1806,18 +1711,7 @@ $$
=== "C#"
```csharp title="time_complexity.cs"
/* 线性对数阶 */
int linearLogRecur(float n)
{
if (n <= 1) return 1;
int count = linearLogRecur(n / 2) +
linearLogRecur(n / 2);
for (int i = 0; i < n; i++)
{
count++;
}
return count;
}
[class]{time_complexity}-[func]{linearLogRecur}
```
=== "Swift"
@ -1921,18 +1815,7 @@ $$
=== "C#"
```csharp title="time_complexity.cs"
/* 阶乘阶（递归实现） */
int factorialRecur(int n)
{
if (n == 0) return 1;
int count = 0;
// 从 1 个分裂出 n 个
for (int i = 0; i < n; i++)
{
count += factorialRecur(n - 1);
}
return count;
}
[class]{time_complexity}-[func]{factorialRecur}
```
=== "Swift"
@ -2146,40 +2029,9 @@ $$
=== "C#"
```csharp title="worst_best_time_complexity.cs"
/* 生成一个数组，元素为 { 1, 2, ..., n }，顺序被打乱 */
int[] randomNumbers(int n)
{
int[] nums = new int[n];
// 生成数组 nums = { 1, 2, 3, ..., n }
for (int i = 0; i < n; i++)
{
nums[i] = i + 1;
}
[class]{worst_best_time_complexity}-[func]{randomNumbers}
// 随机打乱数组元素
for (int i = 0; i < nums.Length; i++)
{
var index = new Random().Next(i, nums.Length);
var tmp = nums[i];
var ran = nums[index];
nums[i] = ran;
nums[index] = tmp;
}
return nums;
}
/* 查找数组 nums 中数字 1 所在索引 */
int findOne(int[] nums)
{
for (int i = 0; i < nums.Length; i++)
{
// 当元素 1 在数组头部时，达到最佳时间复杂度 O(1)
// 当元素 1 在数组尾部时，达到最差时间复杂度 O(n)
if (nums[i] == 1)
return i;
}
return -1;
}
[class]{worst_best_time_complexity}-[func]{findOne}
```
=== "Swift"

4
docs/chapter_graph/graph_operations.md
View file

@ -160,7 +160,7 @@ comments: true
=== "C#"
```csharp title="graph_adjacency_matrix.cs"
[class]{GraphAdjMat}-[func]{}
```
=== "Swift"
@ -409,7 +409,9 @@ comments: true
=== "C#"
```csharp title="graph_adjacency_list.cs"
[class]{Vertex}-[func]{}
[class]{GraphAdjList}-[func]{}
```
=== "Swift"

55
docs/chapter_hashing/hash_map.md
View file

@ -513,60 +513,9 @@ $$
=== "C#"
```csharp title="array_hash_map.cs"
/* 键值对 int->String */
class Entry
{
public int key;
public String val;
public Entry(int key, String val)
{
this.key = key;
this.val = val;
}
}
[class]{Entry}-[func]{}
/* 基于数组简易实现的哈希表 */
class ArrayHashMap
{
private List<Entry?> bucket;
public ArrayHashMap()
{
// 初始化一个长度为 100 的桶（数组）
bucket = new ();
for (int i = 0; i < 100; i++)
{
bucket.Add(null);
}
}
/* 哈希函数 */
private int hashFunc(int key)
{
int index = key % 100;
return index;
}
/* 查询操作 */
public String? get(int key)
{
int index = hashFunc(key);
Entry? pair = bucket[index];
if (pair == null) return null;
return pair.val;
}
/* 添加操作 */
public void put(int key, String val)
{
Entry pair = new Entry(key, val);
int index = hashFunc(key);
bucket[index]=pair;
}
/* 删除操作 */
public void remove(int key)
{
int index = hashFunc(key);
// 置为 null ，代表删除
bucket[index]=null;
}
}
[class]{ArrayHashMap}-[func]{}
```
=== "Swift"

12
docs/chapter_heap/heap.md
View file

@ -344,7 +344,11 @@ comments: true
=== "C#"
```csharp title="my_heap.cs"
[class]{MaxHeap}-[func]{left}
[class]{MaxHeap}-[func]{right}
[class]{MaxHeap}-[func]{parent}
```
=== "Swift"
@ -415,7 +419,7 @@ comments: true
=== "C#"
```csharp title="my_heap.cs"
[class]{MaxHeap}-[func]{peek}
```
=== "Swift"
@ -531,7 +535,9 @@ comments: true
=== "C#"
```csharp title="my_heap.cs"
[class]{MaxHeap}-[func]{push}
[class]{MaxHeap}-[func]{siftUp}
```
=== "Swift"
@ -682,7 +688,9 @@ comments: true
=== "C#"
```csharp title="my_heap.cs"
[class]{MaxHeap}-[func]{poll}
[class]{MaxHeap}-[func]{siftDown}
```
=== "Swift"
@ -759,7 +767,7 @@ comments: true
=== "C#"
```csharp title="my_heap.cs"
[class]{MaxHeap}-[func]{MaxHeap}
```
=== "Swift"

40
docs/chapter_searching/binary_search.md
View file

@ -113,25 +113,7 @@ $$
=== "C#"
```csharp title="binary_search.cs"
/* 二分查找（双闭区间） */
int binarySearch(int[] nums, int target)
{
// 初始化双闭区间 [0, n-1] ，即 i, j 分别指向数组首元素、尾元素
int i = 0, j = nums.Length - 1;
// 循环，当搜索区间为空时跳出（当 i > j 时为空）
while (i <= j)
{
int m = (i + j) / 2; // 计算中点索引 m
if (nums[m] < target) // 此情况说明 target 在区间 [m+1, j] 中
i = m + 1;
else if (nums[m] > target) // 此情况说明 target 在区间 [i, m-1] 中
j = m - 1;
else // 找到目标元素，返回其索引
return m;
}
// 未找到目标元素，返回 -1
return -1;
}
[class]{binary_search}-[func]{binarySearch}
```
=== "Swift"
@ -212,25 +194,7 @@ $$
=== "C#"
```csharp title="binary_search.cs"
/* 二分查找（左闭右开） */
int binarySearch1(int[] nums, int target)
{
// 初始化左闭右开 [0, n) ，即 i, j 分别指向数组首元素、尾元素+1
int i = 0, j = nums.Length;
// 循环，当搜索区间为空时跳出（当 i = j 时为空）
while (i < j)
{
int m = (i + j) / 2; // 计算中点索引 m
if (nums[m] < target) // 此情况说明 target 在区间 [m+1, j) 中
i = m + 1;
else if (nums[m] > target) // 此情况说明 target 在区间 [i, m) 中
j = m;
else // 找到目标元素，返回其索引
return m;
}
// 未找到目标元素，返回 -1
return -1;
}
[class]{binary_search}-[func]{binarySearch1}
```
=== "Swift"

17
docs/chapter_searching/hashing_search.md
View file

@ -70,13 +70,7 @@ comments: true
=== "C#"
```csharp title="hashing_search.cs"
/* 哈希查找（数组） */
int hashingSearchArray(Dictionary<int, int> map, int target)
{
// 哈希表的 key: 目标元素，value: 索引
// 若哈希表中无此 key ，返回 -1
return map.GetValueOrDefault(target, -1);
}
[class]{hashing_search}-[func]{hashingSearchArray}
```
=== "Swift"
@ -149,14 +143,7 @@ comments: true
=== "C#"
```csharp title="hashing_search.cs"
/* 哈希查找（链表） */
ListNode? hashingSearchLinkedList(Dictionary<int, ListNode> map, int target)
{
// 哈希表的 key: 目标结点值，value: 结点对象
// 若哈希表中无此 key ，返回 null
return map.GetValueOrDefault(target);
}
[class]{hashing_search}-[func]{hashingSearchLinkedList}
```
=== "Swift"

30
docs/chapter_searching/linear_search.md
View file

@ -68,20 +68,7 @@ comments: true
=== "C#"
```csharp title="linear_search.cs"
/* 线性查找（数组） */
int linearSearchArray(int[] nums, int target)
{
// 遍历数组
for (int i = 0; i < nums.Length; i++)
{
// 找到目标元素，返回其索引
if (nums[i] == target)
return i;
}
// 未找到目标元素，返回 -1
return -1;
}
[class]{linear_search}-[func]{linearSearchArray}
```
=== "Swift"
@ -155,20 +142,7 @@ comments: true
=== "C#"
```csharp title="linear_search.cs"
/* 线性查找（链表） */
ListNode? linearSearchLinkedList(ListNode head, int target)
{
// 遍历链表
while (head != null)
{
// 找到目标结点，返回之
if (head.val == target)
return head;
head = head.next;
}
// 未找到目标结点，返回 null
return null;
}
[class]{linear_search}-[func]{linearSearchLinkedList}
```
=== "Swift"

43
docs/chapter_sorting/bubble_sort.md
View file

@ -120,25 +120,7 @@ comments: true
=== "C#"
```csharp title="bubble_sort.cs"
/* 冒泡排序 */
void bubbleSort(int[] nums)
{
// 外循环：待排序元素数量为 n-1, n-2, ..., 1
for (int i = nums.Length - 1; i > 0; i--)
{
// 内循环：冒泡操作
for (int j = 0; j < i; j++)
{
if (nums[j] > nums[j + 1])
{
// 交换 nums[j] 与 nums[j + 1]
int tmp = nums[j];
nums[j] = nums[j + 1];
nums[j + 1] = tmp;
}
}
}
}
[class]{bubble_sort}-[func]{bubbleSort}
```
=== "Swift"
@ -252,28 +234,7 @@ comments: true
=== "C#"
```csharp title="bubble_sort.cs"
/* 冒泡排序（标志优化）*/
void bubbleSortWithFlag(int[] nums)
{
// 外循环：待排序元素数量为 n-1, n-2, ..., 1
for (int i = nums.Length - 1; i > 0; i--)
{
bool flag = false; // 初始化标志位
// 内循环：冒泡操作
for (int j = 0; j < i; j++)
{
if (nums[j] > nums[j + 1])
{
// 交换 nums[j] 与 nums[j + 1]
int tmp = nums[j];
nums[j] = nums[j + 1];
nums[j + 1] = tmp;
flag = true; // 记录交换元素
}
}
if (!flag) break; // 此轮冒泡未交换任何元素，直接跳出
}
}
[class]{bubble_sort}-[func]{bubbleSortWithFlag}
```
=== "Swift"

17
docs/chapter_sorting/insertion_sort.md
View file

@ -98,22 +98,7 @@ comments: true
=== "C#"
```csharp title="insertion_sort.cs"
/* 插入排序 */
void insertionSort(int[] nums)
{
// 外循环：base = nums[1], nums[2], ..., nums[n-1]
for (int i = 1; i < nums.Length; i++)
{
int bas = nums[i], j = i - 1;
// 内循环：将 base 插入到左边的正确位置
while (j >= 0 && nums[j] > bas)
{
nums[j + 1] = nums[j]; // 1. 将 nums[j] 向右移动一位
j--;
}
nums[j + 1] = bas; // 2. 将 base 赋值到正确位置
}
}
[class]{insertion_sort}-[func]{insertionSort}
```
=== "Swift"

41
docs/chapter_sorting/merge_sort.md
View file

@ -264,46 +264,9 @@ comments: true
=== "C#"
```csharp title="merge_sort.cs"
/* 合并左子数组和右子数组 */
// 左子数组区间 [left, mid]
// 右子数组区间 [mid + 1, right]
void merge(int[] nums, int left, int mid, int right)
{
// 初始化辅助数组
int[] tmp = nums[left..(right + 1)];
// 左子数组的起始索引和结束索引
int leftStart = left - left, leftEnd = mid - left;
// 右子数组的起始索引和结束索引
int rightStart = mid + 1 - left, rightEnd = right - left;
// i, j 分别指向左子数组、右子数组的首元素
int i = leftStart, j = rightStart;
// 通过覆盖原数组 nums 来合并左子数组和右子数组
for (int k = left; k <= right; k++)
{
// 若“左子数组已全部合并完”，则选取右子数组元素，并且 j++
if (i > leftEnd)
nums[k] = tmp[j++];
// 否则，若“右子数组已全部合并完”或“左子数组元素 <= 右子数组元素”，则选取左子数组元素，并且 i++
else if (j > rightEnd || tmp[i] <= tmp[j])
nums[k] = tmp[i++];
// 否则，若“左右子数组都未全部合并完”且“左子数组元素 > 右子数组元素”，则选取右子数组元素，并且 j++
else
nums[k] = tmp[j++];
}
}
[class]{merge_sort}-[func]{merge}
/* 归并排序 */
void mergeSort(int[] nums, int left, int right)
{
// 终止条件
if (left >= right) return; // 当子数组长度为 1 时终止递归
// 划分阶段
int mid = (left + right) / 2; // 计算中点
mergeSort(nums, left, mid); // 递归左子数组
mergeSort(nums, mid + 1, right); // 递归右子数组
// 合并阶段
merge(nums, left, mid, right);
}
[class]{merge_sort}-[func]{mergeSort}
```
=== "Swift"

85
docs/chapter_sorting/quick_sort.md
View file

@ -113,30 +113,9 @@ comments: true
=== "C#"
```csharp title="quick_sort.cs"
/* 元素交换 */
void swap(int[] nums, int i, int j)
{
int tmp = nums[i];
nums[i] = nums[j];
nums[j] = tmp;
}
[class]{QuickSort}-[func]{swap}
/* 哨兵划分 */
int partition(int[] nums, int left, int right)
{
// 以 nums[left] 作为基准数
int i = left, j = right;
while (i < j)
{
while (i < j && nums[j] >= nums[left])
j--; // 从右向左找首个小于基准数的元素
while (i < j && nums[i] <= nums[left])
i++; // 从左向右找首个大于基准数的元素
swap(nums, i, j); // 交换这两个元素
}
swap(nums, i, left); // 将基准数交换至两子数组的分界线
return i; // 返回基准数的索引
}
[class]{QuickSort}-[func]{partition}
```
=== "Swift"
@ -225,19 +204,7 @@ comments: true
=== "C#"
```csharp title="quick_sort.cs"
/* 快速排序 */
void quickSort(int[] nums, int left, int right)
{
// 子数组长度为 1 时终止递归
if (left >= right)
return;
// 哨兵划分
int pivot = partition(nums, left, right);
// 递归左子数组、右子数组
quickSort(nums, left, pivot - 1);
quickSort(nums, pivot + 1, right);
}
[class]{QuickSort}-[func]{quickSort}
```
=== "Swift"
@ -355,29 +322,9 @@ comments: true
=== "C#"
```csharp title="quick_sort.cs"
/* 选取三个元素的中位数 */
int medianThree(int[] nums, int left, int mid, int right)
{
// 使用了异或操作来简化代码
// 异或规则为 0 ^ 0 = 1 ^ 1 = 0, 0 ^ 1 = 1 ^ 0 = 1
if ((nums[left] < nums[mid]) ^ (nums[left] < nums[right]))
return left;
else if ((nums[mid] < nums[left]) ^ (nums[mid] < nums[right]))
return mid;
else
return right;
}
[class]{QuickSortMedian}-[func]{medianThree}
/* 哨兵划分（三数取中值） */
int partition(int[] nums, int left, int right)
{
// 选取三个候选元素的中位数
int med = medianThree(nums, left, (left + right) / 2, right);
// 将中位数交换至数组最左端
swap(nums, left, med);
// 以 nums[left] 作为基准数
// 下同省略...
}
[class]{QuickSortMedian}-[func]{partition}
```
=== "Swift"
@ -460,27 +407,7 @@ comments: true
=== "C#"
```csharp title="quick_sort.cs"
/* 快速排序（尾递归优化） */
void quickSort(int[] nums, int left, int right)
{
// 子数组长度为 1 时终止
while (left < right)
{
// 哨兵划分操作
int pivot = partition(nums, left, right);
// 对两个子数组中较短的那个执行快排
if (pivot - left < right - pivot)
{
quickSort(nums, left, pivot - 1); // 递归排序左子数组
left = pivot + 1; // 剩余待排序区间为 [pivot + 1, right]
}
else
{
quickSort(nums, pivot + 1, right); // 递归排序右子数组
right = pivot - 1; // 剩余待排序区间为 [left, pivot - 1]
}
}
}
[class]{QuickSortTailCall}-[func]{quickSort}
```
=== "Swift"

2
docs/chapter_stack_and_queue/deque.md
View file

@ -607,7 +607,9 @@ comments: true
=== "C#"
```csharp title="linkedlist_deque.cs"
[class]{ListNode}-[func]{}
[class]{LinkedListDeque}-[func]{}
```
=== "Swift"

123
docs/chapter_stack_and_queue/queue.md
View file

@ -371,62 +371,7 @@ comments: true
=== "C#"
```csharp title="linkedlist_queue.cs"
/* 基于链表实现的队列 */
class LinkedListQueue
{
private ListNode? front, rear; // 头结点 front ，尾结点 rear
private int queSize = 0;
public LinkedListQueue()
{
front = null;
rear = null;
}
/* 获取队列的长度 */
public int size()
{
return queSize;
}
/* 判断队列是否为空 */
public bool isEmpty()
{
return size() == 0;
}
/* 入队 */
public void push(int num)
{
// 尾结点后添加 num
ListNode node = new ListNode(num);
// 如果队列为空，则令头、尾结点都指向该结点
if (front == null)
{
front = node;
rear = node;
// 如果队列不为空，则将该结点添加到尾结点后
}
else if (rear != null)
{
rear.next = node;
rear = node;
}
queSize++;
}
/* 出队 */
public int poll()
{
int num = peek();
// 删除头结点
front = front?.next;
queSize--;
return num;
}
/* 访问队首元素 */
public int peek()
{
if (size() == 0 || front == null)
throw new Exception();
return front.val;
}
}
[class]{LinkedListQueue}-[func]{}
```
=== "Swift"
@ -570,71 +515,7 @@ comments: true
=== "C#"
```csharp title="array_queue.cs"
/* 基于环形数组实现的队列 */
class ArrayQueue
{
private int[] nums; // 用于存储队列元素的数组
private int front; // 队首指针，指向队首元素
private int queSize; // 队列长度
public ArrayQueue(int capacity)
{
nums = new int[capacity];
front = queSize = 0;
}
/* 获取队列的容量 */
public int capacity()
{
return nums.Length;
}
/* 获取队列的长度 */
public int size()
{
return queSize;
}
/* 判断队列是否为空 */
public bool isEmpty()
{
return queSize == 0;
}
/* 入队 */
public void push(int num)
{
if (queSize == capacity())
{
Console.WriteLine("队列已满");
return;
}
// 计算尾指针，指向队尾索引 + 1
// 通过取余操作，实现 rear 越过数组尾部后回到头部
int rear = (front + queSize) % capacity();
// 尾结点后添加 num
nums[rear] = num;
queSize++;
}
/* 出队 */
public int poll()
{
int num = peek();
// 队首指针向后移动一位，若越过尾部则返回到数组头部
front = (front + 1) % capacity();
queSize--;
return num;
}
/* 访问队首元素 */
public int peek()
{
if (isEmpty())
throw new Exception();
return nums[front];
}
}
[class]{ArrayQueue}-[func]{}
```
=== "Swift"

86
docs/chapter_stack_and_queue/stack.md
View file

@ -374,49 +374,7 @@ comments: true
=== "C#"
```csharp title="linkedlist_stack.cs"
/* 基于链表实现的栈 */
class LinkedListStack
{
private ListNode stackPeek; // 将头结点作为栈顶
private int stkSize = 0; // 栈的长度
public LinkedListStack()
{
stackPeek = null;
}
/* 获取栈的长度 */
public int size()
{
return stkSize;
}
/* 判断栈是否为空 */
public bool isEmpty()
{
return size() == 0;
}
/* 入栈 */
public void push(int num)
{
ListNode node = new ListNode(num);
node.next = stackPeek;
stackPeek = node;
stkSize++;
}
/* 出栈 */
public int pop()
{
int num = peek();
stackPeek = stackPeek?.next;
stkSize--;
return num;
}
/* 访问栈顶元素 */
public int peek()
{
if (size() == 0)
throw new Exception();
return stackPeek.val;
}
}
[class]{LinkedListStack}-[func]{}
```
=== "Swift"
@ -537,47 +495,7 @@ comments: true
=== "C#"
```csharp title="array_stack.cs"
/* 基于数组实现的栈 */
class ArrayStack
{
private List<int> stack;
public ArrayStack()
{
// 初始化列表（动态数组）
stack = new();
}
/* 获取栈的长度 */
public int size()
{
return stack.Count();
}
/* 判断栈是否为空 */
public bool isEmpty()
{
return size() == 0;
}
/* 入栈 */
public void push(int num)
{
stack.Add(num);
}
/* 出栈 */
public int pop()
{
if (isEmpty())
throw new Exception();
var val = peek();
stack.RemoveAt(size() - 1);
return val;
}
/* 访问栈顶元素 */
public int peek()
{
if (isEmpty())
throw new Exception();
return stack[size() - 1];
}
}
[class]{ArrayStack}-[func]{}
```
=== "Swift"

162
docs/chapter_tree/avl_tree.md
View file

@ -253,19 +253,9 @@ G. M. Adelson-Velsky 和 E. M. Landis 在其 1962 年发表的论文 "An algorit
=== "C#"
```csharp title="avl_tree.cs"
/* 获取结点高度 */
public int height(TreeNode? node)
{
// 空结点高度为 -1 ，叶结点高度为 0
return node == null ? -1 : node.height;
}
[class]{AVLTree}-[func]{height}
/* 更新结点高度 */
private void updateHeight(TreeNode node)
{
// 结点高度等于最高子树高度 + 1
node.height = Math.Max(height(node.left), height(node.right)) + 1;
}
[class]{AVLTree}-[func]{updateHeight}
```
=== "Swift"
@ -349,14 +339,7 @@ G. M. Adelson-Velsky 和 E. M. Landis 在其 1962 年发表的论文 "An algorit
=== "C#"
```csharp title="avl_tree.cs"
/* 获取平衡因子 */
public int balanceFactor(TreeNode? node)
{
// 空结点平衡因子为 0
if (node == null) return 0;
// 结点平衡因子 = 左子树高度 - 右子树高度
return height(node.left) - height(node.right);
}
[class]{AVLTree}-[func]{balanceFactor}
```
=== "Swift"
@ -460,20 +443,7 @@ AVL 树的独特之处在于「旋转 Rotation」的操作，其可 **在不影
=== "C#"
```csharp title="avl_tree.cs"
/* 右旋操作 */
TreeNode? rightRotate(TreeNode? node)
{
TreeNode? child = node.left;
TreeNode? grandChild = child?.right;
// 以 child 为原点，将 node 向右旋转
child.right = node;
node.left = grandChild;
// 更新结点高度
updateHeight(node);
updateHeight(child);
// 返回旋转后子树的根结点
return child;
}
[class]{AVLTree}-[func]{rightRotate}
```
=== "Swift"
@ -559,20 +529,7 @@ AVL 树的独特之处在于「旋转 Rotation」的操作，其可 **在不影
=== "C#"
```csharp title="avl_tree.cs"
/* 左旋操作 */
TreeNode? leftRotate(TreeNode? node)
{
TreeNode? child = node.right;
TreeNode? grandChild = child?.left;
// 以 child 为原点，将 node 向左旋转
child.left = node;
node.right = grandChild;
// 更新结点高度
updateHeight(node);
updateHeight(child);
// 返回旋转后子树的根结点
return child;
}
[class]{AVLTree}-[func]{leftRotate}
```
=== "Swift"
@ -694,44 +651,7 @@ AVL 树的独特之处在于「旋转 Rotation」的操作，其可 **在不影
=== "C#"
```csharp title="avl_tree.cs"
/* 执行旋转操作，使该子树重新恢复平衡 */
TreeNode? rotate(TreeNode? node)
{
// 获取结点 node 的平衡因子
int balanceFactorInt = balanceFactor(node);
// 左偏树
if (balanceFactorInt > 1)
{
if (balanceFactor(node.left) >= 0)
{
// 右旋
return rightRotate(node);
}
else
{
// 先左旋后右旋
node.left = leftRotate(node?.left);
return rightRotate(node);
}
}
// 右偏树
if (balanceFactorInt < -1)
{
if (balanceFactor(node.right) <= 0)
{
// 左旋
return leftRotate(node);
}
else
{
// 先右旋后左旋
node.right = rightRotate(node?.right);
return leftRotate(node);
}
}
// 平衡树，无需旋转，直接返回
return node;
}
[class]{AVLTree}-[func]{rotate}
```
=== "Swift"
@ -889,30 +809,9 @@ AVL 树的独特之处在于「旋转 Rotation」的操作，其可 **在不影
=== "C#"
```csharp title="avl_tree.cs"
/* 插入结点 */
public TreeNode? insert(int val)
{
root = insertHelper(root, val);
return root;
}
[class]{AVLTree}-[func]{insert}
/* 递归插入结点（辅助函数） */
private TreeNode? insertHelper(TreeNode? node, int val)
{
if (node == null) return new TreeNode(val);
/* 1. 查找插入位置，并插入结点 */
if (val < node.val)
node.left = insertHelper(node.left, val);
else if (val > node.val)
node.right = insertHelper(node.right, val);
else
return node; // 重复结点不插入，直接返回
updateHeight(node); // 更新结点高度
/* 2. 执行旋转操作，使该子树重新恢复平衡 */
node = rotate(node);
// 返回子树的根结点
return node;
}
[class]{AVLTree}-[func]{insertHelper}
```
=== "Swift"
@ -1186,48 +1085,11 @@ AVL 树的独特之处在于「旋转 Rotation」的操作，其可 **在不影
=== "C#"
```csharp title="avl_tree.cs"
/* 删除结点 */
public TreeNode? remove(int val)
{
root = removeHelper(root, val);
return root;
}
[class]{AVLTree}-[func]{remove}
/* 递归删除结点（辅助函数） */
private TreeNode? removeHelper(TreeNode? node, int val)
{
if (node == null) return null;
/* 1. 查找结点，并删除之 */
if (val < node.val)
node.left = removeHelper(node.left, val);
else if (val > node.val)
node.right = removeHelper(node.right, val);
else
{
if (node.left == null || node.right == null)
{
TreeNode? child = node.left != null ? node.left : node.right;
// 子结点数量 = 0 ，直接删除 node 并返回
if (child == null)
return null;
// 子结点数量 = 1 ，直接删除 node
else
node = child;
}
else
{
// 子结点数量 = 2 ，则将中序遍历的下个结点删除，并用该结点替换当前结点
TreeNode? temp = getInOrderNext(node.right);
node.right = removeHelper(node.right, temp.val);
node.val = temp.val;
}
}
updateHeight(node); // 更新结点高度
/* 2. 执行旋转操作，使该子树重新恢复平衡 */
node = rotate(node);
// 返回子树的根结点
return node;
}
[class]{AVLTree}-[func]{removeHelper}
[class]{AVLTree}-[func]{getInOrderNext}
```
=== "Swift"

109
docs/chapter_tree/binary_search_tree.md
View file

@ -98,23 +98,7 @@ comments: true
=== "C#"
```csharp title="binary_search_tree.cs"
/* 查找结点 */
TreeNode? search(int num)
{
TreeNode? cur = root;
// 循环查找，越过叶结点后跳出
while (cur != null)
{
// 目标结点在 cur 的右子树中
if (cur.val < num) cur = cur.right;
// 目标结点在 cur 的左子树中
else if (cur.val > num) cur = cur.left;
// 找到目标结点，跳出循环
else break;
}
// 返回目标结点
return cur;
}
[class]{BinarySearchTree}-[func]{search}
```
=== "Swift"
@ -214,33 +198,7 @@ comments: true
=== "C#"
```csharp title="binary_search_tree.cs"
/* 插入结点 */
TreeNode? insert(int num)
{
// 若树为空，直接提前返回
if (root == null) return null;
TreeNode? cur = root, pre = null;
// 循环查找，越过叶结点后跳出
while (cur != null)
{
// 找到重复结点，直接返回
if (cur.val == num) return null;
pre = cur;
// 插入位置在 cur 的右子树中
if (cur.val < num) cur = cur.right;
// 插入位置在 cur 的左子树中
else cur = cur.left;
}
// 插入结点 val
TreeNode node = new TreeNode(num);
if (pre != null)
{
if (pre.val < num) pre.right = node;
else pre.left = node;
}
return node;
}
[class]{BinarySearchTree}-[func]{insert}
```
=== "Swift"
@ -411,68 +369,9 @@ comments: true
=== "C#"
```csharp title="binary_search_tree.cs"
/* 删除结点 */
TreeNode? remove(int num)
{
// 若树为空，直接提前返回
if (root == null) return null;
TreeNode? cur = root, pre = null;
// 循环查找，越过叶结点后跳出
while (cur != null)
{
// 找到待删除结点，跳出循环
if (cur.val == num) break;
pre = cur;
// 待删除结点在 cur 的右子树中
if (cur.val < num) cur = cur.right;
// 待删除结点在 cur 的左子树中
else cur = cur.left;
}
// 若无待删除结点，则直接返回
if (cur == null || pre == null) return null;
// 子结点数量 = 0 or 1
if (cur.left == null || cur.right == null)
{
// 当子结点数量 = 0 / 1 时， child = null / 该子结点
TreeNode? child = cur.left != null ? cur.left : cur.right;
// 删除结点 cur
if (pre.left == cur)
{
pre.left = child;
}
else
{
pre.right = child;
}
}
// 子结点数量 = 2
else
{
// 获取中序遍历中 cur 的下一个结点
TreeNode? nex = getInOrderNext(cur.right);
if (nex != null)
{
int tmp = nex.val;
// 递归删除结点 nex
remove(nex.val);
// 将 nex 的值复制给 cur
cur.val = tmp;
}
}
return cur;
}
[class]{BinarySearchTree}-[func]{remove}
/* 获取中序遍历中的下一个结点（仅适用于 root 有左子结点的情况） */
private TreeNode? getInOrderNext(TreeNode? root)
{
if (root == null) return root;
// 循环访问左子结点，直到叶结点时为最小结点，跳出
while (root.left != null)
{
root = root.left;
}
return root;
}
[class]{BinarySearchTree}-[func]{getInOrderNext}
```
=== "Swift"

51
docs/chapter_tree/binary_tree_traversal.md
View file

@ -85,26 +85,7 @@ comments: true
=== "C#"
```csharp title="binary_tree_bfs.cs"
/* 层序遍历 */
public List<int?> hierOrder(TreeNode root)
{
// 初始化队列，加入根结点
Queue<TreeNode> queue = new();
queue.Enqueue(root);
// 初始化一个列表，用于保存遍历序列
List<int> list = new();
while (queue.Count != 0)
{
TreeNode node = queue.Dequeue(); // 队列出队
list.Add(node.val); // 保存结点值
if (node.left != null)
queue.Enqueue(node.left); // 左子结点入队
if (node.right != null)
queue.Enqueue(node.right); // 右子结点入队
}
return list;
}
[class]{binary_tree_bfs}-[func]{hierOrder}
```
=== "Swift"
@ -235,35 +216,11 @@ comments: true
=== "C#"
```csharp title="binary_tree_dfs.cs"
/* 前序遍历 */
void preOrder(TreeNode? root)
{
if (root == null) return;
// 访问优先级：根结点 -> 左子树 -> 右子树
list.Add(root.val);
preOrder(root.left);
preOrder(root.right);
}
[class]{binary_tree_dfs}-[func]{preOrder}
/* 中序遍历 */
void inOrder(TreeNode? root)
{
if (root == null) return;
// 访问优先级：左子树 -> 根结点 -> 右子树
inOrder(root.left);
list.Add(root.val);
inOrder(root.right);
}
[class]{binary_tree_dfs}-[func]{inOrder}
/* 后序遍历 */
void postOrder(TreeNode? root)
{
if (root == null) return;
// 访问优先级：左子树 -> 右子树 -> 根结点
postOrder(root.left);
postOrder(root.right);
list.Add(root.val);
}
[class]{binary_tree_dfs}-[func]{postOrder}
```
=== "Swift"

8
docs/utils/build_markdown.py
View file

@ -15,6 +15,7 @@ from docs.utils.extract_code_java import ExtractCodeBlocksJava
from docs.utils.extract_code_cpp import ExtractCodeBlocksCpp
from docs.utils.extract_code_jsts import ExtractCodeBlocksJSTS
from docs.utils.extract_code_swift import ExtractCodeBlocksSwift
from docs.utils.extract_code_csharp import ExtractCodeBlocksCSharp
def build_markdown(md_path):
@ -42,8 +43,12 @@ def build_markdown(md_path):
extractor = extractor_dict[lang]
# Get code blocks
if file_name not in code_blocks_dict:
code_blocks_dict[file_name] = extractor.extract(
code_blocks = extractor.extract(
file_path=osp.dirname(md_path).replace("docs/", f"codes/{lang}/") + f"/{file_name}")
if code_blocks is None:
i += 1
continue
code_blocks_dict[file_name] = code_blocks
header_line = i
class_label = src_match[1]
@ -90,6 +95,7 @@ extractor_dict = {
"javascript": ExtractCodeBlocksJSTS(),
"typescript": ExtractCodeBlocksJSTS(),
"swift": ExtractCodeBlocksSwift(),
"csharp": ExtractCodeBlocksCSharp(),
}

15
docs/utils/deploy.sh
View file

@ -1,14 +1,27 @@
# This script is borrowed from https://gist.github.com/cobyism/4730490
python docs/utils/build_markdown.py
while true; do
read -p "Do you wish to deploy the site? [y] [n]" yn
case $yn in
[Yy]* ) make install; break;;
[Nn]* ) exit;;
* ) echo "Please answer yes[y] or no[n].";;
esac
done
# push the built docs
cd build
git add .
git commit -m "build"
git push -u origin docs
cd ..
# Build mkdocs
mkdocs build --clean
# deploy the site
cd site
git add .
git commit -m "deploy"
git push -u origin gh-pages
cd..

28
docs/utils/extract_code_csharp.py Normal file
View file

@ -0,0 +1,28 @@
"""
File: extract_code_csharp.py
Created Time: 2023-02-07
Author: Krahets (krahets@163.com)
"""
import re
import glob
import sys, os.path as osp
sys.path.append(osp.dirname(osp.dirname(osp.dirname(osp.abspath(__file__)))))
from docs.utils.extract_code_java import ExtractCodeBlocksJava
class ExtractCodeBlocksCSharp(ExtractCodeBlocksJava):
def __init__(self) -> None:
super().__init__()
# Pattern to match function names and class names
self.func_pattern = r'(\s*)(public|private|)\s*(static|)\s*(|\S+)\s*(\w+)(\(.*\))'
self.class_pattern = r'(public|)\s*(class|struct)\s+(\w+)\s*\n'
self.func_pattern_keys = ["total", "ind", "scope", "static", "return", "label", "args"]
self.class_pattern_keys = ["total", "scope", "type", "label"]
# for code_path in glob.glob("codes/csharp/chapter_*/array.cs"):
# ext = ExtractCodeBlocksCSharp()
# res = ext.extract(code_path)
# pass

3
docs/utils/extract_code_java.py
View file

@ -31,6 +31,9 @@ class ExtractCodeBlocksJava:
"""
Extract classes and functions from a markdown document
"""
if not osp.isfile(file_path):
return None
self.file_path = file_path
with open(file_path) as f:
self.lines = f.readlines()

5
docs/utils/extract_code_jsts.py
View file

@ -21,8 +21,3 @@ class ExtractCodeBlocksJSTS(ExtractCodeBlocksJava):
self.func_pattern_keys = ["total", "ind", "prefix", "label", ":", "return"]
self.class_pattern_keys = ["total", "scope", "label"]
# for code_path in glob.glob("codes/cpp/chapter_*/my_heap.cpp"):
# ext = ExtractCodeBlocksCpp()
# ext.extract(code_path)

4
docs/utils/extract_code_python.py
View file

@ -49,7 +49,3 @@ class ExtractCodeBlocksPython(ExtractCodeBlocksJava):
remove_empty_lines(func)
for func in funcs.values():
remove_empty_lines(func)
# ext = ExtractCodeBlocksPython()
# ext.extract("codes/python/chapter_array_and_linkedlist/my_list.py")

5
docs/utils/extract_code_swift.py
View file

@ -21,8 +21,3 @@ class ExtractCodeBlocksSwift(ExtractCodeBlocksJava):
self.func_pattern_keys = ["total", "ind", "scope", "static", "func", "label"]
self.class_pattern_keys = ["total", "scope", "label"]
# for code_path in glob.glob("codes/cpp/chapter_*/my_heap.cpp"):
# ext = ExtractCodeBlocksCpp()
# ext.extract(code_path)