Skip to content

Commit 4ee42a1

Browse files
Zhi2014Zhi2014
committed
add file
1 parent 75d050a commit 4ee42a1

File tree

134 files changed

+9788
-10017
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

134 files changed

+9788
-10017
lines changed

‎README.md

Lines changed: 1747 additions & 1747 deletions
Large diffs are not rendered by default.

‎SUMMARY.md

Lines changed: 74 additions & 76 deletions
Original file line numberDiff line numberDiff line change
@@ -1,79 +1,77 @@
11
# Summary
22

33
* [Introduction](README.md)
4-
* [题目](docs/source/question/readme.md)
5-
- [0001-0100](docs/source/question/0001-0100.md)
6-
- [0100-0200](docs/source/question/0101-0200.md)
7-
- [0201-0300](docs/source/question/0201-0300.md)
8-
- [0301-0400](docs/source/question/0301-0400.md)
9-
- [0401-0500](docs/source/question/0401-0500.md)
10-
- [0501-0600](docs/source/question/0501-0600.md)
11-
- [0601-0700](docs/source/question/0601-0700.md)
12-
- [0701-0800](docs/source/question/0701-0800.md)
13-
- [0801-0900](docs/source/question/0801-0900.md)
14-
- [0901-1000](docs/source/question/0901-1000.md)
15-
- [1001-1100](docs/source/question/1001-1100.md)
16-
- [1101-1200](docs/source/question/1101-1200.md)
17-
- [1201-1300](docs/source/question/1201-1300.md)
18-
- [1301-1400](docs/source/question/1301-1400.md)
19-
- [1401-1500](docs/source/question/1401-1500.md)
20-
- [1501-1600](docs/source/question/1501-1600.md)
21-
- [1601-1700](docs/source/question/1601-1700.md)
22-
- [1701-1800](docs/source/question/1701-1800.md)
23-
- [1801-1900](docs/source/question/1801-1900.md)
24-
- [1901-2000](docs/source/question/1901-2000.md)
25-
- [2001-2100](docs/source/question/2001-2100.md)
26-
- [2101-2200](docs/source/question/2101-2200.md)
27-
- [2201-2300](docs/source/question/2201-2300.md)
28-
- [2301-2400](docs/source/question/2301-2400.md)
29-
- [2401-2500](docs/source/question/2401-2500.md)
30-
- [lcp](docs/source/question/lcp.md)
31-
- [lcs](docs/source/question/lcs.md)
32-
- [mysql](docs/source/question/mysql.md)
33-
- [bash](docs/source/question/bash.md)
34-
- [剑指offer](docs/source/question/offer.md)
35-
- [剑指offer2](docs/source/question/offer2.md)
36-
- [程序员面试金典](docs/source/question/lcci.md)
37-
- [acmcoder-基础系列](docs/source/question/acmcoder-基本算法.md)
38-
* [分类/书籍](docs/source/question/readme.md)
39-
- [重复问题](docs/source/classification/same.md)
40-
- [系列问题](docs/source/classification/class.md)
41-
- [书籍-剑指offer-完成](docs/source/classification/offer.md)
42-
- [书籍-剑指offer](docs/source/classification/offer2.md)
43-
- [书籍-程序员面试金典](docs/source/classification/lcci.md)
44-
- [lcp](docs/source/classification/lcp.md)
45-
- [leetcode-竞赛](docs/source/classification/leetcode_contest.md)
46-
- [初级算法(49)-完成](docs/source/classification/easy.md)
47-
- [中级算法(45)-完成](docs/source/classification/medium.md)
48-
- [高级算法(47)](docs/source/classification/hard.md)
49-
- [热题100(100)-完成](docs/source/classification/hot-100.md)
50-
- [腾讯精选练习50题(50)-完成](docs/source/classification/50.md)
51-
- [数据结构-数组与字符串(22)-完成](docs/source/classification/data-array_and_string.md)
52-
- [数据结构-队列与栈(19)-完成](docs/source/classification/data-queue-stack.md)
53-
- [数据结构-递归(12)-完成](docs/source/classification/data-recursion.md)
54-
- [牛客-华为](docs/source/classification/nowcoder_hw.md)
55-
- [牛客-拼多多](docs/source/classification/nowcoder_pdd.md)
56-
- [PAT-乙级](docs/source/classification/patB.md)
57-
- [github-labuladong](docs/source/classification/github-labuladong.md)
58-
* [算法](docs/source/question/readme.md)
59-
- [查找](docs/source/algorithm/查找算法.md)
60-
- [排序](docs/source/algorithm/排序/排序-算法.md)
61-
- [排序-堆](docs/source/algorithm/排序/排序-堆.md)
62-
- [Trie树(前缀树/字典树)](docs/source/algorithm/字符串/字符串-trie.md)
63-
- [并查集](docs/source/algorithm/并查集.md)
64-
- [数组-树状数组](docs/source/algorithm/数组/数组-树状数组.md)
65-
- [数组-前缀和](docs/source/algorithm/数组/数组-前缀和.md)
66-
- [数组-差分数组](docs/source/algorithm/数组/数组-差分数组.md)
67-
- [字符串-KMP算法](docs/source/algorithm/字符串/字符串-KMP算法.md)
68-
- [字符串-马拉车算法](docs/source/algorithm/字符串/字符串-马拉车算法.md)
69-
- [背包问题-01背包](docs/source/algorithm/动态规划/动态规划-背包问题-01背包.md)
70-
- [背包问题-完全背包](docs/source/algorithm/动态规划/动态规划-背包问题-完全背包.md)
71-
* [牛客](docs/source/question/readme.md)
72-
- [华为机试](docs/source/nowcoder/hw.md)
73-
- [拼多多](docs/source/nowcoder/pdd.md)
74-
* [PAT](docs/source/question/readme.md)
75-
- [PAT-乙级](docs/source/question/patB.md)
76-
* [ACM在线笔试模式](docs/source/question/readme.md)
77-
- [ACM-go语言处理](docs/source/go/1-go语言acm刷题输入问题.md)
78-
79-
4+
5+
* [经验总结](docs/source/experience/readme.md)
6+
- [如何刷题](docs/source/experience/如何刷题.md)
7+
- [ACM在线笔试模式-go语言处理](docs/source/experience/go语言acm刷题输入问题.md)
8+
* [题目分类](docs/source/classification/readme.md)
9+
- [书籍-剑指offer-完成](docs/source/classification/lc_offer.md)
10+
- [书籍-剑指offer(专项突击版)-完成](docs/source/classification/lc_offer2.md)
11+
- [书籍-程序员面试金典](docs/source/classification/lc_lcci.md)
12+
- [github-labuladong](docs/source/classification/github-labuladong.md)
13+
- [lc-重复问题](docs/source/classification/lc_same.md)
14+
- [lc-系列问题](docs/source/classification/class.md)
15+
- [lc-热题100(100)-完成](docs/source/classification/lc_hot-100.md)
16+
- [lc-腾讯精选练习50题(50)-完成](docs/source/classification/lc_50.md)
17+
- [lc-初级算法(49)-完成](docs/source/classification/lc_easy.md)
18+
- [lc-中级算法(45)-完成](docs/source/classification/lc_medium.md)
19+
- [lc-高级算法(47)](docs/source/classification/lc_hard.md)
20+
- [lc-数据结构-数组与字符串(22)-完成](docs/source/classification/lc_data-array_and_string.md)
21+
- [lc-数据结构-队列与栈(19)-完成](docs/source/classification/lc_data-queue-stack.md)
22+
- [lc-数据结构-递归(12)-完成](docs/source/classification/lc_data-recursion.md)
23+
- [lc-力扣杯](docs/source/classification/lc_lcp.md)
24+
- [lc-竞赛](docs/source/classification/lc_contest.md)
25+
- [牛客-华为](docs/source/classification/nowcoder_hw.md)
26+
- [牛客-拼多多](docs/source/classification/nowcoder_pdd.md)
27+
- [PAT-乙级](docs/source/classification/patB.md)
28+
* [算法列表](docs/source/algorithm/readme.md)
29+
- [查找](docs/source/algorithm/查找算法.md)
30+
- [排序](docs/source/algorithm/排序/排序-算法.md)
31+
- [排序-堆](docs/source/algorithm/排序/排序-堆.md)
32+
- [Trie树(前缀树/字典树)](docs/source/algorithm/字符串/字符串-trie.md)
33+
- [并查集](docs/source/algorithm/并查集.md)
34+
- [数组-树状数组](docs/source/algorithm/数组/数组-树状数组.md)
35+
- [数组-前缀和](docs/source/algorithm/数组/数组-前缀和.md)
36+
- [数组-差分数组](docs/source/algorithm/数组/数组-差分数组.md)
37+
- [字符串-KMP算法](docs/source/algorithm/字符串/字符串-KMP算法.md)
38+
- [字符串-马拉车算法](docs/source/algorithm/字符串/字符串-马拉车算法.md)
39+
- [背包问题-01背包](docs/source/algorithm/动态规划/动态规划-背包问题-01背包.md)
40+
- [背包问题-完全背包](docs/source/algorithm/动态规划/动态规划-背包问题-完全背包.md)
41+
* [题目列表](docs/source/question/readme.md)
42+
- [0001-0100](docs/source/question/0001-0100.md)
43+
- [0100-0200](docs/source/question/0101-0200.md)
44+
- [0201-0300](docs/source/question/0201-0300.md)
45+
- [0301-0400](docs/source/question/0301-0400.md)
46+
- [0401-0500](docs/source/question/0401-0500.md)
47+
- [0501-0600](docs/source/question/0501-0600.md)
48+
- [0601-0700](docs/source/question/0601-0700.md)
49+
- [0701-0800](docs/source/question/0701-0800.md)
50+
- [0801-0900](docs/source/question/0801-0900.md)
51+
- [0901-1000](docs/source/question/0901-1000.md)
52+
- [1001-1100](docs/source/question/1001-1100.md)
53+
- [1101-1200](docs/source/question/1101-1200.md)
54+
- [1201-1300](docs/source/question/1201-1300.md)
55+
- [1301-1400](docs/source/question/1301-1400.md)
56+
- [1401-1500](docs/source/question/1401-1500.md)
57+
- [1501-1600](docs/source/question/1501-1600.md)
58+
- [1601-1700](docs/source/question/1601-1700.md)
59+
- [1701-1800](docs/source/question/1701-1800.md)
60+
- [1801-1900](docs/source/question/1801-1900.md)
61+
- [1901-2000](docs/source/question/1901-2000.md)
62+
- [2001-2100](docs/source/question/2001-2100.md)
63+
- [2101-2200](docs/source/question/2101-2200.md)
64+
- [2201-2300](docs/source/question/2201-2300.md)
65+
- [2301-2400](docs/source/question/2301-2400.md)
66+
- [2401-2500](docs/source/question/2401-2500.md)
67+
- [lcp](docs/source/question/lcp.md)
68+
- [lcs](docs/source/question/lcs.md)
69+
- [mysql](docs/source/question/mysql.md)
70+
- [bash](docs/source/question/bash.md)
71+
- [剑指offer](docs/source/question/offer.md)
72+
- [剑指offer2](docs/source/question/offer2.md)
73+
- [程序员面试金典](docs/source/question/lcci.md)
74+
- [acmcoder-基础系列](docs/source/question/acmcoder-基本算法.md)
75+
- [华为机试](docs/source/nowcoder/hw.md)
76+
- [拼多多](docs/source/nowcoder/pdd.md)
77+
- [PAT-乙级](docs/source/question/patB.md)

‎docs/Makefile

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -17,4 +17,4 @@ help:
1717
# Catch-all target: route all unknown targets to Sphinx using the new
1818
# "make mode" option. $(O) is meant as a shortcut for $(SPHINXOPTS).
1919
%: Makefile
20-
@$(SPHINXBUILD) -M $@ "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)
20+
@$(SPHINXBUILD) -M $@ "$(SOURCEDIR)" "$(BUILDDIR)" $(SPHINXOPTS) $(O)

‎docs/build/html/_static/jquery-3.2.1.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -8518,7 +8518,7 @@ var
85188518
/* Transports bindings
85198519
* 1) key is the dataType
85208520
* 2) the catchall symbol "*" can be used
8521-
* 3) selection will start with transport dataType and THEN go to "*" if needed
8521+
* 3) selection will start with transport dataType and THEN experience to "*" if needed
85228522
*/
85238523
transports = {},
85248524

‎docs/build/html/_static/jquery-3.4.1.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -8777,7 +8777,7 @@ var
87778777
/* Transports bindings
87788778
* 1) key is the dataType
87798779
* 2) the catchall symbol "*" can be used
8780-
* 3) selection will start with transport dataType and THEN go to "*" if needed
8780+
* 3) selection will start with transport dataType and THEN experience to "*" if needed
87818781
*/
87828782
transports = {},
87838783

