Notes and codes for learning algorithm and data structures 😃

Some pictures and ideas are from <<Introduction to Algotithm>>

Click here to view notes

• .
  • LICENSE
  • README.md
  • backtracking
  • dataStructure
    • LRU
    • bTree.py
    • binaryHeap.py
    • binaryHeap1.py
    • binaryTree.py
    • circularQueue.py
    • graph
    • hashTable.py
    • huffman
    • insert_remove_getRandom.py
    • intervalTree.py
    • leftHeap.py
    • linkedList.py
    • loserTree.py
    • map.cc
    • polynomial.cpp
    • polynomial.py
    • redBlackTree.py
    • redBlackTree0.py
    • splayTree.py
    • trie
    • unionFindSet
    • winnerTree.py
  • divideAndConquer
    • min_distance_of_n_points.py
  • docs
    • README.md
    • _config.yml
    • algorithm-general.md
    • b-tree.md
    • dft.md
    • fib-heap.md
    • graph.md
    • hashTable.md
    • red-black-tree.md
    • sort.md
    • src
    • string-matching.md
    • tree.md
  • dynamicProgramming
    • Vec2d.hs
    • last-stone-weight.py
    • lcs.py
    • matrixChainMultiply.py
    • max-len-of-repeated-subarray.py
    • splitStripe.hs
    • splitStripe.py
    • stoneGame.py
    • testVec2d.hs
  • graph
    • cloneGraph.cpp
    • dfs.py
    • isBipartGraph.py
  • math
    • README.md
    • fastPow.py
    • fft.py
    • fibonacci
    • numWeight
    • numberTheory
    • numericalAnalysis
    • permute
  • parser
    • PL0-compiler
    • calculator
    • declarationParser
  • search
    • 8Astar.py
    • BFS_knight.hs
    • binary_search.hs
    • bloomFilter.py
    • schedule.py
    • work_dispatch.py
  • sort
    • binaryTree.py
    • heapSort.py
    • quickSort.c
    • quickSort.py
    • radixSort.py
    • select.py
    • shellSort.py
  • string
    • KMP.py
    • README.md
    • manacher.py
    • markov.py
    • min-window-substring.py
    • rabin_karp.py
    • rotate.py
    • src
    • sunday.py
    • wildcard_matching.py
  • utils
    • codecogs.py
    • config.py
    • genReadme.py
    • headinfo.py
    • tree.py