algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-02 12:58:42 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fix bugs and harmonize the code comments (#1199)

Browse Source 
* Fix the comment in array_deque.go

* Fix the comment in bucket_sort.c

* Translate the Java code comments to Chinese

* Bug fixes

* 二分查找 -> 二分搜尋

* Harmonize comments in `utils` between multiple programming languages
This commit is contained in:
Yudong Jin
2024-03-31 03:06:41 +08:00
committed by GitHub
parent cfe8281aee
commit 034ee65e9a
35 changed files with 133 additions and 271 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
codes/dart/utils/list_node.dart
View File

@ -4,7 +4,7 @@
* Author: Jefferson (JeffersonHuang77@gmail.com)
*/
/* Definition for a singly-linked list node */
/* 链表节点 */
class ListNode {
int val;
ListNode? next;
@ -12,7 +12,7 @@ class ListNode {
ListNode(this.val, [this.next]);
}
/* Generate a linked list with a list */
/* 将列表反序列化为链表 */
ListNode? listToLinkedList(List<int> list) {
ListNode dum = ListNode(0);
ListNode? head = dum;

9
codes/dart/utils/print_util.dart
View File

@ -16,7 +16,7 @@ class Trunk {
Trunk(this.prev, this.str);
}
/* Print a matrix (Array) */
/* 打印矩阵 (Array) */
void printMatrix(List<List<int>> matrix) {
print("[");
for (List<int> row in matrix) {
@ -25,7 +25,7 @@ void printMatrix(List<List<int>> matrix) {
print("]");
}
/* Print a linked list */
/* 打印链表 */
void printLinkedList(ListNode? head) {
List<String> list = [];
@ -38,7 +38,7 @@ void printLinkedList(ListNode? head) {
}
/**
* The interface of the tree printer
* 打印二叉树
* This tree printer is borrowed from TECHIE DELIGHT
* https://www.techiedelight.com/c-program-print-binary-tree/
*/
@ -72,7 +72,6 @@ void printTree(TreeNode? root, [Trunk? prev = null, bool isRight = false]) {
printTree(root.left, trunk, false);
}
/* Helper function to print branches of the binary tree */
void showTrunks(Trunk? p) {
if (p == null) {
return;
@ -82,7 +81,7 @@ void showTrunks(Trunk? p) {
stdout.write(p.str);
}
/* Print a heap (PriorityQueue) */
/* 打印堆 */
void printHeap(List<int> heap) {
print("堆的数组表示：$heap");
print("堆的树状表示：");