Skip to content

Commit

Permalink
Merge pull request #1 from lhui/main
Browse files Browse the repository at this point in the history
update README.md
  • Loading branch information
lhui authored Jul 21, 2024
2 parents aea55a7 + f9d1bb1 commit ad886fc
Show file tree
Hide file tree
Showing 6 changed files with 15 additions and 9 deletions.
Empty file added 1foundations/JPA/index.md
Empty file.
4 changes: 3 additions & 1 deletion 1foundations/index.md
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.
4 changes: 2 additions & 2 deletions 2code/front-end/index.md
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)
10 changes: 6 additions & 4 deletions README.md
Original file line number Diff line number Diff line change
@@ -1,5 +1,7 @@
# Woodpecker 啄木鸟

网站直达: https://woodpecker.clover-blog.cn

努力更新中`ing`...

## 文档结构:
Expand Down Expand Up @@ -33,7 +35,7 @@

### `url``目录`映射关系:

```json
```javascript
const NameMap = {
'2code': '代码题',
'1foundations': '基础',
Expand All @@ -48,9 +50,9 @@ const NameMap = {
}
```

面经也可以选择投稿`[email protected]`或者提MR
面经也可以选择投稿 `[email protected]` 或者提 PR

好的复盘是可以帮助你下一次更好的拿到offer
好的复盘是可以帮助你下一次更好的拿到 offer


### 常用排序算法和概念
Expand All @@ -72,5 +74,5 @@ const NameMap = {
5. **归并排序**:将已有序的子序列合并,得到完全有序的序列。即先使每个子序列有序,再使子序列段间有序;
6. **堆排序**:利用堆这种数据结构所设计的一种排序算法,将初始待排序关键字序列构建成一个大顶堆,此时,整个序列的最大值就是堆顶的根节点,将其与末尾元素进行交换,使末尾元素最大,然后再将剩余n-1个元素重新构造成一个堆,这样会得到n个元素的次大值,如此反复执行,便能得到一个有序序列;
7. **计数排序**:根据数组中每个元素的值,计算出该元素在排序后数组中的位置,并将其放入相应位置;
8. **桶排序**:将数组分到有限数量的桶里,然后对每个桶内的元素进行单独排序,最后将各个桶中的元素合并起来;
8. **桶排序**:将数组分到有限数量的桶里,然后对每个桶内的元素进行单独排序,最后将各个桶中的元素合并起来;
9. **基数排序**:按照低位先排序,然后收集,再按照高位排序,再收集,以此类推,直到最高位。
6 changes: 4 additions & 2 deletions _sidebar.md
Original file line number Diff line number Diff line change
@@ -1,5 +1,5 @@
- [基础](/1foundations/index.md)
- [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)
Expand All @@ -23,15 +23,16 @@
- [node](/1foundations/front-end/node.md)
- [前端监控](/1foundations/front-end/前端监控.md)
- [微前端](/1foundations/front-end/微前端.md)
- [git](/1foundations/git.md)
- [网络](/1foundations/network/index.md)
- [HTTP](/1foundations/network/HTTP.md)
- [npm](/1foundations/npm.md)
- [springboot](/1foundations/springboot/index.md)
- [测试](/1foundations/test/index.md)
- [Jest](/1foundations/test/Jest.md)
- [设计模式](/1foundations/设计模式.md)
- [代码题](/2code/index.md)
- [大前端](/2code/front-end/index.md)
- [CSS](/2code/front-end/CSS.md)
- [JavaScript](/2code/front-end/JavaScript/index.md)
- [Arrary](/2code/front-end/JavaScript/Arrary.md)
- [Promise](/2code/front-end/JavaScript/Promise.md)
Expand All @@ -54,6 +55,7 @@
- [redux](/2code/front-end/React/redux.md)
- [todoList](/2code/front-end/React/todoList.md)
- [计时器](/2code/front-end/React/计时器.md)
- [css](/2code/front-end/css.md)
- [力扣](/2code/leet-code/index.md)
- [设计模式](/2code/设计模式.md)
- [场景题](/3scene-questions/index.md)
Expand Down

0 comments on commit ad886fc

Please sign in to comment.