-
Notifications
You must be signed in to change notification settings - Fork 3
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
6 changed files
with
15 additions
and
9 deletions.
There are no files selected for viewing
Empty file.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,9 +1,11 @@ | ||
- [Git](/1foundations/Git.md) | ||
- [JPA](/1foundations/JPA/index.md) | ||
- [Rx.js](/1foundations/Rx.js.md) | ||
- [后端](/1foundations/back-end/index.md) | ||
- [数据库](/1foundations/data-base/index.md) | ||
- [大前端](/1foundations/front-end/index.md) | ||
- [git](/1foundations/git.md) | ||
- [网络](/1foundations/network/index.md) | ||
- [npm](/1foundations/npm.md) | ||
- [springboot](/1foundations/springboot/index.md) | ||
- [测试](/1foundations/test/index.md) | ||
- [设计模式](/1foundations/设计模式.md) |
Empty file.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,3 +1,3 @@ | ||
- [CSS](/2code/front-end/CSS.md) | ||
- [JavaScript](/2code/front-end/JavaScript/index.md) | ||
- [React](/2code/front-end/React/index.md) | ||
- [React](/2code/front-end/React/index.md) | ||
- [css](/2code/front-end/css.md) |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,5 +1,7 @@ | ||
# Woodpecker 啄木鸟 | ||
|
||
网站直达: https://woodpecker.clover-blog.cn | ||
|
||
努力更新中`ing`... | ||
|
||
## 文档结构: | ||
|
@@ -33,7 +35,7 @@ | |
|
||
### `url`和`目录`映射关系: | ||
|
||
```json | ||
```javascript | ||
const NameMap = { | ||
'2code': '代码题', | ||
'1foundations': '基础', | ||
|
@@ -48,9 +50,9 @@ const NameMap = { | |
} | ||
``` | ||
|
||
面经也可以选择投稿`[email protected]`或者提MR | ||
面经也可以选择投稿 `[email protected]` 或者提 PR | ||
|
||
好的复盘是可以帮助你下一次更好的拿到offer | ||
好的复盘是可以帮助你下一次更好的拿到 offer | ||
|
||
|
||
### 常用排序算法和概念 | ||
|
@@ -72,5 +74,5 @@ const NameMap = { | |
5. **归并排序**:将已有序的子序列合并,得到完全有序的序列。即先使每个子序列有序,再使子序列段间有序; | ||
6. **堆排序**:利用堆这种数据结构所设计的一种排序算法,将初始待排序关键字序列构建成一个大顶堆,此时,整个序列的最大值就是堆顶的根节点,将其与末尾元素进行交换,使末尾元素最大,然后再将剩余n-1个元素重新构造成一个堆,这样会得到n个元素的次大值,如此反复执行,便能得到一个有序序列; | ||
7. **计数排序**:根据数组中每个元素的值,计算出该元素在排序后数组中的位置,并将其放入相应位置; | ||
8. **桶排序**:将数组分到有限数量的桶里,然后对每个桶内的元素进行单独排序,最后将各个桶中的元素合并起来; | ||
8. **桶排序**:将数组分到有限数量的桶里,然后对每个桶内的元素进行单独排序,最后将各个桶中的元素合并起来; | ||
9. **基数排序**:按照低位先排序,然后收集,再按照高位排序,再收集,以此类推,直到最高位。 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters