From 270e077cf9825dfe0a5859a130504fc781496095 Mon Sep 17 00:00:00 2001 From: mbinary Date: Mon, 18 Mar 2019 01:01:32 +0800 Subject: [PATCH] update --- README.md | 13 +++++++++++-- docs/b-tree.md | 1 - utils/config.py | 4 +--- 3 files changed, 12 insertions(+), 6 deletions(-) diff --git a/README.md b/README.md index d754a6d..55613a4 100644 --- a/README.md +++ b/README.md @@ -6,6 +6,7 @@ [![repo-size](https://img.shields.io/github/repo-size/mbinary/algorithm.svg)]() [![License](https://img.shields.io/badge/LICENSE-WTFPL-blue.svg)](LICENSE) [![Language](https://img.shields.io/badge/language-python3-orange.svg)]() +[![codebeat badge](https://codebeat.co/badges/4ef725b5-405a-4390-a860-a86deefab3f8)](https://codebeat.co/projects/github-com-mbinary-algorithm-master) >Notes and codes for learning algorithm and data structures :smiley: @@ -14,12 +15,12 @@ Some pictures and ideas are from `<>` I use python 3.6+ and c/c++ to implement them. - -[Click here](https://mbinary.xyz/alogrithm) to view notes +[Click here](https://mbinary.xyz/algorithm/) to view notes # Index * [.](.) * [LICENSE](./LICENSE) * [README.md](./README.md) + * [_config.yml](./_config.yml) * [backtracking](./backtracking) * [dataStructure](./dataStructure) * [allOone](./dataStructure/allOone) @@ -48,6 +49,7 @@ I use python 3.6+ and c/c++ to implement them. * [min_distance_of_n_points.py](./divideAndConquer/min_distance_of_n_points.py) * [docs](./docs) * [README.md](./docs/README.md) + * [_config.yml](./docs/_config.yml) * [algorithm-general.md](./docs/algorithm-general.md) * [b-tree.md](./docs/b-tree.md) * [fib-heap.md](./docs/fib-heap.md) @@ -68,14 +70,20 @@ I use python 3.6+ and c/c++ to implement them. * [testVec2d.hs](./dynamicProgramming/testVec2d.hs) * [wildcard_matching.py](./dynamicProgramming/wildcard_matching.py) * [graph](./graph) + * [cloneGraph.cpp](./graph/cloneGraph.cpp) * [isBipartGraph.py](./graph/isBipartGraph.py) * [math](./math) * [README.md](./math/README.md) * [convertWeight.py](./math/convertWeight.py) * [fastPow.py](./math/fastPow.py) + * [fibonacci](./math/fibonacci) * [numberTheory](./math/numberTheory) * [numericalAnalysis](./math/numericalAnalysis) * [permute](./math/permute) + * [parser](./parser) + * [PL0-compiler](./parser/PL0-compiler) + * [calculator](./parser/calculator) + * [declarationParser](./parser/declarationParser) * [search](./search) * [8Astar.py](./search/8Astar.py) * [BFS_knight.hs](./search/BFS_knight.hs) @@ -102,6 +110,7 @@ I use python 3.6+ and c/c++ to implement them. * [sunday.py](./string/sunday.py) * [wildcard_matching.py](./string/wildcard_matching.py) * [utils](./utils) + * [codecogs.py](./utils/codecogs.py) * [config.py](./utils/config.py) * [genReadme.py](./utils/genReadme.py) * [headinfo.py](./utils/headinfo.py) diff --git a/docs/b-tree.md b/docs/b-tree.md index 1ed6f42..3d20cbf 100644 --- a/docs/b-tree.md +++ b/docs/b-tree.md @@ -27,7 +27,6 @@ description: -{% note info %}从此心里有了B数(●'◡'●){% endnote %} # 1. 背景 当有大量数据储存在磁盘时,如数据库的查找,插入, 删除等操作的实现, 如果要读取或者写入, 磁盘的寻道, 旋转时间很长, 远大于在 内存中的读取,写入时间. diff --git a/utils/config.py b/utils/config.py index a40f8b8..42c2942 100644 --- a/utils/config.py +++ b/utils/config.py @@ -15,9 +15,7 @@ Some pictures and ideas are from `<>` I use python 3.6+ and c/c++ to implement them. -# Notice -Currently, Github can't render latex math formulas.Thus,if you want to view the markodwn notes which contain latex math formulas, you can visit [my blog](https://mbinary.xyz) - +[Click here](https://mbinary.xyz/algorithm/) to view notes # Index {index} '''