Fix all the incorrect comment in kotin files (krahets#1176)

curtishd · krahets · web-flow · commit 42f48405ef11 · 2024-03-25T22:14:55.000+08:00
* feat(kotlin): add kotlin code for utils file.

* Update ListNode.kt

* Update PrintUtil.kt

* fix: add the header comment for linkedlist_stack class.

* fix(kotlin): fix the kotlin file name.

* delete blank line in main function

* add comment for class head.

* delete the old file.

* fix the created time

* delete blank line beneath files.

---------

Co-authored-by: Yudong Jin &lt;krahets@163.com&gt;
diff --git a/codes/kotlin/chapter_array_and_linkedlist/linked_list.kt b/codes/kotlin/chapter_array_and_linkedlist/linked_list.kt
@@ -77,4 +77,4 @@ fun main() {
     /* 查找节点 */
     val index: Int = find(n0, 2)
     println("链表中值为 2 的节点的索引 = $index")
-}
+}
diff --git a/codes/kotlin/chapter_divide_and_conquer/hanota.kt b/codes/kotlin/chapter_divide_and_conquer/hanota.kt
@@ -1,6 +1,6 @@
 /**
  * File: hanota.kt
- * Created Time: 2024-1-25
+ * Created Time: 2024-01-25
  * Author: curtishd (1023632660@qq.com)
  */
 
