Skip to content

Commit bbe68d7

Browse files
heqin-zhuheqin-zhu
committed
Add header info
1 parent 166cd27 commit bbe68d7

14 files changed

Lines changed: 306 additions & 8 deletions

‎README.md‎

Lines changed: 27 additions & 8 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,4 @@
1+
12
# Algorithm
23
>Notes and codes for learning algorithm and data structures :smiley:
34
@@ -14,22 +15,24 @@ So,if you wannt to view the notes which contain latex math formulas and are in m
1415

1516
# Index
1617
* [.](.)
18+
* [README.md](./README.md)
19+
* [backtracking](./backtracking)
1720
* [computationalMethod](./computationalMethod)
21+
* [README.md](./computationalMethod/README.md)
1822
* [interplotion.py](./computationalMethod/interplotion.py)
1923
* [iteration.py](./computationalMethod/iteration.py)
2024
* [least_square.py](./computationalMethod/least_square.py)
2125
* [linear_equation.py](./computationalMethod/linear_equation.py)
2226
* [numerical_differential.py](./computationalMethod/numerical_differential.py)
2327
* [numerical_integration.py](./computationalMethod/numerical_integration.py)
24-
* [README.md](./computationalMethod/README.md)
2528
* [solve-linear-by-iteration.py](./computationalMethod/solve-linear-by-iteration.py)
2629
* [tongyu_equation.py](./computationalMethod/tongyu_equation.py)
2730
* [vector_norm.py](./computationalMethod/vector_norm.py)
2831
* [dataStructure](./dataStructure)
2932
* [allOone](./dataStructure/allOone)
33+
* [bTree.py](./dataStructure/bTree.py)
3034
* [binaryHeap.py](./dataStructure/binaryHeap.py)
3135
* [binaryTree.py](./dataStructure/binaryTree.py)
32-
* [bTree.py](./dataStructure/bTree.py)
3336
* [graph](./dataStructure/graph)
3437
* [hashTable.py](./dataStructure/hashTable.py)
3538
* [huffman](./dataStructure/huffman)
@@ -40,38 +43,44 @@ So,if you wannt to view the notes which contain latex math formulas and are in m
4043
* [polynomial.cpp](./dataStructure/polynomial.cpp)
4144
* [polynomial.py](./dataStructure/polynomial.py)
4245
* [redBlackTree.py](./dataStructure/redBlackTree.py)
46+
* [redBlackTree0.py](./dataStructure/redBlackTree0.py)
4347
* [splayTree.py](./dataStructure/splayTree.py)
4448
* [trie.py](./dataStructure/trie.py)
4549
* [winnerTree.py](./dataStructure/winnerTree.py)
4650
* [divideAndConquer](./divideAndConquer)
4751
* [min_distance_of_n_points.py](./divideAndConquer/min_distance_of_n_points.py)
4852
* [docs](./docs)
53+
* [README.md](./docs/README.md)
4954
* [algorithm-general.md](./docs/algorithm-general.md)
5055
* [b-tree.md](./docs/b-tree.md)
5156
* [fib-heap.md](./docs/fib-heap.md)
5257
* [graph.md](./docs/graph.md)
5358
* [hashTable.md](./docs/hashTable.md)
54-
* [README.md](./docs/README.md)
5559
* [red-black-tree.md](./docs/red-black-tree.md)
5660
* [sort.md](./docs/sort.md)
61+
* [src](./docs/src)
5762
* [tree.md](./docs/tree.md)
5863
* [dynamicProgramming](./dynamicProgramming)
59-
* [lcs.hs](./dynamicProgramming/lcs.hs)
64+
* [Vec2d.hs](./dynamicProgramming/Vec2d.hs)
6065
* [lcs.py](./dynamicProgramming/lcs.py)
6166
* [matrixChainMultiply.py](./dynamicProgramming/matrixChainMultiply.py)
6267
* [splitStripe.hs](./dynamicProgramming/splitStripe.hs)
6368
* [splitStripe.py](./dynamicProgramming/splitStripe.py)
6469
* [testVec2d.hs](./dynamicProgramming/testVec2d.hs)
65-
* [Vec2d.hs](./dynamicProgramming/Vec2d.hs)
6670
* [math](./math)
67-
* [arrangement.c](./math/arrangement.c)
68-
* [cantor.c](./math/cantor.c)
6971
* [isPrime.py](./math/isPrime.py)
7072
* [num_weight.py](./math/num_weight.py)
71-
* [README.md](./README.md)
73+
* [permute_back_track.py](./math/permute_back_track.py)
74+
* [permute_cantor.c](./math/permute_cantor.c)
75+
* [permute_divide_and_conquer.py](./math/permute_divide_and_conquer.py)
76+
* [permute_next_arrangement.c](./math/permute_next_arrangement.c)
77+
* [primesLEn.hs](./math/primesLEn.hs)
7278
* [search](./search)
7379
* [8Astar.py](./search/8Astar.py)
80+
* [BFS_knight.hs](./search/BFS_knight.hs)
81+
* [binary_search.hs](./search/binary_search.hs)
7482
* [bloomFilter.py](./search/bloomFilter.py)
83+
* [schedule.py](./search/schedule.py)
7584
* [sort](./sort)
7685
* [binaryTree.py](./sort/binaryTree.py)
7786
* [heapSort.py](./sort/heapSort.py)
@@ -80,5 +89,15 @@ So,if you wannt to view the notes which contain latex math formulas and are in m
8089
* [select.py](./sort/select.py)
8190
* [shellSort.py](./sort/shellSort.py)
8291
* [string](./string)
92+
* [KMP.py](./string/KMP.py)
93+
* [README.md](./string/README.md)
8394
* [manacher.py](./string/manacher.py)
8495
* [markov.py](./string/markov.py)
96+
* [rabin_karp.py](./string/rabin_karp.py)
97+
* [src](./string/src)
98+
* [sunday.py](./string/sunday.py)
99+
* [utils](./utils)
100+
* [config.py](./utils/config.py)
101+
* [genReadme.py](./utils/genReadme.py)
102+
* [headinfo.py](./utils/headinfo.py)
103+
* [tree.py](./utils/tree.py)

