Commit 8e03404

committed

fix: update sorting algorithms

1 parent 0cfeeba commit 8e03404Copy full SHA for 8e03404

File tree

15 files changed

+330

-285

lines changed

README.md
README_EN.md
basic
- README.md
- README_EN.md
- sorting
  - BubbleSort
    - BubbleSort.java
    - README.md
  - InsertionSort
    - InsertionSort.java
    - README.md
  - MergeSort
    - MergeSort.java
    - README.md
  - QuickSort
    - QuickSort.java
    - README.md
- sort
  - README.md
- summary.md
index.html

15 files changed

+330

-285

lines changed

`‎README.md‎`

Lines changed: 32 additions & 23 deletions

Original file line number	Diff line number	Diff line change
`@@ -25,39 +25,48 @@`
`25`	`25`	`- Gitee Pages: https://doocs.gitee.io/leetcode`
`26`	`26`	`- GitHub Pages: https://doocs.github.io/leetcode`
`27`	`27`
`28`		`-## 题解`
	`28`	`+## LeetCode 全解`
`29`	`29`
`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)`
`33`	`42`
`34`	`43`	`## 面试高频考题`
`35`	`44`
`36`	`45`	`### 数组`
`37`	`46`
`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)`
`40`	`49`
`41`	`50`	`### 链表`
`42`	`51`
`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)`
`49`	`58`
`50`	`59`	`### 二叉树`
`51`	`60`
`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)`
`54`	`63`
`55`	`64`	`### 数学`
`56`	`65`
`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)`
`61`	`70`
`62`	`71`	`### 栈和队列`
`63`	`72`
`@@ -75,10 +84,10 @@`
`75`	`84`
`76`	`85`	`如果你对本项目感兴趣,并且希望加入我们刷题大军,欢迎随时提交 [PR](https://github.com/doocs/leetcode/pulls)。请参考如下步骤:`
`77`	`86`
`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) 了解更多细节。`
`82`	`91`
`83`	`92`	`<p align="center">`
`84`	`93`	`<a href="https://github.com/doocs/leetcode"><img src="./images/how-to-contribute.png" alt="how-to-contribute"></a>`
`@@ -103,7 +112,7 @@`
`103`	`112`	`<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>`
`104`	`113`
`105`	`114`
`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)`
`107`	`116`
`108`	`117`	`## 许可证`
`109`	`118`

`‎README_EN.md‎`

Lines changed: 22 additions & 18 deletions

Original file line number	Diff line number	Diff line change
`@@ -27,33 +27,37 @@ Complete solutions to [LeetCode](https://leetcode-cn.com/problemset/all/), [LCOF`
`27`	`27`
`28`	`28`	`## Solutions`
`29`	`29`
`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)`
`33`	`33`
`34`		`-## High frequency interview questions`
	`34`	`+## Basic Algorithms`
	`35`	`+`
	`36`	`+1. [Sorting](/basic/sort/README.md)`
	`37`	`+`
	`38`	`+## High Frequency Interview Questions`
`35`	`39`
`36`	`40`	`### Arrays`
`37`	`41`
`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)`
`39`	`43`
`40`	`44`	`### Linked List`
`41`	`45`
`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)`
`47`	`51`
`48`	`52`	`### Binary Tree`
`49`	`53`
`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)`
`52`	`56`
`53`	`57`
`54`	`58`	`### Math`
`55`	`59`
`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)`
`57`	`61`
`58`	`62`	`### Stack & Queue`
`59`	`63`
`@@ -70,10 +74,10 @@ Complete solutions to [LeetCode](https://leetcode-cn.com/problemset/all/), [LCOF`
`70`	`74`
`71`	`75`	`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:`
`72`	`76`
`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.`
`77`	`81`
`78`	`82`	`<p align="center">`
`79`	`83`	`<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!`
`98`	`102`	`<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>`
`99`	`103`
`100`	`104`
`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)`
`102`	`106`
`103`	`107`	`## License`
`104`	`108`

`‎basic/README.md‎`

Lines changed: 4 additions & 7 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,10 +2,7 @@`
`2`	`2`
`3`	`3`	`## 常见的排序算法`
`4`	`4`
`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)

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit 8e03404

File tree

15 files changed

15 files changed

`‎README.md‎`

`‎README_EN.md‎`

`‎basic/README.md‎`

`‎basic/README_EN.md‎`

0 commit comments