diff --git a/codes/kotlin/chapter_dynamic_programming/climbing_stairs_dfs_mem.kt b/codes/kotlin/chapter_dynamic_programming/climbing_stairs_dfs_mem.kt
diff --git a/codes/kotlin/chapter_hashing/array_hash_map.kt b/codes/kotlin/chapter_hashing/array_hash_map.kt
@@ -16,7 +16,6 @@ class Pair(
 class ArrayHashMap {
     private val buckets = arrayOfNulls<Pair>(100)
 
-    /* 构造方法 */
     init {
         // 初始化数组，包含 100 个桶
         for (i in 0..<100) {
diff --git a/codes/kotlin/chapter_searching/binary_search.kt b/codes/kotlin/chapter_searching/binary_search.kt
@@ -1,6 +1,6 @@
 /**
  * File: binary_search.kt
- * Created Time: 2024-1-25
+ * Created Time: 2024-01-25
  * Author: curtishd (1023632660@qq.com)
  */
 
diff --git a/codes/kotlin/chapter_searching/binary_search_edge.kt b/codes/kotlin/chapter_searching/binary_search_edge.kt
@@ -1,6 +1,6 @@
 /**
  * File: binary_search_edge.kt
- * Created Time: 2024-1-25
+ * Created Time: 2024-01-25
  * Author: curtishd (1023632660@qq.com)
  */
 
diff --git a/codes/kotlin/chapter_searching/binary_search_insertion.kt b/codes/kotlin/chapter_searching/binary_search_insertion.kt
@@ -1,6 +1,6 @@
 /**
  * File: binary_search_insertion.kt
- * Created Time: 2024-1-25
+ * Created Time: 2024-01-25
  * Author: curtishd (1023632660@qq.com)
  */
 
diff --git a/codes/kotlin/chapter_searching/hashing_search.kt b/codes/kotlin/chapter_searching/hashing_search.kt
@@ -1,6 +1,6 @@
 /**
  * File: hashing_search.kt
- * Created Time: 2024-1-25
+ * Created Time: 2024-01-25
  * Author: curtishd (1023632660@qq.com)
  */
 
diff --git a/codes/kotlin/chapter_searching/linear_search.kt b/codes/kotlin/chapter_searching/linear_search.kt
@@ -1,6 +1,6 @@
 /**
  * File: linear_search.kt
- * Created Time: 2024-1-25
+ * Created Time: 2024-01-25
  * Author: curtishd (1023632660@qq.com)
  */
 
diff --git a/codes/kotlin/chapter_searching/two_sum.kt b/codes/kotlin/chapter_searching/two_sum.kt
@@ -1,6 +1,6 @@
 /**
  * File: two_sum.kt
- * Created Time: 2024-1-25
+ * Created Time: 2024-01-25
  * Author: curtishd (1023632660@qq.com)
  */
 
diff --git a/codes/kotlin/chapter_sorting/bubble_sort.kt b/codes/kotlin/chapter_sorting/bubble_sort.kt
@@ -1,6 +1,6 @@
 /**
  * File: bubble_sort.kt
- * Created Time: 2024-1-25
+ * Created Time: 2024-01-25
  * Author: curtishd (1023632660@qq.com)
  */
 
diff --git a/codes/kotlin/chapter_sorting/bucket_sort.kt b/codes/kotlin/chapter_sorting/bucket_sort.kt
@@ -1,6 +1,6 @@
 /**
  * File: bucket_sort.kt
- * Created Time: 2024-1-25
+ * Created Time: 2024-01-25
  * Author: curtishd (1023632660@qq.com)
  */
 
diff --git a/codes/kotlin/chapter_sorting/counting_sort.kt b/codes/kotlin/chapter_sorting/counting_sort.kt
@@ -1,6 +1,6 @@
 /**
  * File: counting_sort.kt
- * Created Time: 2024-1-25
+ * Created Time: 2024-01-25
  * Author: curtishd (1023632660@qq.com)
  */
 
diff --git a/codes/kotlin/chapter_sorting/heap_sort.kt b/codes/kotlin/chapter_sorting/heap_sort.kt
@@ -1,6 +1,6 @@
 /**
  * File: heap_sort.kt
- * Created Time: 2024-1-25
+ * Created Time: 2024-01-25
  * Author: curtishd (1023632660@qq.com)
  */
 
diff --git a/codes/kotlin/chapter_sorting/insertion_sort.kt b/codes/kotlin/chapter_sorting/insertion_sort.kt
@@ -1,6 +1,6 @@
 /**
  * File: insertion_sort.kt
- * Created Time: 2024-1-25
+ * Created Time: 2024-01-25
  * Author: curtishd (1023632660@qq.com)
  */
 
diff --git a/codes/kotlin/chapter_sorting/merge_sort.kt b/codes/kotlin/chapter_sorting/merge_sort.kt
@@ -1,6 +1,6 @@
 /**
  * File: merge_sort.kt
- * Created Time: 2024-1-25
+ * Created Time: 2024-01-25
  * Author: curtishd (1023632660@qq.com)
  */
 
diff --git a/codes/kotlin/chapter_sorting/quick_sort.kt b/codes/kotlin/chapter_sorting/quick_sort.kt
@@ -1,6 +1,6 @@
 /**
  * File: quick_sort.kt
- * Created Time: 2024-1-25
+ * Created Time: 2024-01-25
  * Author: curtishd (1023632660@qq.com)
  */
 
diff --git a/codes/kotlin/chapter_sorting/radix_sort.kt b/codes/kotlin/chapter_sorting/radix_sort.kt
@@ -1,6 +1,6 @@
 /**
  * File: radix_sort.kt
- * Created Time: 2024-1-25
+ * Created Time: 2024-01-25
  * Author: curtishd (1023632660@qq.com)
  */
 
diff --git a/codes/kotlin/chapter_sorting/selection_sort.kt b/codes/kotlin/chapter_sorting/selection_sort.kt
@@ -1,6 +1,6 @@
 /**
  * File: selection_sort.kt
- * Created Time: 2024-1-25
+ * Created Time: 2024-01-25
  * Author: curtishd (1023632660@qq.com)
  */
 
diff --git a/codes/kotlin/chapter_stack_and_queue/linkedlist_queue.kt b/codes/kotlin/chapter_stack_and_queue/linkedlist_queue.kt
@@ -6,6 +6,7 @@
 
 package chapter_stack_and_queue
 
+/* 基于链表实现的队列 */
 class LinkedListQueue(
     // 头节点 front ，尾节点 rear
     private var front: ListNode? = null,
@@ -94,4 +95,4 @@ fun main() {
     /* 判断队列是否为空 */
     val isEmpty = queue.isEmpty()
     println("队列是否为空 = $isEmpty")
-}
+}
diff --git a/codes/kotlin/chapter_stack_and_queue/linkedlist_stack.kt b/codes/kotlin/chapter_stack_and_queue/linkedlist_stack.kt
@@ -6,6 +6,7 @@
 
 package chapter_stack_and_queue
 
+/* 基于链表实现的栈 */
 class LinkedListStack(
     private var stackPeek: ListNode? = null, // 将头节点作为栈顶
     private var stkSize: Int = 0 // 栈的长度