‎dataStructure/intervalTree.py‎

Lines changed: 11 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,14 @@
1+
''' mbinary
2+
#########################################################################
3+
# File : intervalTree.py
4+
# Author: mbinary
5+
# Mail: [email protected]
6+
# Blog: https://mbinary.coding.me
7+
# Github: https://github.com/mbinary
8+
# Created Time: 2018-11-18 10:48
9+
# Description:
10+
#########################################################################
11+
'''
112
from redBlackTree import redBlackTree
213

314
from functools import total_ordering

‎divideAndConquer/min_distance_of_n_points.py‎

Lines changed: 11 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,14 @@
1+
''' mbinary
2+
#########################################################################
3+
# File : min_distance_of_n_points.py
4+
# Author: mbinary
5+
# Mail: [email protected]
6+
# Blog: https://mbinary.coding.me
7+
# Github: https://github.com/mbinary
8+
# Created Time: 2018-11-24 22:03
9+
# Description:
10+
#########################################################################
11+
'''
112
from random import randint
213
from time import time
314
from functools import total_ordering

‎dynamicProgramming/matrixChainMultiply.py‎

Lines changed: 11 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,14 @@
1+
''' mbinary
2+
#########################################################################
3+
# File : matrixChainMultiply.py
4+
# Author: mbinary
5+
# Mail: [email protected]
6+
# Blog: https://mbinary.coding.me
7+
# Github: https://github.com/mbinary
8+
# Created Time: 2018-11-05 19:09
9+
# Description:
10+
#########################################################################
11+
'''
112
def matrixChainMultiply(seq):
213
'''matrix chain multiply, find the optimalest comb to multiply
314
eg ABCD, (AB)(CD), A((BC)D)

‎math/permute_back_track.py‎

Lines changed: 11 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,14 @@
1+
''' mbinary
2+
#########################################################################
3+
# File : permute_back_track.py
4+
# Author: mbinary
5+
# Mail: [email protected]
6+
# Blog: https://mbinary.coding.me
7+
# Github: https://github.com/mbinary
8+
# Created Time: 2018-11-25 12:32
9+
# Description:
10+
#########################################################################
11+
'''
112
def permute(n):
213
def _util(lst,i):
314
if i==n:print(lst)

‎math/permute_cantor.c‎

Lines changed: 11 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,14 @@
1+
/* mbinary
2+
#########################################################################
3+
# File : permute_cantor.c
4+
# Author: mbinary
5+
# Mail: [email protected]
6+
# Blog: https://mbinary.coding.me
7+
# Github: https://github.com/mbinary
8+
# Created Time: 2018-11-17 11:25
9+
# Description:
10+
#########################################################################
11+
*/
112
#include<stdio.h>
213

314
//使用康托展开计算全排列, 下面存储的是0!,1!,2!...(n-1)!

‎math/permute_divide_and_conquer.py‎

Lines changed: 11 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,14 @@
1+
''' mbinary
2+
#########################################################################
3+
# File : permute_divide_and_conquer.py
4+
# Author: mbinary
5+
# Mail: [email protected]
6+
# Blog: https://mbinary.coding.me
7+
# Github: https://github.com/mbinary
8+
# Created Time: 2018-11-25 12:23
9+
# Description:
10+
#########################################################################
11+
'''
112
def permute(lst,n):
213
''' O(n!), optimal'''
314
if n==1:print(lst)

‎math/permute_next_arrangement.c‎

Lines changed: 11 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,14 @@
1+
/* mbinary
2+
#########################################################################
3+
# File : permute_next_arrangement.c
4+
# Author: mbinary
5+
# Mail: [email protected]
6+
# Blog: https://mbinary.coding.me
7+
# Github: https://github.com/mbinary
8+
# Created Time: 2018-11-17 14:31
9+
# Description:
10+
#########################################################################
11+
*/
112
#include<stdio.h>
213

314
void swap(int*arr,int i,int j)

‎search/bloomFilter.py‎

Lines changed: 11 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,14 @@
1+
''' mbinary
2+
#########################################################################
3+
# File : bloomFilter.py
4+
# Author: mbinary
5+
# Mail: [email protected]
6+
# Blog: https://mbinary.coding.me
7+
# Github: https://github.com/mbinary
8+
# Created Time: 2018-10-17 11:19
9+
# Description:
10+
#########################################################################
11+
'''
112
from bitarray import bitarray
213

314
import mmh3

‎search/schedule.py‎

Lines changed: 11 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,14 @@
1+
''' mbinary
2+
#########################################################################
3+
# File : schedule.py
4+
# Author: mbinary
5+
# Mail: [email protected]
6+
# Blog: https://mbinary.coding.me
7+
# Github: https://github.com/mbinary
8+
# Created Time: 2018-11-30 12:00
9+
# Description:
10+
#########################################################################
11+
'''
112
'''
213
回溯全空间搜索, 剪枝优化
314

0 commit comments

Comments
 (0)