mirror of
https://github.moeyy.xyz/https://github.com/trekhleb/javascript-algorithms.git
synced 2024-12-26 07:01:18 +08:00
Update CN README.
This commit is contained in:
parent
428648a13e
commit
bcedcce9cb
@ -3,14 +3,6 @@
|
||||
[![build status](https://travis-ci.org/trekhleb/javascript-algorithms.svg?branch=master)](https://travis-ci.org/trekhleb/javascript-algorithms)
|
||||
[![codecov](https://codecov.io/gh/trekhleb/javascript-algorithms/branch/master/graph/badge.svg)](https://codecov.io/gh/trekhleb/javascript-algorithms)
|
||||
|
||||
|翻译的原文|与日期|原文更新|
|
||||
---|---|---
|
||||
[commit]|2018 7.29|![last commit][last]
|
||||
|
||||
[commit]: https://github.com/trekhleb/javascript-algorithms/tree/f32172e3db50a73b2c4b09c4363d1fdc40ce2ef6
|
||||
[last]: https://img.shields.io/github/last-commit/trekhleb/javascript-algorithms.svg
|
||||
|
||||
|
||||
本仓库包含了多种基于 JavaScript 的算法与数据结构。
|
||||
|
||||
每种算法和数据结构都有自己的 README 并提供相关说明以及进一步阅读和 YouTube 视频。
|
||||
@ -151,14 +143,14 @@ launches, [click here](https://upscri.be/402324/).
|
||||
* `B` [二分查找](src/algorithms/search/binary-search)
|
||||
* `B` [汉诺塔](src/algorithms/uncategorized/hanoi-tower)
|
||||
* `B` [杨辉三角形](src/algorithms/math/pascal-triangle)
|
||||
* [欧几里得算法](src/algorithms/math/euclidean-algorithm) - 计算最大公约数 (GCD)
|
||||
* `A` [排列](src/algorithms/sets/permutations) (有/无重复)
|
||||
* `A` [组合](src/algorithms/sets/combinations) (有/无重复)
|
||||
* `B` [欧几里得算法](src/algorithms/math/euclidean-algorithm) - 计算最大公约数 (GCD)
|
||||
* `B` [跳跃游戏](src/algorithms/uncategorized/jump-game)
|
||||
* `B` [归并排序](src/algorithms/sorting/merge-sort)
|
||||
* `B` [快速排序](src/algorithms/sorting/quick-sort)
|
||||
* `B` [树深度优先搜索](src/algorithms/tree/depth-first-search) (DFS)
|
||||
* `B` [图深度优先搜索](src/algorithms/graph/depth-first-search) (DFS)
|
||||
* `A` [排列](src/algorithms/sets/permutations) (有/无重复)
|
||||
* `A` [组合](src/algorithms/sets/combinations) (有/无重复)
|
||||
* **动态编程** - 使用以前找到的子解决方案构建解决方案
|
||||
* `B` [斐波那契数](src/algorithms/math/fibonacci)
|
||||
* `B` [跳跃游戏](src/algorithms/uncategorized/jump-game)
|
||||
@ -181,7 +173,7 @@ launches, [click here](https://upscri.be/402324/).
|
||||
* `A` [八皇后问题](src/algorithms/uncategorized/n-queens)
|
||||
* `A` [骑士巡逻](src/algorithms/uncategorized/knight-tour)
|
||||
* `A` [组合求和](src/algorithms/sets/combination-sum) - 从规定的总和中找出所有的组合
|
||||
* **B & B**
|
||||
* **Branch & Bound**
|
||||
|
||||
## 如何使用本仓库
|
||||
|
||||
|
Loading…
Reference in New Issue
Block a user