‎docs/build/html/_static/underscore-1.3.1.js

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -408,7 +408,7 @@
408408
};
409409

410410
// Zip together multiple lists into a single array -- elements that share
411-
// an index go together.
411+
// an index experience together.
412412
_.zip = function() {
413413
var args = slice.call(arguments);
414414
var length = _.max(_.pluck(args, 'length'));

‎docs/build/html/searchindex.js

Lines changed: 1 addition & 1 deletion
Some generated files are not rendered by default. Learn more about customizing how changed files appear on GitHub.

‎docs/source/algorithm/二叉树/树-AVL树.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -11,5 +11,5 @@
1111
## 3、Leetcode
1212

1313
| Title | Tag | 难度 | 完成情况 |
14-
|-------|-----|----|------|
14+
| :-------| :-----| :----| :------|
1515
| | | | |

‎docs/source/algorithm/二叉树/树-二叉搜索树.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -11,5 +11,5 @@
1111
## 3、Leetcode
1212

1313
| Title | Tag | 难度 | 完成情况 |
14-
|-------|-----|----|------|
14+
| :-------| :-----| :----| :------|
1515
| | | | |

‎docs/source/algorithm/二叉树/树-二叉树.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -11,5 +11,5 @@
1111
## 3、Leetcode
1212

1313
| Title | Tag | 难度 | 完成情况 |
14-
|-------|-----|----|------|
14+
| :-------| :-----| :----| :------|
1515
| | | | |

‎docs/source/algorithm/二叉树/树-平衡树.md

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
# 树-平衡树
22

3-
- 参考：https://leetcode-cn.com/problems/balance-a-binary-search-tree/solution/shou-si-avlshu-wo-bu-guan-wo-jiu-shi-yao-xuan-zhua/
3+
- 参考：https://leetcode.cn/problems/balance-a-binary-search-tree/solution/shou-si-avlshu-wo-bu-guan-wo-jiu-shi-yao-xuan-zhua/
44

55
## 0、定义
66

@@ -38,5 +38,5 @@ func (this *Node) Insert(node *Node) bool {
3838
## 3、Leetcode
3939

4040
| Title | Tag | 难度 | 完成情况 |
41-
|-----------------------------------------------------------------|-----|--------|------|
42-
| [729.我的日程安排表I](https://leetcode-cn.com/problems/my-calendar-i/) | 数组 | Medium | 完成 |
41+
| :-----------------------------------------------------------------| :-----| :--------| :------|
42+
| [729.我的日程安排表I](https://leetcode.cn/problems/my-calendar-i/) | 数组 | Medium | 完成 |

‎docs/source/algorithm/二叉树/树-平衡树树堆Treap.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -141,5 +141,5 @@ func (t *treap) max() (max *Node) {
141141
## 3、Leetcode
142142

143143
| Title | Tag | 难度 | 完成情况 |
144-
|---------------------------------------------------------------------------------------------------------------------------------------|------------------------------------|--------|------|
145-
| [1438.绝对差不超过限制的最长连续子数组](https://leetcode-cn.com/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/) | 队列、数组、有序集合、滑动窗口、<br />单调队列、堆（优先队列） | Medium | 完成 |
144+
| :---------------------------------------------------------------------------------------------------------------------------------------| :------------------------------------| :--------| :------|
145+
| [1438.绝对差不超过限制的最长连续子数组](https://leetcode.cn/problems/longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit/) | 队列、数组、有序集合、滑动窗口、<br />单调队列、堆（优先队列） | Medium | 完成 |

‎docs/source/algorithm/二叉树/树-红黑树.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -100,5 +100,5 @@ class Solution:
100100
## 3、Leetcode
101101

102102
| Title | Tag | 难度 | 完成情况 |
103-
|-------|-----|----|------|
103+
| :-------| :-----| :----| :------|
104104
| | | | |

‎docs/source/algorithm/位运算/位运算.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@
33
## 0、定义
44

55
| 操作符 | 含义 | |
6-
|-----|---------|--------------------------------------------------------------------------------------------------------|
6+
| :-----| :---------| :--------------------------------------------------------------------------------------------------------|
77
| ^ | 2元：异或 | |
88
| &^ | 2元：按位置零 | z = x &^ y，表示如果 y 中的 bit 位为 1，则 z 对应 bit 位为 0，否则 z 对应 bit 位等于 x 中相应的 bit 位的值 |
99
| & | 位与 | 2个位都是1，结果才位1，否则结果为0 |

‎docs/source/algorithm/几何/几何-斜率.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -58,5 +58,5 @@ if x1 == x2{
5858
## 3、Leetcode
5959

6060
| Title | Tag | 难度 | 完成情况 |
61-
|-------------------------------------------------------------------|--------------|--------|------|
62-
| [面试题16.14.最佳直线](https://leetcode-cn.com/problems/best-line-lcci/) | 几何、数组、哈希表、数学 | Medium | 完成 |
61+
| :-------------------------------------------------------------------| :--------------| :--------| :------|
62+
| [面试题16.14.最佳直线](https://leetcode.cn/problems/best-line-lcci/) | 几何、数组、哈希表、数学 | Medium | 完成 |

0 commit comments

Comments
 (0)