Skip to content

Commit 8e03404

Browse files
yanglbmeyanglbme
committed
fix: update sorting algorithms
1 parent 0cfeeba commit 8e03404

File tree

15 files changed

+330
-285
lines changed

15 files changed

+330
-285
lines changed

‎README.md

Lines changed: 32 additions & 23 deletions
Original file line numberDiff line numberDiff line change
@@ -25,39 +25,48 @@
2525
- Gitee Pages: https://doocs.gitee.io/leetcode
2626
- GitHub Pages: https://doocs.github.io/leetcode
2727

28-
## 题解
28+
## LeetCode 全解
2929

30-
- [LeetCode](/solution/README.md)
31-
- [LeetCode 《剑指 Offer（第 2 版）》](/lcof/README.md)
32-
- [LeetCode 《程序员面试金典（第 6 版）》](/lcci/README.md)
30+
1. [LeetCode](/solution/README.md)
31+
1. [LeetCode 《剑指 Offer（第 2 版）》](/lcof/README.md)
32+
1. [LeetCode 《程序员面试金典（第 6 版）》](/lcci/README.md)
33+
34+
## 基础算法通关
35+
36+
### 常见的排序算法
37+
38+
1. [冒泡排序](/basic/sorting/BubbleSort/README.md)
39+
1. [插入排序](/basic/sorting/InsertionSort/README.md)
40+
1. [归并排序](/basic/sorting/MergeSort/README.md)
41+
1. [快速排序](/basic/sorting/QuickSort/README.md)
3342

3443
## 面试高频考题
3544

3645
### 数组
3746

38-
1. [数组中重复的数字](./lcof/面试题03.%20数组中重复的数字/README.md)
39-
1. [旋转数组](./solution/0100-0199/0189.Rotate%20Array/README.md)
47+
1. [数组中重复的数字](/lcof/面试题03.%20数组中重复的数字/README.md)
48+
1. [旋转数组](/solution/0100-0199/0189.Rotate%20Array/README.md)
4049

4150
### 链表
4251

43-
1. [从尾到头打印链表](./lcof/面试题06.%20从尾到头打印链表/README.md)
44-
1. [删除链表的节点](./lcof/面试题18.%20删除链表的节点/README.md)
45-
1. [链表中倒数第 k 个节点](./lcci/02.02.Kth%20Node%20From%20End%20of%20List/README.md)
46-
1. [反转链表](./solution/0200-0299/0206.Reverse%20Linked%20List/README.md)
47-
1. [环形链表](./solution/0100-0199/0141.Linked%20List%20Cycle/README.md)
48-
1. [环形链表 II](./solution/0100-0199/0142.Linked%20List%20Cycle%20II/README.md)
52+
1. [从尾到头打印链表](/lcof/面试题06.%20从尾到头打印链表/README.md)
53+
1. [删除链表的节点](/lcof/面试题18.%20删除链表的节点/README.md)
54+
1. [链表中倒数第 k 个节点](/lcci/02.02.Kth%20Node%20From%20End%20of%20List/README.md)
55+
1. [反转链表](/solution/0200-0299/0206.Reverse%20Linked%20List/README.md)
56+
1. [环形链表](/solution/0100-0199/0141.Linked%20List%20Cycle/README.md)
57+
1. [环形链表 II](/solution/0100-0199/0142.Linked%20List%20Cycle%20II/README.md)
4958

5059
### 二叉树
5160

52-
1. [二叉树的最近公共祖先](./solution/0200-0299/0235.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree/README.md)
53-
1. [二叉搜索树的最近公共祖先](./solution/0200-0299/0236.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree/README.md)
61+
1. [二叉树的最近公共祖先](/solution/0200-0299/0235.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree/README.md)
62+
1. [二叉搜索树的最近公共祖先](/solution/0200-0299/0236.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree/README.md)
5463

5564
### 数学
5665

57-
1. [数组中数字出现的次数](./lcof/面试题56%20-%20I.%20数组中数字出现的次数/README.md)
58-
1. [数组中数字出现的次数 II](./lcof/面试题56%20-%20II.%20数组中数字出现的次数%20II/README.md)
59-
1. [错误的集合](./solution/0600-0699/0645.Set%20Mismatch/README.md)
60-
1. [二进制中 1 的个数](./lcof/面试题15.%20二进制中1的个数/README.md)
66+
1. [数组中数字出现的次数](/lcof/面试题56%20-%20I.%20数组中数字出现的次数/README.md)
67+
1. [数组中数字出现的次数 II](/lcof/面试题56%20-%20II.%20数组中数字出现的次数%20II/README.md)
68+
1. [错误的集合](/solution/0600-0699/0645.Set%20Mismatch/README.md)
69+
1. [二进制中 1 的个数](/lcof/面试题15.%20二进制中1的个数/README.md)
6170

