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

7 commits

Author SHA1 Message Date
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