DS-for-Kotlin
Just write some classic data structure by kotlin during my leisure. Now, it has the data structure as below:
- Linked-list
- BST(binary search tree)
- Map(red-black tree)
- Unordered-map(hash table)
The following data structure will be updated like:
Unordered-map(hash table)- KMP
- trie tree
- regular expression
- some other algorithms about string
- topological sort
- directed cycle find
- Two algorithms for scc(Tarjan and Kosaraju-Sharir)
- ...
The project will be continue updated