Fix bugs and harmonize the code comments (#1199)

* 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

codes/javascript/modules/ListNode.js

@@ -4,9 +4,7 @@
  * Author: IsChristina (christinaxia77@foxmail.com)
  */
 
-/**
- * Definition for a singly-linked list node
- */
+/* 链表节点 */
 class ListNode {
     val; // 节点值
     next; // 指向下一节点的引用（指针）
@@ -16,11 +14,7 @@ class ListNode {
     }
 }
 
-/**
- * Generate a linked list with an array
- * @param arr
- * @return
- */
+/* 将列表反序列化为链表 */
 function arrToLinkedList(arr) {
     const dum = new ListNode(0);
     let head = dum;
@@ -31,21 +25,7 @@ function arrToLinkedList(arr) {
     return dum.next;
 }
 
-/**
- * Get a list node with specific value from a linked list
- * @param head
- * @param val
- * @return
- */
-function getListNode(head, val) {
-    while (head !== null && head.val !== val) {
-        head = head.next;
-    }
-    return head;
-}
-
 module.exports = {
     ListNode,
     arrToLinkedList,
-    getListNode,
 };

codes/javascript/modules/PrintUtil.js

@@ -6,10 +6,7 @@
 
 const { arrToTree } = require('./TreeNode');
 
-/**
- * Print a linked list
- * @param head
- */
+/* 打印链表 */
 function printLinkedList(head) {
     let list = [];
     while (head !== null) {
@@ -25,21 +22,15 @@ function Trunk(prev, str) {
 }
 
 /**
- * The interface of the tree printer
+ * 打印二叉树
  * This tree printer is borrowed from TECHIE DELIGHT
  * https://www.techiedelight.com/c-program-print-binary-tree/
- * @param root
  */
 function printTree(root) {
     printTree(root, null, false);
 }
 
-/**
- * Print a binary tree
- * @param root
- * @param prev
- * @param isRight
- */
+/* 打印二叉树 */
 function printTree(root, prev, isRight) {
     if (root === null) {
         return;
@@ -71,10 +62,6 @@ function printTree(root, prev, isRight) {
     printTree(root.left, trunk, false);
 }
 
-/**
- * Helper function to print branches of the binary tree
- * @param p
- */
 function showTrunks(p) {
     if (!p) {
         return;
@@ -84,10 +71,7 @@ function showTrunks(p) {
     process.stdout.write(p.str);
 }
 
-/**
- * Print a heap
- * @param arr
- */
+/* 打印堆 */
 function printHeap(arr) {
     console.log('堆的数组表示：');
     console.log(arr);

codes/javascript/modules/TreeNode.js

@@ -4,9 +4,7 @@
  * Author: IsChristina (christinaxia77@foxmail.com)
  */
 
-/**
- * Definition for a binary tree node.
- */
+/* 二叉树节点 */
 class TreeNode {
     val; // 节点值
     left; // 左子节点指针
@@ -20,11 +18,7 @@ class TreeNode {
     }
 }
 
-/**
- * Generate a binary tree given an array
- * @param arr
- * @return
- */
+/* 将数组反序列化为二叉树 */
 function arrToTree(arr, i = 0) {
     if (i < 0 || i >= arr.length || arr[i] === null) {
         return null;