xmengnet/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2024-12-25 15:16:29 +08:00
Code Issues Projects Releases Packages Wiki Activity Actions
1875 commits 5 branches 9 tags 383 MiB
Commit graph

18 commits

Author SHA1 Message Date
curtishd
9c07ca99f3
Fix the comment in recursion.kt (#1177) 
* 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.

* keep tailRecur function consistent with other.

* Update recursion.kt

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2024-03-26 03:14:13 +08:00
curtishd
42f48405ef
Fix all the incorrect comment in kotin files (#1176) 
* 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 <krahets@163.com>
 2024-03-25 22:14:55 +08:00
curtishd
5ec5ef9af0
Add kotlin code for the utils file (#1175) 
* feat(kotlin): add kotlin code for utils file.

* Update ListNode.kt

* Update PrintUtil.kt

---------

Co-authored-by: Yudong Jin <krahets@163.com>
 2024-03-25 19:15:40 +08:00
curtishd
5e77a64341
Add kotlin code for the chapter of tree (#1172) 
* modified array.kt.

* feat(kotlin): add kotlin code for the chapter of stack and queue.

* modified array.kt

* modified comments.

* feat(kotlin): add kotlin code for the chapter of tree.

* feat(kotlin): add kotlin code for the chapter of tree.
 2024-03-25 16:22:17 +08:00
curtishd
6069cb89a7
Add kotlin code for the chapter of stack and queue (#1162) 
* modified array.kt.

* feat(kotlin): add kotlin code for the chapter of stack and queue.

* modified array.kt

* modified comments.
 2024-03-23 19:33:18 +08:00
Yudong Jin
3ea91bda99
fix: Use int instead of float for the example code of log time complexity (#1164) 
* Use int instead of float for the example code of log time complexity

* Bug fixes

* Bug fixes
 2024-03-23 02:17:48 +08:00
Nan Lei
300a781fab
Update code comment of quadratic in time_complexity (#1155) 2024-03-19 02:28:16 +08:00
curtishd
1845937c5a
Add kotlin code for the chapter of sorting (#1145) 
* feat(kotlin): add kotlin code for chapter sorting.

* style(kotlin): fix some indent.

* refactor(kotlin): refactor quick_sort.kt files.

* style(kotlin): modified medianThree function.
 2024-03-18 13:34:20 +08:00
curtishd
54ceef3443
feat(kotlin): add kotlin codes for the chapter of searching. (#1140) 2024-03-15 17:11:41 +08:00
curtishd
a05192ea0f
Add kotlin code for the chapter of heap (#1115) 
* feat(kotlin): add kotlin code for dynamic programming.

* Update knapsack.kt

* feat(kotlin): add kotlin codes for graph.

* style(kotlin): reformatted the codes.

* feat(kotlin): add kotlin codes for the chapter of greedy.

* Update max_product_cutting.kt

* feat(kotlin): add kotlin code for chapter of hashing.

* style(kotlin): modified some comment

* Update array_hash_map.kt

* Update hash_map_chaining.kt

* Update hash_map_chaining.kt

* feat(kotlin): add kotlin codes for the chapter of heap.

* Update my_heap.kt
 2024-03-15 01:12:00 +08:00
curtishd
eadf4c86d4
Add kotlin code for the chapter of hashing (#1104) 
* feat(kotlin): add kotlin code for dynamic programming.

* Update knapsack.kt

* feat(kotlin): add kotlin codes for graph.

* style(kotlin): reformatted the codes.

* feat(kotlin): add kotlin codes for the chapter of greedy.

* Update max_product_cutting.kt

* feat(kotlin): add kotlin code for chapter of hashing.

* style(kotlin): modified some comment

* Update array_hash_map.kt

* Update hash_map_chaining.kt

* Update hash_map_chaining.kt
 2024-03-12 14:08:15 +08:00
curtishd
89679a4a13
Add kotlin codes for the chapter of greedy (#1103) 
* feat(kotlin): add kotlin code for dynamic programming.

* Update knapsack.kt

* feat(kotlin): add kotlin codes for graph.

* style(kotlin): reformatted the codes.

* feat(kotlin): add kotlin codes for the chapter of greedy.

* Update max_product_cutting.kt
 2024-03-04 00:10:34 +08:00
curtishd
6a728042fd
Add kotlin code for the chapter of graph (#1102) 
* feat(kotlin): add kotlin code for dynamic programming.

* Update knapsack.kt

* feat(kotlin): add kotlin codes for graph.

* style(kotlin): reformatted the codes.
 2024-03-03 19:18:07 +08:00
curtishd
5c1f43fefd
Add kotlin code for dynamic programming (#1099) 
* feat(kotlin): add kotlin code for dynamic programming.

* Update knapsack.kt
 2024-03-03 15:14:26 +08:00
curtishd
7cdfa03e68
Add kotlin code for the chapter of divide and conquer (#1098) 
* feat(kotlin):new kotlin support files

* fix(kotlin):

    reviewed the formatting, comments and so on.

* fix(kotlin): fix the indentation and format

* feat(kotlin): Add kotlin code for the backtraking chapter.

* fix(kotlin): fix incorrect output of preorder_traversal_iii_template.kt file

* fix(kotlin): simplify kotlin codes

* fix(kotlin): modify n_queens.kt for consistency.

* feat(kotlin): add kotlin code for computational complexity.

* fix(kotlin): remove iteration folder.

* fix(kotlin): remove n_queens.kt file out of folder.

* fix(kotlin): remove some folders.

* style(kotlin): modified two chapters.

* feat(kotlin): add kotlin code for divide and conquer.

* Update build_tree.kt

* Update hanota.kt

* Delete codes/kotlin/chapter_backtracking directory

* Delete codes/kotlin/chapter_computational_complexity directory

* Delete codes/kotlin/chapter_divide_and_conquer directory

* feat(kotlin): add kotlin code for divide and conquer.

* Update hanota.kt
 2024-02-28 01:25:38 +08:00
curtishd
306dc019ef
Add Kotlin code for computational complexity (#1090) 
* feat(kotlin):new kotlin support files

* fix(kotlin):

    reviewed the formatting, comments and so on.

* fix(kotlin): fix the indentation and format

* feat(kotlin): Add kotlin code for the backtraking chapter.

* fix(kotlin): fix incorrect output of preorder_traversal_iii_template.kt file

* fix(kotlin): simplify kotlin codes

* fix(kotlin): modify n_queens.kt for consistency.

* feat(kotlin): add kotlin code for computational complexity.

* fix(kotlin): remove iteration folder.

* fix(kotlin): remove n_queens.kt file out of folder.

* fix(kotlin): remove some folders.

* style(kotlin): modified two chapters.
 2024-02-27 17:04:57 +08:00
curtishd
507357ace1
feat(kotlin): Add kotlin code for backtracking chapter (#1088) 
* feat(kotlin):new kotlin support files

* fix(kotlin):

    reviewed the formatting, comments and so on.

* fix(kotlin): fix the indentation and format

* feat(kotlin): Add kotlin code for the backtraking chapter.

* fix(kotlin): fix incorrect output of preorder_traversal_iii_template.kt file

* fix(kotlin): simplify kotlin codes

* fix(kotlin): modify n_queens.kt for consistency.
 2024-02-21 01:57:41 +08:00
curtishd
4b990c10ce
feat(Kotlin): Add Kotlin code for the array and linked list chapter (#1070) 
* feat(kotlin):new kotlin support files

* fix(kotlin):

    reviewed the formatting, comments and so on.

* fix(kotlin): fix the indentation and format
 2024-02-07 22:55:29 +08:00