Merge branch 'master' of https://github.com/azl397985856/leetcode

Author: lucifer

CONTRIBUTING.md

@@ -16,6 +16,7 @@
 - drawio 文件 或者图片（如果你画图的话）
 
 > 模板可参考 [1014.best-sightseeing-pair](./templates/problems/1014.best-sightseeing-pair.md)
+> 也可以使用其他画图工具，比如 https://excalidraw.com/ 或者 draw.io 或者 processon 或者 ipad 画图
 
 ## 贡献每日一题
 

README.en.md

@@ -15,10 +15,10 @@
 
 ![leetcode.jpeg](./assets/leetcode.jpeg)
 
-This essay records the course of and my emotion to this project from initialisation to 10,000 stars.
+This essay records the course of and my emotion to this project from initialization to 10,000 stars.
 [Milestone for 10,000+ stars](./thanksGiving.md)
 
-If you are interested in this project, **do not mean your star**. This project will be **supported for a long enough time** by the comminity. Thanks for every audience and contributor.
+If you are interested in this project, **do not mean your star**. This project will be **supported for a long enough time** by the community. Thanks for every audience and contributor.
 
 ## Introduction
 
@@ -36,15 +36,15 @@ This repository is divided into five parts for now:
 
 - The fourth part is daily challenges which were held at group chat. We usually solve one problem altogether to get more feedback. Moreover, the problems can be drafted to add to the problem solving module.
 
-- The fifth part is a future plannning on content that will be introduced into the above parts.
+- The fifth part is a future planning on content that will be introduced into the above parts.
 
 > Only when having mastered the basic data structures and algorithms can you solve complex problems easily.
 
 ## About me
 
 I, a programmer, am all passionate about technology.
 
-Used to write `.net` and `Java`, I am a frontend engineer and focused on the engineering, optimization and standardlization for frontend.
+Used to write `.net` and `Java`, I am a frontend engineer and focused on the engineering, optimization and standardization for frontend.
 
 If you want to do some contributions or collaborations, just feel free to contact me via [[email protected]].
 
@@ -59,15 +59,15 @@ If you want to do some contributions or collaborations, just feel free to contac
 
 (Picture credited by [LeetCode-cn](https://www.zhihu.com/question/24964987/answer/586425979).)
 
-The algorithms mainly includes:
+The algorithms mainly include:
 
 - Basic skills: Divide-and-Conquer; Binary; Greedy
 - Sorting algorithms: Quicksort; Merge Sort; Counting Sort
 - Searching algorithms: Backtracking; Recursion; Depth-First-Search (DFS); Breath-First-Search (BFS); Binary Search Tree; etc.
 - Graph theory: Shortest Path Problem; Minimal Spanning Tree
 - Dynamic Programming: Knapsack Problem; Longest Common Subsequence (LCS) Problem
 
-The data structures mainly includes:
+The data structures mainly include:
 
 - Array and linked list: Singly/Doubly-Linked List
 - Stack and queue

problems/23.merge-k-sorted-lists.md

@@ -37,7 +37,7 @@ https://leetcode-cn.com/problems/merge-k-sorted-lists/description/
 ## 关键点解析
 
 - 分治
-- 合并排序(merge sort)
+- 归并排序(merge sort)
 
 ## 代码
 
@@ -159,4 +159,4 @@ class Solution:
 
 ## 相关题目
 
--[88.merge-sorted-array](./88.merge-sorted-array.md)
+- [88.merge-sorted-array](./88.merge-sorted-array.md)

problems/46.permutations.md

@@ -170,7 +170,7 @@ class Solution:
 - [39.combination-sum](./39.combination-sum.md)
 - [40.combination-sum-ii](./40.combination-sum-ii.md)
 - [47.permutations-ii](./47.permutations-ii.md)
-- [60.permutation-sequence](./60.permutation-sequence.md)(TODO)
+- [60.permutation-sequence](./60.permutation-sequence.md)
 - [78.subsets](./78.subsets.md)
 - [90.subsets-ii](./90.subsets-ii.md)
 - [113.path-sum-ii](./113.path-sum-ii.md)