6271
### 栈和队列
6372

@@ -75,10 +84,10 @@
7584

7685
如果你对本项目感兴趣，并且希望加入我们刷题大军，欢迎随时提交 [PR](https://github.com/doocs/leetcode/pulls)。请参考如下步骤：
7786

78-
- 将[本项目](https://github.com/doocs/leetcode) <kbd>fork</kbd> 到你的个人 GitHub 帐户，然后 <kbd>clone</kbd> 到你的本地机器；
79-
- 对项目做出一些变更，然后使用 git <kbd>add</kbd>、<kbd>commit</kbd>、<kbd>push</kbd> 等命令将你的变更提交到你的远程 GitHub 仓库；
80-
- 将你的变更以 PR 的形式提交过来，项目的维护人员会在第一时间对你的变更进行 review！
81-
- 你也可以参考 [GitHub 帮助文档](https://help.github.com/cn) 了解更多细节。
87+
1. 将[本项目](https://github.com/doocs/leetcode) <kbd>fork</kbd> 到你的个人 GitHub 帐户，然后 <kbd>clone</kbd> 到你的本地机器；
88+
1. 对项目做出一些变更，然后使用 git <kbd>add</kbd>、<kbd>commit</kbd>、<kbd>push</kbd> 等命令将你的变更提交到你的远程 GitHub 仓库；
89+
1. 将你的变更以 PR 的形式提交过来，项目的维护人员会在第一时间对你的变更进行 review！
90+
1. 你也可以参考 [GitHub 帮助文档](https://help.github.com/cn) 了解更多细节。
8291

8392
<p align="center">
8493
<a href="https://github.com/doocs/leetcode"><img src="./images/how-to-contribute.png" alt="how-to-contribute"></a>
@@ -103,7 +112,7 @@
103112
<a href="https://opencollective.com/doocs-leetcode/sponsors.svg?width=890" target="_blank"><img src="https://opencollective.com/doocs-leetcode/sponsors.svg?width=890"></a>
104113

105114

106-
> You help the developer community practice for interviews, and there is nothing better we could ask for. -- [Alan Yessenbayev](https://opencollective.com/alan-yessenbayev)
115+
> You help the developer community practice for interviews, and there is nothing better we could ask for. -1. [Alan Yessenbayev](https://opencollective.com/alan-yessenbayev)
107116
108117
## 许可证
109118

‎README_EN.md

Lines changed: 22 additions & 18 deletions
Original file line numberDiff line numberDiff line change
@@ -27,33 +27,37 @@ Complete solutions to [LeetCode](https://leetcode-cn.com/problemset/all/), [LCOF
2727

2828
## Solutions
2929

30-
- [LeetCode](/solution/README_EN.md)
31-
- [LCOF: *Coding Interviews, 2nd Edition*](/lcof/README_EN.md)
32-
- [LCCI: *Cracking the Coding Interview, 6th Edition*](/lcci/README_EN.md)
30+
1. [LeetCode](/solution/README_EN.md)
31+
1. [LCOF: *Coding Interviews, 2nd Edition*](/lcof/README_EN.md)
32+
1. [LCCI: *Cracking the Coding Interview, 6th Edition*](/lcci/README_EN.md)
3333

34-
## High frequency interview questions
34+
## Basic Algorithms
35+
36+
1. [Sorting](/basic/sort/README.md)
37+
38+
## High Frequency Interview Questions
3539

3640
### Arrays
3741

38-
1. [Rotate Array](./solution/0100-0199/0189.Rotate%20Array/README_EN.md)
42+
1. [Rotate Array](/solution/0100-0199/0189.Rotate%20Array/README_EN.md)
3943

4044
### Linked List
4145

42-
1. [Delete Node in a Linked List](./solution/0200-0299/0237.Delete%20Node%20in%20a%20Linked%20List/README_EN.md)
43-
1. [Kth Node From End of List](./lcci/02.02.Kth%20Node%20From%20End%20of%20List/README_EN.md)
44-
1. [Reverse Linked List](./solution/0200-0299/0206.Reverse%20Linked%20List/README_EN.md)
45-
1. [Linked List Cycle](./solution/0100-0199/0141.Linked%20List%20Cycle/README_EN.md)
46-
1. [Linked List Cycle II](./solution/0100-0199/0142.Linked%20List%20Cycle%20II/README_EN.md)
46+
1. [Delete Node in a Linked List](/solution/0200-0299/0237.Delete%20Node%20in%20a%20Linked%20List/README_EN.md)
47+
1. [Kth Node From End of List](/lcci/02.02.Kth%20Node%20From%20End%20of%20List/README_EN.md)
48+
1. [Reverse Linked List](/solution/0200-0299/0206.Reverse%20Linked%20List/README_EN.md)
49+
1. [Linked List Cycle](/solution/0100-0199/0141.Linked%20List%20Cycle/README_EN.md)
50+
1. [Linked List Cycle II](/solution/0100-0199/0142.Linked%20List%20Cycle%20II/README_EN.md)
4751

4852
### Binary Tree
4953

50-
1. [Lowest Common Ancestor of a Binary Tree](./solution/0200-0299/0236.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree/README_EN.md)
51-
1. [Lowest Common Ancestor of a Binary Search Tree](./solution/0200-0299/0235.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree/README_EN.md)
54+
1. [Lowest Common Ancestor of a Binary Tree](/solution/0200-0299/0236.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Tree/README_EN.md)
55+
1. [Lowest Common Ancestor of a Binary Search Tree](/solution/0200-0299/0235.Lowest%20Common%20Ancestor%20of%20a%20Binary%20Search%20Tree/README_EN.md)
5256

5357

5458
### Math
5559

56-
1. [Set Mismatch](./solution/0600-0699/0645.Set%20Mismatch/README_EN.md)
60+
1. [Set Mismatch](/solution/0600-0699/0645.Set%20Mismatch/README_EN.md)
5761

5862
### Stack & Queue
5963

@@ -70,10 +74,10 @@ Complete solutions to [LeetCode](https://leetcode-cn.com/problemset/all/), [LCOF
7074

7175
I'm looking for long-term contributors/partners to this repo! Send me [PRs](https://github.com/doocs/leetcode/pulls) if you're interested! See the following:
7276

73-
- <kbd>Fork</kbd> [this repository](https://github.com/doocs/leetcode) to your own GitHub account and then <kbd>clone</kbd> it to your local machine.
74-
- Make some changes to your leetcode repository, then <kbd>add</kbd>, <kbd>commit</kbd> and <kbd>push</kbd> the changes to your remote GitHub repository.
75-
- Submit a pull request with your changes!
76-
- See [CONTRIBUTING](https://github.com/doocs/.github/blob/master/CONTRIBUTING.md) or [GitHub Help](https://help.github.com/en) for more details.
77+
1. <kbd>Fork</kbd> [this repository](https://github.com/doocs/leetcode) to your own GitHub account and then <kbd>clone</kbd> it to your local machine.
78+
1. Make some changes to your leetcode repository, then <kbd>add</kbd>, <kbd>commit</kbd> and <kbd>push</kbd> the changes to your remote GitHub repository.
79+
1. Submit a pull request with your changes!
80+
1. See [CONTRIBUTING](https://github.com/doocs/.github/blob/master/CONTRIBUTING.md) or [GitHub Help](https://help.github.com/en) for more details.
7781

7882
<p align="center">
7983
<a href="https://github.com/doocs/leetcode"><img src="./images/how-to-contribute.png" alt="how-to-contribute"></a>
@@ -98,7 +102,7 @@ Thank you to all our backers and sponsors!
98102
<a href="https://opencollective.com/doocs-leetcode/sponsors.svg?width=890" target="_blank"><img src="https://opencollective.com/doocs-leetcode/sponsors.svg?width=890"></a>
99103

100104

101-
> You help the developer community practice for interviews, and there is nothing better we could ask for. -- [Alan Yessenbayev](https://opencollective.com/alan-yessenbayev)
105+
> You help the developer community practice for interviews, and there is nothing better we could ask for. -1. [Alan Yessenbayev](https://opencollective.com/alan-yessenbayev)
102106
103107
## License
104108

‎basic/README.md

Lines changed: 4 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -2,10 +2,7 @@
22

33
## 常见的排序算法
44

5-
- 冒泡排序
6-
- 插入排序
7-
- 归并排序
8-
- 快速排序
9-
- 拓扑排序
10-
- 堆排序
11-
- 桶排序
5+
- [冒泡排序](./sorting/BubbleSort/README.md)
6+
- [插入排序](./sorting/InsertionSort/README.md)
7+
- [归并排序](./sorting/MergeSort/README.md)
8+
- [快速排序](./sorting/QuickSort/README.md)

‎basic/README_EN.md

Whitespace-only changes.

0 commit comments

Comments
 (0)
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy