diff --git a/README.md b/README.md index fade28112..4bce71657 100644 --- a/README.md +++ b/README.md @@ -19,44 +19,44 @@ LeetCode Problems' Solutions - - - - - - + + + + + + - - - - - - + + + + + + - - - - - - + + + + + + - - - - - - + + + + + + - - - - - - + + + + + +
[1-50][51-100][101-150][151-200][201-250][251-300][1-50][51-100][101-150][151-200][201-250][251-300]
[301-350][351-400][401-450][451-500][501-550][551-600][301-350][351-400][401-450][451-500][501-550][551-600]
[601-650][651-700][701-750][751-800][801-850][851-900][601-650][651-700][701-750][751-800][801-850][851-900]
[901-950][951-1000][1001-1050][1051-1100][1101-1150][1151-1200][901-950][951-1000][1001-1050][1051-1100][1101-1150][1151-1200]
[1201-1250][1251-1300][1301-1350][1351-1400][1401-1450][1451-1500][1201-1250][1251-1300][1301-1350][1351-1400][1401-1450][1451-1500]
diff --git a/internal/base/base.go b/internal/base/base.go index 28168c8c5..38e622d8d 100644 --- a/internal/base/base.go +++ b/internal/base/base.go @@ -14,7 +14,10 @@ import ( ) // CmdName - base.CmdName -const CmdName = "leetcode" +const ( + CmdName = "leetcode" + URL = "https://github.com/openset/leetcode/tree/master" +) // base var var ( diff --git a/internal/leetcode/question_data.go b/internal/leetcode/question_data.go index 4bf230f02..a326f54cc 100644 --- a/internal/leetcode/question_data.go +++ b/internal/leetcode/question_data.go @@ -172,7 +172,7 @@ func (question *questionType) getNavigation() string { nav, pre, next := "\n%s\n%s\n%s\n", "< Previous", "Next >" problems := ProblemsAll().StatStatusPairs id := question.questionID() - format := `[%s](https://github.com/openset/leetcode/tree/master/problems/%s "%s")` + format := `[%s](../%s "%s")` for i, problem := range problems { if problem.Stat.QuestionID == id { if i < len(problems)-1 { @@ -193,7 +193,7 @@ func (question *questionType) getTopicTags() []byte { if len(tags) > 0 { buf.WriteString("\n### Related Topics\n") } - format := " [[%s](https://github.com/openset/leetcode/tree/master/tag/%s/README.md)]\n" + format := " [[%s](../../tag/%s/README.md)]\n" for _, tag := range tags { buf.WriteString(fmt.Sprintf(format, tag.Name, tag.Slug)) } @@ -249,7 +249,7 @@ func (question *questionType) getSimilarQuestion() []byte { if len(sq) > 0 { buf.WriteString("\n### Similar Questions\n") } - format := " 1. [%s](https://github.com/openset/leetcode/tree/master/problems/%s)%s\n" + format := " 1. [%s](../%s)%s\n" for _, q := range sq { buf.WriteString(fmt.Sprintf(format, q.Title, q.TitleSlug, q.Difficulty.Str())) } diff --git a/internal/leetcode/topic_tag.go b/internal/leetcode/topic_tag.go index 32243f173..c297cb3c9 100644 --- a/internal/leetcode/topic_tag.go +++ b/internal/leetcode/topic_tag.go @@ -34,10 +34,10 @@ func (tag *TagType) SaveContents() { }) var buf bytes.Buffer buf.WriteString(authInfo("tag")) - buf.WriteString(fmt.Sprintf("\n## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > %s\n\n", tag.name())) + buf.WriteString(fmt.Sprintf("\n## [话题分类](../README.md) > %s\n\n", tag.name())) buf.WriteString("| # | 题名 | 标签 | 难度 |\n") buf.WriteString("| :-: | - | - | :-: |\n") - format := "| %d | [%s](https://github.com/openset/leetcode/tree/master/problems/%s)%s | %s | %s |\n" + format := "| %d | [%s](../../problems/%s)%s | %s | %s |\n" for _, question := range questions { if question.TranslatedTitle == "" { question.TranslatedTitle = question.Title @@ -85,7 +85,7 @@ type ttQuestionType struct { func (question *ttQuestionType) TagsStr() string { var buf bytes.Buffer - format := "[[%s](https://github.com/openset/leetcode/tree/master/tag/%s/README.md)] " + format := "[[%s](../%s/README.md)] " for _, tag := range question.TopicTags { buf.WriteString(fmt.Sprintf(format, tag.name(), tag.Slug)) } diff --git a/internal/open/open.go b/internal/open/open.go index 287f0c31d..5e9d9280c 100644 --- a/internal/open/open.go +++ b/internal/open/open.go @@ -2,6 +2,7 @@ package open import ( + "fmt" "strconv" "github.com/openset/leetcode/internal/base" @@ -31,7 +32,7 @@ func runOpen(cmd *base.Command, args []string) { for _, problem := range problems.StatStatusPairs { if problem.Stat.FrontendQuestionID == id { titleSlug := problem.Stat.QuestionTitleSlug - browser.Open("https://github.com/openset/leetcode/tree/master/problems/" + titleSlug) + browser.Open(fmt.Sprintf("%s/problems/%s", base.URL, titleSlug)) break } } diff --git a/internal/post/post.go b/internal/post/post.go index d79209b1d..e10388367 100644 --- a/internal/post/post.go +++ b/internal/post/post.go @@ -52,7 +52,7 @@ func runPost(cmd *base.Command, args []string) { return } formatFilename := "%s-%s.md" - formatTopicTag := " [[%s](https://github.com/openset/leetcode/tree/master/tag/%s/README.md)]\n" + formatTopicTag := " [[%s](%s/tag/%s/README.md)]\n" formatSimilarQuestion := " 1. [%s](/problems/%s)%s\n" problems := leetcode.ProblemsAll() for _, problem := range problems.StatStatusPairs { @@ -71,7 +71,7 @@ func runPost(cmd *base.Command, args []string) { if tag.TranslatedName != "" { tag.Name = tag.TranslatedName } - tagsBuf.WriteString(fmt.Sprintf(formatTopicTag, tag.Name, tag.Slug)) + tagsBuf.WriteString(fmt.Sprintf(formatTopicTag, tag.Name, base.URL, tag.Slug)) } buf.WriteString(fmt.Sprintf(frontMatter, question.TranslatedTitle, @@ -104,7 +104,7 @@ func runPost(cmd *base.Command, args []string) { buf.WriteString(fmt.Sprintf(formatSimilarQuestion, q.Title, q.TitleSlug, q.Difficulty.Str())) } buf.WriteString("\n---\n") - buf.WriteString(fmt.Sprintf("\n## [解法](https://github.com/openset/leetcode/tree/master/problems/%s)\n", question.TitleSlug)) + buf.WriteString(fmt.Sprintf("\n## [解法](%s/problems/%s)\n", base.URL, question.TitleSlug)) filename := fmt.Sprintf(formatFilename, t.Format("2006-01-02"), question.TitleSlug) oldPath := filepath.Join(basePath, "leetcode", filename) newPath := filepath.Join(basePath, "_posts", filename) diff --git a/internal/readme/readme.go b/internal/readme/readme.go index 22a466b11..5bdb27a00 100644 --- a/internal/readme/readme.go +++ b/internal/readme/readme.go @@ -99,9 +99,8 @@ func writeNav(buf *bytes.Buffer) { } func linkStr(num int) string { - link := "https://github.com/openset/leetcode/blob/master/" if num > maxID-maxID%pageSize-pageSize { - return fmt.Sprintf("%sREADME.md#%d", link, num) + return fmt.Sprintf("%s/README.md#%d", base.URL, num) } - return fmt.Sprintf("%sreadme/%d-%d.md#%d", link, (num-1)/pageSize*pageSize+1, ((num-1)/pageSize+1)*pageSize, num-step+1) + return fmt.Sprintf("%s/readme/%d-%d.md#%d", base.URL, (num-1)/pageSize*pageSize+1, ((num-1)/pageSize+1)*pageSize, num-step+1) } diff --git a/internal/tag/tag.go b/internal/tag/tag.go index d5581f9c2..bb89fe516 100644 --- a/internal/tag/tag.go +++ b/internal/tag/tag.go @@ -31,7 +31,7 @@ func runTag(cmd *base.Command, args []string) { buf.WriteString("\n## 话题分类\n\n") buf.WriteString("| # | Title | 话题 | | # | Title | 话题 |\n") buf.WriteString("| :-: | - | :-: | - | :-: | - | :-: |\n") - format := "| %d | [%s](https://github.com/openset/leetcode/tree/master/tag/%s/README.md) | [%s](https://openset.github.io/tags/%s/) | " + format := "| %d | [%s](%s/README.md) | [%s](https://openset.github.io/tags/%s/) | " n := buf.Len() for times := 0; times < 2; times++ { buf.Truncate(n) diff --git a/problems/01-matrix/README.md b/problems/01-matrix/README.md index 0d8d304d5..c2ee184af 100644 --- a/problems/01-matrix/README.md +++ b/problems/01-matrix/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/reverse-string-ii "Reverse String II") +[< Previous](../reverse-string-ii "Reverse String II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/diameter-of-binary-tree "Diameter of Binary Tree") +[Next >](../diameter-of-binary-tree "Diameter of Binary Tree") ## [542. 01 Matrix (Medium)](https://leetcode.com/problems/01-matrix "01 矩阵") @@ -56,5 +56,5 @@ ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] diff --git a/problems/1-bit-and-2-bit-characters/README.md b/problems/1-bit-and-2-bit-characters/README.md index 4dd3a52e0..5c6032fa3 100644 --- a/problems/1-bit-and-2-bit-characters/README.md +++ b/problems/1-bit-and-2-bit-characters/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/max-stack "Max Stack") +[< Previous](../max-stack "Max Stack") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-length-of-repeated-subarray "Maximum Length of Repeated Subarray") +[Next >](../maximum-length-of-repeated-subarray "Maximum Length of Repeated Subarray") ## [717. 1-bit and 2-bit Characters (Easy)](https://leetcode.com/problems/1-bit-and-2-bit-characters "1比特与2比特字符") @@ -41,10 +41,10 @@ The only way to decode it is two-bit character and two-bit character. So the las

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Gray Code](https://github.com/openset/leetcode/tree/master/problems/gray-code) (Medium) + 1. [Gray Code](../gray-code) (Medium) ### Hints
diff --git a/problems/132-pattern/README.md b/problems/132-pattern/README.md index de23e63ec..862deef34 100644 --- a/problems/132-pattern/README.md +++ b/problems/132-pattern/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/assign-cookies "Assign Cookies") +[< Previous](../assign-cookies "Assign Cookies") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/circular-array-loop "Circular Array Loop") +[Next >](../circular-array-loop "Circular Array Loop") ## [456. 132 Pattern (Medium)](https://leetcode.com/problems/132-pattern "132模式") @@ -48,4 +48,4 @@ that i < j < k and ai < ak ### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] + [[Stack](../../tag/stack/README.md)] diff --git a/problems/2-keys-keyboard/README.md b/problems/2-keys-keyboard/README.md index 7e0aba8ec..618540934 100644 --- a/problems/2-keys-keyboard/README.md +++ b/problems/2-keys-keyboard/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/dota2-senate "Dota2 Senate") +[< Previous](../dota2-senate "Dota2 Senate") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/4-keys-keyboard "4 Keys Keyboard") +[Next >](../4-keys-keyboard "4 Keys Keyboard") ## [650. 2 Keys Keyboard (Medium)](https://leetcode.com/problems/2-keys-keyboard "只有两个键的键盘") @@ -45,11 +45,11 @@ In step 3, we use Paste operation to get 'AAA'.

 

### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [4 Keys Keyboard](https://github.com/openset/leetcode/tree/master/problems/4-keys-keyboard) (Medium) - 1. [Broken Calculator](https://github.com/openset/leetcode/tree/master/problems/broken-calculator) (Medium) + 1. [4 Keys Keyboard](../4-keys-keyboard) (Medium) + 1. [Broken Calculator](../broken-calculator) (Medium) ### Hints
diff --git a/problems/24-game/README.md b/problems/24-game/README.md index 8a3d10396..d5d1487e8 100644 --- a/problems/24-game/README.md +++ b/problems/24-game/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/valid-parenthesis-string "Valid Parenthesis String") +[< Previous](../valid-parenthesis-string "Valid Parenthesis String") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/valid-palindrome-ii "Valid Palindrome II") +[Next >](../valid-palindrome-ii "Valid Palindrome II") ## [679. 24 Game (Hard)](https://leetcode.com/problems/24-game "24 点游戏") @@ -40,4 +40,4 @@ You have 4 cards each containing a number from 1 to 9. You need to judge whethe

### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] diff --git a/problems/3sum-closest/README.md b/problems/3sum-closest/README.md index 68daac163..e5a964119 100644 --- a/problems/3sum-closest/README.md +++ b/problems/3sum-closest/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/3sum "3Sum") +[< Previous](../3sum "3Sum") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/letter-combinations-of-a-phone-number "Letter Combinations of a Phone Number") +[Next >](../letter-combinations-of-a-phone-number "Letter Combinations of a Phone Number") ## [16. 3Sum Closest (Medium)](https://leetcode.com/problems/3sum-closest "最接近的三数之和") @@ -22,9 +22,9 @@ The sum that is closest to the target is 2. (-1 + 2 + 1 = 2). ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Array](../../tag/array/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] ### Similar Questions - 1. [3Sum](https://github.com/openset/leetcode/tree/master/problems/3sum) (Medium) - 1. [3Sum Smaller](https://github.com/openset/leetcode/tree/master/problems/3sum-smaller) (Medium) + 1. [3Sum](../3sum) (Medium) + 1. [3Sum Smaller](../3sum-smaller) (Medium) diff --git a/problems/3sum-smaller/README.md b/problems/3sum-smaller/README.md index 2c7d76610..d9215a65f 100644 --- a/problems/3sum-smaller/README.md +++ b/problems/3sum-smaller/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/add-digits "Add Digits") +[< Previous](../add-digits "Add Digits") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/single-number-iii "Single Number III") +[Next >](../single-number-iii "Single Number III") ## [259. 3Sum Smaller (Medium)](https://leetcode.com/problems/3sum-smaller "较小的三数之和") @@ -26,11 +26,11 @@

Follow up: Could you solve it in O(n2) runtime?

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Array](../../tag/array/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] ### Similar Questions - 1. [3Sum](https://github.com/openset/leetcode/tree/master/problems/3sum) (Medium) - 1. [3Sum Closest](https://github.com/openset/leetcode/tree/master/problems/3sum-closest) (Medium) - 1. [Valid Triangle Number](https://github.com/openset/leetcode/tree/master/problems/valid-triangle-number) (Medium) - 1. [Two Sum Less Than K](https://github.com/openset/leetcode/tree/master/problems/two-sum-less-than-k) (Easy) + 1. [3Sum](../3sum) (Medium) + 1. [3Sum Closest](../3sum-closest) (Medium) + 1. [Valid Triangle Number](../valid-triangle-number) (Medium) + 1. [Two Sum Less Than K](../two-sum-less-than-k) (Easy) diff --git a/problems/3sum-with-multiplicity/README.md b/problems/3sum-with-multiplicity/README.md index 6f8e3dea5..d7d1d6276 100644 --- a/problems/3sum-with-multiplicity/README.md +++ b/problems/3sum-with-multiplicity/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/sort-array-by-parity-ii "Sort Array By Parity II") +[< Previous](../sort-array-by-parity-ii "Sort Array By Parity II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimize-malware-spread "Minimize Malware Spread") +[Next >](../minimize-malware-spread "Minimize Malware Spread") ## [923. 3Sum With Multiplicity (Medium)](https://leetcode.com/problems/3sum-with-multiplicity "三数之和的多种可能") @@ -54,4 +54,4 @@ and two 2s from [2,2,2,2] in 6 ways. ### Related Topics - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] diff --git a/problems/3sum/README.md b/problems/3sum/README.md index c69cd8b84..3bdb80943 100644 --- a/problems/3sum/README.md +++ b/problems/3sum/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/longest-common-prefix "Longest Common Prefix") +[< Previous](../longest-common-prefix "Longest Common Prefix") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/3sum-closest "3Sum Closest") +[Next >](../3sum-closest "3Sum Closest") ## [15. 3Sum (Medium)](https://leetcode.com/problems/3sum "三数之和") @@ -30,11 +30,11 @@ A solution set is: ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Array](../../tag/array/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] ### Similar Questions - 1. [Two Sum](https://github.com/openset/leetcode/tree/master/problems/two-sum) (Easy) - 1. [3Sum Closest](https://github.com/openset/leetcode/tree/master/problems/3sum-closest) (Medium) - 1. [4Sum](https://github.com/openset/leetcode/tree/master/problems/4sum) (Medium) - 1. [3Sum Smaller](https://github.com/openset/leetcode/tree/master/problems/3sum-smaller) (Medium) + 1. [Two Sum](../two-sum) (Easy) + 1. [3Sum Closest](../3sum-closest) (Medium) + 1. [4Sum](../4sum) (Medium) + 1. [3Sum Smaller](../3sum-smaller) (Medium) diff --git a/problems/4-keys-keyboard/README.md b/problems/4-keys-keyboard/README.md index 9e65b9e4a..c8aab92a6 100644 --- a/problems/4-keys-keyboard/README.md +++ b/problems/4-keys-keyboard/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/2-keys-keyboard "2 Keys Keyboard") +[< Previous](../2-keys-keyboard "2 Keys Keyboard") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-duplicate-subtrees "Find Duplicate Subtrees") +[Next >](../find-duplicate-subtrees "Find Duplicate Subtrees") ## [651. 4 Keys Keyboard (Medium)](https://leetcode.com/problems/4-keys-keyboard "4键键盘") @@ -48,9 +48,9 @@ A, A, A, Ctrl A, Ctrl C, Ctrl V, Ctrl V

### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[Math](../../tag/math/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [2 Keys Keyboard](https://github.com/openset/leetcode/tree/master/problems/2-keys-keyboard) (Medium) + 1. [2 Keys Keyboard](../2-keys-keyboard) (Medium) diff --git a/problems/4sum-ii/README.md b/problems/4sum-ii/README.md index e0141b64f..c250b1fe6 100644 --- a/problems/4sum-ii/README.md +++ b/problems/4sum-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-moves-to-equal-array-elements "Minimum Moves to Equal Array Elements") +[< Previous](../minimum-moves-to-equal-array-elements "Minimum Moves to Equal Array Elements") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/assign-cookies "Assign Cookies") +[Next >](../assign-cookies "Assign Cookies") ## [454. 4Sum II (Medium)](https://leetcode.com/problems/4sum-ii "四数相加 II") @@ -36,8 +36,8 @@ The two tuples are:

 

### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [4Sum](https://github.com/openset/leetcode/tree/master/problems/4sum) (Medium) + 1. [4Sum](../4sum) (Medium) diff --git a/problems/4sum/README.md b/problems/4sum/README.md index 5bd3b8a2e..c93f2aba1 100644 --- a/problems/4sum/README.md +++ b/problems/4sum/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/letter-combinations-of-a-phone-number "Letter Combinations of a Phone Number") +[< Previous](../letter-combinations-of-a-phone-number "Letter Combinations of a Phone Number") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/remove-nth-node-from-end-of-list "Remove Nth Node From End of List") +[Next >](../remove-nth-node-from-end-of-list "Remove Nth Node From End of List") ## [18. 4Sum (Medium)](https://leetcode.com/problems/4sum "四数之和") @@ -31,11 +31,11 @@ A solution set is: ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Array](../../tag/array/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] ### Similar Questions - 1. [Two Sum](https://github.com/openset/leetcode/tree/master/problems/two-sum) (Easy) - 1. [3Sum](https://github.com/openset/leetcode/tree/master/problems/3sum) (Medium) - 1. [4Sum II](https://github.com/openset/leetcode/tree/master/problems/4sum-ii) (Medium) + 1. [Two Sum](../two-sum) (Easy) + 1. [3Sum](../3sum) (Medium) + 1. [4Sum II](../4sum-ii) (Medium) diff --git a/problems/accounts-merge/README.md b/problems/accounts-merge/README.md index 6295efa83..90de80088 100644 --- a/problems/accounts-merge/README.md +++ b/problems/accounts-merge/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/longest-word-in-dictionary "Longest Word in Dictionary") +[< Previous](../longest-word-in-dictionary "Longest Word in Dictionary") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/remove-comments "Remove Comments") +[Next >](../remove-comments "Remove Comments") ## [721. Accounts Merge (Medium)](https://leetcode.com/problems/accounts-merge "账户合并") @@ -37,13 +37,13 @@ We could return these lists in any order, for example the answer [['Mary', 'mary

### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Union Find](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Union Find](../../tag/union-find/README.md)] ### Similar Questions - 1. [Redundant Connection](https://github.com/openset/leetcode/tree/master/problems/redundant-connection) (Medium) - 1. [Sentence Similarity](https://github.com/openset/leetcode/tree/master/problems/sentence-similarity) (Easy) - 1. [Sentence Similarity II](https://github.com/openset/leetcode/tree/master/problems/sentence-similarity-ii) (Medium) + 1. [Redundant Connection](../redundant-connection) (Medium) + 1. [Sentence Similarity](../sentence-similarity) (Easy) + 1. [Sentence Similarity II](../sentence-similarity-ii) (Medium) ### Hints
diff --git a/problems/active-businesses/README.md b/problems/active-businesses/README.md index 8e9d065da..878048e5d 100644 --- a/problems/active-businesses/README.md +++ b/problems/active-businesses/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/smallest-sufficient-team "Smallest Sufficient Team") +[< Previous](../smallest-sufficient-team "Smallest Sufficient Team") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/user-purchase-platform "User Purchase Platform") +[Next >](../user-purchase-platform "User Purchase Platform") ## [1126. Active Businesses (Medium)](https://leetcode.com/problems/active-businesses "") diff --git a/problems/actors-and-directors-who-cooperated-at-least-three-times/README.md b/problems/actors-and-directors-who-cooperated-at-least-three-times/README.md index 89ca85513..ae617b27c 100644 --- a/problems/actors-and-directors-who-cooperated-at-least-three-times/README.md +++ b/problems/actors-and-directors-who-cooperated-at-least-three-times/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/last-stone-weight-ii "Last Stone Weight II") +[< Previous](../last-stone-weight-ii "Last Stone Weight II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/height-checker "Height Checker") +[Next >](../height-checker "Height Checker") ## [1050. Actors and Directors Who Cooperated At Least Three Times (Easy)](https://leetcode.com/problems/actors-and-directors-who-cooperated-at-least-three-times "合作过至少三次的演员和导演") diff --git a/problems/add-and-search-word-data-structure-design/README.md b/problems/add-and-search-word-data-structure-design/README.md index 16c4681b3..2376f5791 100644 --- a/problems/add-and-search-word-data-structure-design/README.md +++ b/problems/add-and-search-word-data-structure-design/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/course-schedule-ii "Course Schedule II") +[< Previous](../course-schedule-ii "Course Schedule II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/word-search-ii "Word Search II") +[Next >](../word-search-ii "Word Search II") ## [211. Add and Search Word - Data structure design (Medium)](https://leetcode.com/problems/add-and-search-word-data-structure-design "添加与搜索单词 - 数据结构设计") @@ -36,13 +36,13 @@ search("b..") -> true You may assume that all words are consist of lowercase letters a-z.

### Related Topics - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] - [[Trie](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Design](../../tag/design/README.md)] + [[Trie](../../tag/trie/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Implement Trie (Prefix Tree)](https://github.com/openset/leetcode/tree/master/problems/implement-trie-prefix-tree) (Medium) - 1. [Prefix and Suffix Search](https://github.com/openset/leetcode/tree/master/problems/prefix-and-suffix-search) (Hard) + 1. [Implement Trie (Prefix Tree)](../implement-trie-prefix-tree) (Medium) + 1. [Prefix and Suffix Search](../prefix-and-suffix-search) (Hard) ### Hints
diff --git a/problems/add-binary/README.md b/problems/add-binary/README.md index 5e28afa29..98b349191 100644 --- a/problems/add-binary/README.md +++ b/problems/add-binary/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/plus-one "Plus One") +[< Previous](../plus-one "Plus One") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/text-justification "Text Justification") +[Next >](../text-justification "Text Justification") ## [67. Add Binary (Easy)](https://leetcode.com/problems/add-binary "二进制求和") @@ -28,11 +28,11 @@ Output: "10101" ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Math](../../tag/math/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Add Two Numbers](https://github.com/openset/leetcode/tree/master/problems/add-two-numbers) (Medium) - 1. [Multiply Strings](https://github.com/openset/leetcode/tree/master/problems/multiply-strings) (Medium) - 1. [Plus One](https://github.com/openset/leetcode/tree/master/problems/plus-one) (Easy) - 1. [Add to Array-Form of Integer](https://github.com/openset/leetcode/tree/master/problems/add-to-array-form-of-integer) (Easy) + 1. [Add Two Numbers](../add-two-numbers) (Medium) + 1. [Multiply Strings](../multiply-strings) (Medium) + 1. [Plus One](../plus-one) (Easy) + 1. [Add to Array-Form of Integer](../add-to-array-form-of-integer) (Easy) diff --git a/problems/add-bold-tag-in-string/README.md b/problems/add-bold-tag-in-string/README.md index 1eab22017..9ef927d3d 100644 --- a/problems/add-bold-tag-in-string/README.md +++ b/problems/add-bold-tag-in-string/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/average-salary-departments-vs-company "Average Salary: Departments VS Company") +[< Previous](../average-salary-departments-vs-company "Average Salary: Departments VS Company") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/merge-two-binary-trees "Merge Two Binary Trees") +[Next >](../merge-two-binary-trees "Merge Two Binary Trees") ## [616. Add Bold Tag in String (Medium)](https://leetcode.com/problems/add-bold-tag-in-string "给字符串添加加粗标签") @@ -41,8 +41,8 @@ dict = ["aaa","aab","bc"]

### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Merge Intervals](https://github.com/openset/leetcode/tree/master/problems/merge-intervals) (Medium) - 1. [Tag Validator](https://github.com/openset/leetcode/tree/master/problems/tag-validator) (Hard) + 1. [Merge Intervals](../merge-intervals) (Medium) + 1. [Tag Validator](../tag-validator) (Hard) diff --git a/problems/add-digits/README.md b/problems/add-digits/README.md index c9fffa4c5..e9f8c53bd 100644 --- a/problems/add-digits/README.md +++ b/problems/add-digits/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/binary-tree-paths "Binary Tree Paths") +[< Previous](../binary-tree-paths "Binary Tree Paths") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/3sum-smaller "3Sum Smaller") +[Next >](../3sum-smaller "3Sum Smaller") ## [258. Add Digits (Easy)](https://leetcode.com/problems/add-digits "各位相加") @@ -26,11 +26,11 @@ Could you do it without any loop/recursion in O(1) runtime?

### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Happy Number](https://github.com/openset/leetcode/tree/master/problems/happy-number) (Easy) - 1. [Sum of Digits in the Minimum Number](https://github.com/openset/leetcode/tree/master/problems/sum-of-digits-in-the-minimum-number) (Easy) + 1. [Happy Number](../happy-number) (Easy) + 1. [Sum of Digits in the Minimum Number](../sum-of-digits-in-the-minimum-number) (Easy) ### Hints
diff --git a/problems/add-one-row-to-tree/README.md b/problems/add-one-row-to-tree/README.md index bd0c4e102..6f5c67cbf 100644 --- a/problems/add-one-row-to-tree/README.md +++ b/problems/add-one-row-to-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/design-circular-queue "Design Circular Queue") +[< Previous](../design-circular-queue "Design Circular Queue") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-distance-in-arrays "Maximum Distance in Arrays") +[Next >](../maximum-distance-in-arrays "Maximum Distance in Arrays") ## [623. Add One Row to Tree (Medium)](https://leetcode.com/problems/add-one-row-to-tree "在二叉树中增加一行") @@ -75,4 +75,4 @@ A binary tree as following:

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] diff --git a/problems/add-strings/README.md b/problems/add-strings/README.md index 8bc306acd..f6cabe247 100644 --- a/problems/add-strings/README.md +++ b/problems/add-strings/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/third-maximum-number "Third Maximum Number") +[< Previous](../third-maximum-number "Third Maximum Number") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/partition-equal-subset-sum "Partition Equal Subset Sum") +[Next >](../partition-equal-subset-sum "Partition Equal Subset Sum") ## [415. Add Strings (Easy)](https://leetcode.com/problems/add-strings "字符串相加") @@ -23,9 +23,9 @@

### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Add Two Numbers](https://github.com/openset/leetcode/tree/master/problems/add-two-numbers) (Medium) - 1. [Multiply Strings](https://github.com/openset/leetcode/tree/master/problems/multiply-strings) (Medium) - 1. [Add to Array-Form of Integer](https://github.com/openset/leetcode/tree/master/problems/add-to-array-form-of-integer) (Easy) + 1. [Add Two Numbers](../add-two-numbers) (Medium) + 1. [Multiply Strings](../multiply-strings) (Medium) + 1. [Add to Array-Form of Integer](../add-to-array-form-of-integer) (Easy) diff --git a/problems/add-to-array-form-of-integer/README.md b/problems/add-to-array-form-of-integer/README.md index f133d8fce..eba4e731c 100644 --- a/problems/add-to-array-form-of-integer/README.md +++ b/problems/add-to-array-form-of-integer/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/smallest-string-starting-from-leaf "Smallest String Starting From Leaf") +[< Previous](../smallest-string-starting-from-leaf "Smallest String Starting From Leaf") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/satisfiability-of-equality-equations "Satisfiability of Equality Equations") +[Next >](../satisfiability-of-equality-equations "Satisfiability of Equality Equations") ## [989. Add to Array-Form of Integer (Easy)](https://leetcode.com/problems/add-to-array-form-of-integer "数组形式的整数加法") @@ -72,10 +72,10 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Add Two Numbers](https://github.com/openset/leetcode/tree/master/problems/add-two-numbers) (Medium) - 1. [Plus One](https://github.com/openset/leetcode/tree/master/problems/plus-one) (Easy) - 1. [Add Binary](https://github.com/openset/leetcode/tree/master/problems/add-binary) (Easy) - 1. [Add Strings](https://github.com/openset/leetcode/tree/master/problems/add-strings) (Easy) + 1. [Add Two Numbers](../add-two-numbers) (Medium) + 1. [Plus One](../plus-one) (Easy) + 1. [Add Binary](../add-binary) (Easy) + 1. [Add Strings](../add-strings) (Easy) diff --git a/problems/add-two-numbers-ii/README.md b/problems/add-two-numbers-ii/README.md index 30d6b06e9..4ea219910 100644 --- a/problems/add-two-numbers-ii/README.md +++ b/problems/add-two-numbers-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/sequence-reconstruction "Sequence Reconstruction") +[< Previous](../sequence-reconstruction "Sequence Reconstruction") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/arithmetic-slices-ii-subsequence "Arithmetic Slices II - Subsequence") +[Next >](../arithmetic-slices-ii-subsequence "Arithmetic Slices II - Subsequence") ## [445. Add Two Numbers II (Medium)](https://leetcode.com/problems/add-two-numbers-ii "两数相加 II") @@ -28,7 +28,7 @@ What if you cannot modify the input lists? In other words, reversing the lists i

### Related Topics - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] + [[Linked List](../../tag/linked-list/README.md)] ### Similar Questions - 1. [Add Two Numbers](https://github.com/openset/leetcode/tree/master/problems/add-two-numbers) (Medium) + 1. [Add Two Numbers](../add-two-numbers) (Medium) diff --git a/problems/add-two-numbers/README.md b/problems/add-two-numbers/README.md index 1113d8ea6..f815a5b22 100644 --- a/problems/add-two-numbers/README.md +++ b/problems/add-two-numbers/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/two-sum "Two Sum") +[< Previous](../two-sum "Two Sum") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/longest-substring-without-repeating-characters "Longest Substring Without Repeating Characters") +[Next >](../longest-substring-without-repeating-characters "Longest Substring Without Repeating Characters") ## [2. Add Two Numbers (Medium)](https://leetcode.com/problems/add-two-numbers "两数相加") @@ -24,13 +24,13 @@ ### Related Topics - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Linked List](../../tag/linked-list/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Multiply Strings](https://github.com/openset/leetcode/tree/master/problems/multiply-strings) (Medium) - 1. [Add Binary](https://github.com/openset/leetcode/tree/master/problems/add-binary) (Easy) - 1. [Sum of Two Integers](https://github.com/openset/leetcode/tree/master/problems/sum-of-two-integers) (Easy) - 1. [Add Strings](https://github.com/openset/leetcode/tree/master/problems/add-strings) (Easy) - 1. [Add Two Numbers II](https://github.com/openset/leetcode/tree/master/problems/add-two-numbers-ii) (Medium) - 1. [Add to Array-Form of Integer](https://github.com/openset/leetcode/tree/master/problems/add-to-array-form-of-integer) (Easy) + 1. [Multiply Strings](../multiply-strings) (Medium) + 1. [Add Binary](../add-binary) (Easy) + 1. [Sum of Two Integers](../sum-of-two-integers) (Easy) + 1. [Add Strings](../add-strings) (Easy) + 1. [Add Two Numbers II](../add-two-numbers-ii) (Medium) + 1. [Add to Array-Form of Integer](../add-to-array-form-of-integer) (Easy) diff --git a/problems/adding-two-negabinary-numbers/README.md b/problems/adding-two-negabinary-numbers/README.md index 41323503a..9f9dbeec8 100644 --- a/problems/adding-two-negabinary-numbers/README.md +++ b/problems/adding-two-negabinary-numbers/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/flip-columns-for-maximum-number-of-equal-rows "Flip Columns For Maximum Number of Equal Rows") +[< Previous](../flip-columns-for-maximum-number-of-equal-rows "Flip Columns For Maximum Number of Equal Rows") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-submatrices-that-sum-to-target "Number of Submatrices That Sum to Target") +[Next >](../number-of-submatrices-that-sum-to-target "Number of Submatrices That Sum to Target") ## [1073. Adding Two Negabinary Numbers (Medium)](https://leetcode.com/problems/adding-two-negabinary-numbers "负二进制数相加") @@ -40,7 +40,7 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Hints
diff --git a/problems/additive-number/README.md b/problems/additive-number/README.md index 142fdc4a5..ae071b96f 100644 --- a/problems/additive-number/README.md +++ b/problems/additive-number/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/number-of-islands-ii "Number of Islands II") +[< Previous](../number-of-islands-ii "Number of Islands II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-mutable "Range Sum Query - Mutable") +[Next >](../range-sum-query-mutable "Range Sum Query - Mutable") ## [306. Additive Number (Medium)](https://leetcode.com/problems/additive-number "累加数") @@ -50,7 +50,7 @@ How would you handle overflow for very large input integers?

### Related Topics - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Split Array into Fibonacci Sequence](https://github.com/openset/leetcode/tree/master/problems/split-array-into-fibonacci-sequence) (Medium) + 1. [Split Array into Fibonacci Sequence](../split-array-into-fibonacci-sequence) (Medium) diff --git a/problems/advantage-shuffle/README.md b/problems/advantage-shuffle/README.md index a3ca3e455..4e521fc07 100644 --- a/problems/advantage-shuffle/README.md +++ b/problems/advantage-shuffle/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/reordered-power-of-2 "Reordered Power of 2") +[< Previous](../reordered-power-of-2 "Reordered Power of 2") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-number-of-refueling-stops "Minimum Number of Refueling Stops") +[Next >](../minimum-number-of-refueling-stops "Minimum Number of Refueling Stops") ## [870. Advantage Shuffle (Medium)](https://leetcode.com/problems/advantage-shuffle "优势洗牌") @@ -46,5 +46,5 @@ ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[Array](../../tag/array/README.md)] diff --git a/problems/airplane-seat-assignment-probability/README.md b/problems/airplane-seat-assignment-probability/README.md index a60966ce1..9d9f33ae7 100644 --- a/problems/airplane-seat-assignment-probability/README.md +++ b/problems/airplane-seat-assignment-probability/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/the-dining-philosophers "The Dining Philosophers") +[< Previous](../the-dining-philosophers "The Dining Philosophers") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/missing-number-in-arithmetic-progression "Missing Number In Arithmetic Progression") +[Next >](../missing-number-in-arithmetic-progression "Missing Number In Arithmetic Progression") ## [1227. Airplane Seat Assignment Probability (Medium)](https://leetcode.com/problems/airplane-seat-assignment-probability "飞机座位分配概率") @@ -44,9 +44,9 @@ ### Related Topics - [[Brainteaser](https://github.com/openset/leetcode/tree/master/tag/brainteaser/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Brainteaser](../../tag/brainteaser/README.md)] + [[Math](../../tag/math/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/alien-dictionary/README.md b/problems/alien-dictionary/README.md index bdc4613eb..e22b338d5 100644 --- a/problems/alien-dictionary/README.md +++ b/problems/alien-dictionary/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/missing-number "Missing Number") +[< Previous](../missing-number "Missing Number") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/closest-binary-search-tree-value "Closest Binary Search Tree Value") +[Next >](../closest-binary-search-tree-value "Closest Binary Search Tree Value") ## [269. Alien Dictionary (Hard)](https://leetcode.com/problems/alien-dictionary "火星词典") @@ -65,8 +65,8 @@ ### Related Topics - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] - [[Topological Sort](https://github.com/openset/leetcode/tree/master/tag/topological-sort/README.md)] + [[Graph](../../tag/graph/README.md)] + [[Topological Sort](../../tag/topological-sort/README.md)] ### Similar Questions - 1. [Course Schedule II](https://github.com/openset/leetcode/tree/master/problems/course-schedule-ii) (Medium) + 1. [Course Schedule II](../course-schedule-ii) (Medium) diff --git a/problems/all-nodes-distance-k-in-binary-tree/README.md b/problems/all-nodes-distance-k-in-binary-tree/README.md index 05f76b748..6fd3d78fb 100644 --- a/problems/all-nodes-distance-k-in-binary-tree/README.md +++ b/problems/all-nodes-distance-k-in-binary-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/shortest-subarray-with-sum-at-least-k "Shortest Subarray with Sum at Least K") +[< Previous](../shortest-subarray-with-sum-at-least-k "Shortest Subarray with Sum at Least K") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/shortest-path-to-get-all-keys "Shortest Path to Get All Keys") +[Next >](../shortest-path-to-get-all-keys "Shortest Path to Get All Keys") ## [863. All Nodes Distance K in Binary Tree (Medium)](https://leetcode.com/problems/all-nodes-distance-k-in-binary-tree "二叉树中所有距离为 K 的结点") @@ -51,6 +51,6 @@ The descriptions of the inputs above are just serializations of these objects. ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] diff --git a/problems/all-oone-data-structure/README.md b/problems/all-oone-data-structure/README.md index f52cb3bc1..ad1753225 100644 --- a/problems/all-oone-data-structure/README.md +++ b/problems/all-oone-data-structure/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/encode-n-ary-tree-to-binary-tree "Encode N-ary Tree to Binary Tree") +[< Previous](../encode-n-ary-tree-to-binary-tree "Encode N-ary Tree to Binary Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-genetic-mutation "Minimum Genetic Mutation") +[Next >](../minimum-genetic-mutation "Minimum Genetic Mutation") ## [432. All O`one Data Structure (Hard)](https://leetcode.com/problems/all-oone-data-structure "全 O(1) 的数据结构") @@ -27,4 +27,4 @@ Challenge: Perform all these in O(1) time complexity.

### Related Topics - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] + [[Design](../../tag/design/README.md)] diff --git a/problems/all-paths-from-source-lead-to-destination/README.md b/problems/all-paths-from-source-lead-to-destination/README.md index aa6b72a74..1d060ff6f 100644 --- a/problems/all-paths-from-source-lead-to-destination/README.md +++ b/problems/all-paths-from-source-lead-to-destination/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimize-rounding-error-to-meet-target "Minimize Rounding Error to Meet Target") +[< Previous](../minimize-rounding-error-to-meet-target "Minimize Rounding Error to Meet Target") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/missing-element-in-sorted-array "Missing Element in Sorted Array") +[Next >](../missing-element-in-sorted-array "Missing Element in Sorted Array") ## [1059. All Paths from Source Lead to Destination (Medium)](https://leetcode.com/problems/all-paths-from-source-lead-to-destination "从始点到终点的所有路径") @@ -87,8 +87,8 @@ ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Graph](../../tag/graph/README.md)] ### Hints
diff --git a/problems/all-paths-from-source-to-target/README.md b/problems/all-paths-from-source-to-target/README.md index 443fbc65d..eb3504a37 100644 --- a/problems/all-paths-from-source-to-target/README.md +++ b/problems/all-paths-from-source-to-target/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/rotate-string "Rotate String") +[< Previous](../rotate-string "Rotate String") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/smallest-rotation-with-highest-score "Smallest Rotation with Highest Score") +[Next >](../smallest-rotation-with-highest-score "Smallest Rotation with Highest Score") ## [797. All Paths From Source to Target (Medium)](https://leetcode.com/problems/all-paths-from-source-to-target "所有可能的路径") diff --git a/problems/all-people-report-to-the-given-manager/README.md b/problems/all-people-report-to-the-given-manager/README.md index bdf841497..785024bfe 100644 --- a/problems/all-people-report-to-the-given-manager/README.md +++ b/problems/all-people-report-to-the-given-manager/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps "Number of Ways to Stay in the Same Place After Some Steps") +[< Previous](../number-of-ways-to-stay-in-the-same-place-after-some-steps "Number of Ways to Stay in the Same Place After Some Steps") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/hexspeak "Hexspeak") +[Next >](../hexspeak "Hexspeak") ## [1270. All People Report to the Given Manager (Medium)](https://leetcode.com/problems/all-people-report-to-the-given-manager "") diff --git a/problems/all-possible-full-binary-trees/README.md b/problems/all-possible-full-binary-trees/README.md index 474f5c885..168409c86 100644 --- a/problems/all-possible-full-binary-trees/README.md +++ b/problems/all-possible-full-binary-trees/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/groups-of-special-equivalent-strings "Groups of Special-Equivalent Strings") +[< Previous](../groups-of-special-equivalent-strings "Groups of Special-Equivalent Strings") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-frequency-stack "Maximum Frequency Stack") +[Next >](../maximum-frequency-stack "Maximum Frequency Stack") ## [894. All Possible Full Binary Trees (Medium)](https://leetcode.com/problems/all-possible-full-binary-trees "所有可能的满二叉树") @@ -39,5 +39,5 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Recursion](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Recursion](../../tag/recursion/README.md)] diff --git a/problems/alphabet-board-path/README.md b/problems/alphabet-board-path/README.md index 61aa1efa8..c5062fab4 100644 --- a/problems/alphabet-board-path/README.md +++ b/problems/alphabet-board-path/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/n-th-tribonacci-number "N-th Tribonacci Number") +[< Previous](../n-th-tribonacci-number "N-th Tribonacci Number") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/largest-1-bordered-square "Largest 1-Bordered Square") +[Next >](../largest-1-bordered-square "Largest 1-Bordered Square") ## [1138. Alphabet Board Path (Medium)](https://leetcode.com/problems/alphabet-board-path "字母板上的路径") @@ -48,8 +48,8 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[String](../../tag/string/README.md)] ### Hints
diff --git a/problems/ambiguous-coordinates/README.md b/problems/ambiguous-coordinates/README.md index 456d7ee44..a0f719e6e 100644 --- a/problems/ambiguous-coordinates/README.md +++ b/problems/ambiguous-coordinates/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/bus-routes "Bus Routes") +[< Previous](../bus-routes "Bus Routes") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/linked-list-components "Linked List Components") +[Next >](../linked-list-components "Linked List Components") ## [816. Ambiguous Coordinates (Medium)](https://leetcode.com/problems/ambiguous-coordinates "模糊坐标") @@ -57,4 +57,4 @@

 

### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/analyze-user-website-visit-pattern/README.md b/problems/analyze-user-website-visit-pattern/README.md index 7d6d64da4..3781f2f65 100644 --- a/problems/analyze-user-website-visit-pattern/README.md +++ b/problems/analyze-user-website-visit-pattern/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-swaps-to-group-all-1s-together "Minimum Swaps to Group All 1's Together") +[< Previous](../minimum-swaps-to-group-all-1s-together "Minimum Swaps to Group All 1's Together") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/string-transforms-into-another-string "String Transforms Into Another String") +[Next >](../string-transforms-into-another-string "String Transforms Into Another String") ## [1152. Analyze User Website Visit Pattern (Medium)](https://leetcode.com/problems/analyze-user-website-visit-pattern "用户网站访问行为分析") @@ -58,9 +58,9 @@ The 3-sequence ("cart", "maps", "home") was visite ### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Sort](../../tag/sort/README.md)] + [[Array](../../tag/array/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Hints
diff --git a/problems/android-unlock-patterns/README.md b/problems/android-unlock-patterns/README.md index 78c379a38..9d96cd889 100644 --- a/problems/android-unlock-patterns/README.md +++ b/problems/android-unlock-patterns/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-arrays-ii "Intersection of Two Arrays II") +[< Previous](../intersection-of-two-arrays-ii "Intersection of Two Arrays II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/data-stream-as-disjoint-intervals "Data Stream as Disjoint Intervals") +[Next >](../data-stream-as-disjoint-intervals "Data Stream as Disjoint Intervals") ## [351. Android Unlock Patterns (Medium)](https://leetcode.com/problems/android-unlock-patterns "安卓系统手势解锁") @@ -61,5 +61,5 @@ Line 1 - 9 is valid because it passes through key 5, which had been selected in ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] diff --git a/problems/arithmetic-slices-ii-subsequence/README.md b/problems/arithmetic-slices-ii-subsequence/README.md index 98f442f54..ade7bc39a 100644 --- a/problems/arithmetic-slices-ii-subsequence/README.md +++ b/problems/arithmetic-slices-ii-subsequence/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/add-two-numbers-ii "Add Two Numbers II") +[< Previous](../add-two-numbers-ii "Add Two Numbers II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-boomerangs "Number of Boomerangs") +[Next >](../number-of-boomerangs "Number of Boomerangs") ## [446. Arithmetic Slices II - Subsequence (Hard)](https://leetcode.com/problems/arithmetic-slices-ii-subsequence "等差数列划分 II - 子序列") @@ -54,7 +54,7 @@ All arithmetic subsequence slices are: ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Arithmetic Slices](https://github.com/openset/leetcode/tree/master/problems/arithmetic-slices) (Medium) + 1. [Arithmetic Slices](../arithmetic-slices) (Medium) diff --git a/problems/arithmetic-slices/README.md b/problems/arithmetic-slices/README.md index 558f11dcb..b4a2e552f 100644 --- a/problems/arithmetic-slices/README.md +++ b/problems/arithmetic-slices/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/fizz-buzz "Fizz Buzz") +[< Previous](../fizz-buzz "Fizz Buzz") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/third-maximum-number "Third Maximum Number") +[Next >](../third-maximum-number "Third Maximum Number") ## [413. Arithmetic Slices (Medium)](https://leetcode.com/problems/arithmetic-slices "等差数列划分") @@ -37,8 +37,8 @@ return: 3, for 3 arithmetic slices in A: [1, 2, 3], [2, 3, 4] and [1, 2, 3, 4] i ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Math](../../tag/math/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Arithmetic Slices II - Subsequence](https://github.com/openset/leetcode/tree/master/problems/arithmetic-slices-ii-subsequence) (Hard) + 1. [Arithmetic Slices II - Subsequence](../arithmetic-slices-ii-subsequence) (Hard) diff --git a/problems/armstrong-number/README.md b/problems/armstrong-number/README.md index 53a0fdd8a..2a5aef613 100644 --- a/problems/armstrong-number/README.md +++ b/problems/armstrong-number/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/largest-unique-number "Largest Unique Number") +[< Previous](../largest-unique-number "Largest Unique Number") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/connecting-cities-with-minimum-cost "Connecting Cities With Minimum Cost") +[Next >](../connecting-cities-with-minimum-cost "Connecting Cities With Minimum Cost") ## [1134. Armstrong Number (Easy)](https://leetcode.com/problems/armstrong-number "阿姆斯特朗数") @@ -44,7 +44,7 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Hints
diff --git a/problems/arranging-coins/README.md b/problems/arranging-coins/README.md index b36f01797..92d356733 100644 --- a/problems/arranging-coins/README.md +++ b/problems/arranging-coins/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/k-th-smallest-in-lexicographical-order "K-th Smallest in Lexicographical Order") +[< Previous](../k-th-smallest-in-lexicographical-order "K-th Smallest in Lexicographical Order") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-all-duplicates-in-an-array "Find All Duplicates in an Array") +[Next >](../find-all-duplicates-in-an-array "Find All Duplicates in an Array") ## [441. Arranging Coins (Easy)](https://leetcode.com/problems/arranging-coins "排列硬币") @@ -45,5 +45,5 @@ Because the 4th row is incomplete, we return 3.

### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Math](../../tag/math/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] diff --git a/problems/array-nesting/README.md b/problems/array-nesting/README.md index bacb1b266..eb472d3dd 100644 --- a/problems/array-nesting/README.md +++ b/problems/array-nesting/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-the-closest-palindrome "Find the Closest Palindrome") +[< Previous](../find-the-closest-palindrome "Find the Closest Palindrome") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/reshape-the-matrix "Reshape the Matrix") +[Next >](../reshape-the-matrix "Reshape the Matrix") ## [565. Array Nesting (Medium)](https://leetcode.com/problems/array-nesting "数组嵌套") @@ -40,9 +40,9 @@ S[0] = {A[0], A[5], A[6], A[2]} = {5, 6, 2, 0} ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Nested List Weight Sum](https://github.com/openset/leetcode/tree/master/problems/nested-list-weight-sum) (Easy) - 1. [Flatten Nested List Iterator](https://github.com/openset/leetcode/tree/master/problems/flatten-nested-list-iterator) (Medium) - 1. [Nested List Weight Sum II](https://github.com/openset/leetcode/tree/master/problems/nested-list-weight-sum-ii) (Medium) + 1. [Nested List Weight Sum](../nested-list-weight-sum) (Easy) + 1. [Flatten Nested List Iterator](../flatten-nested-list-iterator) (Medium) + 1. [Nested List Weight Sum II](../nested-list-weight-sum-ii) (Medium) diff --git a/problems/array-of-doubled-pairs/README.md b/problems/array-of-doubled-pairs/README.md index 57aa8de4f..dd4cc0d38 100644 --- a/problems/array-of-doubled-pairs/README.md +++ b/problems/array-of-doubled-pairs/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/verifying-an-alien-dictionary "Verifying an Alien Dictionary") +[< Previous](../verifying-an-alien-dictionary "Verifying an Alien Dictionary") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/delete-columns-to-make-sorted-ii "Delete Columns to Make Sorted II") +[Next >](../delete-columns-to-make-sorted-ii "Delete Columns to Make Sorted II") ## [954. Array of Doubled Pairs (Medium)](https://leetcode.com/problems/array-of-doubled-pairs "二倍数对数组") @@ -72,5 +72,5 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Array](../../tag/array/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] diff --git a/problems/array-partition-i/README.md b/problems/array-partition-i/README.md index 77ae9f4b1..87b67dbcc 100644 --- a/problems/array-partition-i/README.md +++ b/problems/array-partition-i/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/subarray-sum-equals-k "Subarray Sum Equals K") +[< Previous](../subarray-sum-equals-k "Subarray Sum Equals K") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/longest-line-of-consecutive-one-in-matrix "Longest Line of Consecutive One in Matrix") +[Next >](../longest-line-of-consecutive-one-in-matrix "Longest Line of Consecutive One in Matrix") ## [561. Array Partition I (Easy)](https://leetcode.com/problems/array-partition-i "数组拆分 I") @@ -32,7 +32,7 @@ Given an array of 2n integers, your task is to group these integers into

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Hints
diff --git a/problems/array-transformation/README.md b/problems/array-transformation/README.md index 8f58ab5f8..4cccdf1d6 100644 --- a/problems/array-transformation/README.md +++ b/problems/array-transformation/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/web-crawler-multithreaded "Web Crawler Multithreaded") +[< Previous](../web-crawler-multithreaded "Web Crawler Multithreaded") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/design-a-leaderboard "Design A Leaderboard") +[Next >](../design-a-leaderboard "Design A Leaderboard") ## [1243. Array Transformation (Easy)](https://leetcode.com/problems/array-transformation "数组变换") @@ -54,7 +54,7 @@ No more operations can be done to this array. ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Hints
diff --git a/problems/article-views-i/README.md b/problems/article-views-i/README.md index 922b62dcb..2fe77f6d6 100644 --- a/problems/article-views-i/README.md +++ b/problems/article-views-i/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/longest-chunked-palindrome-decomposition "Longest Chunked Palindrome Decomposition") +[< Previous](../longest-chunked-palindrome-decomposition "Longest Chunked Palindrome Decomposition") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/article-views-ii "Article Views II") +[Next >](../article-views-ii "Article Views II") ## [1148. Article Views I (Easy)](https://leetcode.com/problems/article-views-i "文章浏览 I") diff --git a/problems/article-views-ii/README.md b/problems/article-views-ii/README.md index f1e120c7e..f2d98b111 100644 --- a/problems/article-views-ii/README.md +++ b/problems/article-views-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/article-views-i "Article Views I") +[< Previous](../article-views-i "Article Views I") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/check-if-a-number-is-majority-element-in-a-sorted-array "Check If a Number Is Majority Element in a Sorted Array") +[Next >](../check-if-a-number-is-majority-element-in-a-sorted-array "Check If a Number Is Majority Element in a Sorted Array") ## [1149. Article Views II (Medium)](https://leetcode.com/problems/article-views-ii "") diff --git a/problems/as-far-from-land-as-possible/README.md b/problems/as-far-from-land-as-possible/README.md index 108a4ee86..827a3150a 100644 --- a/problems/as-far-from-land-as-possible/README.md +++ b/problems/as-far-from-land-as-possible/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-level-sum-of-a-binary-tree "Maximum Level Sum of a Binary Tree") +[< Previous](../maximum-level-sum-of-a-binary-tree "Maximum Level Sum of a Binary Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/last-substring-in-lexicographical-order "Last Substring in Lexicographical Order") +[Next >](../last-substring-in-lexicographical-order "Last Substring in Lexicographical Order") ## [1162. As Far from Land as Possible (Medium)](https://leetcode.com/problems/as-far-from-land-as-possible "地图分析") @@ -51,11 +51,11 @@ The cell (2, 2) is as far as possible from all the land with distance 4. ### Related Topics - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] + [[Graph](../../tag/graph/README.md)] ### Similar Questions - 1. [Shortest Distance from All Buildings](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-from-all-buildings) (Hard) + 1. [Shortest Distance from All Buildings](../shortest-distance-from-all-buildings) (Hard) ### Hints
diff --git a/problems/assign-cookies/README.md b/problems/assign-cookies/README.md index 4fd1ef220..c72fedcb4 100644 --- a/problems/assign-cookies/README.md +++ b/problems/assign-cookies/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/4sum-ii "4Sum II") +[< Previous](../4sum-ii "4Sum II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/132-pattern "132 Pattern") +[Next >](../132-pattern "132 Pattern") ## [455. Assign Cookies (Easy)](https://leetcode.com/problems/assign-cookies "分发饼干") @@ -45,4 +45,4 @@ You need to output 2.

### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] + [[Greedy](../../tag/greedy/README.md)] diff --git a/problems/asteroid-collision/README.md b/problems/asteroid-collision/README.md index b8a2887d6..58ce6d9fd 100644 --- a/problems/asteroid-collision/README.md +++ b/problems/asteroid-collision/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/sentence-similarity "Sentence Similarity") +[< Previous](../sentence-similarity "Sentence Similarity") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/parse-lisp-expression "Parse Lisp Expression") +[Next >](../parse-lisp-expression "Parse Lisp Expression") ## [735. Asteroid Collision (Medium)](https://leetcode.com/problems/asteroid-collision "行星碰撞") @@ -66,10 +66,10 @@ Asteroids moving the same direction never meet, so no asteroids will meet each o

### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] + [[Stack](../../tag/stack/README.md)] ### Similar Questions - 1. [Can Place Flowers](https://github.com/openset/leetcode/tree/master/problems/can-place-flowers) (Easy) + 1. [Can Place Flowers](../can-place-flowers) (Easy) ### Hints
diff --git a/problems/available-captures-for-rook/README.md b/problems/available-captures-for-rook/README.md index 4efa68d81..77dac0fc4 100644 --- a/problems/available-captures-for-rook/README.md +++ b/problems/available-captures-for-rook/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-binary-tree-ii "Maximum Binary Tree II") +[< Previous](../maximum-binary-tree-ii "Maximum Binary Tree II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-cost-to-merge-stones "Minimum Cost to Merge Stones") +[Next >](../minimum-cost-to-merge-stones "Minimum Cost to Merge Stones") ## [999. Available Captures for Rook (Easy)](https://leetcode.com/problems/available-captures-for-rook "车的可用捕获量") @@ -63,4 +63,4 @@ The rook can capture the pawns at positions b5, d6 and f5. ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] diff --git a/problems/average-of-levels-in-binary-tree/README.md b/problems/average-of-levels-in-binary-tree/README.md index 9d7ddcafb..14a2b4973 100644 --- a/problems/average-of-levels-in-binary-tree/README.md +++ b/problems/average-of-levels-in-binary-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/exclusive-time-of-functions "Exclusive Time of Functions") +[< Previous](../exclusive-time-of-functions "Exclusive Time of Functions") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/shopping-offers "Shopping Offers") +[Next >](../shopping-offers "Shopping Offers") ## [637. Average of Levels in Binary Tree (Easy)](https://leetcode.com/problems/average-of-levels-in-binary-tree "二叉树的层平均值") @@ -34,8 +34,8 @@ The average value of nodes on level 0 is 3, on level 1 is 14.5, and on level 2

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] ### Similar Questions - 1. [Binary Tree Level Order Traversal](https://github.com/openset/leetcode/tree/master/problems/binary-tree-level-order-traversal) (Medium) - 1. [Binary Tree Level Order Traversal II](https://github.com/openset/leetcode/tree/master/problems/binary-tree-level-order-traversal-ii) (Easy) + 1. [Binary Tree Level Order Traversal](../binary-tree-level-order-traversal) (Medium) + 1. [Binary Tree Level Order Traversal II](../binary-tree-level-order-traversal-ii) (Easy) diff --git a/problems/average-salary-departments-vs-company/README.md b/problems/average-salary-departments-vs-company/README.md index 3ca09ca73..6374e1e70 100644 --- a/problems/average-salary-departments-vs-company/README.md +++ b/problems/average-salary-departments-vs-company/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/second-degree-follower "Second Degree Follower") +[< Previous](../second-degree-follower "Second Degree Follower") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/add-bold-tag-in-string "Add Bold Tag in String") +[Next >](../add-bold-tag-in-string "Add Bold Tag in String") ## [615. Average Salary: Departments VS Company (Hard)](https://leetcode.com/problems/average-salary-departments-vs-company "平均工资：部门与公司比较") diff --git a/problems/average-selling-price/README.md b/problems/average-selling-price/README.md index 9b8663ded..db5550bb4 100644 --- a/problems/average-selling-price/README.md +++ b/problems/average-selling-price/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/check-if-it-is-a-good-array "Check If It Is a Good Array") +[< Previous](../check-if-it-is-a-good-array "Check If It Is a Good Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/cells-with-odd-values-in-a-matrix "Cells with Odd Values in a Matrix") +[Next >](../cells-with-odd-values-in-a-matrix "Cells with Odd Values in a Matrix") ## [1251. Average Selling Price (Easy)](https://leetcode.com/problems/average-selling-price "") diff --git a/problems/backspace-string-compare/README.md b/problems/backspace-string-compare/README.md index 74c1bec95..45441ffdd 100644 --- a/problems/backspace-string-compare/README.md +++ b/problems/backspace-string-compare/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/guess-the-word "Guess the Word") +[< Previous](../guess-the-word "Guess the Word") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/longest-mountain-in-array "Longest Mountain in Array") +[Next >](../longest-mountain-in-array "Longest Mountain in Array") ## [844. Backspace String Compare (Easy)](https://leetcode.com/problems/backspace-string-compare "比较含退格的字符串") @@ -68,5 +68,5 @@ ### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Stack](../../tag/stack/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] diff --git a/problems/bag-of-tokens/README.md b/problems/bag-of-tokens/README.md index cd950c911..d64b7f916 100644 --- a/problems/bag-of-tokens/README.md +++ b/problems/bag-of-tokens/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/most-stones-removed-with-same-row-or-column "Most Stones Removed with Same Row or Column") +[< Previous](../most-stones-removed-with-same-row-or-column "Most Stones Removed with Same Row or Column") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/largest-time-for-given-digits "Largest Time for Given Digits") +[Next >](../largest-time-for-given-digits "Largest Time for Given Digits") ## [948. Bag of Tokens (Medium)](https://leetcode.com/problems/bag-of-tokens "令牌放置") @@ -65,4 +65,4 @@ ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] + [[Greedy](../../tag/greedy/README.md)] diff --git a/problems/balanced-binary-tree/README.md b/problems/balanced-binary-tree/README.md index 4a90626f4..5a8f78860 100644 --- a/problems/balanced-binary-tree/README.md +++ b/problems/balanced-binary-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/convert-sorted-list-to-binary-search-tree "Convert Sorted List to Binary Search Tree") +[< Previous](../convert-sorted-list-to-binary-search-tree "Convert Sorted List to Binary Search Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-depth-of-binary-tree "Minimum Depth of Binary Tree") +[Next >](../minimum-depth-of-binary-tree "Minimum Depth of Binary Tree") ## [110. Balanced Binary Tree (Easy)](https://leetcode.com/problems/balanced-binary-tree "平衡二叉树") @@ -51,8 +51,8 @@

Return false.

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] ### Similar Questions - 1. [Maximum Depth of Binary Tree](https://github.com/openset/leetcode/tree/master/problems/maximum-depth-of-binary-tree) (Easy) + 1. [Maximum Depth of Binary Tree](../maximum-depth-of-binary-tree) (Easy) diff --git a/problems/base-7/README.md b/problems/base-7/README.md index 7d207887d..a3c89ea91 100644 --- a/problems/base-7/README.md +++ b/problems/base-7/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-ii "Next Greater Element II") +[< Previous](../next-greater-element-ii "Next Greater Element II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/the-maze-ii "The Maze II") +[Next >](../the-maze-ii "The Maze II") ## [504. Base 7 (Easy)](https://leetcode.com/problems/base-7 "七进制数") diff --git a/problems/baseball-game/README.md b/problems/baseball-game/README.md index 72c31eabf..c938d3158 100644 --- a/problems/baseball-game/README.md +++ b/problems/baseball-game/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/next-closest-time "Next Closest Time") +[< Previous](../next-closest-time "Next Closest Time") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/k-empty-slots "K Empty Slots") +[Next >](../k-empty-slots "K Empty Slots") ## [682. Baseball Game (Easy)](https://leetcode.com/problems/baseball-game "棒球比赛") @@ -68,4 +68,4 @@ Round 7: You could get 9 + 5 = 14 points. The sum is 27.

### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] + [[Stack](../../tag/stack/README.md)] diff --git a/problems/basic-calculator-ii/README.md b/problems/basic-calculator-ii/README.md index 4c9974439..76950166f 100644 --- a/problems/basic-calculator-ii/README.md +++ b/problems/basic-calculator-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/invert-binary-tree "Invert Binary Tree") +[< Previous](../invert-binary-tree "Invert Binary Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/summary-ranges "Summary Ranges") +[Next >](../summary-ranges "Summary Ranges") ## [227. Basic Calculator II (Medium)](https://leetcode.com/problems/basic-calculator-ii "基本计算器 II") @@ -43,9 +43,9 @@ ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Basic Calculator](https://github.com/openset/leetcode/tree/master/problems/basic-calculator) (Hard) - 1. [Expression Add Operators](https://github.com/openset/leetcode/tree/master/problems/expression-add-operators) (Hard) - 1. [Basic Calculator III](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-iii) (Hard) + 1. [Basic Calculator](../basic-calculator) (Hard) + 1. [Expression Add Operators](../expression-add-operators) (Hard) + 1. [Basic Calculator III](../basic-calculator-iii) (Hard) diff --git a/problems/basic-calculator-iii/README.md b/problems/basic-calculator-iii/README.md index d3732386a..2cb1dd8ba 100644 --- a/problems/basic-calculator-iii/README.md +++ b/problems/basic-calculator-iii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/jewels-and-stones "Jewels and Stones") +[< Previous](../jewels-and-stones "Jewels and Stones") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/sliding-puzzle "Sliding Puzzle") +[Next >](../sliding-puzzle "Sliding Puzzle") ## [772. Basic Calculator III (Hard)](https://leetcode.com/problems/basic-calculator-iii "基本计算器 III") @@ -33,10 +33,10 @@

Note: Do not use the eval built-in library function.

### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Stack](../../tag/stack/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Basic Calculator](https://github.com/openset/leetcode/tree/master/problems/basic-calculator) (Hard) - 1. [Basic Calculator II](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-ii) (Medium) - 1. [Basic Calculator IV](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-iv) (Hard) + 1. [Basic Calculator](../basic-calculator) (Hard) + 1. [Basic Calculator II](../basic-calculator-ii) (Medium) + 1. [Basic Calculator IV](../basic-calculator-iv) (Hard) diff --git a/problems/basic-calculator-iv/README.md b/problems/basic-calculator-iv/README.md index 16b146ec8..e4b997d41 100644 --- a/problems/basic-calculator-iv/README.md +++ b/problems/basic-calculator-iv/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/max-chunks-to-make-sorted "Max Chunks To Make Sorted") +[< Previous](../max-chunks-to-make-sorted "Max Chunks To Make Sorted") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/jewels-and-stones "Jewels and Stones") +[Next >](../jewels-and-stones "Jewels and Stones") ## [770. Basic Calculator IV (Hard)](https://leetcode.com/problems/basic-calculator-iv "基本计算器 IV") @@ -63,13 +63,13 @@ evalvars = [], evalints = [] ### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Stack](../../tag/stack/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Parse Lisp Expression](https://github.com/openset/leetcode/tree/master/problems/parse-lisp-expression) (Hard) - 1. [Basic Calculator III](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-iii) (Hard) + 1. [Parse Lisp Expression](../parse-lisp-expression) (Hard) + 1. [Basic Calculator III](../basic-calculator-iii) (Hard) ### Hints
diff --git a/problems/basic-calculator/README.md b/problems/basic-calculator/README.md index 552780bfe..ce4653dd8 100644 --- a/problems/basic-calculator/README.md +++ b/problems/basic-calculator/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/rectangle-area "Rectangle Area") +[< Previous](../rectangle-area "Rectangle Area") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/implement-stack-using-queues "Implement Stack using Queues") +[Next >](../implement-stack-using-queues "Implement Stack using Queues") ## [224. Basic Calculator (Hard)](https://leetcode.com/problems/basic-calculator "基本计算器") @@ -41,12 +41,12 @@ ### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Stack](../../tag/stack/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Evaluate Reverse Polish Notation](https://github.com/openset/leetcode/tree/master/problems/evaluate-reverse-polish-notation) (Medium) - 1. [Basic Calculator II](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-ii) (Medium) - 1. [Different Ways to Add Parentheses](https://github.com/openset/leetcode/tree/master/problems/different-ways-to-add-parentheses) (Medium) - 1. [Expression Add Operators](https://github.com/openset/leetcode/tree/master/problems/expression-add-operators) (Hard) - 1. [Basic Calculator III](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-iii) (Hard) + 1. [Evaluate Reverse Polish Notation](../evaluate-reverse-polish-notation) (Medium) + 1. [Basic Calculator II](../basic-calculator-ii) (Medium) + 1. [Different Ways to Add Parentheses](../different-ways-to-add-parentheses) (Medium) + 1. [Expression Add Operators](../expression-add-operators) (Hard) + 1. [Basic Calculator III](../basic-calculator-iii) (Hard) diff --git a/problems/battleships-in-a-board/README.md b/problems/battleships-in-a-board/README.md index 7b49edcc7..1dc1ee558 100644 --- a/problems/battleships-in-a-board/README.md +++ b/problems/battleships-in-a-board/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/sentence-screen-fitting "Sentence Screen Fitting") +[< Previous](../sentence-screen-fitting "Sentence Screen Fitting") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/strong-password-checker "Strong Password Checker") +[Next >](../strong-password-checker "Strong Password Checker") ## [419. Battleships in a Board (Medium)](https://leetcode.com/problems/battleships-in-a-board "甲板上的战舰") diff --git a/problems/beautiful-arrangement-ii/README.md b/problems/beautiful-arrangement-ii/README.md index 4050dc888..52657c08b 100644 --- a/problems/beautiful-arrangement-ii/README.md +++ b/problems/beautiful-arrangement-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/path-sum-iv "Path Sum IV") +[< Previous](../path-sum-iv "Path Sum IV") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-number-in-multiplication-table "Kth Smallest Number in Multiplication Table") +[Next >](../kth-smallest-number-in-multiplication-table "Kth Smallest Number in Multiplication Table") ## [667. Beautiful Arrangement II (Medium)](https://leetcode.com/problems/beautiful-arrangement-ii "优美的排列 II") @@ -44,7 +44,7 @@ If there are multiple answers, print any of them.

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Beautiful Arrangement](https://github.com/openset/leetcode/tree/master/problems/beautiful-arrangement) (Medium) + 1. [Beautiful Arrangement](../beautiful-arrangement) (Medium) diff --git a/problems/beautiful-arrangement/README.md b/problems/beautiful-arrangement/README.md index 7a772f6ae..e49690af1 100644 --- a/problems/beautiful-arrangement/README.md +++ b/problems/beautiful-arrangement/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/contiguous-array "Contiguous Array") +[< Previous](../contiguous-array "Contiguous Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/word-abbreviation "Word Abbreviation") +[Next >](../word-abbreviation "Word Abbreviation") ## [526. Beautiful Arrangement (Medium)](https://leetcode.com/problems/beautiful-arrangement "优美的排列") @@ -53,7 +53,7 @@ Number at the 2nd position (i=2) is 1, and i (i=2) is divisible by 1.

 

### Related Topics - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Beautiful Arrangement II](https://github.com/openset/leetcode/tree/master/problems/beautiful-arrangement-ii) (Medium) + 1. [Beautiful Arrangement II](../beautiful-arrangement-ii) (Medium) diff --git a/problems/beautiful-array/README.md b/problems/beautiful-array/README.md index e04ac68e7..3d8ca7a50 100644 --- a/problems/beautiful-array/README.md +++ b/problems/beautiful-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-falling-path-sum "Minimum Falling Path Sum") +[< Previous](../minimum-falling-path-sum "Minimum Falling Path Sum") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-recent-calls "Number of Recent Calls") +[Next >](../number-of-recent-calls "Number of Recent Calls") ## [932. Beautiful Array (Medium)](https://leetcode.com/problems/beautiful-array "漂亮数组") @@ -47,4 +47,4 @@ ### Related Topics - [[Divide and Conquer](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] + [[Divide and Conquer](../../tag/divide-and-conquer/README.md)] diff --git a/problems/before-and-after-puzzle/README.md b/problems/before-and-after-puzzle/README.md index 0388bcaa9..d11a38180 100644 --- a/problems/before-and-after-puzzle/README.md +++ b/problems/before-and-after-puzzle/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/count-substrings-with-only-one-distinct-letter "Count Substrings with Only One Distinct Letter") +[< Previous](../count-substrings-with-only-one-distinct-letter "Count Substrings with Only One Distinct Letter") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-to-target-color "Shortest Distance to Target Color") +[Next >](../shortest-distance-to-target-color "Shortest Distance to Target Color") ## [1181. Before and After Puzzle (Medium)](https://leetcode.com/problems/before-and-after-puzzle "前后拼接") @@ -64,7 +64,7 @@ ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Hints
diff --git a/problems/best-meeting-point/README.md b/problems/best-meeting-point/README.md index 8f39648d6..bb2a41eb3 100644 --- a/problems/best-meeting-point/README.md +++ b/problems/best-meeting-point/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-median-from-data-stream "Find Median from Data Stream") +[< Previous](../find-median-from-data-stream "Find Median from Data Stream") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-binary-tree "Serialize and Deserialize Binary Tree") +[Next >](../serialize-and-deserialize-binary-tree "Serialize and Deserialize Binary Tree") ## [296. Best Meeting Point (Hard)](https://leetcode.com/problems/best-meeting-point "最佳的碰头地点") @@ -31,12 +31,12 @@ Explanation: Given three people living at (0,0), (0,   of 2+2+2=6 is minimal. So return 6. ### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Sort](../../tag/sort/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Shortest Distance from All Buildings](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-from-all-buildings) (Hard) - 1. [Minimum Moves to Equal Array Elements II](https://github.com/openset/leetcode/tree/master/problems/minimum-moves-to-equal-array-elements-ii) (Medium) + 1. [Shortest Distance from All Buildings](../shortest-distance-from-all-buildings) (Hard) + 1. [Minimum Moves to Equal Array Elements II](../minimum-moves-to-equal-array-elements-ii) (Medium) ### Hints
diff --git a/problems/best-sightseeing-pair/README.md b/problems/best-sightseeing-pair/README.md index d7fcb6cb2..73535759b 100644 --- a/problems/best-sightseeing-pair/README.md +++ b/problems/best-sightseeing-pair/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/partition-array-into-three-parts-with-equal-sum "Partition Array Into Three Parts With Equal Sum") +[< Previous](../partition-array-into-three-parts-with-equal-sum "Partition Array Into Three Parts With Equal Sum") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/smallest-integer-divisible-by-k "Smallest Integer Divisible by K") +[Next >](../smallest-integer-divisible-by-k "Smallest Integer Divisible by K") ## [1014. Best Sightseeing Pair (Medium)](https://leetcode.com/problems/best-sightseeing-pair "最佳观光组合") @@ -37,7 +37,7 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Hints
diff --git a/problems/best-time-to-buy-and-sell-stock-ii/README.md b/problems/best-time-to-buy-and-sell-stock-ii/README.md index 8cea3d897..48e05d027 100644 --- a/problems/best-time-to-buy-and-sell-stock-ii/README.md +++ b/problems/best-time-to-buy-and-sell-stock-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock "Best Time to Buy and Sell Stock") +[< Previous](../best-time-to-buy-and-sell-stock "Best Time to Buy and Sell Stock") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-iii "Best Time to Buy and Sell Stock III") +[Next >](../best-time-to-buy-and-sell-stock-iii "Best Time to Buy and Sell Stock III") ## [122. Best Time to Buy and Sell Stock II (Easy)](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii "买卖股票的最佳时机 II") @@ -44,12 +44,12 @@ Explanation: In this case, no transaction is done, i.e. max profit = 0. ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Best Time to Buy and Sell Stock](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock) (Easy) - 1. [Best Time to Buy and Sell Stock III](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-iii) (Hard) - 1. [Best Time to Buy and Sell Stock IV](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-iv) (Hard) - 1. [Best Time to Buy and Sell Stock with Cooldown](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-with-cooldown) (Medium) - 1. [Best Time to Buy and Sell Stock with Transaction Fee](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-with-transaction-fee) (Medium) + 1. [Best Time to Buy and Sell Stock](../best-time-to-buy-and-sell-stock) (Easy) + 1. [Best Time to Buy and Sell Stock III](../best-time-to-buy-and-sell-stock-iii) (Hard) + 1. [Best Time to Buy and Sell Stock IV](../best-time-to-buy-and-sell-stock-iv) (Hard) + 1. [Best Time to Buy and Sell Stock with Cooldown](../best-time-to-buy-and-sell-stock-with-cooldown) (Medium) + 1. [Best Time to Buy and Sell Stock with Transaction Fee](../best-time-to-buy-and-sell-stock-with-transaction-fee) (Medium) diff --git a/problems/best-time-to-buy-and-sell-stock-iii/README.md b/problems/best-time-to-buy-and-sell-stock-iii/README.md index 765dde73b..43adc71d1 100644 --- a/problems/best-time-to-buy-and-sell-stock-iii/README.md +++ b/problems/best-time-to-buy-and-sell-stock-iii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-ii "Best Time to Buy and Sell Stock II") +[< Previous](../best-time-to-buy-and-sell-stock-ii "Best Time to Buy and Sell Stock II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/binary-tree-maximum-path-sum "Binary Tree Maximum Path Sum") +[Next >](../binary-tree-maximum-path-sum "Binary Tree Maximum Path Sum") ## [123. Best Time to Buy and Sell Stock III (Hard)](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii "买卖股票的最佳时机 III") @@ -43,11 +43,11 @@ Explanation: In this case, no transaction is done, i.e. max profit = 0. ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Array](../../tag/array/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Best Time to Buy and Sell Stock](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock) (Easy) - 1. [Best Time to Buy and Sell Stock II](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-ii) (Easy) - 1. [Best Time to Buy and Sell Stock IV](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-iv) (Hard) - 1. [Maximum Sum of 3 Non-Overlapping Subarrays](https://github.com/openset/leetcode/tree/master/problems/maximum-sum-of-3-non-overlapping-subarrays) (Hard) + 1. [Best Time to Buy and Sell Stock](../best-time-to-buy-and-sell-stock) (Easy) + 1. [Best Time to Buy and Sell Stock II](../best-time-to-buy-and-sell-stock-ii) (Easy) + 1. [Best Time to Buy and Sell Stock IV](../best-time-to-buy-and-sell-stock-iv) (Hard) + 1. [Maximum Sum of 3 Non-Overlapping Subarrays](../maximum-sum-of-3-non-overlapping-subarrays) (Hard) diff --git a/problems/best-time-to-buy-and-sell-stock-iv/README.md b/problems/best-time-to-buy-and-sell-stock-iv/README.md index 337decbbc..e0f6809f3 100644 --- a/problems/best-time-to-buy-and-sell-stock-iv/README.md +++ b/problems/best-time-to-buy-and-sell-stock-iv/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/repeated-dna-sequences "Repeated DNA Sequences") +[< Previous](../repeated-dna-sequences "Repeated DNA Sequences") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/rotate-array "Rotate Array") +[Next >](../rotate-array "Rotate Array") ## [188. Best Time to Buy and Sell Stock IV (Hard)](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv "买卖股票的最佳时机 IV") @@ -36,9 +36,9 @@ You may not engage in multiple transactions at the same time (ie, you must sell ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Best Time to Buy and Sell Stock](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock) (Easy) - 1. [Best Time to Buy and Sell Stock II](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-ii) (Easy) - 1. [Best Time to Buy and Sell Stock III](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-iii) (Hard) + 1. [Best Time to Buy and Sell Stock](../best-time-to-buy-and-sell-stock) (Easy) + 1. [Best Time to Buy and Sell Stock II](../best-time-to-buy-and-sell-stock-ii) (Easy) + 1. [Best Time to Buy and Sell Stock III](../best-time-to-buy-and-sell-stock-iii) (Hard) diff --git a/problems/best-time-to-buy-and-sell-stock-with-cooldown/README.md b/problems/best-time-to-buy-and-sell-stock-with-cooldown/README.md index a677395f9..e57cb5155 100644 --- a/problems/best-time-to-buy-and-sell-stock-with-cooldown/README.md +++ b/problems/best-time-to-buy-and-sell-stock-with-cooldown/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-mutable "Range Sum Query 2D - Mutable") +[< Previous](../range-sum-query-2d-mutable "Range Sum Query 2D - Mutable") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-height-trees "Minimum Height Trees") +[Next >](../minimum-height-trees "Minimum Height Trees") ## [309. Best Time to Buy and Sell Stock with Cooldown (Medium)](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown "最佳买卖股票时机含冷冻期") @@ -29,8 +29,8 @@ ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Best Time to Buy and Sell Stock](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock) (Easy) - 1. [Best Time to Buy and Sell Stock II](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-ii) (Easy) + 1. [Best Time to Buy and Sell Stock](../best-time-to-buy-and-sell-stock) (Easy) + 1. [Best Time to Buy and Sell Stock II](../best-time-to-buy-and-sell-stock-ii) (Easy) diff --git a/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/README.md b/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/README.md index 5ec74f3eb..b1ad894a5 100644 --- a/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/README.md +++ b/problems/best-time-to-buy-and-sell-stock-with-transaction-fee/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/subarray-product-less-than-k "Subarray Product Less Than K") +[< Previous](../subarray-product-less-than-k "Subarray Product Less Than K") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/range-module "Range Module") +[Next >](../range-module "Range Module") ## [714. Best Time to Buy and Sell Stock with Transaction Fee (Medium)](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-transaction-fee "买卖股票的最佳时机含手续费") @@ -31,12 +31,12 @@

### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[Array](../../tag/array/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Best Time to Buy and Sell Stock II](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-ii) (Easy) + 1. [Best Time to Buy and Sell Stock II](../best-time-to-buy-and-sell-stock-ii) (Easy) ### Hints
diff --git a/problems/best-time-to-buy-and-sell-stock/README.md b/problems/best-time-to-buy-and-sell-stock/README.md index 1705d22ca..0c951ccd2 100644 --- a/problems/best-time-to-buy-and-sell-stock/README.md +++ b/problems/best-time-to-buy-and-sell-stock/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/triangle "Triangle") +[< Previous](../triangle "Triangle") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-ii "Best Time to Buy and Sell Stock II") +[Next >](../best-time-to-buy-and-sell-stock-ii "Best Time to Buy and Sell Stock II") ## [121. Best Time to Buy and Sell Stock (Easy)](https://leetcode.com/problems/best-time-to-buy-and-sell-stock "买卖股票的最佳时机") @@ -35,12 +35,12 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Array](../../tag/array/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Maximum Subarray](https://github.com/openset/leetcode/tree/master/problems/maximum-subarray) (Easy) - 1. [Best Time to Buy and Sell Stock II](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-ii) (Easy) - 1. [Best Time to Buy and Sell Stock III](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-iii) (Hard) - 1. [Best Time to Buy and Sell Stock IV](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-iv) (Hard) - 1. [Best Time to Buy and Sell Stock with Cooldown](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-with-cooldown) (Medium) + 1. [Maximum Subarray](../maximum-subarray) (Easy) + 1. [Best Time to Buy and Sell Stock II](../best-time-to-buy-and-sell-stock-ii) (Easy) + 1. [Best Time to Buy and Sell Stock III](../best-time-to-buy-and-sell-stock-iii) (Hard) + 1. [Best Time to Buy and Sell Stock IV](../best-time-to-buy-and-sell-stock-iv) (Hard) + 1. [Best Time to Buy and Sell Stock with Cooldown](../best-time-to-buy-and-sell-stock-with-cooldown) (Medium) diff --git a/problems/big-countries/README.md b/problems/big-countries/README.md index 789041a13..433c5c428 100644 --- a/problems/big-countries/README.md +++ b/problems/big-countries/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/longest-harmonious-subsequence "Longest Harmonious Subsequence") +[< Previous](../longest-harmonious-subsequence "Longest Harmonious Subsequence") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/classes-more-than-5-students "Classes More Than 5 Students") +[Next >](../classes-more-than-5-students "Classes More Than 5 Students") ## [595. Big Countries (Easy)](https://leetcode.com/problems/big-countries "大的国家") diff --git a/problems/biggest-single-number/README.md b/problems/biggest-single-number/README.md index e95049561..71435f4ab 100644 --- a/problems/biggest-single-number/README.md +++ b/problems/biggest-single-number/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/students-report-by-geography "Students Report By Geography") +[< Previous](../students-report-by-geography "Students Report By Geography") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/not-boring-movies "Not Boring Movies") +[Next >](../not-boring-movies "Not Boring Movies") ## [619. Biggest Single Number (Easy)](https://leetcode.com/problems/biggest-single-number "只出现一次的最大数字") diff --git a/problems/binary-gap/README.md b/problems/binary-gap/README.md index 5930ec74a..02c250249 100644 --- a/problems/binary-gap/README.md +++ b/problems/binary-gap/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/transpose-matrix "Transpose Matrix") +[< Previous](../transpose-matrix "Transpose Matrix") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/reordered-power-of-2 "Reordered Power of 2") +[Next >](../reordered-power-of-2 "Reordered Power of 2") ## [868. Binary Gap (Easy)](https://leetcode.com/problems/binary-gap "二进制间距") @@ -90,4 +90,4 @@ There aren't any consecutive pairs of 1's in the binary representation o ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/binary-number-with-alternating-bits/README.md b/problems/binary-number-with-alternating-bits/README.md index 750776eb3..f05d9ee99 100644 --- a/problems/binary-number-with-alternating-bits/README.md +++ b/problems/binary-number-with-alternating-bits/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/top-k-frequent-words "Top K Frequent Words") +[< Previous](../top-k-frequent-words "Top K Frequent Words") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-distinct-islands "Number of Distinct Islands") +[Next >](../number-of-distinct-islands "Number of Distinct Islands") ## [693. Binary Number with Alternating Bits (Easy)](https://leetcode.com/problems/binary-number-with-alternating-bits "交替位二进制数") @@ -50,7 +50,7 @@ The binary representation of 10 is: 1010.

### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] ### Similar Questions - 1. [Number of 1 Bits](https://github.com/openset/leetcode/tree/master/problems/number-of-1-bits) (Easy) + 1. [Number of 1 Bits](../number-of-1-bits) (Easy) diff --git a/problems/binary-prefix-divisible-by-5/README.md b/problems/binary-prefix-divisible-by-5/README.md index f1030d7fd..d1ee3b80a 100644 --- a/problems/binary-prefix-divisible-by-5/README.md +++ b/problems/binary-prefix-divisible-by-5/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/convert-to-base-2 "Convert to Base -2") +[< Previous](../convert-to-base-2 "Convert to Base -2") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/next-greater-node-in-linked-list "Next Greater Node In Linked List") +[Next >](../next-greater-node-in-linked-list "Next Greater Node In Linked List") ## [1018. Binary Prefix Divisible By 5 (Easy)](https://leetcode.com/problems/binary-prefix-divisible-by-5 "可被 5 整除的二进制前缀") @@ -55,7 +55,7 @@ The input numbers in binary are 0, 01, 011; which are 0, 1, and 3 in base-10. O ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Hints
diff --git a/problems/binary-search-tree-iterator/README.md b/problems/binary-search-tree-iterator/README.md index c1530afee..78b95f3d7 100644 --- a/problems/binary-search-tree-iterator/README.md +++ b/problems/binary-search-tree-iterator/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/factorial-trailing-zeroes "Factorial Trailing Zeroes") +[< Previous](../factorial-trailing-zeroes "Factorial Trailing Zeroes") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/dungeon-game "Dungeon Game") +[Next >](../dungeon-game "Dungeon Game") ## [173. Binary Search Tree Iterator (Medium)](https://leetcode.com/problems/binary-search-tree-iterator "二叉搜索树迭代器") @@ -47,13 +47,13 @@ iterator.hasNext(); // return false ### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] + [[Stack](../../tag/stack/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Design](../../tag/design/README.md)] ### Similar Questions - 1. [Binary Tree Inorder Traversal](https://github.com/openset/leetcode/tree/master/problems/binary-tree-inorder-traversal) (Medium) - 1. [Flatten 2D Vector](https://github.com/openset/leetcode/tree/master/problems/flatten-2d-vector) (Medium) - 1. [Zigzag Iterator](https://github.com/openset/leetcode/tree/master/problems/zigzag-iterator) (Medium) - 1. [Peeking Iterator](https://github.com/openset/leetcode/tree/master/problems/peeking-iterator) (Medium) - 1. [Inorder Successor in BST](https://github.com/openset/leetcode/tree/master/problems/inorder-successor-in-bst) (Medium) + 1. [Binary Tree Inorder Traversal](../binary-tree-inorder-traversal) (Medium) + 1. [Flatten 2D Vector](../flatten-2d-vector) (Medium) + 1. [Zigzag Iterator](../zigzag-iterator) (Medium) + 1. [Peeking Iterator](../peeking-iterator) (Medium) + 1. [Inorder Successor in BST](../inorder-successor-in-bst) (Medium) diff --git a/problems/binary-search-tree-to-greater-sum-tree/README.md b/problems/binary-search-tree-to-greater-sum-tree/README.md index bf74c778e..513955281 100644 --- a/problems/binary-search-tree-to-greater-sum-tree/README.md +++ b/problems/binary-search-tree-to-greater-sum-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/valid-boomerang "Valid Boomerang") +[< Previous](../valid-boomerang "Valid Boomerang") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-score-triangulation-of-polygon "Minimum Score Triangulation of Polygon") +[Next >](../minimum-score-triangulation-of-polygon "Minimum Score Triangulation of Polygon") ## [1038. Binary Search Tree to Greater Sum Tree (Medium)](https://leetcode.com/problems/binary-search-tree-to-greater-sum-tree "从二叉搜索树到更大和树") @@ -51,7 +51,7 @@ ### Related Topics - [[Binary Search Tree](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)] + [[Binary Search Tree](../../tag/binary-search-tree/README.md)] ### Hints
diff --git a/problems/binary-search/README.md b/problems/binary-search/README.md index 072193658..34d2cf28e 100644 --- a/problems/binary-search/README.md +++ b/problems/binary-search/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/kth-largest-element-in-a-stream "Kth Largest Element in a Stream") +[< Previous](../kth-largest-element-in-a-stream "Kth Largest Element in a Stream") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/design-hashset "Design HashSet") +[Next >](../design-hashset "Design HashSet") ## [704. Binary Search (Easy)](https://leetcode.com/problems/binary-search "二分查找") @@ -42,7 +42,7 @@ ### Related Topics - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [Search in a Sorted Array of Unknown Size](https://github.com/openset/leetcode/tree/master/problems/search-in-a-sorted-array-of-unknown-size) (Medium) + 1. [Search in a Sorted Array of Unknown Size](../search-in-a-sorted-array-of-unknown-size) (Medium) diff --git a/problems/binary-string-with-substrings-representing-1-to-n/README.md b/problems/binary-string-with-substrings-representing-1-to-n/README.md index 71e405ef9..ee354f5bf 100644 --- a/problems/binary-string-with-substrings-representing-1-to-n/README.md +++ b/problems/binary-string-with-substrings-representing-1-to-n/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/smallest-integer-divisible-by-k "Smallest Integer Divisible by K") +[< Previous](../smallest-integer-divisible-by-k "Smallest Integer Divisible by K") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/convert-to-base-2 "Convert to Base -2") +[Next >](../convert-to-base-2 "Convert to Base -2") ## [1016. Binary String With Substrings Representing 1 To N (Medium)](https://leetcode.com/problems/binary-string-with-substrings-representing-1-to-n "子串能表示从 1 到 N 数字的二进制串") @@ -39,7 +39,7 @@ ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Hints
diff --git a/problems/binary-subarrays-with-sum/README.md b/problems/binary-subarrays-with-sum/README.md index 9a30b8d6c..530b9e980 100644 --- a/problems/binary-subarrays-with-sum/README.md +++ b/problems/binary-subarrays-with-sum/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/unique-email-addresses "Unique Email Addresses") +[< Previous](../unique-email-addresses "Unique Email Addresses") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-falling-path-sum "Minimum Falling Path Sum") +[Next >](../minimum-falling-path-sum "Minimum Falling Path Sum") ## [930. Binary Subarrays With Sum (Medium)](https://leetcode.com/problems/binary-subarrays-with-sum "和相同的二元子数组") @@ -39,5 +39,5 @@ The 4 subarrays are bolded below: ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] diff --git a/problems/binary-tree-cameras/README.md b/problems/binary-tree-cameras/README.md index adec9afaa..dc265c0a0 100644 --- a/problems/binary-tree-cameras/README.md +++ b/problems/binary-tree-cameras/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/numbers-with-same-consecutive-differences "Numbers With Same Consecutive Differences") +[< Previous](../numbers-with-same-consecutive-differences "Numbers With Same Consecutive Differences") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/pancake-sorting "Pancake Sorting") +[Next >](../pancake-sorting "Pancake Sorting") ## [968. Binary Tree Cameras (Hard)](https://leetcode.com/problems/binary-tree-cameras "监控二叉树") @@ -48,9 +48,9 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Distribute Coins in Binary Tree](https://github.com/openset/leetcode/tree/master/problems/distribute-coins-in-binary-tree) (Medium) + 1. [Distribute Coins in Binary Tree](../distribute-coins-in-binary-tree) (Medium) diff --git a/problems/binary-tree-coloring-game/README.md b/problems/binary-tree-coloring-game/README.md index 6ce16d729..ee44c1142 100644 --- a/problems/binary-tree-coloring-game/README.md +++ b/problems/binary-tree-coloring-game/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/decrease-elements-to-make-array-zigzag "Decrease Elements To Make Array Zigzag") +[< Previous](../decrease-elements-to-make-array-zigzag "Decrease Elements To Make Array Zigzag") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/snapshot-array "Snapshot Array") +[Next >](../snapshot-array "Snapshot Array") ## [1145. Binary Tree Coloring Game (Medium)](https://leetcode.com/problems/binary-tree-coloring-game "二叉树着色游戏") @@ -40,8 +40,8 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] ### Hints
diff --git a/problems/binary-tree-inorder-traversal/README.md b/problems/binary-tree-inorder-traversal/README.md index d88708f8a..541392d4b 100644 --- a/problems/binary-tree-inorder-traversal/README.md +++ b/problems/binary-tree-inorder-traversal/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/restore-ip-addresses "Restore IP Addresses") +[< Previous](../restore-ip-addresses "Restore IP Addresses") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/unique-binary-search-trees-ii "Unique Binary Search Trees II") +[Next >](../unique-binary-search-trees-ii "Unique Binary Search Trees II") ## [94. Binary Tree Inorder Traversal (Medium)](https://leetcode.com/problems/binary-tree-inorder-traversal "二叉树的中序遍历") @@ -28,17 +28,17 @@

Follow up: Recursive solution is trivial, could you do it iteratively?

### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Stack](../../tag/stack/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Validate Binary Search Tree](https://github.com/openset/leetcode/tree/master/problems/validate-binary-search-tree) (Medium) - 1. [Binary Tree Preorder Traversal](https://github.com/openset/leetcode/tree/master/problems/binary-tree-preorder-traversal) (Medium) - 1. [Binary Tree Postorder Traversal](https://github.com/openset/leetcode/tree/master/problems/binary-tree-postorder-traversal) (Hard) - 1. [Binary Search Tree Iterator](https://github.com/openset/leetcode/tree/master/problems/binary-search-tree-iterator) (Medium) - 1. [Kth Smallest Element in a BST](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-element-in-a-bst) (Medium) - 1. [Closest Binary Search Tree Value II](https://github.com/openset/leetcode/tree/master/problems/closest-binary-search-tree-value-ii) (Hard) - 1. [Inorder Successor in BST](https://github.com/openset/leetcode/tree/master/problems/inorder-successor-in-bst) (Medium) - 1. [Convert Binary Search Tree to Sorted Doubly Linked List](https://github.com/openset/leetcode/tree/master/problems/convert-binary-search-tree-to-sorted-doubly-linked-list) (Medium) - 1. [Minimum Distance Between BST Nodes](https://github.com/openset/leetcode/tree/master/problems/minimum-distance-between-bst-nodes) (Easy) + 1. [Validate Binary Search Tree](../validate-binary-search-tree) (Medium) + 1. [Binary Tree Preorder Traversal](../binary-tree-preorder-traversal) (Medium) + 1. [Binary Tree Postorder Traversal](../binary-tree-postorder-traversal) (Hard) + 1. [Binary Search Tree Iterator](../binary-search-tree-iterator) (Medium) + 1. [Kth Smallest Element in a BST](../kth-smallest-element-in-a-bst) (Medium) + 1. [Closest Binary Search Tree Value II](../closest-binary-search-tree-value-ii) (Hard) + 1. [Inorder Successor in BST](../inorder-successor-in-bst) (Medium) + 1. [Convert Binary Search Tree to Sorted Doubly Linked List](../convert-binary-search-tree-to-sorted-doubly-linked-list) (Medium) + 1. [Minimum Distance Between BST Nodes](../minimum-distance-between-bst-nodes) (Easy) diff --git a/problems/binary-tree-level-order-traversal-ii/README.md b/problems/binary-tree-level-order-traversal-ii/README.md index eb3aa1978..d9e2f1472 100644 --- a/problems/binary-tree-level-order-traversal-ii/README.md +++ b/problems/binary-tree-level-order-traversal-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-inorder-and-postorder-traversal "Construct Binary Tree from Inorder and Postorder Traversal") +[< Previous](../construct-binary-tree-from-inorder-and-postorder-traversal "Construct Binary Tree from Inorder and Postorder Traversal") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/convert-sorted-array-to-binary-search-tree "Convert Sorted Array to Binary Search Tree") +[Next >](../convert-sorted-array-to-binary-search-tree "Convert Sorted Array to Binary Search Tree") ## [107. Binary Tree Level Order Traversal II (Easy)](https://leetcode.com/problems/binary-tree-level-order-traversal-ii "二叉树的层次遍历 II") @@ -36,9 +36,9 @@ return its bottom-up level order traversal as:

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] ### Similar Questions - 1. [Binary Tree Level Order Traversal](https://github.com/openset/leetcode/tree/master/problems/binary-tree-level-order-traversal) (Medium) - 1. [Average of Levels in Binary Tree](https://github.com/openset/leetcode/tree/master/problems/average-of-levels-in-binary-tree) (Easy) + 1. [Binary Tree Level Order Traversal](../binary-tree-level-order-traversal) (Medium) + 1. [Average of Levels in Binary Tree](../average-of-levels-in-binary-tree) (Easy) diff --git a/problems/binary-tree-level-order-traversal/README.md b/problems/binary-tree-level-order-traversal/README.md index ad8ce7547..d0e34e041 100644 --- a/problems/binary-tree-level-order-traversal/README.md +++ b/problems/binary-tree-level-order-traversal/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/symmetric-tree "Symmetric Tree") +[< Previous](../symmetric-tree "Symmetric Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/binary-tree-zigzag-level-order-traversal "Binary Tree Zigzag Level Order Traversal") +[Next >](../binary-tree-zigzag-level-order-traversal "Binary Tree Zigzag Level Order Traversal") ## [102. Binary Tree Level Order Traversal (Medium)](https://leetcode.com/problems/binary-tree-level-order-traversal "二叉树的层次遍历") @@ -36,14 +36,14 @@ return its level order traversal as:

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] ### Similar Questions - 1. [Binary Tree Zigzag Level Order Traversal](https://github.com/openset/leetcode/tree/master/problems/binary-tree-zigzag-level-order-traversal) (Medium) - 1. [Binary Tree Level Order Traversal II](https://github.com/openset/leetcode/tree/master/problems/binary-tree-level-order-traversal-ii) (Easy) - 1. [Minimum Depth of Binary Tree](https://github.com/openset/leetcode/tree/master/problems/minimum-depth-of-binary-tree) (Easy) - 1. [Binary Tree Vertical Order Traversal](https://github.com/openset/leetcode/tree/master/problems/binary-tree-vertical-order-traversal) (Medium) - 1. [Average of Levels in Binary Tree](https://github.com/openset/leetcode/tree/master/problems/average-of-levels-in-binary-tree) (Easy) - 1. [N-ary Tree Level Order Traversal](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-level-order-traversal) (Medium) - 1. [Cousins in Binary Tree](https://github.com/openset/leetcode/tree/master/problems/cousins-in-binary-tree) (Easy) + 1. [Binary Tree Zigzag Level Order Traversal](../binary-tree-zigzag-level-order-traversal) (Medium) + 1. [Binary Tree Level Order Traversal II](../binary-tree-level-order-traversal-ii) (Easy) + 1. [Minimum Depth of Binary Tree](../minimum-depth-of-binary-tree) (Easy) + 1. [Binary Tree Vertical Order Traversal](../binary-tree-vertical-order-traversal) (Medium) + 1. [Average of Levels in Binary Tree](../average-of-levels-in-binary-tree) (Easy) + 1. [N-ary Tree Level Order Traversal](../n-ary-tree-level-order-traversal) (Medium) + 1. [Cousins in Binary Tree](../cousins-in-binary-tree) (Easy) diff --git a/problems/binary-tree-longest-consecutive-sequence-ii/README.md b/problems/binary-tree-longest-consecutive-sequence-ii/README.md index e923e4aa6..8347fe2f1 100644 --- a/problems/binary-tree-longest-consecutive-sequence-ii/README.md +++ b/problems/binary-tree-longest-consecutive-sequence-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/split-array-with-equal-sum "Split Array with Equal Sum") +[< Previous](../split-array-with-equal-sum "Split Array with Equal Sum") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/game-play-analysis-iv "Game Play Analysis IV") +[Next >](../game-play-analysis-iv "Game Play Analysis IV") ## [549. Binary Tree Longest Consecutive Sequence II (Medium)](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence-ii "二叉树中最长的连续序列") @@ -44,7 +44,7 @@

Note: All the values of tree nodes are in the range of [-1e7, 1e7].

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] ### Similar Questions - 1. [Binary Tree Longest Consecutive Sequence](https://github.com/openset/leetcode/tree/master/problems/binary-tree-longest-consecutive-sequence) (Medium) + 1. [Binary Tree Longest Consecutive Sequence](../binary-tree-longest-consecutive-sequence) (Medium) diff --git a/problems/binary-tree-longest-consecutive-sequence/README.md b/problems/binary-tree-longest-consecutive-sequence/README.md index ce05cfd2a..1c6bfa49b 100644 --- a/problems/binary-tree-longest-consecutive-sequence/README.md +++ b/problems/binary-tree-longest-consecutive-sequence/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-binary-tree "Serialize and Deserialize Binary Tree") +[< Previous](../serialize-and-deserialize-binary-tree "Serialize and Deserialize Binary Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/bulls-and-cows "Bulls and Cows") +[Next >](../bulls-and-cows "Bulls and Cows") ## [298. Binary Tree Longest Consecutive Sequence (Medium)](https://leetcode.com/problems/binary-tree-longest-consecutive-sequence "二叉树最长连续序列") @@ -50,8 +50,8 @@ Explanation: Longest consecutive sequence path is 2-3, not 3-2-1, so return 2. ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] ### Similar Questions - 1. [Longest Consecutive Sequence](https://github.com/openset/leetcode/tree/master/problems/longest-consecutive-sequence) (Hard) - 1. [Binary Tree Longest Consecutive Sequence II](https://github.com/openset/leetcode/tree/master/problems/binary-tree-longest-consecutive-sequence-ii) (Medium) + 1. [Longest Consecutive Sequence](../longest-consecutive-sequence) (Hard) + 1. [Binary Tree Longest Consecutive Sequence II](../binary-tree-longest-consecutive-sequence-ii) (Medium) diff --git a/problems/binary-tree-maximum-path-sum/README.md b/problems/binary-tree-maximum-path-sum/README.md index 8bf8689e5..c6bba9c25 100644 --- a/problems/binary-tree-maximum-path-sum/README.md +++ b/problems/binary-tree-maximum-path-sum/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-iii "Best Time to Buy and Sell Stock III") +[< Previous](../best-time-to-buy-and-sell-stock-iii "Best Time to Buy and Sell Stock III") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/valid-palindrome "Valid Palindrome") +[Next >](../valid-palindrome "Valid Palindrome") ## [124. Binary Tree Maximum Path Sum (Hard)](https://leetcode.com/problems/binary-tree-maximum-path-sum "二叉树中的最大路径和") @@ -42,11 +42,11 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] ### Similar Questions - 1. [Path Sum](https://github.com/openset/leetcode/tree/master/problems/path-sum) (Easy) - 1. [Sum Root to Leaf Numbers](https://github.com/openset/leetcode/tree/master/problems/sum-root-to-leaf-numbers) (Medium) - 1. [Path Sum IV](https://github.com/openset/leetcode/tree/master/problems/path-sum-iv) (Medium) - 1. [Longest Univalue Path](https://github.com/openset/leetcode/tree/master/problems/longest-univalue-path) (Easy) + 1. [Path Sum](../path-sum) (Easy) + 1. [Sum Root to Leaf Numbers](../sum-root-to-leaf-numbers) (Medium) + 1. [Path Sum IV](../path-sum-iv) (Medium) + 1. [Longest Univalue Path](../longest-univalue-path) (Easy) diff --git a/problems/binary-tree-paths/README.md b/problems/binary-tree-paths/README.md index 6df4189b2..236c890f6 100644 --- a/problems/binary-tree-paths/README.md +++ b/problems/binary-tree-paths/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/paint-house "Paint House") +[< Previous](../paint-house "Paint House") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/add-digits "Add Digits") +[Next >](../add-digits "Add Digits") ## [257. Binary Tree Paths (Easy)](https://leetcode.com/problems/binary-tree-paths "二叉树的所有路径") @@ -32,9 +32,9 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] ### Similar Questions - 1. [Path Sum II](https://github.com/openset/leetcode/tree/master/problems/path-sum-ii) (Medium) - 1. [Smallest String Starting From Leaf](https://github.com/openset/leetcode/tree/master/problems/smallest-string-starting-from-leaf) (Medium) + 1. [Path Sum II](../path-sum-ii) (Medium) + 1. [Smallest String Starting From Leaf](../smallest-string-starting-from-leaf) (Medium) diff --git a/problems/binary-tree-postorder-traversal/README.md b/problems/binary-tree-postorder-traversal/README.md index 926a0321e..3b6c1107b 100644 --- a/problems/binary-tree-postorder-traversal/README.md +++ b/problems/binary-tree-postorder-traversal/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/binary-tree-preorder-traversal "Binary Tree Preorder Traversal") +[< Previous](../binary-tree-preorder-traversal "Binary Tree Preorder Traversal") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/lru-cache "LRU Cache") +[Next >](../lru-cache "LRU Cache") ## [145. Binary Tree Postorder Traversal (Hard)](https://leetcode.com/problems/binary-tree-postorder-traversal "二叉树的后序遍历") @@ -29,9 +29,9 @@

Follow up: Recursive solution is trivial, could you do it iteratively?

### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Stack](../../tag/stack/README.md)] + [[Tree](../../tag/tree/README.md)] ### Similar Questions - 1. [Binary Tree Inorder Traversal](https://github.com/openset/leetcode/tree/master/problems/binary-tree-inorder-traversal) (Medium) - 1. [N-ary Tree Postorder Traversal](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-postorder-traversal) (Easy) + 1. [Binary Tree Inorder Traversal](../binary-tree-inorder-traversal) (Medium) + 1. [N-ary Tree Postorder Traversal](../n-ary-tree-postorder-traversal) (Easy) diff --git a/problems/binary-tree-preorder-traversal/README.md b/problems/binary-tree-preorder-traversal/README.md index be1447b53..1d547ac24 100644 --- a/problems/binary-tree-preorder-traversal/README.md +++ b/problems/binary-tree-preorder-traversal/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/reorder-list "Reorder List") +[< Previous](../reorder-list "Reorder List") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/binary-tree-postorder-traversal "Binary Tree Postorder Traversal") +[Next >](../binary-tree-postorder-traversal "Binary Tree Postorder Traversal") ## [144. Binary Tree Preorder Traversal (Medium)](https://leetcode.com/problems/binary-tree-preorder-traversal "二叉树的前序遍历") @@ -29,10 +29,10 @@

Follow up: Recursive solution is trivial, could you do it iteratively?

### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Stack](../../tag/stack/README.md)] + [[Tree](../../tag/tree/README.md)] ### Similar Questions - 1. [Binary Tree Inorder Traversal](https://github.com/openset/leetcode/tree/master/problems/binary-tree-inorder-traversal) (Medium) - 1. [Verify Preorder Sequence in Binary Search Tree](https://github.com/openset/leetcode/tree/master/problems/verify-preorder-sequence-in-binary-search-tree) (Medium) - 1. [N-ary Tree Preorder Traversal](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-preorder-traversal) (Easy) + 1. [Binary Tree Inorder Traversal](../binary-tree-inorder-traversal) (Medium) + 1. [Verify Preorder Sequence in Binary Search Tree](../verify-preorder-sequence-in-binary-search-tree) (Medium) + 1. [N-ary Tree Preorder Traversal](../n-ary-tree-preorder-traversal) (Easy) diff --git a/problems/binary-tree-pruning/README.md b/problems/binary-tree-pruning/README.md index 703a73320..7fa911708 100644 --- a/problems/binary-tree-pruning/README.md +++ b/problems/binary-tree-pruning/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/largest-sum-of-averages "Largest Sum of Averages") +[< Previous](../largest-sum-of-averages "Largest Sum of Averages") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/bus-routes "Bus Routes") +[Next >](../bus-routes "Bus Routes") ## [814. Binary Tree Pruning (Medium)](https://leetcode.com/problems/binary-tree-pruning "二叉树剪枝") @@ -55,4 +55,4 @@ The diagram on the right represents the answer. ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] diff --git a/problems/binary-tree-right-side-view/README.md b/problems/binary-tree-right-side-view/README.md index 5ece4c4b9..c4c1c1725 100644 --- a/problems/binary-tree-right-side-view/README.md +++ b/problems/binary-tree-right-side-view/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/house-robber "House Robber") +[< Previous](../house-robber "House Robber") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-islands "Number of Islands") +[Next >](../number-of-islands "Number of Islands") ## [199. Binary Tree Right Side View (Medium)](https://leetcode.com/problems/binary-tree-right-side-view "二叉树的右视图") @@ -28,10 +28,10 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] ### Similar Questions - 1. [Populating Next Right Pointers in Each Node](https://github.com/openset/leetcode/tree/master/problems/populating-next-right-pointers-in-each-node) (Medium) - 1. [Boundary of Binary Tree](https://github.com/openset/leetcode/tree/master/problems/boundary-of-binary-tree) (Medium) + 1. [Populating Next Right Pointers in Each Node](../populating-next-right-pointers-in-each-node) (Medium) + 1. [Boundary of Binary Tree](../boundary-of-binary-tree) (Medium) diff --git a/problems/binary-tree-tilt/README.md b/problems/binary-tree-tilt/README.md index 88b2a8815..2f13835ec 100644 --- a/problems/binary-tree-tilt/README.md +++ b/problems/binary-tree-tilt/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/longest-line-of-consecutive-one-in-matrix "Longest Line of Consecutive One in Matrix") +[< Previous](../longest-line-of-consecutive-one-in-matrix "Longest Line of Consecutive One in Matrix") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-the-closest-palindrome "Find the Closest Palindrome") +[Next >](../find-the-closest-palindrome "Find the Closest Palindrome") ## [563. Binary Tree Tilt (Easy)](https://leetcode.com/problems/binary-tree-tilt "二叉树的坡度") @@ -40,7 +40,7 @@ Tilt of binary tree : 0 + 0 + 1 = 1

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] ### Hints
diff --git a/problems/binary-tree-upside-down/README.md b/problems/binary-tree-upside-down/README.md index 034d25b90..5a034ea82 100644 --- a/problems/binary-tree-upside-down/README.md +++ b/problems/binary-tree-upside-down/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/min-stack "Min Stack") +[< Previous](../min-stack "Min Stack") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/read-n-characters-given-read4 "Read N Characters Given Read4") +[Next >](../read-n-characters-given-read4 "Read N Characters Given Read4") ## [156. Binary Tree Upside Down (Medium)](https://leetcode.com/problems/binary-tree-upside-down "上下翻转二叉树") @@ -54,7 +54,7 @@

The above binary tree is serialized as [1,2,3,#,#,4,#,#,5].

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] ### Similar Questions - 1. [Reverse Linked List](https://github.com/openset/leetcode/tree/master/problems/reverse-linked-list) (Easy) + 1. [Reverse Linked List](../reverse-linked-list) (Easy) diff --git a/problems/binary-tree-vertical-order-traversal/README.md b/problems/binary-tree-vertical-order-traversal/README.md index ff7b3c5ba..0b3a26f4c 100644 --- a/problems/binary-tree-vertical-order-traversal/README.md +++ b/problems/binary-tree-vertical-order-traversal/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/super-ugly-number "Super Ugly Number") +[< Previous](../super-ugly-number "Super Ugly Number") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/count-of-smaller-numbers-after-self "Count of Smaller Numbers After Self") +[Next >](../count-of-smaller-numbers-after-self "Count of Smaller Numbers After Self") ## [314. Binary Tree Vertical Order Traversal (Medium)](https://leetcode.com/problems/binary-tree-vertical-order-traversal "二叉树的垂直遍历") @@ -90,7 +90,7 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Binary Tree Level Order Traversal](https://github.com/openset/leetcode/tree/master/problems/binary-tree-level-order-traversal) (Medium) + 1. [Binary Tree Level Order Traversal](../binary-tree-level-order-traversal) (Medium) diff --git a/problems/binary-tree-zigzag-level-order-traversal/README.md b/problems/binary-tree-zigzag-level-order-traversal/README.md index 72bf179c9..10e9b8169 100644 --- a/problems/binary-tree-zigzag-level-order-traversal/README.md +++ b/problems/binary-tree-zigzag-level-order-traversal/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/binary-tree-level-order-traversal "Binary Tree Level Order Traversal") +[< Previous](../binary-tree-level-order-traversal "Binary Tree Level Order Traversal") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-depth-of-binary-tree "Maximum Depth of Binary Tree") +[Next >](../maximum-depth-of-binary-tree "Maximum Depth of Binary Tree") ## [103. Binary Tree Zigzag Level Order Traversal (Medium)](https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal "二叉树的锯齿形层次遍历") @@ -36,9 +36,9 @@ return its zigzag level order traversal as:

### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Stack](../../tag/stack/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] ### Similar Questions - 1. [Binary Tree Level Order Traversal](https://github.com/openset/leetcode/tree/master/problems/binary-tree-level-order-traversal) (Medium) + 1. [Binary Tree Level Order Traversal](../binary-tree-level-order-traversal) (Medium) diff --git a/problems/binary-trees-with-factors/README.md b/problems/binary-trees-with-factors/README.md index 393b0705d..acfc166b7 100644 --- a/problems/binary-trees-with-factors/README.md +++ b/problems/binary-trees-with-factors/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/card-flipping-game "Card Flipping Game") +[< Previous](../card-flipping-game "Card Flipping Game") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/goat-latin "Goat Latin") +[Next >](../goat-latin "Goat Latin") ## [823. Binary Trees With Factors (Medium)](https://leetcode.com/problems/binary-trees-with-factors "带因子的二叉树") diff --git a/problems/binary-watch/README.md b/problems/binary-watch/README.md index 8a6b895f3..09de949d2 100644 --- a/problems/binary-watch/README.md +++ b/problems/binary-watch/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/nth-digit "Nth Digit") +[< Previous](../nth-digit "Nth Digit") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/remove-k-digits "Remove K Digits") +[Next >](../remove-k-digits "Remove K Digits") ## [401. Binary Watch (Easy)](https://leetcode.com/problems/binary-watch "二进制手表") @@ -31,12 +31,12 @@

### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Letter Combinations of a Phone Number](https://github.com/openset/leetcode/tree/master/problems/letter-combinations-of-a-phone-number) (Medium) - 1. [Number of 1 Bits](https://github.com/openset/leetcode/tree/master/problems/number-of-1-bits) (Easy) + 1. [Letter Combinations of a Phone Number](../letter-combinations-of-a-phone-number) (Medium) + 1. [Number of 1 Bits](../number-of-1-bits) (Easy) ### Hints
diff --git a/problems/bitwise-and-of-numbers-range/README.md b/problems/bitwise-and-of-numbers-range/README.md index b0738a994..cf9e4d9c7 100644 --- a/problems/bitwise-and-of-numbers-range/README.md +++ b/problems/bitwise-and-of-numbers-range/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/number-of-islands "Number of Islands") +[< Previous](../number-of-islands "Number of Islands") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/happy-number "Happy Number") +[Next >](../happy-number "Happy Number") ## [201. Bitwise AND of Numbers Range (Medium)](https://leetcode.com/problems/bitwise-and-of-numbers-range "数字范围按位与") @@ -27,4 +27,4 @@ Output: 0 ### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] diff --git a/problems/bitwise-ors-of-subarrays/README.md b/problems/bitwise-ors-of-subarrays/README.md index 1b9e160c2..56b41a488 100644 --- a/problems/bitwise-ors-of-subarrays/README.md +++ b/problems/bitwise-ors-of-subarrays/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/increasing-order-search-tree "Increasing Order Search Tree") +[< Previous](../increasing-order-search-tree "Increasing Order Search Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/orderly-queue "Orderly Queue") +[Next >](../orderly-queue "Orderly Queue") ## [898. Bitwise ORs of Subarrays (Medium)](https://leetcode.com/problems/bitwise-ors-of-subarrays "子数组按位或操作") @@ -64,5 +64,5 @@ The possible results are 1, 2, 3, 4, 6, and 7. ### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/boats-to-save-people/README.md b/problems/boats-to-save-people/README.md index ce89022df..80af1ce36 100644 --- a/problems/boats-to-save-people/README.md +++ b/problems/boats-to-save-people/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/decoded-string-at-index "Decoded String at Index") +[< Previous](../decoded-string-at-index "Decoded String at Index") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/reachable-nodes-in-subdivided-graph "Reachable Nodes In Subdivided Graph") +[Next >](../reachable-nodes-in-subdivided-graph "Reachable Nodes In Subdivided Graph") ## [881. Boats to Save People (Medium)](https://leetcode.com/problems/boats-to-save-people "救生艇") @@ -56,5 +56,5 @@ ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] diff --git a/problems/bold-words-in-string/README.md b/problems/bold-words-in-string/README.md index 5c0eb70fe..bee582ca3 100644 --- a/problems/bold-words-in-string/README.md +++ b/problems/bold-words-in-string/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/set-intersection-size-at-least-two "Set Intersection Size At Least Two") +[< Previous](../set-intersection-size-at-least-two "Set Intersection Size At Least Two") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/employee-free-time "Employee Free Time") +[Next >](../employee-free-time "Employee Free Time") ## [758. Bold Words in String (Easy)](https://leetcode.com/problems/bold-words-in-string "字符串中的加粗单词") @@ -28,7 +28,7 @@ For example, given that words = ["ab", "bc"] and S = "aabcd"

### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Hints
diff --git a/problems/bomb-enemy/README.md b/problems/bomb-enemy/README.md index ee3a3650a..635b337f8 100644 --- a/problems/bomb-enemy/README.md +++ b/problems/bomb-enemy/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/sort-transformed-array "Sort Transformed Array") +[< Previous](../sort-transformed-array "Sort Transformed Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/design-hit-counter "Design Hit Counter") +[Next >](../design-hit-counter "Design Hit Counter") ## [361. Bomb Enemy (Medium)](https://leetcode.com/problems/bomb-enemy "轰炸敌人") @@ -31,4 +31,4 @@ Placing a bomb at (1,1) kills 3 enemies. ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/boundary-of-binary-tree/README.md b/problems/boundary-of-binary-tree/README.md index dd6d7a792..42239e8f7 100644 --- a/problems/boundary-of-binary-tree/README.md +++ b/problems/boundary-of-binary-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/output-contest-matches "Output Contest Matches") +[< Previous](../output-contest-matches "Output Contest Matches") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/remove-boxes "Remove Boxes") +[Next >](../remove-boxes "Remove Boxes") ## [545. Boundary of Binary Tree (Medium)](https://leetcode.com/problems/boundary-of-binary-tree "二叉树的边界") @@ -66,7 +66,7 @@ So order them in anti-clockwise without duplicate nodes we have [1,2,4,7,8,9,10,

 

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] ### Similar Questions - 1. [Binary Tree Right Side View](https://github.com/openset/leetcode/tree/master/problems/binary-tree-right-side-view) (Medium) + 1. [Binary Tree Right Side View](../binary-tree-right-side-view) (Medium) diff --git a/problems/brace-expansion-ii/README.md b/problems/brace-expansion-ii/README.md index e6cd3207b..e8691c186 100644 --- a/problems/brace-expansion-ii/README.md +++ b/problems/brace-expansion-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-in-mountain-array "Find in Mountain Array") +[< Previous](../find-in-mountain-array "Find in Mountain Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/game-play-analysis-v "Game Play Analysis V") +[Next >](../game-play-analysis-v "Game Play Analysis V") ## [1096. Brace Expansion II (Hard)](https://leetcode.com/problems/brace-expansion-ii "花括号展开 II") @@ -78,10 +78,10 @@ ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Brace Expansion](https://github.com/openset/leetcode/tree/master/problems/brace-expansion) (Medium) + 1. [Brace Expansion](../brace-expansion) (Medium) ### Hints
diff --git a/problems/brace-expansion/README.md b/problems/brace-expansion/README.md index 7491e97f8..937e39d7a 100644 --- a/problems/brace-expansion/README.md +++ b/problems/brace-expansion/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/high-five "High Five") +[< Previous](../high-five "High Five") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/confusing-number-ii "Confusing Number II") +[Next >](../confusing-number-ii "Confusing Number II") ## [1087. Brace Expansion (Medium)](https://leetcode.com/problems/brace-expansion "字母切换") @@ -46,12 +46,12 @@ ### Related Topics - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Decode String](https://github.com/openset/leetcode/tree/master/problems/decode-string) (Medium) - 1. [Letter Case Permutation](https://github.com/openset/leetcode/tree/master/problems/letter-case-permutation) (Easy) - 1. [Brace Expansion II](https://github.com/openset/leetcode/tree/master/problems/brace-expansion-ii) (Hard) + 1. [Decode String](../decode-string) (Medium) + 1. [Letter Case Permutation](../letter-case-permutation) (Easy) + 1. [Brace Expansion II](../brace-expansion-ii) (Hard) ### Hints
diff --git a/problems/brick-wall/README.md b/problems/brick-wall/README.md index 395abdbb9..5714cdb26 100644 --- a/problems/brick-wall/README.md +++ b/problems/brick-wall/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/optimal-division "Optimal Division") +[< Previous](../optimal-division "Optimal Division") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/split-concatenated-strings "Split Concatenated Strings") +[Next >](../split-concatenated-strings "Split Concatenated Strings") ## [554. Brick Wall (Medium)](https://leetcode.com/problems/brick-wall "砖墙") @@ -47,4 +47,4 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] diff --git a/problems/bricks-falling-when-hit/README.md b/problems/bricks-falling-when-hit/README.md index a5df4460a..47c98e432 100644 --- a/problems/bricks-falling-when-hit/README.md +++ b/problems/bricks-falling-when-hit/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-eventual-safe-states "Find Eventual Safe States") +[< Previous](../find-eventual-safe-states "Find Eventual Safe States") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/unique-morse-code-words "Unique Morse Code Words") +[Next >](../unique-morse-code-words "Unique Morse Code Words") ## [803. Bricks Falling When Hit (Hard)](https://leetcode.com/problems/bricks-falling-when-hit "打砖块") @@ -47,4 +47,4 @@ When we erase the brick at (1, 0), the brick at (1, 1) has already disappeared d ### Related Topics - [[Union Find](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] + [[Union Find](../../tag/union-find/README.md)] diff --git a/problems/broken-calculator/README.md b/problems/broken-calculator/README.md index 3344b03cf..a452afcbb 100644 --- a/problems/broken-calculator/README.md +++ b/problems/broken-calculator/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/satisfiability-of-equality-equations "Satisfiability of Equality Equations") +[< Previous](../satisfiability-of-equality-equations "Satisfiability of Equality Equations") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/subarrays-with-k-different-integers "Subarrays with K Different Integers") +[Next >](../subarrays-with-k-different-integers "Subarrays with K Different Integers") ## [991. Broken Calculator (Medium)](https://leetcode.com/problems/broken-calculator "坏了的计算器") @@ -66,8 +66,8 @@ ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [2 Keys Keyboard](https://github.com/openset/leetcode/tree/master/problems/2-keys-keyboard) (Medium) + 1. [2 Keys Keyboard](../2-keys-keyboard) (Medium) diff --git a/problems/buddy-strings/README.md b/problems/buddy-strings/README.md index 81a19007a..d2b799aeb 100644 --- a/problems/buddy-strings/README.md +++ b/problems/buddy-strings/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/mirror-reflection "Mirror Reflection") +[< Previous](../mirror-reflection "Mirror Reflection") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/lemonade-change "Lemonade Change") +[Next >](../lemonade-change "Lemonade Change") ## [859. Buddy Strings (Easy)](https://leetcode.com/problems/buddy-strings "亲密字符串") @@ -71,4 +71,4 @@ ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/building-h2o/README.md b/problems/building-h2o/README.md index 1967f5aff..969d84da0 100644 --- a/problems/building-h2o/README.md +++ b/problems/building-h2o/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/print-zero-even-odd "Print Zero Even Odd") +[< Previous](../print-zero-even-odd "Print Zero Even Odd") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-days-in-a-month "Number of Days in a Month") +[Next >](../number-of-days-in-a-month "Number of Days in a Month") ## [1117. Building H2O (Medium)](https://leetcode.com/problems/building-h2o "H2O 生成") diff --git a/problems/bulb-switcher-ii/README.md b/problems/bulb-switcher-ii/README.md index 1e5994bda..2e641f981 100644 --- a/problems/bulb-switcher-ii/README.md +++ b/problems/bulb-switcher-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/second-minimum-node-in-a-binary-tree "Second Minimum Node In a Binary Tree") +[< Previous](../second-minimum-node-in-a-binary-tree "Second Minimum Node In a Binary Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-longest-increasing-subsequence "Number of Longest Increasing Subsequence") +[Next >](../number-of-longest-increasing-subsequence "Number of Longest Increasing Subsequence") ## [672. Bulb Switcher II (Medium)](https://leetcode.com/problems/bulb-switcher-ii "灯泡开关 Ⅱ") @@ -57,7 +57,7 @@

Note: n and m both fit in range [0, 1000].

### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Bulb Switcher](https://github.com/openset/leetcode/tree/master/problems/bulb-switcher) (Medium) + 1. [Bulb Switcher](../bulb-switcher) (Medium) diff --git a/problems/bulb-switcher/README.md b/problems/bulb-switcher/README.md index 9b83f3e02..b8cdb6bab 100644 --- a/problems/bulb-switcher/README.md +++ b/problems/bulb-switcher/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-product-of-word-lengths "Maximum Product of Word Lengths") +[< Previous](../maximum-product-of-word-lengths "Maximum Product of Word Lengths") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/generalized-abbreviation "Generalized Abbreviation") +[Next >](../generalized-abbreviation "Generalized Abbreviation") ## [319. Bulb Switcher (Medium)](https://leetcode.com/problems/bulb-switcher "灯泡开关") @@ -28,9 +28,9 @@ So you should return 1, because there is only one bulb is on. ### Related Topics - [[Brainteaser](https://github.com/openset/leetcode/tree/master/tag/brainteaser/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Brainteaser](../../tag/brainteaser/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Bulb Switcher II](https://github.com/openset/leetcode/tree/master/problems/bulb-switcher-ii) (Medium) - 1. [Minimum Number of K Consecutive Bit Flips](https://github.com/openset/leetcode/tree/master/problems/minimum-number-of-k-consecutive-bit-flips) (Hard) + 1. [Bulb Switcher II](../bulb-switcher-ii) (Medium) + 1. [Minimum Number of K Consecutive Bit Flips](../minimum-number-of-k-consecutive-bit-flips) (Hard) diff --git a/problems/bulls-and-cows/README.md b/problems/bulls-and-cows/README.md index 8986f0056..f2c9dbbc6 100644 --- a/problems/bulls-and-cows/README.md +++ b/problems/bulls-and-cows/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/binary-tree-longest-consecutive-sequence "Binary Tree Longest Consecutive Sequence") +[< Previous](../binary-tree-longest-consecutive-sequence "Binary Tree Longest Consecutive Sequence") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/longest-increasing-subsequence "Longest Increasing Subsequence") +[Next >](../longest-increasing-subsequence "Longest Increasing Subsequence") ## [299. Bulls and Cows (Easy)](https://leetcode.com/problems/bulls-and-cows "猜数字游戏") @@ -38,4 +38,4 @@

Note: You may assume that the secret number and your friend's guess only contain digits, and their lengths are always equal.

### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] diff --git a/problems/burst-balloons/README.md b/problems/burst-balloons/README.md index 61e267b4e..8dff26fd9 100644 --- a/problems/burst-balloons/README.md +++ b/problems/burst-balloons/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/sparse-matrix-multiplication "Sparse Matrix Multiplication") +[< Previous](../sparse-matrix-multiplication "Sparse Matrix Multiplication") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/super-ugly-number "Super Ugly Number") +[Next >](../super-ugly-number "Super Ugly Number") ## [312. Burst Balloons (Hard)](https://leetcode.com/problems/burst-balloons "戳气球") @@ -32,8 +32,8 @@ ### Related Topics - [[Divide and Conquer](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Divide and Conquer](../../tag/divide-and-conquer/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Minimum Cost to Merge Stones](https://github.com/openset/leetcode/tree/master/problems/minimum-cost-to-merge-stones) (Hard) + 1. [Minimum Cost to Merge Stones](../minimum-cost-to-merge-stones) (Hard) diff --git a/problems/bus-routes/README.md b/problems/bus-routes/README.md index 9e114d32f..758dfeff8 100644 --- a/problems/bus-routes/README.md +++ b/problems/bus-routes/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/binary-tree-pruning "Binary Tree Pruning") +[< Previous](../binary-tree-pruning "Binary Tree Pruning") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/ambiguous-coordinates "Ambiguous Coordinates") +[Next >](../ambiguous-coordinates "Ambiguous Coordinates") ## [815. Bus Routes (Hard)](https://leetcode.com/problems/bus-routes "公交路线") @@ -35,4 +35,4 @@ The best strategy is take the first bus to the bus stop 7, then take the second ### Related Topics - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] diff --git a/problems/camelcase-matching/README.md b/problems/camelcase-matching/README.md index c3794292e..6144214e6 100644 --- a/problems/camelcase-matching/README.md +++ b/problems/camelcase-matching/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/sum-of-root-to-leaf-binary-numbers "Sum of Root To Leaf Binary Numbers") +[< Previous](../sum-of-root-to-leaf-binary-numbers "Sum of Root To Leaf Binary Numbers") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/video-stitching "Video Stitching") +[Next >](../video-stitching "Video Stitching") ## [1023. Camelcase Matching (Medium)](https://leetcode.com/problems/camelcase-matching "驼峰式匹配") @@ -58,8 +58,8 @@ ### Related Topics - [[Trie](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Trie](../../tag/trie/README.md)] + [[String](../../tag/string/README.md)] ### Hints
diff --git a/problems/campus-bikes-ii/README.md b/problems/campus-bikes-ii/README.md index 20930ca08..644d66f84 100644 --- a/problems/campus-bikes-ii/README.md +++ b/problems/campus-bikes-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/index-pairs-of-a-string "Index Pairs of a String") +[< Previous](../index-pairs-of-a-string "Index Pairs of a String") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/digit-count-in-range "Digit Count in Range") +[Next >](../digit-count-in-range "Digit Count in Range") ## [1066. Campus Bikes II (Medium)](https://leetcode.com/problems/campus-bikes-ii "校园自行车分配 II") @@ -54,11 +54,11 @@ We first assign bike 0 to worker 0, then assign bike 1 to worker 1 or worker 2, ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Campus Bikes](https://github.com/openset/leetcode/tree/master/problems/campus-bikes) (Medium) + 1. [Campus Bikes](../campus-bikes) (Medium) ### Hints
diff --git a/problems/campus-bikes/README.md b/problems/campus-bikes/README.md index 8dd371be8..04a8de88c 100644 --- a/problems/campus-bikes/README.md +++ b/problems/campus-bikes/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/confusing-number "Confusing Number") +[< Previous](../confusing-number "Confusing Number") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimize-rounding-error-to-meet-target "Minimize Rounding Error to Meet Target") +[Next >](../minimize-rounding-error-to-meet-target "Minimize Rounding Error to Meet Target") ## [1057. Campus Bikes (Medium)](https://leetcode.com/problems/campus-bikes "校园自行车分配") @@ -54,11 +54,11 @@ Worker 0 grabs Bike 0 at first. Worker 1 and Worker 2 share the same distance to ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[Sort](../../tag/sort/README.md)] ### Similar Questions - 1. [Campus Bikes II](https://github.com/openset/leetcode/tree/master/problems/campus-bikes-ii) (Medium) + 1. [Campus Bikes II](../campus-bikes-ii) (Medium) ### Hints
diff --git a/problems/can-i-win/README.md b/problems/can-i-win/README.md index 2cd44020c..8a62abcae 100644 --- a/problems/can-i-win/README.md +++ b/problems/can-i-win/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/island-perimeter "Island Perimeter") +[< Previous](../island-perimeter "Island Perimeter") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/optimal-account-balancing "Optimal Account Balancing") +[Next >](../optimal-account-balancing "Optimal Account Balancing") ## [464. Can I Win (Medium)](https://leetcode.com/problems/can-i-win "我能赢吗") @@ -41,10 +41,10 @@ Same with other integers chosen by the first player, the second player will alwa

### Related Topics - [[Minimax](https://github.com/openset/leetcode/tree/master/tag/minimax/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Minimax](../../tag/minimax/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Flip Game II](https://github.com/openset/leetcode/tree/master/problems/flip-game-ii) (Medium) - 1. [Guess Number Higher or Lower II](https://github.com/openset/leetcode/tree/master/problems/guess-number-higher-or-lower-ii) (Medium) - 1. [Predict the Winner](https://github.com/openset/leetcode/tree/master/problems/predict-the-winner) (Medium) + 1. [Flip Game II](../flip-game-ii) (Medium) + 1. [Guess Number Higher or Lower II](../guess-number-higher-or-lower-ii) (Medium) + 1. [Predict the Winner](../predict-the-winner) (Medium) diff --git a/problems/can-make-palindrome-from-substring/README.md b/problems/can-make-palindrome-from-substring/README.md index 9103b7be1..d3949c81a 100644 --- a/problems/can-make-palindrome-from-substring/README.md +++ b/problems/can-make-palindrome-from-substring/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/diet-plan-performance "Diet Plan Performance") +[< Previous](../diet-plan-performance "Diet Plan Performance") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-valid-words-for-each-puzzle "Number of Valid Words for Each Puzzle") +[Next >](../number-of-valid-words-for-each-puzzle "Number of Valid Words for Each Puzzle") ## [1177. Can Make Palindrome from Substring (Medium)](https://leetcode.com/problems/can-make-palindrome-from-substring "构建回文串检测") @@ -46,8 +46,8 @@ queries[4] : substring = "abcda", could be changed to " ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Array](../../tag/array/README.md)] + [[String](../../tag/string/README.md)] ### Hints
diff --git a/problems/can-place-flowers/README.md b/problems/can-place-flowers/README.md index da20e1d21..18f55a282 100644 --- a/problems/can-place-flowers/README.md +++ b/problems/can-place-flowers/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/design-compressed-string-iterator "Design Compressed String Iterator") +[< Previous](../design-compressed-string-iterator "Design Compressed String Iterator") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/construct-string-from-binary-tree "Construct String from Binary Tree") +[Next >](../construct-string-from-binary-tree "Construct String from Binary Tree") ## [605. Can Place Flowers (Easy)](https://leetcode.com/problems/can-place-flowers "种花问题") @@ -38,8 +38,8 @@

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Teemo Attacking](https://github.com/openset/leetcode/tree/master/problems/teemo-attacking) (Medium) - 1. [Asteroid Collision](https://github.com/openset/leetcode/tree/master/problems/asteroid-collision) (Medium) + 1. [Teemo Attacking](../teemo-attacking) (Medium) + 1. [Asteroid Collision](../asteroid-collision) (Medium) diff --git a/problems/candy-crush/README.md b/problems/candy-crush/README.md index ab4ed5f32..c5f04453d 100644 --- a/problems/candy-crush/README.md +++ b/problems/candy-crush/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/remove-comments "Remove Comments") +[< Previous](../remove-comments "Remove Comments") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-pivot-index "Find Pivot Index") +[Next >](../find-pivot-index "Find Pivot Index") ## [723. Candy Crush (Medium)](https://leetcode.com/problems/candy-crush "粉碎糖果") @@ -51,8 +51,8 @@ board = ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Array](../../tag/array/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] ### Hints
diff --git a/problems/candy/README.md b/problems/candy/README.md index 03119f865..4254bd489 100644 --- a/problems/candy/README.md +++ b/problems/candy/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/gas-station "Gas Station") +[< Previous](../gas-station "Gas Station") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/single-number "Single Number") +[Next >](../single-number "Single Number") ## [135. Candy (Hard)](https://leetcode.com/problems/candy "分发糖果") @@ -40,4 +40,4 @@ ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] + [[Greedy](../../tag/greedy/README.md)] diff --git a/problems/capacity-to-ship-packages-within-d-days/README.md b/problems/capacity-to-ship-packages-within-d-days/README.md index 725416682..82f7876f5 100644 --- a/problems/capacity-to-ship-packages-within-d-days/README.md +++ b/problems/capacity-to-ship-packages-within-d-days/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/pairs-of-songs-with-total-durations-divisible-by-60 "Pairs of Songs With Total Durations Divisible by 60") +[< Previous](../pairs-of-songs-with-total-durations-divisible-by-60 "Pairs of Songs With Total Durations Divisible by 60") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/numbers-with-repeated-digits "Numbers With Repeated Digits") +[Next >](../numbers-with-repeated-digits "Numbers With Repeated Digits") ## [1011. Capacity To Ship Packages Within D Days (Medium)](https://leetcode.com/problems/capacity-to-ship-packages-within-d-days "在 D 天内送达包裹的能力") @@ -69,8 +69,8 @@ A ship capacity of 6 is the minimum to ship all the packages in 3 days like this ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Array](../../tag/array/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Hints
diff --git a/problems/car-fleet/README.md b/problems/car-fleet/README.md index c6d0d419a..e507d9452 100644 --- a/problems/car-fleet/README.md +++ b/problems/car-fleet/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/peak-index-in-a-mountain-array "Peak Index in a Mountain Array") +[< Previous](../peak-index-in-a-mountain-array "Peak Index in a Mountain Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/k-similar-strings "K-Similar Strings") +[Next >](../k-similar-strings "K-Similar Strings") ## [853. Car Fleet (Medium)](https://leetcode.com/problems/car-fleet "车队") @@ -52,4 +52,4 @@ Note that no other cars meet these fleets before the destination, so the answer ### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] + [[Sort](../../tag/sort/README.md)] diff --git a/problems/car-pooling/README.md b/problems/car-pooling/README.md index 3f5a4b143..c7788244d 100644 --- a/problems/car-pooling/README.md +++ b/problems/car-pooling/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/statistics-from-a-large-sample "Statistics from a Large Sample") +[< Previous](../statistics-from-a-large-sample "Statistics from a Large Sample") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-in-mountain-array "Find in Mountain Array") +[Next >](../find-in-mountain-array "Find in Mountain Array") ## [1094. Car Pooling (Medium)](https://leetcode.com/problems/car-pooling "拼车") @@ -73,10 +73,10 @@ ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] + [[Greedy](../../tag/greedy/README.md)] ### Similar Questions - 1. [Meeting Rooms II](https://github.com/openset/leetcode/tree/master/problems/meeting-rooms-ii) (Medium) + 1. [Meeting Rooms II](../meeting-rooms-ii) (Medium) ### Hints
diff --git a/problems/card-flipping-game/README.md b/problems/card-flipping-game/README.md index 004e49ed4..ab4b3a66b 100644 --- a/problems/card-flipping-game/README.md +++ b/problems/card-flipping-game/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-to-a-character "Shortest Distance to a Character") +[< Previous](../shortest-distance-to-a-character "Shortest Distance to a Character") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/binary-trees-with-factors "Binary Trees With Factors") +[Next >](../binary-trees-with-factors "Binary Trees With Factors") ## [822. Card Flipping Game (Medium)](https://leetcode.com/problems/card-flipping-game "翻转卡片游戏") diff --git a/problems/cat-and-mouse/README.md b/problems/cat-and-mouse/README.md index f15258105..51ad3256e 100644 --- a/problems/cat-and-mouse/README.md +++ b/problems/cat-and-mouse/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/sort-an-array "Sort an Array") +[< Previous](../sort-an-array "Sort an Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/x-of-a-kind-in-a-deck-of-cards "X of a Kind in a Deck of Cards") +[Next >](../x-of-a-kind-in-a-deck-of-cards "X of a Kind in a Deck of Cards") ## [913. Cat and Mouse (Hard)](https://leetcode.com/problems/cat-and-mouse "猫和老鼠") @@ -62,5 +62,5 @@ ### Related Topics - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] - [[Minimax](https://github.com/openset/leetcode/tree/master/tag/minimax/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] + [[Minimax](../../tag/minimax/README.md)] diff --git a/problems/cells-with-odd-values-in-a-matrix/README.md b/problems/cells-with-odd-values-in-a-matrix/README.md index c64a42f33..6c2beb96f 100644 --- a/problems/cells-with-odd-values-in-a-matrix/README.md +++ b/problems/cells-with-odd-values-in-a-matrix/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/average-selling-price "Average Selling Price") +[< Previous](../average-selling-price "Average Selling Price") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/reconstruct-a-2-row-binary-matrix "Reconstruct a 2-Row Binary Matrix") +[Next >](../reconstruct-a-2-row-binary-matrix "Reconstruct a 2-Row Binary Matrix") ## [1252. Cells with Odd Values in a Matrix (Easy)](https://leetcode.com/problems/cells-with-odd-values-in-a-matrix "奇数值单元格的数目") @@ -46,7 +46,7 @@ The final matrix will be [[1,3,1],[1,3,1]] which contains 6 odd numbers. ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Hints
diff --git a/problems/chalkboard-xor-game/README.md b/problems/chalkboard-xor-game/README.md index 446f0f6db..26d614dcb 100644 --- a/problems/chalkboard-xor-game/README.md +++ b/problems/chalkboard-xor-game/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/expressive-words "Expressive Words") +[< Previous](../expressive-words "Expressive Words") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/subdomain-visit-count "Subdomain Visit Count") +[Next >](../subdomain-visit-count "Subdomain Visit Count") ## [810. Chalkboard XOR Game (Hard)](https://leetcode.com/problems/chalkboard-xor-game "黑板异或游戏") @@ -38,4 +38,4 @@ If Alice erases 2 first, now nums becomes [1, 1]. The bitwise XOR of all the ele

 

### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/champagne-tower/README.md b/problems/champagne-tower/README.md index 33a68170e..005487ba5 100644 --- a/problems/champagne-tower/README.md +++ b/problems/champagne-tower/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/smallest-rotation-with-highest-score "Smallest Rotation with Highest Score") +[< Previous](../smallest-rotation-with-highest-score "Smallest Rotation with Highest Score") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/similar-rgb-color "Similar RGB Color") +[Next >](../similar-rgb-color "Similar RGB Color") ## [799. Champagne Tower (Medium)](https://leetcode.com/problems/champagne-tower "香槟塔") diff --git a/problems/cheapest-flights-within-k-stops/README.md b/problems/cheapest-flights-within-k-stops/README.md index 557ccb4bc..cba708f69 100644 --- a/problems/cheapest-flights-within-k-stops/README.md +++ b/problems/cheapest-flights-within-k-stops/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/k-th-smallest-prime-fraction "K-th Smallest Prime Fraction") +[< Previous](../k-th-smallest-prime-fraction "K-th Smallest Prime Fraction") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/rotated-digits "Rotated Digits") +[Next >](../rotated-digits "Rotated Digits") ## [787. Cheapest Flights Within K Stops (Medium)](https://leetcode.com/problems/cheapest-flights-within-k-stops "K 站中转内最便宜的航班") @@ -51,9 +51,9 @@ The cheapest price from city 0 to city 2 with at most ### Related Topics - [[Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Heap](../../tag/heap/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Maximum Vacation Days](https://github.com/openset/leetcode/tree/master/problems/maximum-vacation-days) (Hard) + 1. [Maximum Vacation Days](../maximum-vacation-days) (Hard) diff --git a/problems/check-completeness-of-a-binary-tree/README.md b/problems/check-completeness-of-a-binary-tree/README.md index 7571bfc11..1640ba56e 100644 --- a/problems/check-completeness-of-a-binary-tree/README.md +++ b/problems/check-completeness-of-a-binary-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/prison-cells-after-n-days "Prison Cells After N Days") +[< Previous](../prison-cells-after-n-days "Prison Cells After N Days") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/regions-cut-by-slashes "Regions Cut By Slashes") +[Next >](../regions-cut-by-slashes "Regions Cut By Slashes") ## [958. Check Completeness of a Binary Tree (Medium)](https://leetcode.com/problems/check-completeness-of-a-binary-tree "二叉树的完全性检验") @@ -49,4 +49,4 @@ In a complete binary tree every level, except possibly the last, is completely f ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] diff --git a/problems/check-if-a-number-is-majority-element-in-a-sorted-array/README.md b/problems/check-if-a-number-is-majority-element-in-a-sorted-array/README.md index 91e27e31f..ca9cb277e 100644 --- a/problems/check-if-a-number-is-majority-element-in-a-sorted-array/README.md +++ b/problems/check-if-a-number-is-majority-element-in-a-sorted-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/article-views-ii "Article Views II") +[< Previous](../article-views-ii "Article Views II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-swaps-to-group-all-1s-together "Minimum Swaps to Group All 1's Together") +[Next >](../minimum-swaps-to-group-all-1s-together "Minimum Swaps to Group All 1's Together") ## [1150. Check If a Number Is Majority Element in a Sorted Array (Easy)](https://leetcode.com/problems/check-if-a-number-is-majority-element-in-a-sorted-array "检查一个数是否在数组中占绝大多数") @@ -48,12 +48,12 @@ Thus, 101 is not a majority element because 2 > 4/2 is false. ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Array](../../tag/array/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [Majority Element](https://github.com/openset/leetcode/tree/master/problems/majority-element) (Easy) - 1. [Majority Element II](https://github.com/openset/leetcode/tree/master/problems/majority-element-ii) (Medium) + 1. [Majority Element](../majority-element) (Easy) + 1. [Majority Element II](../majority-element-ii) (Medium) ### Hints
diff --git a/problems/check-if-it-is-a-good-array/README.md b/problems/check-if-it-is-a-good-array/README.md index fab812915..862b5b1c0 100644 --- a/problems/check-if-it-is-a-good-array/README.md +++ b/problems/check-if-it-is-a-good-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-remove-to-make-valid-parentheses "Minimum Remove to Make Valid Parentheses") +[< Previous](../minimum-remove-to-make-valid-parentheses "Minimum Remove to Make Valid Parentheses") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/average-selling-price "Average Selling Price") +[Next >](../average-selling-price "Average Selling Price") ## [1250. Check If It Is a Good Array (Hard)](https://leetcode.com/problems/check-if-it-is-a-good-array "检查「好数组」") @@ -50,7 +50,7 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Hints
diff --git a/problems/check-if-it-is-a-straight-line/README.md b/problems/check-if-it-is-a-straight-line/README.md index f1a384a10..f56c7a5e8 100644 --- a/problems/check-if-it-is-a-straight-line/README.md +++ b/problems/check-if-it-is-a-straight-line/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/divide-chocolate "Divide Chocolate") +[< Previous](../divide-chocolate "Divide Chocolate") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/remove-sub-folders-from-the-filesystem "Remove Sub-Folders from the Filesystem") +[Next >](../remove-sub-folders-from-the-filesystem "Remove Sub-Folders from the Filesystem") ## [1232. Check If It Is a Straight Line (Easy)](https://leetcode.com/problems/check-if-it-is-a-straight-line "缀点成线") @@ -45,9 +45,9 @@ ### Related Topics - [[Geometry](https://github.com/openset/leetcode/tree/master/tag/geometry/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Geometry](../../tag/geometry/README.md)] + [[Array](../../tag/array/README.md)] + [[Math](../../tag/math/README.md)] ### Hints
diff --git a/problems/check-if-word-is-valid-after-substitutions/README.md b/problems/check-if-word-is-valid-after-substitutions/README.md index a15f0994a..c52d7b9f1 100644 --- a/problems/check-if-word-is-valid-after-substitutions/README.md +++ b/problems/check-if-word-is-valid-after-substitutions/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-common-characters "Find Common Characters") +[< Previous](../find-common-characters "Find Common Characters") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones-iii "Max Consecutive Ones III") +[Next >](../max-consecutive-ones-iii "Max Consecutive Ones III") ## [1003. Check If Word Is Valid After Substitutions (Medium)](https://leetcode.com/problems/check-if-word-is-valid-after-substitutions "检查替换后的词是否有效") @@ -78,8 +78,8 @@ Then we can insert "abc" before the last letter, resulting in "ab ### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Stack](../../tag/stack/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Valid Parentheses](https://github.com/openset/leetcode/tree/master/problems/valid-parentheses) (Easy) + 1. [Valid Parentheses](../valid-parentheses) (Easy) diff --git a/problems/cherry-pickup/README.md b/problems/cherry-pickup/README.md index dc3c1ce97..d78c181cc 100644 --- a/problems/cherry-pickup/README.md +++ b/problems/cherry-pickup/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/delete-and-earn "Delete and Earn") +[< Previous](../delete-and-earn "Delete and Earn") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/closest-leaf-in-a-binary-tree "Closest Leaf in a Binary Tree") +[Next >](../closest-leaf-in-a-binary-tree "Closest Leaf in a Binary Tree") ## [741. Cherry Pickup (Hard)](https://leetcode.com/problems/cherry-pickup "摘樱桃") @@ -67,8 +67,8 @@ The total number of cherries picked up is 5, and this is the maximum possible. ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Minimum Path Sum](https://github.com/openset/leetcode/tree/master/problems/minimum-path-sum) (Medium) - 1. [Dungeon Game](https://github.com/openset/leetcode/tree/master/problems/dungeon-game) (Hard) + 1. [Minimum Path Sum](../minimum-path-sum) (Medium) + 1. [Dungeon Game](../dungeon-game) (Hard) diff --git a/problems/circular-array-loop/README.md b/problems/circular-array-loop/README.md index fdc034725..64aa6188a 100644 --- a/problems/circular-array-loop/README.md +++ b/problems/circular-array-loop/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/132-pattern "132 Pattern") +[< Previous](../132-pattern "132 Pattern") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/poor-pigs "Poor Pigs") +[Next >](../poor-pigs "Poor Pigs") ## [457. Circular Array Loop (Medium)](https://leetcode.com/problems/circular-array-loop "环形数组循环") @@ -57,5 +57,5 @@

Could you solve it in O(n) time complexity and O(1) extra space complexity?

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Array](../../tag/array/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] diff --git a/problems/circular-permutation-in-binary-representation/README.md b/problems/circular-permutation-in-binary-representation/README.md index 69ea0a51d..db853bdb9 100644 --- a/problems/circular-permutation-in-binary-representation/README.md +++ b/problems/circular-permutation-in-binary-representation/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-positive-integer-solution-for-a-given-equation "Find Positive Integer Solution for a Given Equation") +[< Previous](../find-positive-integer-solution-for-a-given-equation "Find Positive Integer Solution for a Given Equation") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-length-of-a-concatenated-string-with-unique-characters "Maximum Length of a Concatenated String with Unique Characters") +[Next >](../maximum-length-of-a-concatenated-string-with-unique-characters "Maximum Length of a Concatenated String with Unique Characters") ## [1238. Circular Permutation in Binary Representation (Medium)](https://leetcode.com/problems/circular-permutation-in-binary-representation "循环码排列") @@ -46,7 +46,7 @@ All the adjacent element differ by one bit. Another valid permutation is [3,1,0, ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Hints
diff --git a/problems/classes-more-than-5-students/README.md b/problems/classes-more-than-5-students/README.md index 9988db34b..caf9e3dd3 100644 --- a/problems/classes-more-than-5-students/README.md +++ b/problems/classes-more-than-5-students/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/big-countries "Big Countries") +[< Previous](../big-countries "Big Countries") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/friend-requests-i-overall-acceptance-rate "Friend Requests I: Overall Acceptance Rate") +[Next >](../friend-requests-i-overall-acceptance-rate "Friend Requests I: Overall Acceptance Rate") ## [596. Classes More Than 5 Students (Easy)](https://leetcode.com/problems/classes-more-than-5-students "超过5名学生的课") diff --git a/problems/climbing-stairs/README.md b/problems/climbing-stairs/README.md index cac4c346b..d75cf3aa3 100644 --- a/problems/climbing-stairs/README.md +++ b/problems/climbing-stairs/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/sqrtx "Sqrt(x)") +[< Previous](../sqrtx "Sqrt(x)") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/simplify-path "Simplify Path") +[Next >](../simplify-path "Simplify Path") ## [70. Climbing Stairs (Easy)](https://leetcode.com/problems/climbing-stairs "爬楼梯") @@ -39,12 +39,12 @@ ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Min Cost Climbing Stairs](https://github.com/openset/leetcode/tree/master/problems/min-cost-climbing-stairs) (Easy) - 1. [Fibonacci Number](https://github.com/openset/leetcode/tree/master/problems/fibonacci-number) (Easy) - 1. [N-th Tribonacci Number](https://github.com/openset/leetcode/tree/master/problems/n-th-tribonacci-number) (Easy) + 1. [Min Cost Climbing Stairs](../min-cost-climbing-stairs) (Easy) + 1. [Fibonacci Number](../fibonacci-number) (Easy) + 1. [N-th Tribonacci Number](../n-th-tribonacci-number) (Easy) ### Hints
diff --git a/problems/clone-graph/README.md b/problems/clone-graph/README.md index 3a6b39079..83ddbe13a 100644 --- a/problems/clone-graph/README.md +++ b/problems/clone-graph/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/palindrome-partitioning-ii "Palindrome Partitioning II") +[< Previous](../palindrome-partitioning-ii "Palindrome Partitioning II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/gas-station "Gas Station") +[Next >](../gas-station "Gas Station") ## [133. Clone Graph (Medium)](https://leetcode.com/problems/clone-graph "克隆图") @@ -42,9 +42,9 @@ Node 4's value is 4, and it has two neighbors: Node 1 and 3. ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] + [[Graph](../../tag/graph/README.md)] ### Similar Questions - 1. [Copy List with Random Pointer](https://github.com/openset/leetcode/tree/master/problems/copy-list-with-random-pointer) (Medium) + 1. [Copy List with Random Pointer](../copy-list-with-random-pointer) (Medium) diff --git a/problems/closest-binary-search-tree-value-ii/README.md b/problems/closest-binary-search-tree-value-ii/README.md index 0262b09a4..b7fc0e007 100644 --- a/problems/closest-binary-search-tree-value-ii/README.md +++ b/problems/closest-binary-search-tree-value-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/encode-and-decode-strings "Encode and Decode Strings") +[< Previous](../encode-and-decode-strings "Encode and Decode Strings") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/integer-to-english-words "Integer to English Words") +[Next >](../integer-to-english-words "Integer to English Words") ## [272. Closest Binary Search Tree Value II (Hard)](https://leetcode.com/problems/closest-binary-search-tree-value-ii "最接近的二叉搜索树值 II") @@ -38,12 +38,12 @@ Assume that the BST is balanced, could you solve it in less than O(n) runtime (where n = total nodes)?

### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Stack](../../tag/stack/README.md)] + [[Tree](../../tag/tree/README.md)] ### Similar Questions - 1. [Binary Tree Inorder Traversal](https://github.com/openset/leetcode/tree/master/problems/binary-tree-inorder-traversal) (Medium) - 1. [Closest Binary Search Tree Value](https://github.com/openset/leetcode/tree/master/problems/closest-binary-search-tree-value) (Easy) + 1. [Binary Tree Inorder Traversal](../binary-tree-inorder-traversal) (Medium) + 1. [Closest Binary Search Tree Value](../closest-binary-search-tree-value) (Easy) ### Hints
diff --git a/problems/closest-binary-search-tree-value/README.md b/problems/closest-binary-search-tree-value/README.md index 41f7790a7..8351a1bbd 100644 --- a/problems/closest-binary-search-tree-value/README.md +++ b/problems/closest-binary-search-tree-value/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/alien-dictionary "Alien Dictionary") +[< Previous](../alien-dictionary "Alien Dictionary") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/encode-and-decode-strings "Encode and Decode Strings") +[Next >](../encode-and-decode-strings "Encode and Decode Strings") ## [270. Closest Binary Search Tree Value (Easy)](https://leetcode.com/problems/closest-binary-search-tree-value "最接近的二叉搜索树值") @@ -35,10 +35,10 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [Count Complete Tree Nodes](https://github.com/openset/leetcode/tree/master/problems/count-complete-tree-nodes) (Medium) - 1. [Closest Binary Search Tree Value II](https://github.com/openset/leetcode/tree/master/problems/closest-binary-search-tree-value-ii) (Hard) - 1. [Search in a Binary Search Tree](https://github.com/openset/leetcode/tree/master/problems/search-in-a-binary-search-tree) (Easy) + 1. [Count Complete Tree Nodes](../count-complete-tree-nodes) (Medium) + 1. [Closest Binary Search Tree Value II](../closest-binary-search-tree-value-ii) (Hard) + 1. [Search in a Binary Search Tree](../search-in-a-binary-search-tree) (Easy) diff --git a/problems/closest-leaf-in-a-binary-tree/README.md b/problems/closest-leaf-in-a-binary-tree/README.md index 234f6afd4..ae9ad07e2 100644 --- a/problems/closest-leaf-in-a-binary-tree/README.md +++ b/problems/closest-leaf-in-a-binary-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/cherry-pickup "Cherry Pickup") +[< Previous](../cherry-pickup "Cherry Pickup") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/network-delay-time "Network Delay Time") +[Next >](../network-delay-time "Network Delay Time") ## [742. Closest Leaf in a Binary Tree (Medium)](https://leetcode.com/problems/closest-leaf-in-a-binary-tree "二叉树最近的叶节点") @@ -72,7 +72,7 @@ Diagram of binary tree:

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] ### Hints
diff --git a/problems/clumsy-factorial/README.md b/problems/clumsy-factorial/README.md index 269eef531..dcd08ce1b 100644 --- a/problems/clumsy-factorial/README.md +++ b/problems/clumsy-factorial/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximize-sum-of-array-after-k-negations "Maximize Sum Of Array After K Negations") +[< Previous](../maximize-sum-of-array-after-k-negations "Maximize Sum Of Array After K Negations") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-domino-rotations-for-equal-row "Minimum Domino Rotations For Equal Row") +[Next >](../minimum-domino-rotations-for-equal-row "Minimum Domino Rotations For Equal Row") ## [1006. Clumsy Factorial (Medium)](https://leetcode.com/problems/clumsy-factorial "笨阶乘") @@ -49,4 +49,4 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/coin-change-2/README.md b/problems/coin-change-2/README.md index 66a73d957..8ab989868 100644 --- a/problems/coin-change-2/README.md +++ b/problems/coin-change-2/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/super-washing-machines "Super Washing Machines") +[< Previous](../super-washing-machines "Super Washing Machines") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/random-flip-matrix "Random Flip Matrix") +[Next >](../random-flip-matrix "Random Flip Matrix") ## [518. Coin Change 2 (Medium)](https://leetcode.com/problems/coin-change-2 "零钱兑换 II") diff --git a/problems/coin-change/README.md b/problems/coin-change/README.md index 080a65096..813ce28ba 100644 --- a/problems/coin-change/README.md +++ b/problems/coin-change/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/create-maximum-number "Create Maximum Number") +[< Previous](../create-maximum-number "Create Maximum Number") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-connected-components-in-an-undirected-graph "Number of Connected Components in an Undirected Graph") +[Next >](../number-of-connected-components-in-an-undirected-graph "Number of Connected Components in an Undirected Graph") ## [322. Coin Change (Medium)](https://leetcode.com/problems/coin-change "零钱兑换") @@ -31,7 +31,7 @@ You may assume that you have an infinite number of each kind of coin.

### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Minimum Cost For Tickets](https://github.com/openset/leetcode/tree/master/problems/minimum-cost-for-tickets) (Medium) + 1. [Minimum Cost For Tickets](../minimum-cost-for-tickets) (Medium) diff --git a/problems/coin-path/README.md b/problems/coin-path/README.md index d4412128b..d230d792b 100644 --- a/problems/coin-path/README.md +++ b/problems/coin-path/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/print-binary-tree "Print Binary Tree") +[< Previous](../print-binary-tree "Print Binary Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/robot-return-to-origin "Robot Return to Origin") +[Next >](../robot-return-to-origin "Robot Return to Origin") ## [656. Coin Path (Hard)](https://leetcode.com/problems/coin-path "金币路径") @@ -49,8 +49,8 @@

 

### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [House Robber](https://github.com/openset/leetcode/tree/master/problems/house-robber) (Easy) - 1. [House Robber II](https://github.com/openset/leetcode/tree/master/problems/house-robber-ii) (Medium) + 1. [House Robber](../house-robber) (Easy) + 1. [House Robber II](../house-robber-ii) (Medium) diff --git a/problems/coloring-a-border/README.md b/problems/coloring-a-border/README.md index b8d34c5df..21f04e19a 100644 --- a/problems/coloring-a-border/README.md +++ b/problems/coloring-a-border/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/moving-stones-until-consecutive "Moving Stones Until Consecutive") +[< Previous](../moving-stones-until-consecutive "Moving Stones Until Consecutive") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/uncrossed-lines "Uncrossed Lines") +[Next >](../uncrossed-lines "Uncrossed Lines") ## [1034. Coloring A Border (Medium)](https://leetcode.com/problems/coloring-a-border "边框着色") @@ -59,10 +59,10 @@ ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] ### Similar Questions - 1. [Island Perimeter](https://github.com/openset/leetcode/tree/master/problems/island-perimeter) (Easy) + 1. [Island Perimeter](../island-perimeter) (Easy) ### Hints
diff --git a/problems/combination-sum-ii/README.md b/problems/combination-sum-ii/README.md index d1bce0f92..765af270b 100644 --- a/problems/combination-sum-ii/README.md +++ b/problems/combination-sum-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/combination-sum "Combination Sum") +[< Previous](../combination-sum "Combination Sum") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/first-missing-positive "First Missing Positive") +[Next >](../first-missing-positive "First Missing Positive") ## [40. Combination Sum II (Medium)](https://leetcode.com/problems/combination-sum-ii "组合总和 II") @@ -47,8 +47,8 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Array](../../tag/array/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Combination Sum](https://github.com/openset/leetcode/tree/master/problems/combination-sum) (Medium) + 1. [Combination Sum](../combination-sum) (Medium) diff --git a/problems/combination-sum-iii/README.md b/problems/combination-sum-iii/README.md index 6c010289a..806610e75 100644 --- a/problems/combination-sum-iii/README.md +++ b/problems/combination-sum-iii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/kth-largest-element-in-an-array "Kth Largest Element in an Array") +[< Previous](../kth-largest-element-in-an-array "Kth Largest Element in an Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate "Contains Duplicate") +[Next >](../contains-duplicate "Contains Duplicate") ## [216. Combination Sum III (Medium)](https://leetcode.com/problems/combination-sum-iii "组合总和 III") @@ -37,8 +37,8 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Array](../../tag/array/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Combination Sum](https://github.com/openset/leetcode/tree/master/problems/combination-sum) (Medium) + 1. [Combination Sum](../combination-sum) (Medium) diff --git a/problems/combination-sum-iv/README.md b/problems/combination-sum-iv/README.md index d0b6efb6f..5b6a981df 100644 --- a/problems/combination-sum-iv/README.md +++ b/problems/combination-sum-iv/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/wiggle-subsequence "Wiggle Subsequence") +[< Previous](../wiggle-subsequence "Wiggle Subsequence") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-element-in-a-sorted-matrix "Kth Smallest Element in a Sorted Matrix") +[Next >](../kth-smallest-element-in-a-sorted-matrix "Kth Smallest Element in a Sorted Matrix") ## [377. Combination Sum IV (Medium)](https://leetcode.com/problems/combination-sum-iv "组合总和 Ⅳ") @@ -44,7 +44,7 @@ What limitation we need to add to the question to allow negative numbers?

Special thanks to @pbrother for adding this problem and creating all test cases.

### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Combination Sum](https://github.com/openset/leetcode/tree/master/problems/combination-sum) (Medium) + 1. [Combination Sum](../combination-sum) (Medium) diff --git a/problems/combination-sum/README.md b/problems/combination-sum/README.md index 18cff6162..3e9c9ac70 100644 --- a/problems/combination-sum/README.md +++ b/problems/combination-sum/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/count-and-say "Count and Say") +[< Previous](../count-and-say "Count and Say") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/combination-sum-ii "Combination Sum II") +[Next >](../combination-sum-ii "Combination Sum II") ## [39. Combination Sum (Medium)](https://leetcode.com/problems/combination-sum "组合总和") @@ -46,13 +46,13 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Array](../../tag/array/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Letter Combinations of a Phone Number](https://github.com/openset/leetcode/tree/master/problems/letter-combinations-of-a-phone-number) (Medium) - 1. [Combination Sum II](https://github.com/openset/leetcode/tree/master/problems/combination-sum-ii) (Medium) - 1. [Combinations](https://github.com/openset/leetcode/tree/master/problems/combinations) (Medium) - 1. [Combination Sum III](https://github.com/openset/leetcode/tree/master/problems/combination-sum-iii) (Medium) - 1. [Factor Combinations](https://github.com/openset/leetcode/tree/master/problems/factor-combinations) (Medium) - 1. [Combination Sum IV](https://github.com/openset/leetcode/tree/master/problems/combination-sum-iv) (Medium) + 1. [Letter Combinations of a Phone Number](../letter-combinations-of-a-phone-number) (Medium) + 1. [Combination Sum II](../combination-sum-ii) (Medium) + 1. [Combinations](../combinations) (Medium) + 1. [Combination Sum III](../combination-sum-iii) (Medium) + 1. [Factor Combinations](../factor-combinations) (Medium) + 1. [Combination Sum IV](../combination-sum-iv) (Medium) diff --git a/problems/combinations/README.md b/problems/combinations/README.md index 66f22628c..196e8c701 100644 --- a/problems/combinations/README.md +++ b/problems/combinations/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-window-substring "Minimum Window Substring") +[< Previous](../minimum-window-substring "Minimum Window Substring") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/subsets "Subsets") +[Next >](../subsets "Subsets") ## [77. Combinations (Medium)](https://leetcode.com/problems/combinations "组合") @@ -29,8 +29,8 @@ ### Related Topics - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Combination Sum](https://github.com/openset/leetcode/tree/master/problems/combination-sum) (Medium) - 1. [Permutations](https://github.com/openset/leetcode/tree/master/problems/permutations) (Medium) + 1. [Combination Sum](../combination-sum) (Medium) + 1. [Permutations](../permutations) (Medium) diff --git a/problems/combine-two-tables/README.md b/problems/combine-two-tables/README.md index 45ff44fa0..c86061faa 100644 --- a/problems/combine-two-tables/README.md +++ b/problems/combine-two-tables/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/dungeon-game "Dungeon Game") +[< Previous](../dungeon-game "Dungeon Game") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/second-highest-salary "Second Highest Salary") +[Next >](../second-highest-salary "Second Highest Salary") ## [175. Combine Two Tables (Easy)](https://leetcode.com/problems/combine-two-tables "组合两个表") @@ -47,4 +47,4 @@ FirstName, LastName, City, State ### Similar Questions - 1. [Employee Bonus](https://github.com/openset/leetcode/tree/master/problems/employee-bonus) (Easy) + 1. [Employee Bonus](../employee-bonus) (Easy) diff --git a/problems/compare-strings-by-frequency-of-the-smallest-character/README.md b/problems/compare-strings-by-frequency-of-the-smallest-character/README.md index f964282e5..c17b913ac 100644 --- a/problems/compare-strings-by-frequency-of-the-smallest-character/README.md +++ b/problems/compare-strings-by-frequency-of-the-smallest-character/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/invalid-transactions "Invalid Transactions") +[< Previous](../invalid-transactions "Invalid Transactions") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/remove-zero-sum-consecutive-nodes-from-linked-list "Remove Zero Sum Consecutive Nodes from Linked List") +[Next >](../remove-zero-sum-consecutive-nodes-from-linked-list "Remove Zero Sum Consecutive Nodes from Linked List") ## [1170. Compare Strings by Frequency of the Smallest Character (Easy)](https://leetcode.com/problems/compare-strings-by-frequency-of-the-smallest-character "比较字符串最小字母出现频次") @@ -43,8 +43,8 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Array](../../tag/array/README.md)] + [[String](../../tag/string/README.md)] ### Hints
diff --git a/problems/compare-version-numbers/README.md b/problems/compare-version-numbers/README.md index 178af1b2c..b1fe1be1b 100644 --- a/problems/compare-version-numbers/README.md +++ b/problems/compare-version-numbers/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-gap "Maximum Gap") +[< Previous](../maximum-gap "Maximum Gap") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/fraction-to-recurring-decimal "Fraction to Recurring Decimal") +[Next >](../fraction-to-recurring-decimal "Fraction to Recurring Decimal") ## [165. Compare Version Numbers (Medium)](https://leetcode.com/problems/compare-version-numbers "比较版本号") @@ -57,4 +57,4 @@ If version1 > version2 return 1;& ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/complement-of-base-10-integer/README.md b/problems/complement-of-base-10-integer/README.md index b40f124c2..97dfeceb3 100644 --- a/problems/complement-of-base-10-integer/README.md +++ b/problems/complement-of-base-10-integer/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/construct-binary-search-tree-from-preorder-traversal "Construct Binary Search Tree from Preorder Traversal") +[< Previous](../construct-binary-search-tree-from-preorder-traversal "Construct Binary Search Tree from Preorder Traversal") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/pairs-of-songs-with-total-durations-divisible-by-60 "Pairs of Songs With Total Durations Divisible by 60") +[Next >](../pairs-of-songs-with-total-durations-divisible-by-60 "Pairs of Songs With Total Durations Divisible by 60") ## [1009. Complement of Base 10 Integer (Easy)](https://leetcode.com/problems/complement-of-base-10-integer "十进制整数的反码") @@ -61,7 +61,7 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Hints
diff --git a/problems/complete-binary-tree-inserter/README.md b/problems/complete-binary-tree-inserter/README.md index 4b4dbea2c..3b690771a 100644 --- a/problems/complete-binary-tree-inserter/README.md +++ b/problems/complete-binary-tree-inserter/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-sum-circular-subarray "Maximum Sum Circular Subarray") +[< Previous](../maximum-sum-circular-subarray "Maximum Sum Circular Subarray") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-music-playlists "Number of Music Playlists") +[Next >](../number-of-music-playlists "Number of Music Playlists") ## [919. Complete Binary Tree Inserter (Medium)](https://leetcode.com/problems/complete-binary-tree-inserter "完全二叉树插入器") @@ -62,4 +62,4 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] diff --git a/problems/complex-number-multiplication/README.md b/problems/complex-number-multiplication/README.md index 02543cc9f..327b453c3 100644 --- a/problems/complex-number-multiplication/README.md +++ b/problems/complex-number-multiplication/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-string "Construct Binary Tree from String") +[< Previous](../construct-binary-tree-from-string "Construct Binary Tree from String") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/convert-bst-to-greater-tree "Convert BST to Greater Tree") +[Next >](../convert-bst-to-greater-tree "Convert BST to Greater Tree") ## [537. Complex Number Multiplication (Medium)](https://leetcode.com/problems/complex-number-multiplication "复数乘法") @@ -42,5 +42,5 @@ You need to return a string representing their multiplication. Note i2 ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Math](../../tag/math/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/concatenated-words/README.md b/problems/concatenated-words/README.md index c00ec694d..bb66dc160 100644 --- a/problems/concatenated-words/README.md +++ b/problems/concatenated-words/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/encode-string-with-shortest-length "Encode String with Shortest Length") +[< Previous](../encode-string-with-shortest-length "Encode String with Shortest Length") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/matchsticks-to-square "Matchsticks to Square") +[Next >](../matchsticks-to-square "Matchsticks to Square") ## [472. Concatenated Words (Hard)](https://leetcode.com/problems/concatenated-words "连接词") @@ -34,9 +34,9 @@ Given a list of words (without duplicates), please write a program that r

### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Trie](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Trie](../../tag/trie/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Word Break II](https://github.com/openset/leetcode/tree/master/problems/word-break-ii) (Hard) + 1. [Word Break II](../word-break-ii) (Hard) diff --git a/problems/confusing-number-ii/README.md b/problems/confusing-number-ii/README.md index d2a3b2093..22064adde 100644 --- a/problems/confusing-number-ii/README.md +++ b/problems/confusing-number-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/brace-expansion "Brace Expansion") +[< Previous](../brace-expansion "Brace Expansion") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/duplicate-zeros "Duplicate Zeros") +[Next >](../duplicate-zeros "Duplicate Zeros") ## [1088. Confusing Number II (Hard)](https://leetcode.com/problems/confusing-number-ii "易混淆数 II") @@ -52,11 +52,11 @@ The confusing numbers are [6,9,10,16,18,19,60,61,66,68,80,81,86,89,90,91,98,99,1 ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Math](../../tag/math/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Confusing Number](https://github.com/openset/leetcode/tree/master/problems/confusing-number) (Easy) + 1. [Confusing Number](../confusing-number) (Easy) ### Hints
diff --git a/problems/confusing-number/README.md b/problems/confusing-number/README.md index 3619109cd..63070cfc9 100644 --- a/problems/confusing-number/README.md +++ b/problems/confusing-number/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/shortest-way-to-form-string "Shortest Way to Form String") +[< Previous](../shortest-way-to-form-string "Shortest Way to Form String") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/campus-bikes "Campus Bikes") +[Next >](../campus-bikes "Campus Bikes") ## [1056. Confusing Number (Easy)](https://leetcode.com/problems/confusing-number "易混淆数") @@ -71,11 +71,11 @@ We get an invalid number after rotating 25. ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Strobogrammatic Number](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number) (Easy) - 1. [Confusing Number II](https://github.com/openset/leetcode/tree/master/problems/confusing-number-ii) (Hard) + 1. [Strobogrammatic Number](../strobogrammatic-number) (Easy) + 1. [Confusing Number II](../confusing-number-ii) (Hard) ### Hints
diff --git a/problems/connecting-cities-with-minimum-cost/README.md b/problems/connecting-cities-with-minimum-cost/README.md index 3b835adf4..8809b7075 100644 --- a/problems/connecting-cities-with-minimum-cost/README.md +++ b/problems/connecting-cities-with-minimum-cost/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/armstrong-number "Armstrong Number") +[< Previous](../armstrong-number "Armstrong Number") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/parallel-courses "Parallel Courses") +[Next >](../parallel-courses "Parallel Courses") ## [1135. Connecting Cities With Minimum Cost (Medium)](https://leetcode.com/problems/connecting-cities-with-minimum-cost "最低成本联通所有城市") @@ -54,8 +54,8 @@ There is no way to connect all cities even if all edges are used. ### Related Topics - [[Union Find](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] + [[Union Find](../../tag/union-find/README.md)] + [[Graph](../../tag/graph/README.md)] ### Hints
diff --git a/problems/consecutive-available-seats/README.md b/problems/consecutive-available-seats/README.md index 1167c7c46..30ecfa1fb 100644 --- a/problems/consecutive-available-seats/README.md +++ b/problems/consecutive-available-seats/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/friend-requests-ii-who-has-the-most-friends "Friend Requests II: Who Has the Most Friends") +[< Previous](../friend-requests-ii-who-has-the-most-friends "Friend Requests II: Who Has the Most Friends") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/design-compressed-string-iterator "Design Compressed String Iterator") +[Next >](../design-compressed-string-iterator "Design Compressed String Iterator") ## [603. Consecutive Available Seats (Easy)](https://leetcode.com/problems/consecutive-available-seats "连续空余座位") diff --git a/problems/consecutive-numbers-sum/README.md b/problems/consecutive-numbers-sum/README.md index eafadca7d..d8a56e19e 100644 --- a/problems/consecutive-numbers-sum/README.md +++ b/problems/consecutive-numbers-sum/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/unique-letter-string "Unique Letter String") +[< Previous](../unique-letter-string "Unique Letter String") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/positions-of-large-groups "Positions of Large Groups") +[Next >](../positions-of-large-groups "Positions of Large Groups") ## [829. Consecutive Numbers Sum (Hard)](https://leetcode.com/problems/consecutive-numbers-sum "连续整数求和") @@ -37,4 +37,4 @@

Note: 1 <= N <= 10 ^ 9.

### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/consecutive-numbers/README.md b/problems/consecutive-numbers/README.md index a84874f18..6a5efe60c 100644 --- a/problems/consecutive-numbers/README.md +++ b/problems/consecutive-numbers/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/largest-number "Largest Number") +[< Previous](../largest-number "Largest Number") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/employees-earning-more-than-their-managers "Employees Earning More Than Their Managers") +[Next >](../employees-earning-more-than-their-managers "Employees Earning More Than Their Managers") ## [180. Consecutive Numbers (Medium)](https://leetcode.com/problems/consecutive-numbers "连续出现的数字") diff --git a/problems/construct-binary-search-tree-from-preorder-traversal/README.md b/problems/construct-binary-search-tree-from-preorder-traversal/README.md index fc00d9b00..982740fb7 100644 --- a/problems/construct-binary-search-tree-from-preorder-traversal/README.md +++ b/problems/construct-binary-search-tree-from-preorder-traversal/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-domino-rotations-for-equal-row "Minimum Domino Rotations For Equal Row") +[< Previous](../minimum-domino-rotations-for-equal-row "Minimum Domino Rotations For Equal Row") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/complement-of-base-10-integer "Complement of Base 10 Integer") +[Next >](../complement-of-base-10-integer "Complement of Base 10 Integer") ## [1008. Construct Binary Search Tree from Preorder Traversal (Medium)](https://leetcode.com/problems/construct-binary-search-tree-from-preorder-traversal "先序遍历构造二叉树") @@ -35,4 +35,4 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] diff --git a/problems/construct-binary-tree-from-inorder-and-postorder-traversal/README.md b/problems/construct-binary-tree-from-inorder-and-postorder-traversal/README.md index 3b827e726..6cab3faca 100644 --- a/problems/construct-binary-tree-from-inorder-and-postorder-traversal/README.md +++ b/problems/construct-binary-tree-from-inorder-and-postorder-traversal/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-preorder-and-inorder-traversal "Construct Binary Tree from Preorder and Inorder Traversal") +[< Previous](../construct-binary-tree-from-preorder-and-inorder-traversal "Construct Binary Tree from Preorder and Inorder Traversal") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/binary-tree-level-order-traversal-ii "Binary Tree Level Order Traversal II") +[Next >](../binary-tree-level-order-traversal-ii "Binary Tree Level Order Traversal II") ## [106. Construct Binary Tree from Inorder and Postorder Traversal (Medium)](https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal "从中序与后序遍历序列构造二叉树") @@ -33,9 +33,9 @@ postorder = [9,15,7,20,3] ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Construct Binary Tree from Preorder and Inorder Traversal](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-preorder-and-inorder-traversal) (Medium) + 1. [Construct Binary Tree from Preorder and Inorder Traversal](../construct-binary-tree-from-preorder-and-inorder-traversal) (Medium) diff --git a/problems/construct-binary-tree-from-preorder-and-inorder-traversal/README.md b/problems/construct-binary-tree-from-preorder-and-inorder-traversal/README.md index 45529a3aa..b90901203 100644 --- a/problems/construct-binary-tree-from-preorder-and-inorder-traversal/README.md +++ b/problems/construct-binary-tree-from-preorder-and-inorder-traversal/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-depth-of-binary-tree "Maximum Depth of Binary Tree") +[< Previous](../maximum-depth-of-binary-tree "Maximum Depth of Binary Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-inorder-and-postorder-traversal "Construct Binary Tree from Inorder and Postorder Traversal") +[Next >](../construct-binary-tree-from-inorder-and-postorder-traversal "Construct Binary Tree from Inorder and Postorder Traversal") ## [105. Construct Binary Tree from Preorder and Inorder Traversal (Medium)](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal "从前序与中序遍历序列构造二叉树") @@ -32,9 +32,9 @@ inorder = [9,3,15,20,7] 15 7 ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Construct Binary Tree from Inorder and Postorder Traversal](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-inorder-and-postorder-traversal) (Medium) + 1. [Construct Binary Tree from Inorder and Postorder Traversal](../construct-binary-tree-from-inorder-and-postorder-traversal) (Medium) diff --git a/problems/construct-binary-tree-from-preorder-and-postorder-traversal/README.md b/problems/construct-binary-tree-from-preorder-and-postorder-traversal/README.md index 07326909e..c73628d7f 100644 --- a/problems/construct-binary-tree-from-preorder-and-postorder-traversal/README.md +++ b/problems/construct-binary-tree-from-preorder-and-postorder-traversal/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/fair-candy-swap "Fair Candy Swap") +[< Previous](../fair-candy-swap "Fair Candy Swap") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-and-replace-pattern "Find and Replace Pattern") +[Next >](../find-and-replace-pattern "Find and Replace Pattern") ## [889. Construct Binary Tree from Preorder and Postorder Traversal (Medium)](https://leetcode.com/problems/construct-binary-tree-from-preorder-and-postorder-traversal "根据前序和后序遍历构造二叉树") @@ -37,4 +37,4 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] diff --git a/problems/construct-binary-tree-from-string/README.md b/problems/construct-binary-tree-from-string/README.md index d0d37b6b6..36efbb74b 100644 --- a/problems/construct-binary-tree-from-string/README.md +++ b/problems/construct-binary-tree-from-string/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/encode-and-decode-tinyurl "Encode and Decode TinyURL") +[< Previous](../encode-and-decode-tinyurl "Encode and Decode TinyURL") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/complex-number-multiplication "Complex Number Multiplication") +[Next >](../complex-number-multiplication "Complex Number Multiplication") ## [536. Construct Binary Tree from String (Medium)](https://leetcode.com/problems/construct-binary-tree-from-string "从字符串生成二叉树") @@ -38,8 +38,8 @@

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Tree](../../tag/tree/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Construct String from Binary Tree](https://github.com/openset/leetcode/tree/master/problems/construct-string-from-binary-tree) (Easy) + 1. [Construct String from Binary Tree](../construct-string-from-binary-tree) (Easy) diff --git a/problems/construct-quad-tree/README.md b/problems/construct-quad-tree/README.md index 5f71237f2..85ea30cfc 100644 --- a/problems/construct-quad-tree/README.md +++ b/problems/construct-quad-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/convert-binary-search-tree-to-sorted-doubly-linked-list "Convert Binary Search Tree to Sorted Doubly Linked List") +[< Previous](../convert-binary-search-tree-to-sorted-doubly-linked-list "Convert Binary Search Tree to Sorted Doubly Linked List") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-n-ary-tree "Serialize and Deserialize N-ary Tree") +[Next >](../serialize-and-deserialize-n-ary-tree "Serialize and Deserialize N-ary Tree") ## [427. Construct Quad Tree (Medium)](https://leetcode.com/problems/construct-quad-tree "建立四叉树") diff --git a/problems/construct-string-from-binary-tree/README.md b/problems/construct-string-from-binary-tree/README.md index f57de305e..c1eb73f7f 100644 --- a/problems/construct-string-from-binary-tree/README.md +++ b/problems/construct-string-from-binary-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/can-place-flowers "Can Place Flowers") +[< Previous](../can-place-flowers "Can Place Flowers") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/sales-person "Sales Person") +[Next >](../sales-person "Sales Person") ## [606. Construct String from Binary Tree (Easy)](https://leetcode.com/problems/construct-string-from-binary-tree "根据二叉树创建字符串") @@ -44,9 +44,9 @@

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Tree](../../tag/tree/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Construct Binary Tree from String](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-string) (Medium) - 1. [Find Duplicate Subtrees](https://github.com/openset/leetcode/tree/master/problems/find-duplicate-subtrees) (Medium) + 1. [Construct Binary Tree from String](../construct-binary-tree-from-string) (Medium) + 1. [Find Duplicate Subtrees](../find-duplicate-subtrees) (Medium) diff --git a/problems/construct-the-rectangle/README.md b/problems/construct-the-rectangle/README.md index 10f3be612..a7dc0df8a 100644 --- a/problems/construct-the-rectangle/README.md +++ b/problems/construct-the-rectangle/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/increasing-subsequences "Increasing Subsequences") +[< Previous](../increasing-subsequences "Increasing Subsequences") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/reverse-pairs "Reverse Pairs") +[Next >](../reverse-pairs "Reverse Pairs") ## [492. Construct the Rectangle (Easy)](https://leetcode.com/problems/construct-the-rectangle "构造矩形") diff --git a/problems/contain-virus/README.md b/problems/contain-virus/README.md index fd591e702..a296f5966 100644 --- a/problems/contain-virus/README.md +++ b/problems/contain-virus/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/shortest-completing-word "Shortest Completing Word") +[< Previous](../shortest-completing-word "Shortest Completing Word") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-corner-rectangles "Number Of Corner Rectangles") +[Next >](../number-of-corner-rectangles "Number Of Corner Rectangles") ## [749. Contain Virus (Hard)](https://leetcode.com/problems/contain-virus "隔离病毒") @@ -75,7 +75,7 @@ Notice that walls are only built on the shared boundary of two different cells.

### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] ### Hints
diff --git a/problems/container-with-most-water/README.md b/problems/container-with-most-water/README.md index 1572d657b..c56097f9e 100644 --- a/problems/container-with-most-water/README.md +++ b/problems/container-with-most-water/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/regular-expression-matching "Regular Expression Matching") +[< Previous](../regular-expression-matching "Regular Expression Matching") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/integer-to-roman "Integer to Roman") +[Next >](../integer-to-roman "Integer to Roman") ## [11. Container With Most Water (Medium)](https://leetcode.com/problems/container-with-most-water "盛最多水的容器") @@ -30,8 +30,8 @@ Output: 49 ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Array](../../tag/array/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] ### Similar Questions - 1. [Trapping Rain Water](https://github.com/openset/leetcode/tree/master/problems/trapping-rain-water) (Hard) + 1. [Trapping Rain Water](../trapping-rain-water) (Hard) diff --git a/problems/contains-duplicate-ii/README.md b/problems/contains-duplicate-ii/README.md index ac23889f5..c90582922 100644 --- a/problems/contains-duplicate-ii/README.md +++ b/problems/contains-duplicate-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/the-skyline-problem "The Skyline Problem") +[< Previous](../the-skyline-problem "The Skyline Problem") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate-iii "Contains Duplicate III") +[Next >](../contains-duplicate-iii "Contains Duplicate III") ## [219. Contains Duplicate II (Easy)](https://leetcode.com/problems/contains-duplicate-ii "存在重复元素 II") @@ -41,9 +41,9 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Array](../../tag/array/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Contains Duplicate](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate) (Easy) - 1. [Contains Duplicate III](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate-iii) (Medium) + 1. [Contains Duplicate](../contains-duplicate) (Easy) + 1. [Contains Duplicate III](../contains-duplicate-iii) (Medium) diff --git a/problems/contains-duplicate-iii/README.md b/problems/contains-duplicate-iii/README.md index 297a1946f..2e124d496 100644 --- a/problems/contains-duplicate-iii/README.md +++ b/problems/contains-duplicate-iii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate-ii "Contains Duplicate II") +[< Previous](../contains-duplicate-ii "Contains Duplicate II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximal-square "Maximal Square") +[Next >](../maximal-square "Maximal Square") ## [220. Contains Duplicate III (Medium)](https://leetcode.com/problems/contains-duplicate-iii "存在重复元素 III") @@ -41,12 +41,12 @@ ### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] - [[Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md)] + [[Sort](../../tag/sort/README.md)] + [[Ordered Map](../../tag/ordered-map/README.md)] ### Similar Questions - 1. [Contains Duplicate](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate) (Easy) - 1. [Contains Duplicate II](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate-ii) (Easy) + 1. [Contains Duplicate](../contains-duplicate) (Easy) + 1. [Contains Duplicate II](../contains-duplicate-ii) (Easy) ### Hints
diff --git a/problems/contains-duplicate/README.md b/problems/contains-duplicate/README.md index 7f16f88db..1a922e7cf 100644 --- a/problems/contains-duplicate/README.md +++ b/problems/contains-duplicate/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/combination-sum-iii "Combination Sum III") +[< Previous](../combination-sum-iii "Combination Sum III") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/the-skyline-problem "The Skyline Problem") +[Next >](../the-skyline-problem "The Skyline Problem") ## [217. Contains Duplicate (Easy)](https://leetcode.com/problems/contains-duplicate "存在重复元素") @@ -34,9 +34,9 @@ Output: true ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Array](../../tag/array/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Contains Duplicate II](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate-ii) (Easy) - 1. [Contains Duplicate III](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate-iii) (Medium) + 1. [Contains Duplicate II](../contains-duplicate-ii) (Easy) + 1. [Contains Duplicate III](../contains-duplicate-iii) (Medium) diff --git a/problems/contiguous-array/README.md b/problems/contiguous-array/README.md index 632d9344a..8203bbcef 100644 --- a/problems/contiguous-array/README.md +++ b/problems/contiguous-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/longest-word-in-dictionary-through-deleting "Longest Word in Dictionary through Deleting") +[< Previous](../longest-word-in-dictionary-through-deleting "Longest Word in Dictionary through Deleting") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/beautiful-arrangement "Beautiful Arrangement") +[Next >](../beautiful-arrangement "Beautiful Arrangement") ## [525. Contiguous Array (Medium)](https://leetcode.com/problems/contiguous-array "连续数组") @@ -35,7 +35,7 @@ The length of the given binary array will not exceed 50,000.

### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Maximum Size Subarray Sum Equals k](https://github.com/openset/leetcode/tree/master/problems/maximum-size-subarray-sum-equals-k) (Medium) + 1. [Maximum Size Subarray Sum Equals k](../maximum-size-subarray-sum-equals-k) (Medium) diff --git a/problems/continuous-subarray-sum/README.md b/problems/continuous-subarray-sum/README.md index 72e50a225..5ef9ff35d 100644 --- a/problems/continuous-subarray-sum/README.md +++ b/problems/continuous-subarray-sum/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/longest-uncommon-subsequence-ii "Longest Uncommon Subsequence II") +[< Previous](../longest-uncommon-subsequence-ii "Longest Uncommon Subsequence II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/longest-word-in-dictionary-through-deleting "Longest Word in Dictionary through Deleting") +[Next >](../longest-word-in-dictionary-through-deleting "Longest Word in Dictionary through Deleting") ## [523. Continuous Subarray Sum (Medium)](https://leetcode.com/problems/continuous-subarray-sum "连续的子数组和") @@ -41,8 +41,8 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Math](../../tag/math/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Subarray Sum Equals K](https://github.com/openset/leetcode/tree/master/problems/subarray-sum-equals-k) (Medium) + 1. [Subarray Sum Equals K](../subarray-sum-equals-k) (Medium) diff --git a/problems/convert-a-number-to-hexadecimal/README.md b/problems/convert-a-number-to-hexadecimal/README.md index 16363d0d0..5e644bf73 100644 --- a/problems/convert-a-number-to-hexadecimal/README.md +++ b/problems/convert-a-number-to-hexadecimal/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/sum-of-left-leaves "Sum of Left Leaves") +[< Previous](../sum-of-left-leaves "Sum of Left Leaves") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/queue-reconstruction-by-height "Queue Reconstruction by Height") +[Next >](../queue-reconstruction-by-height "Queue Reconstruction by Height") ## [405. Convert a Number to Hexadecimal (Easy)](https://leetcode.com/problems/convert-a-number-to-hexadecimal "数字转换为十六进制数") @@ -45,4 +45,4 @@ Output:

### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] diff --git a/problems/convert-binary-number-in-a-linked-list-to-integer/README.md b/problems/convert-binary-number-in-a-linked-list-to-integer/README.md index 688a1ad50..8d35ca70e 100644 --- a/problems/convert-binary-number-in-a-linked-list-to-integer/README.md +++ b/problems/convert-binary-number-in-a-linked-list-to-integer/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-falling-path-sum-ii "Minimum Falling Path Sum II") +[< Previous](../minimum-falling-path-sum-ii "Minimum Falling Path Sum II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/sequential-digits "Sequential Digits") +[Next >](../sequential-digits "Sequential Digits") ## [1290. Convert Binary Number in a Linked List to Integer (Easy)](https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer "二进制链表转整数") @@ -62,8 +62,8 @@ ### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] + [[Linked List](../../tag/linked-list/README.md)] ### Hints
diff --git a/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/README.md b/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/README.md index 280c149c2..9769c0b64 100644 --- a/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/README.md +++ b/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/word-squares "Word Squares") +[< Previous](../word-squares "Word Squares") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/construct-quad-tree "Construct Quad Tree") +[Next >](../construct-quad-tree "Construct Quad Tree") ## [426. Convert Binary Search Tree to Sorted Doubly Linked List (Medium)](https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list "将二叉搜索树转化为排序的双向链表") @@ -35,9 +35,9 @@

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] - [[Divide and Conquer](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Linked List](../../tag/linked-list/README.md)] + [[Divide and Conquer](../../tag/divide-and-conquer/README.md)] ### Similar Questions - 1. [Binary Tree Inorder Traversal](https://github.com/openset/leetcode/tree/master/problems/binary-tree-inorder-traversal) (Medium) + 1. [Binary Tree Inorder Traversal](../binary-tree-inorder-traversal) (Medium) diff --git a/problems/convert-bst-to-greater-tree/README.md b/problems/convert-bst-to-greater-tree/README.md index d1a6769aa..4fcf2c680 100644 --- a/problems/convert-bst-to-greater-tree/README.md +++ b/problems/convert-bst-to-greater-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/complex-number-multiplication "Complex Number Multiplication") +[< Previous](../complex-number-multiplication "Complex Number Multiplication") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-time-difference "Minimum Time Difference") +[Next >](../minimum-time-difference "Minimum Time Difference") ## [538. Convert BST to Greater Tree (Easy)](https://leetcode.com/problems/convert-bst-to-greater-tree "把二叉搜索树转换为累加树") @@ -29,4 +29,4 @@

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] diff --git a/problems/convert-sorted-array-to-binary-search-tree/README.md b/problems/convert-sorted-array-to-binary-search-tree/README.md index 24ec68cfc..7b9ec6396 100644 --- a/problems/convert-sorted-array-to-binary-search-tree/README.md +++ b/problems/convert-sorted-array-to-binary-search-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/binary-tree-level-order-traversal-ii "Binary Tree Level Order Traversal II") +[< Previous](../binary-tree-level-order-traversal-ii "Binary Tree Level Order Traversal II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/convert-sorted-list-to-binary-search-tree "Convert Sorted List to Binary Search Tree") +[Next >](../convert-sorted-list-to-binary-search-tree "Convert Sorted List to Binary Search Tree") ## [108. Convert Sorted Array to Binary Search Tree (Easy)](https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree "将有序数组转换为二叉搜索树") @@ -30,8 +30,8 @@ One possible answer is: [0,-3,9,-10,null,5], which represents the following heig ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] ### Similar Questions - 1. [Convert Sorted List to Binary Search Tree](https://github.com/openset/leetcode/tree/master/problems/convert-sorted-list-to-binary-search-tree) (Medium) + 1. [Convert Sorted List to Binary Search Tree](../convert-sorted-list-to-binary-search-tree) (Medium) diff --git a/problems/convert-sorted-list-to-binary-search-tree/README.md b/problems/convert-sorted-list-to-binary-search-tree/README.md index 14d09f85c..040b46dbd 100644 --- a/problems/convert-sorted-list-to-binary-search-tree/README.md +++ b/problems/convert-sorted-list-to-binary-search-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/convert-sorted-array-to-binary-search-tree "Convert Sorted Array to Binary Search Tree") +[< Previous](../convert-sorted-array-to-binary-search-tree "Convert Sorted Array to Binary Search Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/balanced-binary-tree "Balanced Binary Tree") +[Next >](../balanced-binary-tree "Balanced Binary Tree") ## [109. Convert Sorted List to Binary Search Tree (Medium)](https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree "有序链表转换二叉搜索树") @@ -30,8 +30,8 @@ One possible answer is: [0,-3,9,-10,null,5], which represents the following heig ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Linked List](../../tag/linked-list/README.md)] ### Similar Questions - 1. [Convert Sorted Array to Binary Search Tree](https://github.com/openset/leetcode/tree/master/problems/convert-sorted-array-to-binary-search-tree) (Easy) + 1. [Convert Sorted Array to Binary Search Tree](../convert-sorted-array-to-binary-search-tree) (Easy) diff --git a/problems/convert-to-base-2/README.md b/problems/convert-to-base-2/README.md index e1a921a8a..4efbc5543 100644 --- a/problems/convert-to-base-2/README.md +++ b/problems/convert-to-base-2/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/binary-string-with-substrings-representing-1-to-n "Binary String With Substrings Representing 1 To N") +[< Previous](../binary-string-with-substrings-representing-1-to-n "Binary String With Substrings Representing 1 To N") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/binary-prefix-divisible-by-5 "Binary Prefix Divisible By 5") +[Next >](../binary-prefix-divisible-by-5 "Binary Prefix Divisible By 5") ## [1017. Convert to Base -2 (Medium)](https://leetcode.com/problems/convert-to-base-2 "负二进制转换") @@ -56,10 +56,10 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Encode Number](https://github.com/openset/leetcode/tree/master/problems/encode-number) (Medium) + 1. [Encode Number](../encode-number) (Medium) ### Hints
diff --git a/problems/convex-polygon/README.md b/problems/convex-polygon/README.md index 175e1440a..f70b00492 100644 --- a/problems/convex-polygon/README.md +++ b/problems/convex-polygon/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/validate-ip-address "Validate IP Address") +[< Previous](../validate-ip-address "Validate IP Address") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/implement-rand10-using-rand7 "Implement Rand10() Using Rand7()") +[Next >](../implement-rand10-using-rand7 "Implement Rand10() Using Rand7()") ## [469. Convex Polygon (Medium)](https://leetcode.com/problems/convex-polygon "凸多边形") @@ -46,4 +46,4 @@ Explanation:](https://github.com/openset/leetcode/tree/master/problems/word-break "Word Break") +[Next >](../word-break "Word Break") ## [138. Copy List with Random Pointer (Medium)](https://leetcode.com/problems/copy-list-with-random-pointer "复制带随机指针的链表") @@ -39,11 +39,11 @@ Node 2's value is 2, its next pointer points to null and its random pointer ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[Linked List](../../tag/linked-list/README.md)] ### Similar Questions - 1. [Clone Graph](https://github.com/openset/leetcode/tree/master/problems/clone-graph) (Medium) + 1. [Clone Graph](../clone-graph) (Medium) ### Hints
diff --git a/problems/corporate-flight-bookings/README.md b/problems/corporate-flight-bookings/README.md index 876e2dcef..dac77489e 100644 --- a/problems/corporate-flight-bookings/README.md +++ b/problems/corporate-flight-bookings/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/defanging-an-ip-address "Defanging an IP Address") +[< Previous](../defanging-an-ip-address "Defanging an IP Address") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/delete-nodes-and-return-forest "Delete Nodes And Return Forest") +[Next >](../delete-nodes-and-return-forest "Delete Nodes And Return Forest") ## [1109. Corporate Flight Bookings (Medium)](https://leetcode.com/problems/corporate-flight-bookings "航班预订统计") @@ -35,5 +35,5 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Array](../../tag/array/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/count-and-say/README.md b/problems/count-and-say/README.md index 9cbe06b18..518a90528 100644 --- a/problems/count-and-say/README.md +++ b/problems/count-and-say/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/sudoku-solver "Sudoku Solver") +[< Previous](../sudoku-solver "Sudoku Solver") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/combination-sum "Combination Sum") +[Next >](../combination-sum "Combination Sum") ## [38. Count and Say (Easy)](https://leetcode.com/problems/count-and-say "报数") @@ -45,11 +45,11 @@ Output: "1211" ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Encode and Decode Strings](https://github.com/openset/leetcode/tree/master/problems/encode-and-decode-strings) (Medium) - 1. [String Compression](https://github.com/openset/leetcode/tree/master/problems/string-compression) (Easy) + 1. [Encode and Decode Strings](../encode-and-decode-strings) (Medium) + 1. [String Compression](../string-compression) (Easy) ### Hints
diff --git a/problems/count-binary-substrings/README.md b/problems/count-binary-substrings/README.md index deddaa011..983f09f4d 100644 --- a/problems/count-binary-substrings/README.md +++ b/problems/count-binary-substrings/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/max-area-of-island "Max Area of Island") +[< Previous](../max-area-of-island "Max Area of Island") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/degree-of-an-array "Degree of an Array") +[Next >](../degree-of-an-array "Degree of an Array") ## [696. Count Binary Substrings (Easy)](https://leetcode.com/problems/count-binary-substrings "计数二进制子串") @@ -39,10 +39,10 @@

### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Encode and Decode Strings](https://github.com/openset/leetcode/tree/master/problems/encode-and-decode-strings) (Medium) + 1. [Encode and Decode Strings](../encode-and-decode-strings) (Medium) ### Hints
diff --git a/problems/count-complete-tree-nodes/README.md b/problems/count-complete-tree-nodes/README.md index 2b1afcb4c..bcc3eedbc 100644 --- a/problems/count-complete-tree-nodes/README.md +++ b/problems/count-complete-tree-nodes/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximal-square "Maximal Square") +[< Previous](../maximal-square "Maximal Square") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/rectangle-area "Rectangle Area") +[Next >](../rectangle-area "Rectangle Area") ## [222. Count Complete Tree Nodes (Medium)](https://leetcode.com/problems/count-complete-tree-nodes "完全二叉树的节点个数") @@ -31,8 +31,8 @@ In a complete binary tree every level, except possibly the last, is completely f Output: 6 ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [Closest Binary Search Tree Value](https://github.com/openset/leetcode/tree/master/problems/closest-binary-search-tree-value) (Easy) + 1. [Closest Binary Search Tree Value](../closest-binary-search-tree-value) (Easy) diff --git a/problems/count-different-palindromic-subsequences/README.md b/problems/count-different-palindromic-subsequences/README.md index 8da473279..b8d590c65 100644 --- a/problems/count-different-palindromic-subsequences/README.md +++ b/problems/count-different-palindromic-subsequences/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/my-calendar-i "My Calendar I") +[< Previous](../my-calendar-i "My Calendar I") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/my-calendar-ii "My Calendar II") +[Next >](../my-calendar-ii "My Calendar II") ## [730. Count Different Palindromic Subsequences (Hard)](https://leetcode.com/problems/count-different-palindromic-subsequences "统计不同回文子字符串") @@ -48,11 +48,11 @@ There are 3104860382 different non-empty palindromic subsequences, which is 1048

### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[String](../../tag/string/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Longest Palindromic Subsequence](https://github.com/openset/leetcode/tree/master/problems/longest-palindromic-subsequence) (Medium) + 1. [Longest Palindromic Subsequence](../longest-palindromic-subsequence) (Medium) ### Hints
diff --git a/problems/count-number-of-nice-subarrays/README.md b/problems/count-number-of-nice-subarrays/README.md index 2f527ab7a..dfdd0ad80 100644 --- a/problems/count-number-of-nice-subarrays/README.md +++ b/problems/count-number-of-nice-subarrays/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-swaps-to-make-strings-equal "Minimum Swaps to Make Strings Equal") +[< Previous](../minimum-swaps-to-make-strings-equal "Minimum Swaps to Make Strings Equal") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-remove-to-make-valid-parentheses "Minimum Remove to Make Valid Parentheses") +[Next >](../minimum-remove-to-make-valid-parentheses "Minimum Remove to Make Valid Parentheses") ## [1248. Count Number of Nice Subarrays (Medium)](https://leetcode.com/problems/count-number-of-nice-subarrays "统计「优美子数组」") @@ -49,7 +49,7 @@ ### Related Topics - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] ### Hints
diff --git a/problems/count-numbers-with-unique-digits/README.md b/problems/count-numbers-with-unique-digits/README.md index c6fd5053b..9aed98006 100644 --- a/problems/count-numbers-with-unique-digits/README.md +++ b/problems/count-numbers-with-unique-digits/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/line-reflection "Line Reflection") +[< Previous](../line-reflection "Line Reflection") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/rearrange-string-k-distance-apart "Rearrange String k Distance Apart") +[Next >](../rearrange-string-k-distance-apart "Rearrange String k Distance Apart") ## [357. Count Numbers with Unique Digits (Medium)](https://leetcode.com/problems/count-numbers-with-unique-digits "计算各个位数不同的数字个数") @@ -25,9 +25,9 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Math](../../tag/math/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Hints
diff --git a/problems/count-of-range-sum/README.md b/problems/count-of-range-sum/README.md index 5daaa7bfc..ca49f61da 100644 --- a/problems/count-of-range-sum/README.md +++ b/problems/count-of-range-sum/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/power-of-three "Power of Three") +[< Previous](../power-of-three "Power of Three") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/odd-even-linked-list "Odd Even Linked List") +[Next >](../odd-even-linked-list "Odd Even Linked List") ## [327. Count of Range Sum (Hard)](https://leetcode.com/problems/count-of-range-sum "区间和的个数") @@ -26,12 +26,12 @@ A naive algorithm of O(n2) is trivial. You MUST do bett ### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] - [[Binary Indexed Tree](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] - [[Segment Tree](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] - [[Divide and Conquer](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] + [[Sort](../../tag/sort/README.md)] + [[Binary Indexed Tree](../../tag/binary-indexed-tree/README.md)] + [[Segment Tree](../../tag/segment-tree/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] + [[Divide and Conquer](../../tag/divide-and-conquer/README.md)] ### Similar Questions - 1. [Count of Smaller Numbers After Self](https://github.com/openset/leetcode/tree/master/problems/count-of-smaller-numbers-after-self) (Hard) - 1. [Reverse Pairs](https://github.com/openset/leetcode/tree/master/problems/reverse-pairs) (Hard) + 1. [Count of Smaller Numbers After Self](../count-of-smaller-numbers-after-self) (Hard) + 1. [Reverse Pairs](../reverse-pairs) (Hard) diff --git a/problems/count-of-smaller-numbers-after-self/README.md b/problems/count-of-smaller-numbers-after-self/README.md index e66a2d1f9..ceae78a02 100644 --- a/problems/count-of-smaller-numbers-after-self/README.md +++ b/problems/count-of-smaller-numbers-after-self/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/binary-tree-vertical-order-traversal "Binary Tree Vertical Order Traversal") +[< Previous](../binary-tree-vertical-order-traversal "Binary Tree Vertical Order Traversal") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/remove-duplicate-letters "Remove Duplicate Letters") +[Next >](../remove-duplicate-letters "Remove Duplicate Letters") ## [315. Count of Smaller Numbers After Self (Hard)](https://leetcode.com/problems/count-of-smaller-numbers-after-self "计算右侧小于当前元素的个数") @@ -26,13 +26,13 @@ To the right of 1 there is 0 smaller element. ### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] - [[Binary Indexed Tree](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] - [[Segment Tree](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] - [[Divide and Conquer](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] + [[Sort](../../tag/sort/README.md)] + [[Binary Indexed Tree](../../tag/binary-indexed-tree/README.md)] + [[Segment Tree](../../tag/segment-tree/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] + [[Divide and Conquer](../../tag/divide-and-conquer/README.md)] ### Similar Questions - 1. [Count of Range Sum](https://github.com/openset/leetcode/tree/master/problems/count-of-range-sum) (Hard) - 1. [Queue Reconstruction by Height](https://github.com/openset/leetcode/tree/master/problems/queue-reconstruction-by-height) (Medium) - 1. [Reverse Pairs](https://github.com/openset/leetcode/tree/master/problems/reverse-pairs) (Hard) + 1. [Count of Range Sum](../count-of-range-sum) (Hard) + 1. [Queue Reconstruction by Height](../queue-reconstruction-by-height) (Medium) + 1. [Reverse Pairs](../reverse-pairs) (Hard) diff --git a/problems/count-primes/README.md b/problems/count-primes/README.md index 6f297d81d..5ff81dc7f 100644 --- a/problems/count-primes/README.md +++ b/problems/count-primes/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/remove-linked-list-elements "Remove Linked List Elements") +[< Previous](../remove-linked-list-elements "Remove Linked List Elements") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/isomorphic-strings "Isomorphic Strings") +[Next >](../isomorphic-strings "Isomorphic Strings") ## [204. Count Primes (Easy)](https://leetcode.com/problems/count-primes "计数质数") @@ -22,13 +22,13 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Ugly Number](https://github.com/openset/leetcode/tree/master/problems/ugly-number) (Easy) - 1. [Ugly Number II](https://github.com/openset/leetcode/tree/master/problems/ugly-number-ii) (Medium) - 1. [Perfect Squares](https://github.com/openset/leetcode/tree/master/problems/perfect-squares) (Medium) + 1. [Ugly Number](../ugly-number) (Easy) + 1. [Ugly Number II](../ugly-number-ii) (Medium) + 1. [Perfect Squares](../perfect-squares) (Medium) ### Hints
diff --git a/problems/count-servers-that-communicate/README.md b/problems/count-servers-that-communicate/README.md index ff7cf62cb..4a6de5bd0 100644 --- a/problems/count-servers-that-communicate/README.md +++ b/problems/count-servers-that-communicate/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-time-visiting-all-points "Minimum Time Visiting All Points") +[< Previous](../minimum-time-visiting-all-points "Minimum Time Visiting All Points") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/search-suggestions-system "Search Suggestions System") +[Next >](../search-suggestions-system "Search Suggestions System") ## [1267. Count Servers that Communicate (Medium)](https://leetcode.com/problems/count-servers-that-communicate "统计参与通信的服务器") @@ -57,8 +57,8 @@ Return the number of servers that communicate with any other server.

### Related Topics - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Graph](../../tag/graph/README.md)] + [[Array](../../tag/array/README.md)] ### Hints
diff --git a/problems/count-square-submatrices-with-all-ones/README.md b/problems/count-square-submatrices-with-all-ones/README.md index d29006e29..4ad175457 100644 --- a/problems/count-square-submatrices-with-all-ones/README.md +++ b/problems/count-square-submatrices-with-all-ones/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/number-of-burgers-with-no-waste-of-ingredients "Number of Burgers with No Waste of Ingredients") +[< Previous](../number-of-burgers-with-no-waste-of-ingredients "Number of Burgers with No Waste of Ingredients") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/palindrome-partitioning-iii "Palindrome Partitioning III") +[Next >](../palindrome-partitioning-iii "Palindrome Partitioning III") ## [1277. Count Square Submatrices with All Ones (Medium)](https://leetcode.com/problems/count-square-submatrices-with-all-ones "统计全为 1 的正方形子矩阵") @@ -57,8 +57,8 @@ Total number of squares = 6 + 1 = 7. ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Array](../../tag/array/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/count-student-number-in-departments/README.md b/problems/count-student-number-in-departments/README.md index c39b281dd..5291ffe31 100644 --- a/problems/count-student-number-in-departments/README.md +++ b/problems/count-student-number-in-departments/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-cumulative-salary-of-an-employee "Find Cumulative Salary of an Employee") +[< Previous](../find-cumulative-salary-of-an-employee "Find Cumulative Salary of an Employee") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/shortest-unsorted-continuous-subarray "Shortest Unsorted Continuous Subarray") +[Next >](../shortest-unsorted-continuous-subarray "Shortest Unsorted Continuous Subarray") ## [580. Count Student Number in Departments (Medium)](https://leetcode.com/problems/count-student-number-in-departments "统计各专业学生人数") diff --git a/problems/count-substrings-with-only-one-distinct-letter/README.md b/problems/count-substrings-with-only-one-distinct-letter/README.md index 17f5a7bd2..4636959fc 100644 --- a/problems/count-substrings-with-only-one-distinct-letter/README.md +++ b/problems/count-substrings-with-only-one-distinct-letter/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/reformat-department-table "Reformat Department Table") +[< Previous](../reformat-department-table "Reformat Department Table") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/before-and-after-puzzle "Before and After Puzzle") +[Next >](../before-and-after-puzzle "Before and After Puzzle") ## [1180. Count Substrings with Only One Distinct Letter (Easy)](https://leetcode.com/problems/count-substrings-with-only-one-distinct-letter "统计只含单一字母的子串") @@ -43,8 +43,8 @@ So the answer is 1 + 2 + 4 + 1 = 8. ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Math](../../tag/math/README.md)] + [[String](../../tag/string/README.md)] ### Hints
diff --git a/problems/count-the-repetitions/README.md b/problems/count-the-repetitions/README.md index a41a96c6d..3d8983d52 100644 --- a/problems/count-the-repetitions/README.md +++ b/problems/count-the-repetitions/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/optimal-account-balancing "Optimal Account Balancing") +[< Previous](../optimal-account-balancing "Optimal Account Balancing") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/unique-substrings-in-wraparound-string "Unique Substrings in Wraparound String") +[Next >](../unique-substrings-in-wraparound-string "Unique Substrings in Wraparound String") ## [466. Count The Repetitions (Hard)](https://leetcode.com/problems/count-the-repetitions "统计重复个数") @@ -27,4 +27,4 @@ Return:

### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/count-univalue-subtrees/README.md b/problems/count-univalue-subtrees/README.md index 3ff6de1b6..68d57a5be 100644 --- a/problems/count-univalue-subtrees/README.md +++ b/problems/count-univalue-subtrees/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/group-shifted-strings "Group Shifted Strings") +[< Previous](../group-shifted-strings "Group Shifted Strings") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/flatten-2d-vector "Flatten 2D Vector") +[Next >](../flatten-2d-vector "Flatten 2D Vector") ## [250. Count Univalue Subtrees (Medium)](https://leetcode.com/problems/count-univalue-subtrees "统计同值子树") @@ -29,8 +29,8 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] ### Similar Questions - 1. [Subtree of Another Tree](https://github.com/openset/leetcode/tree/master/problems/subtree-of-another-tree) (Easy) - 1. [Longest Univalue Path](https://github.com/openset/leetcode/tree/master/problems/longest-univalue-path) (Easy) + 1. [Subtree of Another Tree](../subtree-of-another-tree) (Easy) + 1. [Longest Univalue Path](../longest-univalue-path) (Easy) diff --git a/problems/count-vowels-permutation/README.md b/problems/count-vowels-permutation/README.md index 6f3587629..31af29368 100644 --- a/problems/count-vowels-permutation/README.md +++ b/problems/count-vowels-permutation/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/path-with-maximum-gold "Path with Maximum Gold") +[< Previous](../path-with-maximum-gold "Path with Maximum Gold") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/split-a-string-in-balanced-strings "Split a String in Balanced Strings") +[Next >](../split-a-string-in-balanced-strings "Split a String in Balanced Strings") ## [1220. Count Vowels Permutation (Hard)](https://leetcode.com/problems/count-vowels-permutation "统计元音字母序列的数目") @@ -55,7 +55,7 @@ ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/counting-bits/README.md b/problems/counting-bits/README.md index 9f17689de..e8d6a286b 100644 --- a/problems/counting-bits/README.md +++ b/problems/counting-bits/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/house-robber-iii "House Robber III") +[< Previous](../house-robber-iii "House Robber III") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/nested-list-weight-sum "Nested List Weight Sum") +[Next >](../nested-list-weight-sum "Nested List Weight Sum") ## [338. Counting Bits (Medium)](https://leetcode.com/problems/counting-bits "比特位计数") @@ -35,11 +35,11 @@ ### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Number of 1 Bits](https://github.com/openset/leetcode/tree/master/problems/number-of-1-bits) (Easy) + 1. [Number of 1 Bits](../number-of-1-bits) (Easy) ### Hints
diff --git a/problems/couples-holding-hands/README.md b/problems/couples-holding-hands/README.md index e9ffd922a..b86d0e446 100644 --- a/problems/couples-holding-hands/README.md +++ b/problems/couples-holding-hands/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/largest-plus-sign "Largest Plus Sign") +[< Previous](../largest-plus-sign "Largest Plus Sign") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/toeplitz-matrix "Toeplitz Matrix") +[Next >](../toeplitz-matrix "Toeplitz Matrix") ## [765. Couples Holding Hands (Hard)](https://leetcode.com/problems/couples-holding-hands "情侣牵手") @@ -38,14 +38,14 @@ The couples' initial seating is given by row[i] being the value of ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[Union Find](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[Union Find](../../tag/union-find/README.md)] + [[Graph](../../tag/graph/README.md)] ### Similar Questions - 1. [First Missing Positive](https://github.com/openset/leetcode/tree/master/problems/first-missing-positive) (Hard) - 1. [Missing Number](https://github.com/openset/leetcode/tree/master/problems/missing-number) (Easy) - 1. [K-Similar Strings](https://github.com/openset/leetcode/tree/master/problems/k-similar-strings) (Hard) + 1. [First Missing Positive](../first-missing-positive) (Hard) + 1. [Missing Number](../missing-number) (Easy) + 1. [K-Similar Strings](../k-similar-strings) (Hard) ### Hints
diff --git a/problems/course-schedule-ii/README.md b/problems/course-schedule-ii/README.md index a6c13e0ab..fa278ad52 100644 --- a/problems/course-schedule-ii/README.md +++ b/problems/course-schedule-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-size-subarray-sum "Minimum Size Subarray Sum") +[< Previous](../minimum-size-subarray-sum "Minimum Size Subarray Sum") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/add-and-search-word-data-structure-design "Add and Search Word - Data structure design") +[Next >](../add-and-search-word-data-structure-design "Add and Search Word - Data structure design") ## [210. Course Schedule II (Medium)](https://leetcode.com/problems/course-schedule-ii "课程表 II") @@ -44,17 +44,17 @@ ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] - [[Topological Sort](https://github.com/openset/leetcode/tree/master/tag/topological-sort/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] + [[Graph](../../tag/graph/README.md)] + [[Topological Sort](../../tag/topological-sort/README.md)] ### Similar Questions - 1. [Course Schedule](https://github.com/openset/leetcode/tree/master/problems/course-schedule) (Medium) - 1. [Alien Dictionary](https://github.com/openset/leetcode/tree/master/problems/alien-dictionary) (Hard) - 1. [Minimum Height Trees](https://github.com/openset/leetcode/tree/master/problems/minimum-height-trees) (Medium) - 1. [Sequence Reconstruction](https://github.com/openset/leetcode/tree/master/problems/sequence-reconstruction) (Medium) - 1. [Course Schedule III](https://github.com/openset/leetcode/tree/master/problems/course-schedule-iii) (Hard) + 1. [Course Schedule](../course-schedule) (Medium) + 1. [Alien Dictionary](../alien-dictionary) (Hard) + 1. [Minimum Height Trees](../minimum-height-trees) (Medium) + 1. [Sequence Reconstruction](../sequence-reconstruction) (Medium) + 1. [Course Schedule III](../course-schedule-iii) (Hard) ### Hints
diff --git a/problems/course-schedule-iii/README.md b/problems/course-schedule-iii/README.md index c01f7c980..bf2960faf 100644 --- a/problems/course-schedule-iii/README.md +++ b/problems/course-schedule-iii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/k-inverse-pairs-array "K Inverse Pairs Array") +[< Previous](../k-inverse-pairs-array "K Inverse Pairs Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/design-excel-sum-formula "Design Excel Sum Formula") +[Next >](../design-excel-sum-formula "Design Excel Sum Formula") ## [630. Course Schedule III (Hard)](https://leetcode.com/problems/course-schedule-iii "课程表 III") @@ -40,11 +40,11 @@ The 4th course cannot be taken now, since you will finish it on the 3300th day,

 

### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] + [[Greedy](../../tag/greedy/README.md)] ### Similar Questions - 1. [Course Schedule](https://github.com/openset/leetcode/tree/master/problems/course-schedule) (Medium) - 1. [Course Schedule II](https://github.com/openset/leetcode/tree/master/problems/course-schedule-ii) (Medium) + 1. [Course Schedule](../course-schedule) (Medium) + 1. [Course Schedule II](../course-schedule-ii) (Medium) ### Hints
diff --git a/problems/course-schedule/README.md b/problems/course-schedule/README.md index e3854bc7b..1cea1585c 100644 --- a/problems/course-schedule/README.md +++ b/problems/course-schedule/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/reverse-linked-list "Reverse Linked List") +[< Previous](../reverse-linked-list "Reverse Linked List") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/implement-trie-prefix-tree "Implement Trie (Prefix Tree)") +[Next >](../implement-trie-prefix-tree "Implement Trie (Prefix Tree)") ## [207. Course Schedule (Medium)](https://leetcode.com/problems/course-schedule "课程表") @@ -43,16 +43,16 @@ ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] - [[Topological Sort](https://github.com/openset/leetcode/tree/master/tag/topological-sort/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] + [[Graph](../../tag/graph/README.md)] + [[Topological Sort](../../tag/topological-sort/README.md)] ### Similar Questions - 1. [Course Schedule II](https://github.com/openset/leetcode/tree/master/problems/course-schedule-ii) (Medium) - 1. [Graph Valid Tree](https://github.com/openset/leetcode/tree/master/problems/graph-valid-tree) (Medium) - 1. [Minimum Height Trees](https://github.com/openset/leetcode/tree/master/problems/minimum-height-trees) (Medium) - 1. [Course Schedule III](https://github.com/openset/leetcode/tree/master/problems/course-schedule-iii) (Hard) + 1. [Course Schedule II](../course-schedule-ii) (Medium) + 1. [Graph Valid Tree](../graph-valid-tree) (Medium) + 1. [Minimum Height Trees](../minimum-height-trees) (Medium) + 1. [Course Schedule III](../course-schedule-iii) (Hard) ### Hints
diff --git a/problems/cousins-in-binary-tree/README.md b/problems/cousins-in-binary-tree/README.md index 7415ee085..b56db424b 100644 --- a/problems/cousins-in-binary-tree/README.md +++ b/problems/cousins-in-binary-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/subarrays-with-k-different-integers "Subarrays with K Different Integers") +[< Previous](../subarrays-with-k-different-integers "Subarrays with K Different Integers") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/rotting-oranges "Rotting Oranges") +[Next >](../rotting-oranges "Rotting Oranges") ## [993. Cousins in Binary Tree (Easy)](https://leetcode.com/problems/cousins-in-binary-tree "二叉树的堂兄弟节点") @@ -65,8 +65,8 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] ### Similar Questions - 1. [Binary Tree Level Order Traversal](https://github.com/openset/leetcode/tree/master/problems/binary-tree-level-order-traversal) (Medium) + 1. [Binary Tree Level Order Traversal](../binary-tree-level-order-traversal) (Medium) diff --git a/problems/cracking-the-safe/README.md b/problems/cracking-the-safe/README.md index 319f2e435..fc3957601 100644 --- a/problems/cracking-the-safe/README.md +++ b/problems/cracking-the-safe/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/open-the-lock "Open the Lock") +[< Previous](../open-the-lock "Open the Lock") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/reach-a-number "Reach a Number") +[Next >](../reach-a-number "Reach a Number") ## [753. Cracking the Safe (Hard)](https://leetcode.com/problems/cracking-the-safe "破解保险箱") @@ -50,8 +50,8 @@

 

### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Math](../../tag/math/README.md)] ### Hints
diff --git a/problems/create-maximum-number/README.md b/problems/create-maximum-number/README.md index d57941c34..56b92324f 100644 --- a/problems/create-maximum-number/README.md +++ b/problems/create-maximum-number/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/generalized-abbreviation "Generalized Abbreviation") +[< Previous](../generalized-abbreviation "Generalized Abbreviation") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/coin-change "Coin Change") +[Next >](../coin-change "Coin Change") ## [321. Create Maximum Number (Hard)](https://leetcode.com/problems/create-maximum-number "拼接最大数") @@ -47,9 +47,9 @@ k = 3 ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Remove K Digits](https://github.com/openset/leetcode/tree/master/problems/remove-k-digits) (Medium) - 1. [Maximum Swap](https://github.com/openset/leetcode/tree/master/problems/maximum-swap) (Medium) + 1. [Remove K Digits](../remove-k-digits) (Medium) + 1. [Maximum Swap](../maximum-swap) (Medium) diff --git a/problems/critical-connections-in-a-network/README.md b/problems/critical-connections-in-a-network/README.md index 6443eb367..ec7b89a84 100644 --- a/problems/critical-connections-in-a-network/README.md +++ b/problems/critical-connections-in-a-network/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/k-concatenation-maximum-sum "K-Concatenation Maximum Sum") +[< Previous](../k-concatenation-maximum-sum "K-Concatenation Maximum Sum") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/monthly-transactions-i "Monthly Transactions I") +[Next >](../monthly-transactions-i "Monthly Transactions I") ## [1192. Critical Connections in a Network (Hard)](https://leetcode.com/problems/critical-connections-in-a-network "查找集群内的「关键连接」") @@ -39,7 +39,7 @@ ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] ### Hints
diff --git a/problems/custom-sort-string/README.md b/problems/custom-sort-string/README.md index c6c50ca70..45c2502b9 100644 --- a/problems/custom-sort-string/README.md +++ b/problems/custom-sort-string/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/domino-and-tromino-tiling "Domino and Tromino Tiling") +[< Previous](../domino-and-tromino-tiling "Domino and Tromino Tiling") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-matching-subsequences "Number of Matching Subsequences") +[Next >](../number-of-matching-subsequences "Number of Matching Subsequences") ## [791. Custom Sort String (Medium)](https://leetcode.com/problems/custom-sort-string "自定义字符串排序") @@ -39,4 +39,4 @@ Since "d" does not appear in S, it can be at any position in T. " ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/customer-placing-the-largest-number-of-orders/README.md b/problems/customer-placing-the-largest-number-of-orders/README.md index 8451e4363..e4537c3f7 100644 --- a/problems/customer-placing-the-largest-number-of-orders/README.md +++ b/problems/customer-placing-the-largest-number-of-orders/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/investments-in-2016 "Investments in 2016") +[< Previous](../investments-in-2016 "Investments in 2016") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/erect-the-fence "Erect the Fence") +[Next >](../erect-the-fence "Erect the Fence") ## [586. Customer Placing the Largest Number of Orders (Easy)](https://leetcode.com/problems/customer-placing-the-largest-number-of-orders "订单最多的客户") diff --git a/problems/customers-who-bought-all-products/README.md b/problems/customers-who-bought-all-products/README.md index c0f39c74e..55613c05d 100644 --- a/problems/customers-who-bought-all-products/README.md +++ b/problems/customers-who-bought-all-products/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/longest-duplicate-substring "Longest Duplicate Substring") +[< Previous](../longest-duplicate-substring "Longest Duplicate Substring") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/last-stone-weight "Last Stone Weight") +[Next >](../last-stone-weight "Last Stone Weight") ## [1045. Customers Who Bought All Products (Medium)](https://leetcode.com/problems/customers-who-bought-all-products "买下所有产品的客户") diff --git a/problems/customers-who-never-order/README.md b/problems/customers-who-never-order/README.md index 3bb83537f..abb7f3491 100644 --- a/problems/customers-who-never-order/README.md +++ b/problems/customers-who-never-order/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/duplicate-emails "Duplicate Emails") +[< Previous](../duplicate-emails "Duplicate Emails") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/department-highest-salary "Department Highest Salary") +[Next >](../department-highest-salary "Department Highest Salary") ## [183. Customers Who Never Order (Easy)](https://leetcode.com/problems/customers-who-never-order "从不订购的客户") diff --git a/problems/cut-off-trees-for-golf-event/README.md b/problems/cut-off-trees-for-golf-event/README.md index b250a1f77..cf0e863e8 100644 --- a/problems/cut-off-trees-for-golf-event/README.md +++ b/problems/cut-off-trees-for-golf-event/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/longest-continuous-increasing-subsequence "Longest Continuous Increasing Subsequence") +[< Previous](../longest-continuous-increasing-subsequence "Longest Continuous Increasing Subsequence") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/implement-magic-dictionary "Implement Magic Dictionary") +[Next >](../implement-magic-dictionary "Implement Magic Dictionary") ## [675. Cut Off Trees for Golf Event (Hard)](https://leetcode.com/problems/cut-off-trees-for-golf-event "为高尔夫比赛砍树") @@ -73,4 +73,4 @@

Hint: size of the given matrix will not exceed 50x50.

### Related Topics - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] diff --git a/problems/daily-temperatures/README.md b/problems/daily-temperatures/README.md index 9c0e7c3b7..2b44915b5 100644 --- a/problems/daily-temperatures/README.md +++ b/problems/daily-temperatures/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/monotone-increasing-digits "Monotone Increasing Digits") +[< Previous](../monotone-increasing-digits "Monotone Increasing Digits") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/delete-and-earn "Delete and Earn") +[Next >](../delete-and-earn "Delete and Earn") ## [739. Daily Temperatures (Medium)](https://leetcode.com/problems/daily-temperatures "每日温度") @@ -23,11 +23,11 @@ Each temperature will be an integer in the range [30, 100].

### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Stack](../../tag/stack/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Next Greater Element I](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-i) (Easy) + 1. [Next Greater Element I](../next-greater-element-i) (Easy) ### Hints
diff --git a/problems/data-stream-as-disjoint-intervals/README.md b/problems/data-stream-as-disjoint-intervals/README.md index d76f5d428..faacb90e7 100644 --- a/problems/data-stream-as-disjoint-intervals/README.md +++ b/problems/data-stream-as-disjoint-intervals/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/android-unlock-patterns "Android Unlock Patterns") +[< Previous](../android-unlock-patterns "Android Unlock Patterns") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/design-snake-game "Design Snake Game") +[Next >](../design-snake-game "Design Snake Game") ## [352. Data Stream as Disjoint Intervals (Hard)](https://leetcode.com/problems/data-stream-as-disjoint-intervals "将数据流变为多个不相交区间") @@ -30,10 +30,10 @@

What if there are lots of merges and the number of disjoint intervals are small compared to the data stream's size?

### Related Topics - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] - [[Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] + [[Ordered Map](../../tag/ordered-map/README.md)] ### Similar Questions - 1. [Summary Ranges](https://github.com/openset/leetcode/tree/master/problems/summary-ranges) (Medium) - 1. [Find Right Interval](https://github.com/openset/leetcode/tree/master/problems/find-right-interval) (Medium) - 1. [Range Module](https://github.com/openset/leetcode/tree/master/problems/range-module) (Hard) + 1. [Summary Ranges](../summary-ranges) (Medium) + 1. [Find Right Interval](../find-right-interval) (Medium) + 1. [Range Module](../range-module) (Hard) diff --git a/problems/day-of-the-week/README.md b/problems/day-of-the-week/README.md index bac1cd003..a5107132f 100644 --- a/problems/day-of-the-week/README.md +++ b/problems/day-of-the-week/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/distance-between-bus-stops "Distance Between Bus Stops") +[< Previous](../distance-between-bus-stops "Distance Between Bus Stops") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-subarray-sum-with-one-deletion "Maximum Subarray Sum with One Deletion") +[Next >](../maximum-subarray-sum-with-one-deletion "Maximum Subarray Sum with One Deletion") ## [1185. Day of the Week (Easy)](https://leetcode.com/problems/day-of-the-week "一周中的第几天") @@ -47,7 +47,7 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Hints
diff --git a/problems/day-of-the-year/README.md b/problems/day-of-the-year/README.md index 7c4e65130..d023c8209 100644 --- a/problems/day-of-the-year/README.md +++ b/problems/day-of-the-year/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/string-transforms-into-another-string "String Transforms Into Another String") +[< Previous](../string-transforms-into-another-string "String Transforms Into Another String") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-dice-rolls-with-target-sum "Number of Dice Rolls With Target Sum") +[Next >](../number-of-dice-rolls-with-target-sum "Number of Dice Rolls With Target Sum") ## [1154. Day of the Year (Easy)](https://leetcode.com/problems/day-of-the-year "一年中的第几天") @@ -53,7 +53,7 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Hints
diff --git a/problems/decode-string/README.md b/problems/decode-string/README.md index 35004dff4..a8c64086a 100644 --- a/problems/decode-string/README.md +++ b/problems/decode-string/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/utf-8-validation "UTF-8 Validation") +[< Previous](../utf-8-validation "UTF-8 Validation") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-least-k-repeating-characters "Longest Substring with At Least K Repeating Characters") +[Next >](../longest-substring-with-at-least-k-repeating-characters "Longest Substring with At Least K Repeating Characters") ## [394. Decode String (Medium)](https://leetcode.com/problems/decode-string "字符串解码") @@ -30,10 +30,10 @@ s = "2[abc]3[cd]ef", return "abcabccdcdcdef".

 

### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Stack](../../tag/stack/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] ### Similar Questions - 1. [Encode String with Shortest Length](https://github.com/openset/leetcode/tree/master/problems/encode-string-with-shortest-length) (Hard) - 1. [Number of Atoms](https://github.com/openset/leetcode/tree/master/problems/number-of-atoms) (Hard) - 1. [Brace Expansion](https://github.com/openset/leetcode/tree/master/problems/brace-expansion) (Medium) + 1. [Encode String with Shortest Length](../encode-string-with-shortest-length) (Hard) + 1. [Number of Atoms](../number-of-atoms) (Hard) + 1. [Brace Expansion](../brace-expansion) (Medium) diff --git a/problems/decode-ways-ii/README.md b/problems/decode-ways-ii/README.md index 53a80f86e..78a0e77f0 100644 --- a/problems/decode-ways-ii/README.md +++ b/problems/decode-ways-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/shopping-offers "Shopping Offers") +[< Previous](../shopping-offers "Shopping Offers") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/solve-the-equation "Solve the Equation") +[Next >](../solve-the-equation "Solve the Equation") ## [639. Decode Ways II (Hard)](https://leetcode.com/problems/decode-ways-ii "解码方法 2") @@ -58,7 +58,7 @@ Also, since the answer may be very large, you should return the output mod 10 ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Decode Ways](https://github.com/openset/leetcode/tree/master/problems/decode-ways) (Medium) + 1. [Decode Ways](../decode-ways) (Medium) diff --git a/problems/decode-ways/README.md b/problems/decode-ways/README.md index 3a2569d2f..933dcf927 100644 --- a/problems/decode-ways/README.md +++ b/problems/decode-ways/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/subsets-ii "Subsets II") +[< Previous](../subsets-ii "Subsets II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/reverse-linked-list-ii "Reverse Linked List II") +[Next >](../reverse-linked-list-ii "Reverse Linked List II") ## [91. Decode Ways (Medium)](https://leetcode.com/problems/decode-ways "解码方法") @@ -38,8 +38,8 @@ Explanation: It could be decoded as "BZ" (2 26), "VF" (22 6), or "BBF" (2 2 6). ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[String](../../tag/string/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Decode Ways II](https://github.com/openset/leetcode/tree/master/problems/decode-ways-ii) (Hard) + 1. [Decode Ways II](../decode-ways-ii) (Hard) diff --git a/problems/decoded-string-at-index/README.md b/problems/decoded-string-at-index/README.md index d27e7cfc7..08c90384a 100644 --- a/problems/decoded-string-at-index/README.md +++ b/problems/decoded-string-at-index/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/profitable-schemes "Profitable Schemes") +[< Previous](../profitable-schemes "Profitable Schemes") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/boats-to-save-people "Boats to Save People") +[Next >](../boats-to-save-people "Boats to Save People") ## [880. Decoded String at Index (Medium)](https://leetcode.com/problems/decoded-string-at-index "索引处的解码字符串") @@ -69,4 +69,4 @@ The decoded string is "a" repeated 8301530446056247680 times. The 1st ### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] + [[Stack](../../tag/stack/README.md)] diff --git a/problems/decrease-elements-to-make-array-zigzag/README.md b/problems/decrease-elements-to-make-array-zigzag/README.md index 89d266149..a03fae69f 100644 --- a/problems/decrease-elements-to-make-array-zigzag/README.md +++ b/problems/decrease-elements-to-make-array-zigzag/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/longest-common-subsequence "Longest Common Subsequence") +[< Previous](../longest-common-subsequence "Longest Common Subsequence") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/binary-tree-coloring-game "Binary Tree Coloring Game") +[Next >](../binary-tree-coloring-game "Binary Tree Coloring Game") ## [1144. Decrease Elements To Make Array Zigzag (Medium)](https://leetcode.com/problems/decrease-elements-to-make-array-zigzag "递减元素使数组呈锯齿状") @@ -47,7 +47,7 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Hints
diff --git a/problems/defanging-an-ip-address/README.md b/problems/defanging-an-ip-address/README.md index df01ada1a..916337166 100644 --- a/problems/defanging-an-ip-address/README.md +++ b/problems/defanging-an-ip-address/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/new-users-daily-count "New Users Daily Count") +[< Previous](../new-users-daily-count "New Users Daily Count") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/corporate-flight-bookings "Corporate Flight Bookings") +[Next >](../corporate-flight-bookings "Corporate Flight Bookings") ## [1108. Defanging an IP Address (Easy)](https://leetcode.com/problems/defanging-an-ip-address "IP 地址无效化") @@ -31,4 +31,4 @@ ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/degree-of-an-array/README.md b/problems/degree-of-an-array/README.md index 0046229ed..af0281478 100644 --- a/problems/degree-of-an-array/README.md +++ b/problems/degree-of-an-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/count-binary-substrings "Count Binary Substrings") +[< Previous](../count-binary-substrings "Count Binary Substrings") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/partition-to-k-equal-sum-subsets "Partition to K Equal Sum Subsets") +[Next >](../partition-to-k-equal-sum-subsets "Partition to K Equal Sum Subsets") ## [697. Degree of an Array (Easy)](https://leetcode.com/problems/degree-of-an-array "数组的度") @@ -40,10 +40,10 @@ The shortest length is 2. So return 2.

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Maximum Subarray](https://github.com/openset/leetcode/tree/master/problems/maximum-subarray) (Easy) + 1. [Maximum Subarray](../maximum-subarray) (Easy) ### Hints
diff --git a/problems/delete-and-earn/README.md b/problems/delete-and-earn/README.md index ed871877f..517fcfb44 100644 --- a/problems/delete-and-earn/README.md +++ b/problems/delete-and-earn/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/daily-temperatures "Daily Temperatures") +[< Previous](../daily-temperatures "Daily Temperatures") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/cherry-pickup "Cherry Pickup") +[Next >](../cherry-pickup "Cherry Pickup") ## [740. Delete and Earn (Medium)](https://leetcode.com/problems/delete-and-earn "删除与获得点数") @@ -52,10 +52,10 @@ Then, delete 3 again to earn 3 points, and 3 again to earn 3 points.

 

### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [House Robber](https://github.com/openset/leetcode/tree/master/problems/house-robber) (Easy) + 1. [House Robber](../house-robber) (Easy) ### Hints
diff --git a/problems/delete-columns-to-make-sorted-ii/README.md b/problems/delete-columns-to-make-sorted-ii/README.md index c09a89512..5e5583679 100644 --- a/problems/delete-columns-to-make-sorted-ii/README.md +++ b/problems/delete-columns-to-make-sorted-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/array-of-doubled-pairs "Array of Doubled Pairs") +[< Previous](../array-of-doubled-pairs "Array of Doubled Pairs") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/tallest-billboard "Tallest Billboard") +[Next >](../tallest-billboard "Tallest Billboard") ## [955. Delete Columns to Make Sorted II (Medium)](https://leetcode.com/problems/delete-columns-to-make-sorted-ii "删列造序 II") @@ -81,4 +81,4 @@ We have to delete every column. ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] + [[Greedy](../../tag/greedy/README.md)] diff --git a/problems/delete-columns-to-make-sorted-iii/README.md b/problems/delete-columns-to-make-sorted-iii/README.md index 380e6d1d0..36088fa3b 100644 --- a/problems/delete-columns-to-make-sorted-iii/README.md +++ b/problems/delete-columns-to-make-sorted-iii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/regions-cut-by-slashes "Regions Cut By Slashes") +[< Previous](../regions-cut-by-slashes "Regions Cut By Slashes") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/n-repeated-element-in-size-2n-array "N-Repeated Element in Size 2N Array") +[Next >](../n-repeated-element-in-size-2n-array "N-Repeated Element in Size 2N Array") ## [960. Delete Columns to Make Sorted III (Hard)](https://leetcode.com/problems/delete-columns-to-make-sorted-iii "删列造序 III") @@ -67,4 +67,4 @@ Note that A[0] > A[1] - the array A isn't necessarily in lexicographic or ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/delete-columns-to-make-sorted/README.md b/problems/delete-columns-to-make-sorted/README.md index 88f9e2efe..8c8aef867 100644 --- a/problems/delete-columns-to-make-sorted/README.md +++ b/problems/delete-columns-to-make-sorted/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-the-shortest-superstring "Find the Shortest Superstring") +[< Previous](../find-the-shortest-superstring "Find the Shortest Superstring") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-increment-to-make-array-unique "Minimum Increment to Make Array Unique") +[Next >](../minimum-increment-to-make-array-unique "Minimum Increment to Make Array Unique") ## [944. Delete Columns to Make Sorted (Easy)](https://leetcode.com/problems/delete-columns-to-make-sorted "删列造序") @@ -65,4 +65,4 @@ If we chose D = {}, then a column ["b","a","h"] wo ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] + [[Greedy](../../tag/greedy/README.md)] diff --git a/problems/delete-duplicate-emails/README.md b/problems/delete-duplicate-emails/README.md index 514ecc93e..43a4a9fda 100644 --- a/problems/delete-duplicate-emails/README.md +++ b/problems/delete-duplicate-emails/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/tenth-line "Tenth Line") +[< Previous](../tenth-line "Tenth Line") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/rising-temperature "Rising Temperature") +[Next >](../rising-temperature "Rising Temperature") ## [196. Delete Duplicate Emails (Easy)](https://leetcode.com/problems/delete-duplicate-emails "删除重复的电子邮箱") diff --git a/problems/delete-node-in-a-bst/README.md b/problems/delete-node-in-a-bst/README.md index 6921e541f..0381b48dd 100644 --- a/problems/delete-node-in-a-bst/README.md +++ b/problems/delete-node-in-a-bst/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-bst "Serialize and Deserialize BST") +[< Previous](../serialize-and-deserialize-bst "Serialize and Deserialize BST") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/sort-characters-by-frequency "Sort Characters By Frequency") +[Next >](../sort-characters-by-frequency "Sort Characters By Frequency") ## [450. Delete Node in a BST (Medium)](https://leetcode.com/problems/delete-node-in-a-bst "删除二叉搜索树中的节点") @@ -54,7 +54,7 @@ Another valid answer is [5,2,6,null,4,null,7].

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] ### Similar Questions - 1. [Split BST](https://github.com/openset/leetcode/tree/master/problems/split-bst) (Medium) + 1. [Split BST](../split-bst) (Medium) diff --git a/problems/delete-node-in-a-linked-list/README.md b/problems/delete-node-in-a-linked-list/README.md index 5df329c78..13e7acb62 100644 --- a/problems/delete-node-in-a-linked-list/README.md +++ b/problems/delete-node-in-a-linked-list/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/lowest-common-ancestor-of-a-binary-tree "Lowest Common Ancestor of a Binary Tree") +[< Previous](../lowest-common-ancestor-of-a-binary-tree "Lowest Common Ancestor of a Binary Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/product-of-array-except-self "Product of Array Except Self") +[Next >](../product-of-array-except-self "Product of Array Except Self") ## [237. Delete Node in a Linked List (Easy)](https://leetcode.com/problems/delete-node-in-a-linked-list "删除链表中的节点") @@ -47,7 +47,7 @@ ### Related Topics - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] + [[Linked List](../../tag/linked-list/README.md)] ### Similar Questions - 1. [Remove Linked List Elements](https://github.com/openset/leetcode/tree/master/problems/remove-linked-list-elements) (Easy) + 1. [Remove Linked List Elements](../remove-linked-list-elements) (Easy) diff --git a/problems/delete-nodes-and-return-forest/README.md b/problems/delete-nodes-and-return-forest/README.md index f6c02ef41..5f6290874 100644 --- a/problems/delete-nodes-and-return-forest/README.md +++ b/problems/delete-nodes-and-return-forest/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/corporate-flight-bookings "Corporate Flight Bookings") +[< Previous](../corporate-flight-bookings "Corporate Flight Bookings") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-nesting-depth-of-two-valid-parentheses-strings "Maximum Nesting Depth of Two Valid Parentheses Strings") +[Next >](../maximum-nesting-depth-of-two-valid-parentheses-strings "Maximum Nesting Depth of Two Valid Parentheses Strings") ## [1110. Delete Nodes And Return Forest (Medium)](https://leetcode.com/problems/delete-nodes-and-return-forest "删点成林") @@ -38,5 +38,5 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] diff --git a/problems/delete-operation-for-two-strings/README.md b/problems/delete-operation-for-two-strings/README.md index 87566b336..436c2977a 100644 --- a/problems/delete-operation-for-two-strings/README.md +++ b/problems/delete-operation-for-two-strings/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/kill-process "Kill Process") +[< Previous](../kill-process "Kill Process") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-customer-referee "Find Customer Referee") +[Next >](../find-customer-referee "Find Customer Referee") ## [583. Delete Operation for Two Strings (Medium)](https://leetcode.com/problems/delete-operation-for-two-strings "两个字符串的删除操作") @@ -31,8 +31,8 @@ Given two words word1 and word2, find the minimum number of steps

### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Edit Distance](https://github.com/openset/leetcode/tree/master/problems/edit-distance) (Hard) - 1. [Minimum ASCII Delete Sum for Two Strings](https://github.com/openset/leetcode/tree/master/problems/minimum-ascii-delete-sum-for-two-strings) (Medium) + 1. [Edit Distance](../edit-distance) (Hard) + 1. [Minimum ASCII Delete Sum for Two Strings](../minimum-ascii-delete-sum-for-two-strings) (Medium) diff --git a/problems/delete-tree-nodes/README.md b/problems/delete-tree-nodes/README.md index 4ad510520..010ab41e2 100644 --- a/problems/delete-tree-nodes/README.md +++ b/problems/delete-tree-nodes/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/remove-interval "Remove Interval") +[< Previous](../remove-interval "Remove Interval") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-ships-in-a-rectangle "Number of Ships in a Rectangle") +[Next >](../number-of-ships-in-a-rectangle "Number of Ships in a Rectangle") ## [1273. Delete Tree Nodes (Medium)](https://leetcode.com/problems/delete-tree-nodes "删除树节点") @@ -44,8 +44,8 @@ ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/department-highest-salary/README.md b/problems/department-highest-salary/README.md index 4e64bd78b..f96e6c0e6 100644 --- a/problems/department-highest-salary/README.md +++ b/problems/department-highest-salary/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/customers-who-never-order "Customers Who Never Order") +[< Previous](../customers-who-never-order "Customers Who Never Order") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/department-top-three-salaries "Department Top Three Salaries") +[Next >](../department-top-three-salaries "Department Top Three Salaries") ## [184. Department Highest Salary (Medium)](https://leetcode.com/problems/department-highest-salary "部门工资最高的员工") diff --git a/problems/department-top-three-salaries/README.md b/problems/department-top-three-salaries/README.md index 98fb00201..bf38afcb1 100644 --- a/problems/department-top-three-salaries/README.md +++ b/problems/department-top-three-salaries/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/department-highest-salary "Department Highest Salary") +[< Previous](../department-highest-salary "Department Highest Salary") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/reverse-words-in-a-string-ii "Reverse Words in a String II") +[Next >](../reverse-words-in-a-string-ii "Reverse Words in a String II") ## [185. Department Top Three Salaries (Hard)](https://leetcode.com/problems/department-top-three-salaries "部门工资前三高的所有员工") diff --git a/problems/design-a-leaderboard/README.md b/problems/design-a-leaderboard/README.md index 528efa17b..d00c749ae 100644 --- a/problems/design-a-leaderboard/README.md +++ b/problems/design-a-leaderboard/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/array-transformation "Array Transformation") +[< Previous](../array-transformation "Array Transformation") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/tree-diameter "Tree Diameter") +[Next >](../tree-diameter "Tree Diameter") ## [1244. Design A Leaderboard (Medium)](https://leetcode.com/problems/design-a-leaderboard "力扣排行榜") @@ -56,9 +56,9 @@ leaderboard.top(3); // returns 141 = 51 + 51 + 39; ### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Sort](../../tag/sort/README.md)] + [[Design](../../tag/design/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Hints
diff --git a/problems/design-bounded-blocking-queue/README.md b/problems/design-bounded-blocking-queue/README.md index cd41fa0cd..8c53985e3 100644 --- a/problems/design-bounded-blocking-queue/README.md +++ b/problems/design-bounded-blocking-queue/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/make-array-strictly-increasing "Make Array Strictly Increasing") +[< Previous](../make-array-strictly-increasing "Make Array Strictly Increasing") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-number-of-balloons "Maximum Number of Balloons") +[Next >](../maximum-number-of-balloons "Maximum Number of Balloons") ## [1188. Design Bounded Blocking Queue (Medium)](https://leetcode.com/problems/design-bounded-blocking-queue "设计有限阻塞队列") diff --git a/problems/design-circular-deque/README.md b/problems/design-circular-deque/README.md index d35aa282f..82da33739 100644 --- a/problems/design-circular-deque/README.md +++ b/problems/design-circular-deque/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/solve-the-equation "Solve the Equation") +[< Previous](../solve-the-equation "Solve the Equation") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/design-search-autocomplete-system "Design Search Autocomplete System") +[Next >](../design-search-autocomplete-system "Design Search Autocomplete System") ## [641. Design Circular Deque (Medium)](https://leetcode.com/problems/design-circular-deque "设计循环双端队列") @@ -55,8 +55,8 @@ circularDeque.getFront(); // return 4 ### Related Topics - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] - [[Queue](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)] + [[Design](../../tag/design/README.md)] + [[Queue](../../tag/queue/README.md)] ### Similar Questions - 1. [Design Circular Queue](https://github.com/openset/leetcode/tree/master/problems/design-circular-queue) (Medium) + 1. [Design Circular Queue](../design-circular-queue) (Medium) diff --git a/problems/design-circular-queue/README.md b/problems/design-circular-queue/README.md index d87c12783..5d16b4293 100644 --- a/problems/design-circular-queue/README.md +++ b/problems/design-circular-queue/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/task-scheduler "Task Scheduler") +[< Previous](../task-scheduler "Task Scheduler") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/add-one-row-to-tree "Add One Row to Tree") +[Next >](../add-one-row-to-tree "Add One Row to Tree") ## [622. Design Circular Queue (Medium)](https://leetcode.com/problems/design-circular-queue "设计循环队列") @@ -54,8 +54,8 @@ circularQueue.Rear();  // return 4 ### Related Topics - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] - [[Queue](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)] + [[Design](../../tag/design/README.md)] + [[Queue](../../tag/queue/README.md)] ### Similar Questions - 1. [Design Circular Deque](https://github.com/openset/leetcode/tree/master/problems/design-circular-deque) (Medium) + 1. [Design Circular Deque](../design-circular-deque) (Medium) diff --git a/problems/design-compressed-string-iterator/README.md b/problems/design-compressed-string-iterator/README.md index 03cb95090..c8278cf05 100644 --- a/problems/design-compressed-string-iterator/README.md +++ b/problems/design-compressed-string-iterator/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/consecutive-available-seats "Consecutive Available Seats") +[< Previous](../consecutive-available-seats "Consecutive Available Seats") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/can-place-flowers "Can Place Flowers") +[Next >](../can-place-flowers "Can Place Flowers") ## [604. Design Compressed String Iterator (Easy)](https://leetcode.com/problems/design-compressed-string-iterator "迭代压缩字符串") @@ -49,8 +49,8 @@ iterator.next(); // return ' '

### Related Topics - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] + [[Design](../../tag/design/README.md)] ### Similar Questions - 1. [LRU Cache](https://github.com/openset/leetcode/tree/master/problems/lru-cache) (Medium) - 1. [String Compression](https://github.com/openset/leetcode/tree/master/problems/string-compression) (Easy) + 1. [LRU Cache](../lru-cache) (Medium) + 1. [String Compression](../string-compression) (Easy) diff --git a/problems/design-excel-sum-formula/README.md b/problems/design-excel-sum-formula/README.md index 0a8d8d7ab..e307a1d0a 100644 --- a/problems/design-excel-sum-formula/README.md +++ b/problems/design-excel-sum-formula/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/course-schedule-iii "Course Schedule III") +[< Previous](../course-schedule-iii "Course Schedule III") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/smallest-range-covering-elements-from-k-lists "Smallest Range Covering Elements from K Lists") +[Next >](../smallest-range-covering-elements-from-k-lists "Smallest Range Covering Elements from K Lists") ## [631. Design Excel Sum Formula (Hard)](https://leetcode.com/problems/design-excel-sum-formula "设计 Excel 求和公式") @@ -70,4 +70,4 @@ Set(2, "B", 2);

### Related Topics - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] + [[Design](../../tag/design/README.md)] diff --git a/problems/design-file-system/README.md b/problems/design-file-system/README.md index 171073d9b..7f00a7862 100644 --- a/problems/design-file-system/README.md +++ b/problems/design-file-system/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/single-row-keyboard "Single-Row Keyboard") +[< Previous](../single-row-keyboard "Single-Row Keyboard") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-cost-to-connect-sticks "Minimum Cost to Connect Sticks") +[Next >](../minimum-cost-to-connect-sticks "Minimum Cost to Connect Sticks") ## [1166. Design File System (Medium)](https://leetcode.com/problems/design-file-system "设计文件系统") @@ -70,8 +70,8 @@ fileSystem.get("/c"); // return -1 because this path doesn't exist

NOTE: create method has been changed on August 29, 2019 to createPath. Please reset to default code definition to get new method signature.

### Related Topics - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Design](../../tag/design/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Hints
diff --git a/problems/design-hashmap/README.md b/problems/design-hashmap/README.md index 6a547f5e4..1bcfdc4ac 100644 --- a/problems/design-hashmap/README.md +++ b/problems/design-hashmap/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/design-hashset "Design HashSet") +[< Previous](../design-hashset "Design HashSet") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/design-linked-list "Design Linked List") +[Next >](../design-linked-list "Design Linked List") ## [706. Design HashMap (Easy)](https://leetcode.com/problems/design-hashmap "设计哈希映射") @@ -46,8 +46,8 @@ hashMap.get(2);            // returns -1 (not foun ### Related Topics - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Design](../../tag/design/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Design HashSet](https://github.com/openset/leetcode/tree/master/problems/design-hashset) (Easy) + 1. [Design HashSet](../design-hashset) (Easy) diff --git a/problems/design-hashset/README.md b/problems/design-hashset/README.md index f2167ee1a..4af6db33c 100644 --- a/problems/design-hashset/README.md +++ b/problems/design-hashset/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/binary-search "Binary Search") +[< Previous](../binary-search "Binary Search") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/design-hashmap "Design HashMap") +[Next >](../design-hashmap "Design HashMap") ## [705. Design HashSet (Easy)](https://leetcode.com/problems/design-hashset "设计哈希集合") @@ -46,8 +46,8 @@ hashSet.contains(2);    // returns false (already removed) ### Related Topics - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Design](../../tag/design/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Design HashMap](https://github.com/openset/leetcode/tree/master/problems/design-hashmap) (Easy) + 1. [Design HashMap](../design-hashmap) (Easy) diff --git a/problems/design-hit-counter/README.md b/problems/design-hit-counter/README.md index 72a77a44e..d7eff4a9f 100644 --- a/problems/design-hit-counter/README.md +++ b/problems/design-hit-counter/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/bomb-enemy "Bomb Enemy") +[< Previous](../bomb-enemy "Bomb Enemy") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/max-sum-of-rectangle-no-larger-than-k "Max Sum of Rectangle No Larger Than K") +[Next >](../max-sum-of-rectangle-no-larger-than-k "Max Sum of Rectangle No Larger Than K") ## [362. Design Hit Counter (Medium)](https://leetcode.com/problems/design-hit-counter "敲击计数器") @@ -48,7 +48,7 @@ counter.getHits(301); What if the number of hits per second could be very large? Does your design scale?

### Related Topics - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] + [[Design](../../tag/design/README.md)] ### Similar Questions - 1. [Logger Rate Limiter](https://github.com/openset/leetcode/tree/master/problems/logger-rate-limiter) (Easy) + 1. [Logger Rate Limiter](../logger-rate-limiter) (Easy) diff --git a/problems/design-in-memory-file-system/README.md b/problems/design-in-memory-file-system/README.md index c4650d754..c9e5b7e6a 100644 --- a/problems/design-in-memory-file-system/README.md +++ b/problems/design-in-memory-file-system/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/erect-the-fence "Erect the Fence") +[< Previous](../erect-the-fence "Erect the Fence") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-preorder-traversal "N-ary Tree Preorder Traversal") +[Next >](../n-ary-tree-preorder-traversal "N-ary Tree Preorder Traversal") ## [588. Design In-Memory File System (Hard)](https://leetcode.com/problems/design-in-memory-file-system "设计内存文件系统") @@ -47,9 +47,9 @@ ### Related Topics - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] + [[Design](../../tag/design/README.md)] ### Similar Questions - 1. [LRU Cache](https://github.com/openset/leetcode/tree/master/problems/lru-cache) (Medium) - 1. [LFU Cache](https://github.com/openset/leetcode/tree/master/problems/lfu-cache) (Hard) - 1. [Design Log Storage System](https://github.com/openset/leetcode/tree/master/problems/design-log-storage-system) (Medium) + 1. [LRU Cache](../lru-cache) (Medium) + 1. [LFU Cache](../lfu-cache) (Hard) + 1. [Design Log Storage System](../design-log-storage-system) (Medium) diff --git a/problems/design-linked-list/README.md b/problems/design-linked-list/README.md index 8bf14e22f..c4f46cc65 100644 --- a/problems/design-linked-list/README.md +++ b/problems/design-linked-list/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/design-hashmap "Design HashMap") +[< Previous](../design-hashmap "Design HashMap") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/insert-into-a-sorted-circular-linked-list "Insert into a Sorted Circular Linked List") +[Next >](../insert-into-a-sorted-circular-linked-list "Insert into a Sorted Circular Linked List") ## [707. Design Linked List (Medium)](https://leetcode.com/problems/design-linked-list "设计链表") @@ -54,5 +54,5 @@ linkedList.get(1);    // returns 3 ### Related Topics - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] + [[Design](../../tag/design/README.md)] + [[Linked List](../../tag/linked-list/README.md)] diff --git a/problems/design-log-storage-system/README.md b/problems/design-log-storage-system/README.md index 3f4cf123c..811050b29 100644 --- a/problems/design-log-storage-system/README.md +++ b/problems/design-log-storage-system/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-the-derangement-of-an-array "Find the Derangement of An Array") +[< Previous](../find-the-derangement-of-an-array "Find the Derangement of An Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/exclusive-time-of-functions "Exclusive Time of Functions") +[Next >](../exclusive-time-of-functions "Exclusive Time of Functions") ## [635. Design Log Storage System (Medium)](https://leetcode.com/problems/design-log-storage-system "设计日志存储系统") @@ -38,8 +38,8 @@ retrieve("2016:01:01:01:01:01","2017:01:01:23:00:00","Hour"); // return [1,2], b

### Related Topics - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Design](../../tag/design/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Design In-Memory File System](https://github.com/openset/leetcode/tree/master/problems/design-in-memory-file-system) (Hard) + 1. [Design In-Memory File System](../design-in-memory-file-system) (Hard) diff --git a/problems/design-phone-directory/README.md b/problems/design-phone-directory/README.md index 8bd0f632c..399850809 100644 --- a/problems/design-phone-directory/README.md +++ b/problems/design-phone-directory/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-element-in-a-sorted-matrix "Kth Smallest Element in a Sorted Matrix") +[< Previous](../kth-smallest-element-in-a-sorted-matrix "Kth Smallest Element in a Sorted Matrix") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/insert-delete-getrandom-o1 "Insert Delete GetRandom O(1)") +[Next >](../insert-delete-getrandom-o1 "Insert Delete GetRandom O(1)") ## [379. Design Phone Directory (Medium)](https://leetcode.com/problems/design-phone-directory "电话目录管理系统") @@ -50,5 +50,5 @@ directory.check(2);

### Related Topics - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] + [[Design](../../tag/design/README.md)] + [[Linked List](../../tag/linked-list/README.md)] diff --git a/problems/design-search-autocomplete-system/README.md b/problems/design-search-autocomplete-system/README.md index 85cf6052a..d15189b63 100644 --- a/problems/design-search-autocomplete-system/README.md +++ b/problems/design-search-autocomplete-system/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/design-circular-deque "Design Circular Deque") +[< Previous](../design-circular-deque "Design Circular Deque") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-average-subarray-i "Maximum Average Subarray I") +[Next >](../maximum-average-subarray-i "Maximum Average Subarray I") ## [642. Design Search Autocomplete System (Hard)](https://leetcode.com/problems/design-search-autocomplete-system "设计搜索自动补全系统") @@ -73,8 +73,8 @@ The user finished the input, the sentence "i a" should be

 

### Related Topics - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] - [[Trie](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] + [[Design](../../tag/design/README.md)] + [[Trie](../../tag/trie/README.md)] ### Similar Questions - 1. [Implement Trie (Prefix Tree)](https://github.com/openset/leetcode/tree/master/problems/implement-trie-prefix-tree) (Medium) + 1. [Implement Trie (Prefix Tree)](../implement-trie-prefix-tree) (Medium) diff --git a/problems/design-skiplist/README.md b/problems/design-skiplist/README.md index be697f676..dc479dc8d 100644 --- a/problems/design-skiplist/README.md +++ b/problems/design-skiplist/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/monthly-transactions-ii "Monthly Transactions II") +[< Previous](../monthly-transactions-ii "Monthly Transactions II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/unique-number-of-occurrences "Unique Number of Occurrences") +[Next >](../unique-number-of-occurrences "Unique Number of Occurrences") ## [1206. Design Skiplist (Hard)](https://leetcode.com/problems/design-skiplist "设计跳表") @@ -60,4 +60,4 @@ skiplist.search(1); // return false, 1 has already been erased. ### Related Topics - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] + [[Design](../../tag/design/README.md)] diff --git a/problems/design-snake-game/README.md b/problems/design-snake-game/README.md index b55872a0f..521e549f0 100644 --- a/problems/design-snake-game/README.md +++ b/problems/design-snake-game/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/data-stream-as-disjoint-intervals "Data Stream as Disjoint Intervals") +[< Previous](../data-stream-as-disjoint-intervals "Data Stream as Disjoint Intervals") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/russian-doll-envelopes "Russian Doll Envelopes") +[Next >](../russian-doll-envelopes "Russian Doll Envelopes") ## [353. Design Snake Game (Medium)](https://leetcode.com/problems/design-snake-game "贪吃蛇") @@ -62,5 +62,5 @@ snake.move("U"); -> Returns -1 (Game over because snake collides wi ### Related Topics - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] - [[Queue](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)] + [[Design](../../tag/design/README.md)] + [[Queue](../../tag/queue/README.md)] diff --git a/problems/design-tic-tac-toe/README.md b/problems/design-tic-tac-toe/README.md index 373fc1faf..46731adcc 100644 --- a/problems/design-tic-tac-toe/README.md +++ b/problems/design-tic-tac-toe/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/top-k-frequent-elements "Top K Frequent Elements") +[< Previous](../top-k-frequent-elements "Top K Frequent Elements") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-arrays "Intersection of Two Arrays") +[Next >](../intersection-of-two-arrays "Intersection of Two Arrays") ## [348. Design Tic-Tac-Toe (Medium)](https://leetcode.com/problems/design-tic-tac-toe "判定井字棋胜负") @@ -70,10 +70,10 @@ Could you do better than O(n2) per move() operati

### Related Topics - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] + [[Design](../../tag/design/README.md)] ### Similar Questions - 1. [Valid Tic-Tac-Toe State](https://github.com/openset/leetcode/tree/master/problems/valid-tic-tac-toe-state) (Medium) + 1. [Valid Tic-Tac-Toe State](../valid-tic-tac-toe-state) (Medium) ### Hints
diff --git a/problems/design-twitter/README.md b/problems/design-twitter/README.md index 3542ae84d..c1ad18065 100644 --- a/problems/design-twitter/README.md +++ b/problems/design-twitter/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/russian-doll-envelopes "Russian Doll Envelopes") +[< Previous](../russian-doll-envelopes "Russian Doll Envelopes") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/line-reflection "Line Reflection") +[Next >](../line-reflection "Line Reflection") ## [355. Design Twitter (Medium)](https://leetcode.com/problems/design-twitter "设计推特") @@ -52,6 +52,6 @@ twitter.getNewsFeed(1);

### Related Topics - [[Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Heap](../../tag/heap/README.md)] + [[Design](../../tag/design/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] diff --git a/problems/detect-capital/README.md b/problems/detect-capital/README.md index dcfa152ea..8a644ef49 100644 --- a/problems/detect-capital/README.md +++ b/problems/detect-capital/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/random-flip-matrix "Random Flip Matrix") +[< Previous](../random-flip-matrix "Random Flip Matrix") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/longest-uncommon-subsequence-i "Longest Uncommon Subsequence I ") +[Next >](../longest-uncommon-subsequence-i "Longest Uncommon Subsequence I ") ## [520. Detect Capital (Easy)](https://leetcode.com/problems/detect-capital "检测大写字母") @@ -45,4 +45,4 @@ Otherwise, we define that this word doesn't use capitals in a right way.

Note: The input will be a non-empty word consisting of uppercase and lowercase latin letters.

### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/di-string-match/README.md b/problems/di-string-match/README.md index 904142157..527e1f1d2 100644 --- a/problems/di-string-match/README.md +++ b/problems/di-string-match/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/valid-mountain-array "Valid Mountain Array") +[< Previous](../valid-mountain-array "Valid Mountain Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-the-shortest-superstring "Find the Shortest Superstring") +[Next >](../find-the-shortest-superstring "Find the Shortest Superstring") ## [942. DI String Match (Easy)](https://leetcode.com/problems/di-string-match "增减字符串匹配") @@ -56,4 +56,4 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/diagonal-traverse/README.md b/problems/diagonal-traverse/README.md index 73dc3c5b7..85827a28b 100644 --- a/problems/diagonal-traverse/README.md +++ b/problems/diagonal-traverse/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/random-point-in-non-overlapping-rectangles "Random Point in Non-overlapping Rectangles") +[< Previous](../random-point-in-non-overlapping-rectangles "Random Point in Non-overlapping Rectangles") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/the-maze-iii "The Maze III") +[Next >](../the-maze-iii "The Maze III") ## [498. Diagonal Traverse (Medium)](https://leetcode.com/problems/diagonal-traverse "对角线遍历") diff --git a/problems/diameter-of-binary-tree/README.md b/problems/diameter-of-binary-tree/README.md index 43408cbaf..9a717ccc8 100644 --- a/problems/diameter-of-binary-tree/README.md +++ b/problems/diameter-of-binary-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/01-matrix "01 Matrix") +[< Previous](../01-matrix "01 Matrix") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/output-contest-matches "Output Contest Matches") +[Next >](../output-contest-matches "Output Contest Matches") ## [543. Diameter of Binary Tree (Easy)](https://leetcode.com/problems/diameter-of-binary-tree "二叉树的直径") @@ -35,4 +35,4 @@ The length of path between two nodes is represented by the number of edges betwe

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] diff --git a/problems/dice-roll-simulation/README.md b/problems/dice-roll-simulation/README.md index 046ad67e1..f85ae8d84 100644 --- a/problems/dice-roll-simulation/README.md +++ b/problems/dice-roll-simulation/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/queens-that-can-attack-the-king "Queens That Can Attack the King") +[< Previous](../queens-that-can-attack-the-king "Queens That Can Attack the King") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-equal-frequency "Maximum Equal Frequency") +[Next >](../maximum-equal-frequency "Maximum Equal Frequency") ## [1223. Dice Roll Simulation (Medium)](https://leetcode.com/problems/dice-roll-simulation "掷骰子模拟") @@ -50,7 +50,7 @@ ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/diet-plan-performance/README.md b/problems/diet-plan-performance/README.md index c6d6531de..e13b90c53 100644 --- a/problems/diet-plan-performance/README.md +++ b/problems/diet-plan-performance/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/prime-arrangements "Prime Arrangements") +[< Previous](../prime-arrangements "Prime Arrangements") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/can-make-palindrome-from-substring "Can Make Palindrome from Substring") +[Next >](../can-make-palindrome-from-substring "Can Make Palindrome from Substring") ## [1176. Diet Plan Performance (Easy)](https://leetcode.com/problems/diet-plan-performance "健身计划评估") @@ -57,8 +57,8 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] + [[Array](../../tag/array/README.md)] + [[Sliding Window](../../tag/sliding-window/README.md)] ### Hints
diff --git a/problems/different-ways-to-add-parentheses/README.md b/problems/different-ways-to-add-parentheses/README.md index 3fe8d055a..270723339 100644 --- a/problems/different-ways-to-add-parentheses/README.md +++ b/problems/different-ways-to-add-parentheses/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/search-a-2d-matrix-ii "Search a 2D Matrix II") +[< Previous](../search-a-2d-matrix-ii "Search a 2D Matrix II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/valid-anagram "Valid Anagram") +[Next >](../valid-anagram "Valid Anagram") ## [241. Different Ways to Add Parentheses (Medium)](https://leetcode.com/problems/different-ways-to-add-parentheses "为运算表达式设计优先级") @@ -36,9 +36,9 @@ ### Related Topics - [[Divide and Conquer](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] + [[Divide and Conquer](../../tag/divide-and-conquer/README.md)] ### Similar Questions - 1. [Unique Binary Search Trees II](https://github.com/openset/leetcode/tree/master/problems/unique-binary-search-trees-ii) (Medium) - 1. [Basic Calculator](https://github.com/openset/leetcode/tree/master/problems/basic-calculator) (Hard) - 1. [Expression Add Operators](https://github.com/openset/leetcode/tree/master/problems/expression-add-operators) (Hard) + 1. [Unique Binary Search Trees II](../unique-binary-search-trees-ii) (Medium) + 1. [Basic Calculator](../basic-calculator) (Hard) + 1. [Expression Add Operators](../expression-add-operators) (Hard) diff --git a/problems/digit-count-in-range/README.md b/problems/digit-count-in-range/README.md index 0864f21b9..144467f1b 100644 --- a/problems/digit-count-in-range/README.md +++ b/problems/digit-count-in-range/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/campus-bikes-ii "Campus Bikes II") +[< Previous](../campus-bikes-ii "Campus Bikes II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/product-sales-analysis-i "Product Sales Analysis I") +[Next >](../product-sales-analysis-i "Product Sales Analysis I") ## [1067. Digit Count in Range (Hard)](https://leetcode.com/problems/digit-count-in-range "范围内的数字计数") @@ -44,11 +44,11 @@ The digit d=3 occurs 35 times in 103,113,123,130 ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Math](../../tag/math/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Number of Digit One](https://github.com/openset/leetcode/tree/master/problems/number-of-digit-one) (Hard) + 1. [Number of Digit One](../number-of-digit-one) (Hard) ### Hints
diff --git a/problems/dinner-plate-stacks/README.md b/problems/dinner-plate-stacks/README.md index 60f18c04f..8c1578558 100644 --- a/problems/dinner-plate-stacks/README.md +++ b/problems/dinner-plate-stacks/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/remove-zero-sum-consecutive-nodes-from-linked-list "Remove Zero Sum Consecutive Nodes from Linked List") +[< Previous](../remove-zero-sum-consecutive-nodes-from-linked-list "Remove Zero Sum Consecutive Nodes from Linked List") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/immediate-food-delivery-i "Immediate Food Delivery I") +[Next >](../immediate-food-delivery-i "Immediate Food Delivery I") ## [1172. Dinner Plate Stacks (Hard)](https://leetcode.com/problems/dinner-plate-stacks "餐盘栈") @@ -77,7 +77,7 @@ D.pop() // Returns -1. There are still no stacks. ### Related Topics - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] + [[Design](../../tag/design/README.md)] ### Hints
diff --git a/problems/distance-between-bus-stops/README.md b/problems/distance-between-bus-stops/README.md index 5cc1a7a56..1d919d552 100644 --- a/problems/distance-between-bus-stops/README.md +++ b/problems/distance-between-bus-stops/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-number-of-ones "Maximum Number of Ones") +[< Previous](../maximum-number-of-ones "Maximum Number of Ones") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/day-of-the-week "Day of the Week") +[Next >](../day-of-the-week "Day of the Week") ## [1184. Distance Between Bus Stops (Easy)](https://leetcode.com/problems/distance-between-bus-stops "公交站间的距离") @@ -62,7 +62,7 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Hints
diff --git a/problems/distant-barcodes/README.md b/problems/distant-barcodes/README.md index bc984cc96..b77e33d66 100644 --- a/problems/distant-barcodes/README.md +++ b/problems/distant-barcodes/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/previous-permutation-with-one-swap "Previous Permutation With One Swap") +[< Previous](../previous-permutation-with-one-swap "Previous Permutation With One Swap") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/shortest-way-to-form-string "Shortest Way to Form String") +[Next >](../shortest-way-to-form-string "Shortest Way to Form String") ## [1054. Distant Barcodes (Medium)](https://leetcode.com/problems/distant-barcodes "距离相等的条形码") @@ -46,8 +46,8 @@ ### Related Topics - [[Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] + [[Heap](../../tag/heap/README.md)] + [[Sort](../../tag/sort/README.md)] ### Hints
diff --git a/problems/distinct-subsequences-ii/README.md b/problems/distinct-subsequences-ii/README.md index c72aa44f6..5ae9d2f70 100644 --- a/problems/distinct-subsequences-ii/README.md +++ b/problems/distinct-subsequences-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-area-rectangle "Minimum Area Rectangle") +[< Previous](../minimum-area-rectangle "Minimum Area Rectangle") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/valid-mountain-array "Valid Mountain Array") +[Next >](../valid-mountain-array "Valid Mountain Array") ## [940. Distinct Subsequences II (Hard)](https://leetcode.com/problems/distinct-subsequences-ii "不同的子序列 II") @@ -65,4 +65,4 @@ ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/distinct-subsequences/README.md b/problems/distinct-subsequences/README.md index 9ba9a29ed..5a7804750 100644 --- a/problems/distinct-subsequences/README.md +++ b/problems/distinct-subsequences/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/flatten-binary-tree-to-linked-list "Flatten Binary Tree to Linked List") +[< Previous](../flatten-binary-tree-to-linked-list "Flatten Binary Tree to Linked List") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/populating-next-right-pointers-in-each-node "Populating Next Right Pointers in Each Node") +[Next >](../populating-next-right-pointers-in-each-node "Populating Next Right Pointers in Each Node") ## [115. Distinct Subsequences (Hard)](https://leetcode.com/problems/distinct-subsequences "不同的子序列") @@ -56,5 +56,5 @@ As shown below, there are 5 ways you can generate "bag" from S. ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[String](../../tag/string/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/distribute-candies-to-people/README.md b/problems/distribute-candies-to-people/README.md index a40be9024..7ee31f1d3 100644 --- a/problems/distribute-candies-to-people/README.md +++ b/problems/distribute-candies-to-people/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/path-with-maximum-minimum-value "Path With Maximum Minimum Value") +[< Previous](../path-with-maximum-minimum-value "Path With Maximum Minimum Value") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/path-in-zigzag-labelled-binary-tree "Path In Zigzag Labelled Binary Tree") +[Next >](../path-in-zigzag-labelled-binary-tree "Path In Zigzag Labelled Binary Tree") ## [1103. Distribute Candies to People (Easy)](https://leetcode.com/problems/distribute-candies-to-people "分糖果 II") @@ -55,7 +55,7 @@ On the fourth turn, ans[0] += 4, and the final array is [5,2,3]. ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Hints
diff --git a/problems/distribute-candies/README.md b/problems/distribute-candies/README.md index 7d5cb2f31..38dff1ca2 100644 --- a/problems/distribute-candies/README.md +++ b/problems/distribute-candies/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/winning-candidate "Winning Candidate") +[< Previous](../winning-candidate "Winning Candidate") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/out-of-boundary-paths "Out of Boundary Paths") +[Next >](../out-of-boundary-paths "Out of Boundary Paths") ## [575. Distribute Candies (Easy)](https://leetcode.com/problems/distribute-candies "分糖果") @@ -41,7 +41,7 @@ The sister has two different kinds of candies, the brother has only one kind of

### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Hints
diff --git a/problems/distribute-coins-in-binary-tree/README.md b/problems/distribute-coins-in-binary-tree/README.md index 677a8a1ec..5a8d2fecc 100644 --- a/problems/distribute-coins-in-binary-tree/README.md +++ b/problems/distribute-coins-in-binary-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/longest-turbulent-subarray "Longest Turbulent Subarray") +[< Previous](../longest-turbulent-subarray "Longest Turbulent Subarray") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/unique-paths-iii "Unique Paths III") +[Next >](../unique-paths-iii "Unique Paths III") ## [979. Distribute Coins in Binary Tree (Medium)](https://leetcode.com/problems/distribute-coins-in-binary-tree "在二叉树中分配硬币") @@ -75,9 +75,9 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] ### Similar Questions - 1. [Sum of Distances in Tree](https://github.com/openset/leetcode/tree/master/problems/sum-of-distances-in-tree) (Hard) - 1. [Binary Tree Cameras](https://github.com/openset/leetcode/tree/master/problems/binary-tree-cameras) (Hard) + 1. [Sum of Distances in Tree](../sum-of-distances-in-tree) (Hard) + 1. [Binary Tree Cameras](../binary-tree-cameras) (Hard) diff --git a/problems/divide-array-into-increasing-sequences/README.md b/problems/divide-array-into-increasing-sequences/README.md index 2713bcd7d..b8e16c7d3 100644 --- a/problems/divide-array-into-increasing-sequences/README.md +++ b/problems/divide-array-into-increasing-sequences/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-average-subtree "Maximum Average Subtree") +[< Previous](../maximum-average-subtree "Maximum Average Subtree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/relative-sort-array "Relative Sort Array") +[Next >](../relative-sort-array "Relative Sort Array") ## [1121. Divide Array Into Increasing Sequences (Hard)](https://leetcode.com/problems/divide-array-into-increasing-sequences "将数组分成几个递增序列") @@ -44,7 +44,7 @@ There is no way to divide the array using the conditions required. ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Hints
diff --git a/problems/divide-chocolate/README.md b/problems/divide-chocolate/README.md index a3f3daf1a..b60367c17 100644 --- a/problems/divide-chocolate/README.md +++ b/problems/divide-chocolate/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/toss-strange-coins "Toss Strange Coins") +[< Previous](../toss-strange-coins "Toss Strange Coins") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/check-if-it-is-a-straight-line "Check If It Is a Straight Line") +[Next >](../check-if-it-is-a-straight-line "Check If It Is a Straight Line") ## [1231. Divide Chocolate (Hard)](https://leetcode.com/problems/divide-chocolate "分享巧克力") @@ -53,8 +53,8 @@ ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Hints
diff --git a/problems/divide-two-integers/README.md b/problems/divide-two-integers/README.md index 013767ec8..cc6d1c827 100644 --- a/problems/divide-two-integers/README.md +++ b/problems/divide-two-integers/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/implement-strstr "Implement strStr()") +[< Previous](../implement-strstr "Implement strStr()") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/substring-with-concatenation-of-all-words "Substring with Concatenation of All Words") +[Next >](../substring-with-concatenation-of-all-words "Substring with Concatenation of All Words") ## [29. Divide Two Integers (Medium)](https://leetcode.com/problems/divide-two-integers "两数相除") @@ -38,5 +38,5 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Math](../../tag/math/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] diff --git a/problems/divisor-game/README.md b/problems/divisor-game/README.md index d39492181..6b74ac26b 100644 --- a/problems/divisor-game/README.md +++ b/problems/divisor-game/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/video-stitching "Video Stitching") +[< Previous](../video-stitching "Video Stitching") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-difference-between-node-and-ancestor "Maximum Difference Between Node and Ancestor") +[Next >](../maximum-difference-between-node-and-ancestor "Maximum Difference Between Node and Ancestor") ## [1025. Divisor Game (Easy)](https://leetcode.com/problems/divisor-game "除数博弈") @@ -58,8 +58,8 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Math](../../tag/math/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/domino-and-tromino-tiling/README.md b/problems/domino-and-tromino-tiling/README.md index 67d8e276b..b469cb085 100644 --- a/problems/domino-and-tromino-tiling/README.md +++ b/problems/domino-and-tromino-tiling/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/escape-the-ghosts "Escape The Ghosts") +[< Previous](../escape-the-ghosts "Escape The Ghosts") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/custom-sort-string "Custom Sort String") +[Next >](../custom-sort-string "Custom Sort String") ## [790. Domino and Tromino Tiling (Medium)](https://leetcode.com/problems/domino-and-tromino-tiling "多米诺和托米诺平铺") @@ -43,4 +43,4 @@ XYZ YYZ XZZ XYY XXY

 

### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/dota2-senate/README.md b/problems/dota2-senate/README.md index e0a6664fa..f0bf806cb 100644 --- a/problems/dota2-senate/README.md +++ b/problems/dota2-senate/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/replace-words "Replace Words") +[< Previous](../replace-words "Replace Words") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/2-keys-keyboard "2 Keys Keyboard") +[Next >](../2-keys-keyboard "2 Keys Keyboard") ## [649. Dota2 Senate (Medium)](https://leetcode.com/problems/dota2-senate "Dota2 参议院") @@ -65,7 +65,7 @@ And in the round 2, the third senator can just announce the victory since he is

 

### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] + [[Greedy](../../tag/greedy/README.md)] ### Similar Questions - 1. [Teemo Attacking](https://github.com/openset/leetcode/tree/master/problems/teemo-attacking) (Medium) + 1. [Teemo Attacking](../teemo-attacking) (Medium) diff --git a/problems/dungeon-game/README.md b/problems/dungeon-game/README.md index 97a9a1adb..24582265b 100644 --- a/problems/dungeon-game/README.md +++ b/problems/dungeon-game/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/binary-search-tree-iterator "Binary Search Tree Iterator") +[< Previous](../binary-search-tree-iterator "Binary Search Tree Iterator") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/combine-two-tables "Combine Two Tables") +[Next >](../combine-two-tables "Combine Two Tables") ## [174. Dungeon Game (Hard)](https://leetcode.com/problems/dungeon-game "地下城游戏") @@ -55,10 +55,10 @@ ### Related Topics - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Unique Paths](https://github.com/openset/leetcode/tree/master/problems/unique-paths) (Medium) - 1. [Minimum Path Sum](https://github.com/openset/leetcode/tree/master/problems/minimum-path-sum) (Medium) - 1. [Cherry Pickup](https://github.com/openset/leetcode/tree/master/problems/cherry-pickup) (Hard) + 1. [Unique Paths](../unique-paths) (Medium) + 1. [Minimum Path Sum](../minimum-path-sum) (Medium) + 1. [Cherry Pickup](../cherry-pickup) (Hard) diff --git a/problems/duplicate-emails/README.md b/problems/duplicate-emails/README.md index 6c3c10853..3b3247fdc 100644 --- a/problems/duplicate-emails/README.md +++ b/problems/duplicate-emails/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/employees-earning-more-than-their-managers "Employees Earning More Than Their Managers") +[< Previous](../employees-earning-more-than-their-managers "Employees Earning More Than Their Managers") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/customers-who-never-order "Customers Who Never Order") +[Next >](../customers-who-never-order "Customers Who Never Order") ## [182. Duplicate Emails (Easy)](https://leetcode.com/problems/duplicate-emails "查找重复的电子邮箱") diff --git a/problems/duplicate-zeros/README.md b/problems/duplicate-zeros/README.md index 9856d288b..4799ee5dd 100644 --- a/problems/duplicate-zeros/README.md +++ b/problems/duplicate-zeros/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/confusing-number-ii "Confusing Number II") +[< Previous](../confusing-number-ii "Confusing Number II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/largest-values-from-labels "Largest Values From Labels") +[Next >](../largest-values-from-labels "Largest Values From Labels") ## [1089. Duplicate Zeros (Easy)](https://leetcode.com/problems/duplicate-zeros "复写零") @@ -45,7 +45,7 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Hints
diff --git a/problems/edit-distance/README.md b/problems/edit-distance/README.md index adaa032a4..140d75e55 100644 --- a/problems/edit-distance/README.md +++ b/problems/edit-distance/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/simplify-path "Simplify Path") +[< Previous](../simplify-path "Simplify Path") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/set-matrix-zeroes "Set Matrix Zeroes") +[Next >](../set-matrix-zeroes "Set Matrix Zeroes") ## [72. Edit Distance (Hard)](https://leetcode.com/problems/edit-distance "编辑距离") @@ -46,11 +46,11 @@ exection -> execution (insert 'u') ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[String](../../tag/string/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [One Edit Distance](https://github.com/openset/leetcode/tree/master/problems/one-edit-distance) (Medium) - 1. [Delete Operation for Two Strings](https://github.com/openset/leetcode/tree/master/problems/delete-operation-for-two-strings) (Medium) - 1. [Minimum ASCII Delete Sum for Two Strings](https://github.com/openset/leetcode/tree/master/problems/minimum-ascii-delete-sum-for-two-strings) (Medium) - 1. [Uncrossed Lines](https://github.com/openset/leetcode/tree/master/problems/uncrossed-lines) (Medium) + 1. [One Edit Distance](../one-edit-distance) (Medium) + 1. [Delete Operation for Two Strings](../delete-operation-for-two-strings) (Medium) + 1. [Minimum ASCII Delete Sum for Two Strings](../minimum-ascii-delete-sum-for-two-strings) (Medium) + 1. [Uncrossed Lines](../uncrossed-lines) (Medium) diff --git a/problems/element-appearing-more-than-25-in-sorted-array/README.md b/problems/element-appearing-more-than-25-in-sorted-array/README.md index 172d085de..52bdccd5e 100644 --- a/problems/element-appearing-more-than-25-in-sorted-array/README.md +++ b/problems/element-appearing-more-than-25-in-sorted-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/iterator-for-combination "Iterator for Combination") +[< Previous](../iterator-for-combination "Iterator for Combination") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/remove-covered-intervals "Remove Covered Intervals") +[Next >](../remove-covered-intervals "Remove Covered Intervals") ## [1287. Element Appearing More Than 25% In Sorted Array (Easy)](https://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array "有序数组中出现次数超过25%的元素") @@ -29,7 +29,7 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Hints
diff --git a/problems/elimination-game/README.md b/problems/elimination-game/README.md index ea1bc19a1..142b660d0 100644 --- a/problems/elimination-game/README.md +++ b/problems/elimination-game/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-the-difference "Find the Difference") +[< Previous](../find-the-difference "Find the Difference") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/perfect-rectangle "Perfect Rectangle") +[Next >](../perfect-rectangle "Perfect Rectangle") ## [390. Elimination Game (Medium)](https://leetcode.com/problems/elimination-game "消除游戏") diff --git a/problems/employee-bonus/README.md b/problems/employee-bonus/README.md index 5f390e4f5..da6fb333b 100644 --- a/problems/employee-bonus/README.md +++ b/problems/employee-bonus/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/out-of-boundary-paths "Out of Boundary Paths") +[< Previous](../out-of-boundary-paths "Out of Boundary Paths") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/get-highest-answer-rate-question "Get Highest Answer Rate Question") +[Next >](../get-highest-answer-rate-question "Get Highest Answer Rate Question") ## [577. Employee Bonus (Easy)](https://leetcode.com/problems/employee-bonus "员工奖金") @@ -52,7 +52,7 @@ empId is the primary key column for this table. ### Similar Questions - 1. [Combine Two Tables](https://github.com/openset/leetcode/tree/master/problems/combine-two-tables) (Easy) + 1. [Combine Two Tables](../combine-two-tables) (Easy) ### Hints
diff --git a/problems/employee-free-time/README.md b/problems/employee-free-time/README.md index 58aefdc02..8cb019ef3 100644 --- a/problems/employee-free-time/README.md +++ b/problems/employee-free-time/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/bold-words-in-string "Bold Words in String") +[< Previous](../bold-words-in-string "Bold Words in String") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-anagram-mappings "Find Anagram Mappings") +[Next >](../find-anagram-mappings "Find Anagram Mappings") ## [759. Employee Free Time (Hard)](https://leetcode.com/problems/employee-free-time "员工空闲时间") @@ -55,12 +55,12 @@ We discard any intervals that contain inf as they aren't finite.

 

### Related Topics - [[Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] + [[Heap](../../tag/heap/README.md)] + [[Greedy](../../tag/greedy/README.md)] ### Similar Questions - 1. [Merge Intervals](https://github.com/openset/leetcode/tree/master/problems/merge-intervals) (Medium) - 1. [Interval List Intersections](https://github.com/openset/leetcode/tree/master/problems/interval-list-intersections) (Medium) + 1. [Merge Intervals](../merge-intervals) (Medium) + 1. [Interval List Intersections](../interval-list-intersections) (Medium) ### Hints
diff --git a/problems/employee-importance/README.md b/problems/employee-importance/README.md index 17f9c8afa..16fda8047 100644 --- a/problems/employee-importance/README.md +++ b/problems/employee-importance/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-sum-of-3-non-overlapping-subarrays "Maximum Sum of 3 Non-Overlapping Subarrays") +[< Previous](../maximum-sum-of-3-non-overlapping-subarrays "Maximum Sum of 3 Non-Overlapping Subarrays") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/stickers-to-spell-word "Stickers to Spell Word") +[Next >](../stickers-to-spell-word "Stickers to Spell Word") ## [690. Employee Importance (Easy)](https://leetcode.com/problems/employee-importance "员工的重要性") @@ -38,9 +38,9 @@ Employee 1 has importance value 5, and he has two direct subordinates: employee

 

### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Nested List Weight Sum](https://github.com/openset/leetcode/tree/master/problems/nested-list-weight-sum) (Easy) + 1. [Nested List Weight Sum](../nested-list-weight-sum) (Easy) diff --git a/problems/employees-earning-more-than-their-managers/README.md b/problems/employees-earning-more-than-their-managers/README.md index 4f6b0b684..d775a4709 100644 --- a/problems/employees-earning-more-than-their-managers/README.md +++ b/problems/employees-earning-more-than-their-managers/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/consecutive-numbers "Consecutive Numbers") +[< Previous](../consecutive-numbers "Consecutive Numbers") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/duplicate-emails "Duplicate Emails") +[Next >](../duplicate-emails "Duplicate Emails") ## [181. Employees Earning More Than Their Managers (Easy)](https://leetcode.com/problems/employees-earning-more-than-their-managers "超过经理收入的员工") diff --git a/problems/encode-and-decode-strings/README.md b/problems/encode-and-decode-strings/README.md index ab52b1dca..5674a6223 100644 --- a/problems/encode-and-decode-strings/README.md +++ b/problems/encode-and-decode-strings/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/closest-binary-search-tree-value "Closest Binary Search Tree Value") +[< Previous](../closest-binary-search-tree-value "Closest Binary Search Tree Value") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/closest-binary-search-tree-value-ii "Closest Binary Search Tree Value II") +[Next >](../closest-binary-search-tree-value-ii "Closest Binary Search Tree Value II") ## [271. Encode and Decode Strings (Medium)](https://leetcode.com/problems/encode-and-decode-strings "字符串的编码与解码") @@ -56,10 +56,10 @@ vector<string> strs2 = decode(encoded_string); ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Count and Say](https://github.com/openset/leetcode/tree/master/problems/count-and-say) (Easy) - 1. [Serialize and Deserialize Binary Tree](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-binary-tree) (Hard) - 1. [String Compression](https://github.com/openset/leetcode/tree/master/problems/string-compression) (Easy) - 1. [Count Binary Substrings](https://github.com/openset/leetcode/tree/master/problems/count-binary-substrings) (Easy) + 1. [Count and Say](../count-and-say) (Easy) + 1. [Serialize and Deserialize Binary Tree](../serialize-and-deserialize-binary-tree) (Hard) + 1. [String Compression](../string-compression) (Easy) + 1. [Count Binary Substrings](../count-binary-substrings) (Easy) diff --git a/problems/encode-and-decode-tinyurl/README.md b/problems/encode-and-decode-tinyurl/README.md index d4ac836c6..209c602d6 100644 --- a/problems/encode-and-decode-tinyurl/README.md +++ b/problems/encode-and-decode-tinyurl/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/game-play-analysis-iii "Game Play Analysis III") +[< Previous](../game-play-analysis-iii "Game Play Analysis III") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-string "Construct Binary Tree from String") +[Next >](../construct-binary-tree-from-string "Construct Binary Tree from String") ## [535. Encode and Decode TinyURL (Medium)](https://leetcode.com/problems/encode-and-decode-tinyurl "TinyURL 的加密与解密") @@ -18,5 +18,5 @@

Design the encode and decode methods for the TinyURL service. There is no restriction on how your encode/decode algorithm should work. You just need to ensure that a URL can be encoded to a tiny URL and the tiny URL can be decoded to the original URL.

### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/encode-n-ary-tree-to-binary-tree/README.md b/problems/encode-n-ary-tree-to-binary-tree/README.md index d5cf469f7..e2895bbe5 100644 --- a/problems/encode-n-ary-tree-to-binary-tree/README.md +++ b/problems/encode-n-ary-tree-to-binary-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/flatten-a-multilevel-doubly-linked-list "Flatten a Multilevel Doubly Linked List") +[< Previous](../flatten-a-multilevel-doubly-linked-list "Flatten a Multilevel Doubly Linked List") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/all-oone-data-structure "All O`one Data Structure") +[Next >](../all-oone-data-structure "All O`one Data Structure") ## [431. Encode N-ary Tree to Binary Tree (Hard)](https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree "将 N 叉树编码为二叉树") @@ -33,7 +33,7 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] ### Similar Questions - 1. [Serialize and Deserialize N-ary Tree](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-n-ary-tree) (Hard) + 1. [Serialize and Deserialize N-ary Tree](../serialize-and-deserialize-n-ary-tree) (Hard) diff --git a/problems/encode-number/README.md b/problems/encode-number/README.md index fa422dd2a..31691e5a7 100644 --- a/problems/encode-number/README.md +++ b/problems/encode-number/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-score-words-formed-by-letters "Maximum Score Words Formed by Letters") +[< Previous](../maximum-score-words-formed-by-letters "Maximum Score Words Formed by Letters") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/smallest-common-region "Smallest Common Region") +[Next >](../smallest-common-region "Smallest Common Region") ## [1256. Encode Number (Medium)](https://leetcode.com/problems/encode-number "加密数字") @@ -40,11 +40,11 @@ ### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Convert to Base -2](https://github.com/openset/leetcode/tree/master/problems/convert-to-base-2) (Medium) + 1. [Convert to Base -2](../convert-to-base-2) (Medium) ### Hints
diff --git a/problems/encode-string-with-shortest-length/README.md b/problems/encode-string-with-shortest-length/README.md index 0f9cb0c75..f30975bf9 100644 --- a/problems/encode-string-with-shortest-length/README.md +++ b/problems/encode-string-with-shortest-length/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/implement-rand10-using-rand7 "Implement Rand10() Using Rand7()") +[< Previous](../implement-rand10-using-rand7 "Implement Rand10() Using Rand7()") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/concatenated-words "Concatenated Words") +[Next >](../concatenated-words "Concatenated Words") ## [471. Encode String with Shortest Length (Hard)](https://leetcode.com/problems/encode-string-with-shortest-length "编码最短长度的字符串") @@ -76,8 +76,8 @@ Explanation: "abbbabbbc" occurs twice, but "abbbabbbc" can a

 

### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Decode String](https://github.com/openset/leetcode/tree/master/problems/decode-string) (Medium) - 1. [Number of Atoms](https://github.com/openset/leetcode/tree/master/problems/number-of-atoms) (Hard) + 1. [Decode String](../decode-string) (Medium) + 1. [Number of Atoms](../number-of-atoms) (Hard) diff --git a/problems/equal-rational-numbers/README.md b/problems/equal-rational-numbers/README.md index 7b30d8133..1f778ea6a 100644 --- a/problems/equal-rational-numbers/README.md +++ b/problems/equal-rational-numbers/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/flip-binary-tree-to-match-preorder-traversal "Flip Binary Tree To Match Preorder Traversal") +[< Previous](../flip-binary-tree-to-match-preorder-traversal "Flip Binary Tree To Match Preorder Traversal") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/k-closest-points-to-origin "K Closest Points to Origin") +[Next >](../k-closest-points-to-origin "K Closest Points to Origin") ## [972. Equal Rational Numbers (Hard)](https://leetcode.com/problems/equal-rational-numbers "相等的有理数") @@ -71,4 +71,4 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/equal-tree-partition/README.md b/problems/equal-tree-partition/README.md index 19e441893..c6edb8c86 100644 --- a/problems/equal-tree-partition/README.md +++ b/problems/equal-tree-partition/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-width-of-binary-tree "Maximum Width of Binary Tree") +[< Previous](../maximum-width-of-binary-tree "Maximum Width of Binary Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/strange-printer "Strange Printer") +[Next >](../strange-printer "Strange Printer") ## [663. Equal Tree Partition (Medium)](https://leetcode.com/problems/equal-tree-partition "均匀树划分") @@ -61,4 +61,4 @@ Sum: 15

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] diff --git a/problems/erect-the-fence/README.md b/problems/erect-the-fence/README.md index 200ec6428..4ca2c2779 100644 --- a/problems/erect-the-fence/README.md +++ b/problems/erect-the-fence/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/customer-placing-the-largest-number-of-orders "Customer Placing the Largest Number of Orders") +[< Previous](../customer-placing-the-largest-number-of-orders "Customer Placing the Largest Number of Orders") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/design-in-memory-file-system "Design In-Memory File System") +[Next >](../design-in-memory-file-system "Design In-Memory File System") ## [587. Erect the Fence (Hard)](https://leetcode.com/problems/erect-the-fence "安装栅栏") @@ -48,4 +48,4 @@ Even you only have trees in a line, you need to use rope to enclose them. ### Related Topics - [[Geometry](https://github.com/openset/leetcode/tree/master/tag/geometry/README.md)] + [[Geometry](../../tag/geometry/README.md)] diff --git a/problems/escape-a-large-maze/README.md b/problems/escape-a-large-maze/README.md index b36b78f3b..7348bfdea 100644 --- a/problems/escape-a-large-maze/README.md +++ b/problems/escape-a-large-maze/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/uncrossed-lines "Uncrossed Lines") +[< Previous](../uncrossed-lines "Uncrossed Lines") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/valid-boomerang "Valid Boomerang") +[Next >](../valid-boomerang "Valid Boomerang") ## [1036. Escape a Large Maze (Hard)](https://leetcode.com/problems/escape-a-large-maze "逃离大迷宫") @@ -51,7 +51,7 @@ Because there are no blocked cells, it's possible to reach the target square ### Related Topics - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] ### Hints
diff --git a/problems/escape-the-ghosts/README.md b/problems/escape-the-ghosts/README.md index b26beb934..a733cf3dc 100644 --- a/problems/escape-the-ghosts/README.md +++ b/problems/escape-the-ghosts/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/rotated-digits "Rotated Digits") +[< Previous](../rotated-digits "Rotated Digits") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/domino-and-tromino-tiling "Domino and Tromino Tiling") +[Next >](../domino-and-tromino-tiling "Domino and Tromino Tiling") ## [789. Escape The Ghosts (Medium)](https://leetcode.com/problems/escape-the-ghosts "逃脱阻碍者") @@ -57,4 +57,4 @@ The ghost can reach the target at the same time as you. ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/evaluate-division/README.md b/problems/evaluate-division/README.md index ba9219a90..da828384c 100644 --- a/problems/evaluate-division/README.md +++ b/problems/evaluate-division/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/random-pick-index "Random Pick Index") +[< Previous](../random-pick-index "Random Pick Index") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/nth-digit "Nth Digit") +[Next >](../nth-digit "Nth Digit") ## [399. Evaluate Division (Medium)](https://leetcode.com/problems/evaluate-division "除法求值") @@ -32,8 +32,8 @@ queries = [ ["a", "c"], ["b", "a"], [&qu

The input is always valid. You may assume that evaluating the queries will result in no division by zero and there is no contradiction.

### Related Topics - [[Union Find](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] + [[Union Find](../../tag/union-find/README.md)] + [[Graph](../../tag/graph/README.md)] ### Hints
diff --git a/problems/evaluate-reverse-polish-notation/README.md b/problems/evaluate-reverse-polish-notation/README.md index e0e1ba1c9..8517d4438 100644 --- a/problems/evaluate-reverse-polish-notation/README.md +++ b/problems/evaluate-reverse-polish-notation/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/max-points-on-a-line "Max Points on a Line") +[< Previous](../max-points-on-a-line "Max Points on a Line") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/reverse-words-in-a-string "Reverse Words in a String") +[Next >](../reverse-words-in-a-string "Reverse Words in a String") ## [150. Evaluate Reverse Polish Notation (Medium)](https://leetcode.com/problems/evaluate-reverse-polish-notation "逆波兰表达式求值") @@ -54,8 +54,8 @@ ### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] + [[Stack](../../tag/stack/README.md)] ### Similar Questions - 1. [Basic Calculator](https://github.com/openset/leetcode/tree/master/problems/basic-calculator) (Hard) - 1. [Expression Add Operators](https://github.com/openset/leetcode/tree/master/problems/expression-add-operators) (Hard) + 1. [Basic Calculator](../basic-calculator) (Hard) + 1. [Expression Add Operators](../expression-add-operators) (Hard) diff --git a/problems/exam-room/README.md b/problems/exam-room/README.md index 3e40ccb17..d69790d06 100644 --- a/problems/exam-room/README.md +++ b/problems/exam-room/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/k-similar-strings "K-Similar Strings") +[< Previous](../k-similar-strings "K-Similar Strings") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/score-of-parentheses "Score of Parentheses") +[Next >](../score-of-parentheses "Score of Parentheses") ## [855. Exam Room (Medium)](https://leetcode.com/problems/exam-room "考场就座") @@ -45,7 +45,7 @@ seat() -> 5, the student sits at the last seat number 5. ### Related Topics - [[Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md)] + [[Ordered Map](../../tag/ordered-map/README.md)] ### Similar Questions - 1. [Maximize Distance to Closest Person](https://github.com/openset/leetcode/tree/master/problems/maximize-distance-to-closest-person) (Easy) + 1. [Maximize Distance to Closest Person](../maximize-distance-to-closest-person) (Easy) diff --git a/problems/excel-sheet-column-number/README.md b/problems/excel-sheet-column-number/README.md index 0a2fed74a..f89b0a019 100644 --- a/problems/excel-sheet-column-number/README.md +++ b/problems/excel-sheet-column-number/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/two-sum-iii-data-structure-design "Two Sum III - Data structure design") +[< Previous](../two-sum-iii-data-structure-design "Two Sum III - Data structure design") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/factorial-trailing-zeroes "Factorial Trailing Zeroes") +[Next >](../factorial-trailing-zeroes "Factorial Trailing Zeroes") ## [171. Excel Sheet Column Number (Easy)](https://leetcode.com/problems/excel-sheet-column-number "Excel表列序号") @@ -48,7 +48,7 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Excel Sheet Column Title](https://github.com/openset/leetcode/tree/master/problems/excel-sheet-column-title) (Easy) + 1. [Excel Sheet Column Title](../excel-sheet-column-title) (Easy) diff --git a/problems/excel-sheet-column-title/README.md b/problems/excel-sheet-column-title/README.md index ad0ca9fde..9992a826c 100644 --- a/problems/excel-sheet-column-title/README.md +++ b/problems/excel-sheet-column-title/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/two-sum-ii-input-array-is-sorted "Two Sum II - Input array is sorted") +[< Previous](../two-sum-ii-input-array-is-sorted "Two Sum II - Input array is sorted") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/majority-element "Majority Element") +[Next >](../majority-element "Majority Element") ## [168. Excel Sheet Column Title (Easy)](https://leetcode.com/problems/excel-sheet-column-title "Excel表列名称") @@ -48,7 +48,7 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Excel Sheet Column Number](https://github.com/openset/leetcode/tree/master/problems/excel-sheet-column-number) (Easy) + 1. [Excel Sheet Column Number](../excel-sheet-column-number) (Easy) diff --git a/problems/exchange-seats/README.md b/problems/exchange-seats/README.md index f433e5da1..b68568d1a 100644 --- a/problems/exchange-seats/README.md +++ b/problems/exchange-seats/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-factorization "Minimum Factorization") +[< Previous](../minimum-factorization "Minimum Factorization") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/swap-salary "Swap Salary") +[Next >](../swap-salary "Swap Salary") ## [626. Exchange Seats (Medium)](https://leetcode.com/problems/exchange-seats "换座位") diff --git a/problems/exclusive-time-of-functions/README.md b/problems/exclusive-time-of-functions/README.md index d7109cfcd..3eb9ebd75 100644 --- a/problems/exclusive-time-of-functions/README.md +++ b/problems/exclusive-time-of-functions/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/design-log-storage-system "Design Log Storage System") +[< Previous](../design-log-storage-system "Design Log Storage System") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/average-of-levels-in-binary-tree "Average of Levels in Binary Tree") +[Next >](../average-of-levels-in-binary-tree "Average of Levels in Binary Tree") ## [636. Exclusive Time of Functions (Medium)](https://leetcode.com/problems/exclusive-time-of-functions "函数的独占时间") @@ -54,4 +54,4 @@ So function 0 spends 2 + 1 = 3 units of total time executing, and function 1 spe

 

### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] + [[Stack](../../tag/stack/README.md)] diff --git a/problems/expression-add-operators/README.md b/problems/expression-add-operators/README.md index 0705843ca..03eceb030 100644 --- a/problems/expression-add-operators/README.md +++ b/problems/expression-add-operators/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/zigzag-iterator "Zigzag Iterator") +[< Previous](../zigzag-iterator "Zigzag Iterator") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/move-zeroes "Move Zeroes") +[Next >](../move-zeroes "Move Zeroes") ## [282. Expression Add Operators (Hard)](https://leetcode.com/problems/expression-add-operators "给表达式添加运算符") @@ -47,14 +47,14 @@ ### Related Topics - [[Divide and Conquer](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] + [[Divide and Conquer](../../tag/divide-and-conquer/README.md)] ### Similar Questions - 1. [Evaluate Reverse Polish Notation](https://github.com/openset/leetcode/tree/master/problems/evaluate-reverse-polish-notation) (Medium) - 1. [Basic Calculator](https://github.com/openset/leetcode/tree/master/problems/basic-calculator) (Hard) - 1. [Basic Calculator II](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-ii) (Medium) - 1. [Different Ways to Add Parentheses](https://github.com/openset/leetcode/tree/master/problems/different-ways-to-add-parentheses) (Medium) - 1. [Target Sum](https://github.com/openset/leetcode/tree/master/problems/target-sum) (Medium) + 1. [Evaluate Reverse Polish Notation](../evaluate-reverse-polish-notation) (Medium) + 1. [Basic Calculator](../basic-calculator) (Hard) + 1. [Basic Calculator II](../basic-calculator-ii) (Medium) + 1. [Different Ways to Add Parentheses](../different-ways-to-add-parentheses) (Medium) + 1. [Target Sum](../target-sum) (Medium) ### Hints
diff --git a/problems/expressive-words/README.md b/problems/expressive-words/README.md index 580f18da8..6f0a59155 100644 --- a/problems/expressive-words/README.md +++ b/problems/expressive-words/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/soup-servings "Soup Servings") +[< Previous](../soup-servings "Soup Servings") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/chalkboard-xor-game "Chalkboard XOR Game") +[Next >](../chalkboard-xor-game "Chalkboard XOR Game") ## [809. Expressive Words (Medium)](https://leetcode.com/problems/expressive-words "情感丰富的文字") @@ -46,4 +46,4 @@ We can't extend "helo" to get "heeellooo" because the gr

 

### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/factor-combinations/README.md b/problems/factor-combinations/README.md index ef9157484..89ab53fba 100644 --- a/problems/factor-combinations/README.md +++ b/problems/factor-combinations/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/meeting-rooms-ii "Meeting Rooms II") +[< Previous](../meeting-rooms-ii "Meeting Rooms II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/verify-preorder-sequence-in-binary-search-tree "Verify Preorder Sequence in Binary Search Tree") +[Next >](../verify-preorder-sequence-in-binary-search-tree "Verify Preorder Sequence in Binary Search Tree") ## [254. Factor Combinations (Medium)](https://leetcode.com/problems/factor-combinations "因子的组合") @@ -67,7 +67,7 @@ ### Related Topics - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Combination Sum](https://github.com/openset/leetcode/tree/master/problems/combination-sum) (Medium) + 1. [Combination Sum](../combination-sum) (Medium) diff --git a/problems/factorial-trailing-zeroes/README.md b/problems/factorial-trailing-zeroes/README.md index 699e5d0a6..ad390a548 100644 --- a/problems/factorial-trailing-zeroes/README.md +++ b/problems/factorial-trailing-zeroes/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/excel-sheet-column-number "Excel Sheet Column Number") +[< Previous](../excel-sheet-column-number "Excel Sheet Column Number") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/binary-search-tree-iterator "Binary Search Tree Iterator") +[Next >](../binary-search-tree-iterator "Binary Search Tree Iterator") ## [172. Factorial Trailing Zeroes (Easy)](https://leetcode.com/problems/factorial-trailing-zeroes "阶乘后的零") @@ -30,8 +30,8 @@

Note: Your solution should be in logarithmic time complexity.

### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Number of Digit One](https://github.com/openset/leetcode/tree/master/problems/number-of-digit-one) (Hard) - 1. [Preimage Size of Factorial Zeroes Function](https://github.com/openset/leetcode/tree/master/problems/preimage-size-of-factorial-zeroes-function) (Hard) + 1. [Number of Digit One](../number-of-digit-one) (Hard) + 1. [Preimage Size of Factorial Zeroes Function](../preimage-size-of-factorial-zeroes-function) (Hard) diff --git a/problems/fair-candy-swap/README.md b/problems/fair-candy-swap/README.md index 77ec6bc00..79fe3e629 100644 --- a/problems/fair-candy-swap/README.md +++ b/problems/fair-candy-swap/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/super-egg-drop "Super Egg Drop") +[< Previous](../super-egg-drop "Super Egg Drop") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-preorder-and-postorder-traversal "Construct Binary Tree from Preorder and Postorder Traversal") +[Next >](../construct-binary-tree-from-preorder-and-postorder-traversal "Construct Binary Tree from Preorder and Postorder Traversal") ## [888. Fair Candy Swap (Easy)](https://leetcode.com/problems/fair-candy-swap "公平的糖果交换") @@ -71,4 +71,4 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] diff --git a/problems/falling-squares/README.md b/problems/falling-squares/README.md index 07f33153d..d9209d82b 100644 --- a/problems/falling-squares/README.md +++ b/problems/falling-squares/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/partition-to-k-equal-sum-subsets "Partition to K Equal Sum Subsets") +[< Previous](../partition-to-k-equal-sum-subsets "Partition to K Equal Sum Subsets") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/search-in-a-binary-search-tree "Search in a Binary Search Tree") +[Next >](../search-in-a-binary-search-tree "Search in a Binary Search Tree") ## [699. Falling Squares (Hard)](https://leetcode.com/problems/falling-squares "掉落的方块") @@ -60,11 +60,11 @@

 

### Related Topics - [[Segment Tree](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] - [[Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md)] + [[Segment Tree](../../tag/segment-tree/README.md)] + [[Ordered Map](../../tag/ordered-map/README.md)] ### Similar Questions - 1. [The Skyline Problem](https://github.com/openset/leetcode/tree/master/problems/the-skyline-problem) (Hard) + 1. [The Skyline Problem](../the-skyline-problem) (Hard) ### Hints
diff --git a/problems/fibonacci-number/README.md b/problems/fibonacci-number/README.md index fcb1407d4..c4047fe08 100644 --- a/problems/fibonacci-number/README.md +++ b/problems/fibonacci-number/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/most-frequent-subtree-sum "Most Frequent Subtree Sum") +[< Previous](../most-frequent-subtree-sum "Most Frequent Subtree Sum") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/inorder-successor-in-bst-ii "Inorder Successor in BST II") +[Next >](../inorder-successor-in-bst-ii "Inorder Successor in BST II") ## [509. Fibonacci Number (Easy)](https://leetcode.com/problems/fibonacci-number "斐波那契数") @@ -53,9 +53,9 @@ F(N) = F(N - 1) + F(N - 2), for N > 1.

0 ≤ N ≤ 30.

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Climbing Stairs](https://github.com/openset/leetcode/tree/master/problems/climbing-stairs) (Easy) - 1. [Split Array into Fibonacci Sequence](https://github.com/openset/leetcode/tree/master/problems/split-array-into-fibonacci-sequence) (Medium) - 1. [Length of Longest Fibonacci Subsequence](https://github.com/openset/leetcode/tree/master/problems/length-of-longest-fibonacci-subsequence) (Medium) + 1. [Climbing Stairs](../climbing-stairs) (Easy) + 1. [Split Array into Fibonacci Sequence](../split-array-into-fibonacci-sequence) (Medium) + 1. [Length of Longest Fibonacci Subsequence](../length-of-longest-fibonacci-subsequence) (Medium) diff --git a/problems/filling-bookcase-shelves/README.md b/problems/filling-bookcase-shelves/README.md index 996594860..5d223c77d 100644 --- a/problems/filling-bookcase-shelves/README.md +++ b/problems/filling-bookcase-shelves/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/path-in-zigzag-labelled-binary-tree "Path In Zigzag Labelled Binary Tree") +[< Previous](../path-in-zigzag-labelled-binary-tree "Path In Zigzag Labelled Binary Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/parsing-a-boolean-expression "Parsing A Boolean Expression") +[Next >](../parsing-a-boolean-expression "Parsing A Boolean Expression") ## [1105. Filling Bookcase Shelves (Medium)](https://leetcode.com/problems/filling-bookcase-shelves "填充书架") @@ -42,7 +42,7 @@ Notice that book number 2 does not have to be on the first shelf. ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/find-all-anagrams-in-a-string/README.md b/problems/find-all-anagrams-in-a-string/README.md index 06a8f41f8..bb7452d0b 100644 --- a/problems/find-all-anagrams-in-a-string/README.md +++ b/problems/find-all-anagrams-in-a-string/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/path-sum-iii "Path Sum III") +[< Previous](../path-sum-iii "Path Sum III") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/ternary-expression-parser "Ternary Expression Parser") +[Next >](../ternary-expression-parser "Ternary Expression Parser") ## [438. Find All Anagrams in a String (Medium)](https://leetcode.com/problems/find-all-anagrams-in-a-string "找到字符串中所有字母异位词") @@ -47,8 +47,8 @@ The substring with start index = 2 is "ab", which is an anagram of "ab".

### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Valid Anagram](https://github.com/openset/leetcode/tree/master/problems/valid-anagram) (Easy) - 1. [Permutation in String](https://github.com/openset/leetcode/tree/master/problems/permutation-in-string) (Medium) + 1. [Valid Anagram](../valid-anagram) (Easy) + 1. [Permutation in String](../permutation-in-string) (Medium) diff --git a/problems/find-all-duplicates-in-an-array/README.md b/problems/find-all-duplicates-in-an-array/README.md index b1068827c..9977ff59a 100644 --- a/problems/find-all-duplicates-in-an-array/README.md +++ b/problems/find-all-duplicates-in-an-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/arranging-coins "Arranging Coins") +[< Previous](../arranging-coins "Arranging Coins") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/string-compression "String Compression") +[Next >](../string-compression "String Compression") ## [442. Find All Duplicates in an Array (Medium)](https://leetcode.com/problems/find-all-duplicates-in-an-array "数组中重复的数据") @@ -27,7 +27,7 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Find All Numbers Disappeared in an Array](https://github.com/openset/leetcode/tree/master/problems/find-all-numbers-disappeared-in-an-array) (Easy) + 1. [Find All Numbers Disappeared in an Array](../find-all-numbers-disappeared-in-an-array) (Easy) diff --git a/problems/find-all-numbers-disappeared-in-an-array/README.md b/problems/find-all-numbers-disappeared-in-an-array/README.md index fc993b326..f1ce976b7 100644 --- a/problems/find-all-numbers-disappeared-in-an-array/README.md +++ b/problems/find-all-numbers-disappeared-in-an-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/number-of-boomerangs "Number of Boomerangs") +[< Previous](../number-of-boomerangs "Number of Boomerangs") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-bst "Serialize and Deserialize BST") +[Next >](../serialize-and-deserialize-bst "Serialize and Deserialize BST") ## [448. Find All Numbers Disappeared in an Array (Easy)](https://leetcode.com/problems/find-all-numbers-disappeared-in-an-array "找到所有数组中消失的数字") @@ -28,11 +28,11 @@

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [First Missing Positive](https://github.com/openset/leetcode/tree/master/problems/first-missing-positive) (Hard) - 1. [Find All Duplicates in an Array](https://github.com/openset/leetcode/tree/master/problems/find-all-duplicates-in-an-array) (Medium) + 1. [First Missing Positive](../first-missing-positive) (Hard) + 1. [Find All Duplicates in an Array](../find-all-duplicates-in-an-array) (Medium) ### Hints
diff --git a/problems/find-anagram-mappings/README.md b/problems/find-anagram-mappings/README.md index cf9da2489..c86ee417c 100644 --- a/problems/find-anagram-mappings/README.md +++ b/problems/find-anagram-mappings/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/employee-free-time "Employee Free Time") +[< Previous](../employee-free-time "Employee Free Time") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/special-binary-string "Special Binary String") +[Next >](../special-binary-string "Special Binary String") ## [760. Find Anagram Mappings (Easy)](https://leetcode.com/problems/find-anagram-mappings "找出变位映射") @@ -41,7 +41,7 @@ and so on.

### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Hints
diff --git a/problems/find-and-replace-in-string/README.md b/problems/find-and-replace-in-string/README.md index 989beeab2..351f3f38d 100644 --- a/problems/find-and-replace-in-string/README.md +++ b/problems/find-and-replace-in-string/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/flipping-an-image "Flipping an Image") +[< Previous](../flipping-an-image "Flipping an Image") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/sum-of-distances-in-tree "Sum of Distances in Tree") +[Next >](../sum-of-distances-in-tree "Sum of Distances in Tree") ## [833. Find And Replace in String (Medium)](https://leetcode.com/problems/find-and-replace-in-string "字符串中的查找与替换") @@ -50,4 +50,4 @@

 

### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/find-and-replace-pattern/README.md b/problems/find-and-replace-pattern/README.md index c67de166b..3b4b4f1e6 100644 --- a/problems/find-and-replace-pattern/README.md +++ b/problems/find-and-replace-pattern/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-preorder-and-postorder-traversal "Construct Binary Tree from Preorder and Postorder Traversal") +[< Previous](../construct-binary-tree-from-preorder-and-postorder-traversal "Construct Binary Tree from Preorder and Postorder Traversal") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/sum-of-subsequence-widths "Sum of Subsequence Widths") +[Next >](../sum-of-subsequence-widths "Sum of Subsequence Widths") ## [890. Find and Replace Pattern (Medium)](https://leetcode.com/problems/find-and-replace-pattern "查找和替换模式") @@ -44,4 +44,4 @@ since a and b map to the same letter. ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/find-bottom-left-tree-value/README.md b/problems/find-bottom-left-tree-value/README.md index 811616711..fbca72dfd 100644 --- a/problems/find-bottom-left-tree-value/README.md +++ b/problems/find-bottom-left-tree-value/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/game-play-analysis-ii "Game Play Analysis II") +[< Previous](../game-play-analysis-ii "Game Play Analysis II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/freedom-trail "Freedom Trail") +[Next >](../freedom-trail "Freedom Trail") ## [513. Find Bottom Left Tree Value (Medium)](https://leetcode.com/problems/find-bottom-left-tree-value "找树左下角的值") @@ -50,6 +50,6 @@ You may assume the tree (i.e., the given root node) is not NULL.

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] diff --git a/problems/find-common-characters/README.md b/problems/find-common-characters/README.md index 4da233435..6160447c6 100644 --- a/problems/find-common-characters/README.md +++ b/problems/find-common-characters/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/grid-illumination "Grid Illumination") +[< Previous](../grid-illumination "Grid Illumination") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/check-if-word-is-valid-after-substitutions "Check If Word Is Valid After Substitutions") +[Next >](../check-if-word-is-valid-after-substitutions "Check If Word Is Valid After Substitutions") ## [1002. Find Common Characters (Easy)](https://leetcode.com/problems/find-common-characters "查找常用字符") @@ -46,8 +46,8 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Array](../../tag/array/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Intersection of Two Arrays II](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-arrays-ii) (Easy) + 1. [Intersection of Two Arrays II](../intersection-of-two-arrays-ii) (Easy) diff --git a/problems/find-cumulative-salary-of-an-employee/README.md b/problems/find-cumulative-salary-of-an-employee/README.md index e2833723f..83a85c4ab 100644 --- a/problems/find-cumulative-salary-of-an-employee/README.md +++ b/problems/find-cumulative-salary-of-an-employee/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/get-highest-answer-rate-question "Get Highest Answer Rate Question") +[< Previous](../get-highest-answer-rate-question "Get Highest Answer Rate Question") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/count-student-number-in-departments "Count Student Number in Departments") +[Next >](../count-student-number-in-departments "Count Student Number in Departments") ## [579. Find Cumulative Salary of an Employee (Hard)](https://leetcode.com/problems/find-cumulative-salary-of-an-employee "查询员工的累计薪水") diff --git a/problems/find-customer-referee/README.md b/problems/find-customer-referee/README.md index 3c97763f6..5f0fe373a 100644 --- a/problems/find-customer-referee/README.md +++ b/problems/find-customer-referee/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/delete-operation-for-two-strings "Delete Operation for Two Strings") +[< Previous](../delete-operation-for-two-strings "Delete Operation for Two Strings") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/investments-in-2016 "Investments in 2016") +[Next >](../investments-in-2016 "Investments in 2016") ## [584. Find Customer Referee (Easy)](https://leetcode.com/problems/find-customer-referee "寻找用户推荐人") diff --git a/problems/find-duplicate-file-in-system/README.md b/problems/find-duplicate-file-in-system/README.md index 0a3efdeb9..07fbeb275 100644 --- a/problems/find-duplicate-file-in-system/README.md +++ b/problems/find-duplicate-file-in-system/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/tree-node "Tree Node") +[< Previous](../tree-node "Tree Node") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/triangle-judgement "Triangle Judgement") +[Next >](../triangle-judgement "Triangle Judgement") ## [609. Find Duplicate File in System (Medium)](https://leetcode.com/problems/find-duplicate-file-in-system "在系统中查找重复文件") @@ -58,5 +58,5 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/find-duplicate-subtrees/README.md b/problems/find-duplicate-subtrees/README.md index f5fa2de52..649d1408c 100644 --- a/problems/find-duplicate-subtrees/README.md +++ b/problems/find-duplicate-subtrees/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/4-keys-keyboard "4 Keys Keyboard") +[< Previous](../4-keys-keyboard "4 Keys Keyboard") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/two-sum-iv-input-is-a-bst "Two Sum IV - Input is a BST") +[Next >](../two-sum-iv-input-is-a-bst "Two Sum IV - Input is a BST") ## [652. Find Duplicate Subtrees (Medium)](https://leetcode.com/problems/find-duplicate-subtrees "寻找重复的子树") @@ -43,9 +43,9 @@ Therefore, you need to return above trees' root in the form of a list. ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] ### Similar Questions - 1. [Serialize and Deserialize Binary Tree](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-binary-tree) (Hard) - 1. [Serialize and Deserialize BST](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-bst) (Medium) - 1. [Construct String from Binary Tree](https://github.com/openset/leetcode/tree/master/problems/construct-string-from-binary-tree) (Easy) + 1. [Serialize and Deserialize Binary Tree](../serialize-and-deserialize-binary-tree) (Hard) + 1. [Serialize and Deserialize BST](../serialize-and-deserialize-bst) (Medium) + 1. [Construct String from Binary Tree](../construct-string-from-binary-tree) (Easy) diff --git a/problems/find-elements-in-a-contaminated-binary-tree/README.md b/problems/find-elements-in-a-contaminated-binary-tree/README.md index b179e8dc6..a3a516d28 100644 --- a/problems/find-elements-in-a-contaminated-binary-tree/README.md +++ b/problems/find-elements-in-a-contaminated-binary-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/shift-2d-grid "Shift 2D Grid") +[< Previous](../shift-2d-grid "Shift 2D Grid") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/greatest-sum-divisible-by-three "Greatest Sum Divisible by Three") +[Next >](../greatest-sum-divisible-by-three "Greatest Sum Divisible by Three") ## [1261. Find Elements in a Contaminated Binary Tree (Medium)](https://leetcode.com/problems/find-elements-in-a-contaminated-binary-tree "在受污染的二叉树中查找元素") @@ -90,8 +90,8 @@ findElements.find(5); // return True ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Hints
diff --git a/problems/find-eventual-safe-states/README.md b/problems/find-eventual-safe-states/README.md index 6a01cb5dc..86188cf43 100644 --- a/problems/find-eventual-safe-states/README.md +++ b/problems/find-eventual-safe-states/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-swaps-to-make-sequences-increasing "Minimum Swaps To Make Sequences Increasing") +[< Previous](../minimum-swaps-to-make-sequences-increasing "Minimum Swaps To Make Sequences Increasing") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/bricks-falling-when-hit "Bricks Falling When Hit") +[Next >](../bricks-falling-when-hit "Bricks Falling When Hit") ## [802. Find Eventual Safe States (Medium)](https://leetcode.com/problems/find-eventual-safe-states "找到最终的安全状态") @@ -38,5 +38,5 @@ Here is a diagram of the above graph. ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Graph](../../tag/graph/README.md)] diff --git a/problems/find-first-and-last-position-of-element-in-sorted-array/README.md b/problems/find-first-and-last-position-of-element-in-sorted-array/README.md index cd6946bc6..0ea7457d6 100644 --- a/problems/find-first-and-last-position-of-element-in-sorted-array/README.md +++ b/problems/find-first-and-last-position-of-element-in-sorted-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/search-in-rotated-sorted-array "Search in Rotated Sorted Array") +[< Previous](../search-in-rotated-sorted-array "Search in Rotated Sorted Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/search-insert-position "Search Insert Position") +[Next >](../search-insert-position "Search Insert Position") ## [34. Find First and Last Position of Element in Sorted Array (Medium)](https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array "在排序数组中查找元素的第一个和最后一个位置") @@ -30,8 +30,8 @@ Output: [-1,-1] ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Array](../../tag/array/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [First Bad Version](https://github.com/openset/leetcode/tree/master/problems/first-bad-version) (Easy) + 1. [First Bad Version](../first-bad-version) (Easy) diff --git a/problems/find-in-mountain-array/README.md b/problems/find-in-mountain-array/README.md index e1953c42a..beb2a9ff2 100644 --- a/problems/find-in-mountain-array/README.md +++ b/problems/find-in-mountain-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/car-pooling "Car Pooling") +[< Previous](../car-pooling "Car Pooling") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/brace-expansion-ii "Brace Expansion II") +[Next >](../brace-expansion-ii "Brace Expansion II") ## [1095. Find in Mountain Array (Hard)](https://leetcode.com/problems/find-in-mountain-array "山脉数组中查找目标值") @@ -65,7 +65,7 @@ ### Related Topics - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Hints
diff --git a/problems/find-k-closest-elements/README.md b/problems/find-k-closest-elements/README.md index 994312f97..0849ebd14 100644 --- a/problems/find-k-closest-elements/README.md +++ b/problems/find-k-closest-elements/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/robot-return-to-origin "Robot Return to Origin") +[< Previous](../robot-return-to-origin "Robot Return to Origin") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/split-array-into-consecutive-subsequences "Split Array into Consecutive Subsequences") +[Next >](../split-array-into-consecutive-subsequences "Split Array into Consecutive Subsequences") ## [658. Find K Closest Elements (Medium)](https://leetcode.com/problems/find-k-closest-elements "找到 K 个最接近的元素") @@ -47,9 +47,9 @@ The arr parameter had been changed to an array of integers (instea

### Related Topics - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [Guess Number Higher or Lower](https://github.com/openset/leetcode/tree/master/problems/guess-number-higher-or-lower) (Easy) - 1. [Guess Number Higher or Lower II](https://github.com/openset/leetcode/tree/master/problems/guess-number-higher-or-lower-ii) (Medium) - 1. [Find K-th Smallest Pair Distance](https://github.com/openset/leetcode/tree/master/problems/find-k-th-smallest-pair-distance) (Hard) + 1. [Guess Number Higher or Lower](../guess-number-higher-or-lower) (Easy) + 1. [Guess Number Higher or Lower II](../guess-number-higher-or-lower-ii) (Medium) + 1. [Find K-th Smallest Pair Distance](../find-k-th-smallest-pair-distance) (Hard) diff --git a/problems/find-k-length-substrings-with-no-repeated-characters/README.md b/problems/find-k-length-substrings-with-no-repeated-characters/README.md index e9bb44c68..effcba5f7 100644 --- a/problems/find-k-length-substrings-with-no-repeated-characters/README.md +++ b/problems/find-k-length-substrings-with-no-repeated-characters/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/two-sum-less-than-k "Two Sum Less Than K") +[< Previous](../two-sum-less-than-k "Two Sum Less Than K") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/the-earliest-moment-when-everyone-become-friends "The Earliest Moment When Everyone Become Friends") +[Next >](../the-earliest-moment-when-everyone-become-friends "The Earliest Moment When Everyone Become Friends") ## [1100. Find K-Length Substrings With No Repeated Characters (Medium)](https://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters "长度为 K 的无重复字符子串") @@ -44,8 +44,8 @@ Notice K can be larger than the length of S. In this case is not possible to fin ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] - [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] + [[String](../../tag/string/README.md)] + [[Sliding Window](../../tag/sliding-window/README.md)] ### Hints
diff --git a/problems/find-k-pairs-with-smallest-sums/README.md b/problems/find-k-pairs-with-smallest-sums/README.md index 07c6b6f11..df71879f7 100644 --- a/problems/find-k-pairs-with-smallest-sums/README.md +++ b/problems/find-k-pairs-with-smallest-sums/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/super-pow "Super Pow") +[< Previous](../super-pow "Super Pow") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/guess-number-higher-or-lower "Guess Number Higher or Lower") +[Next >](../guess-number-higher-or-lower "Guess Number Higher or Lower") ## [373. Find K Pairs with Smallest Sums (Medium)](https://leetcode.com/problems/find-k-pairs-with-smallest-sums "查找和最小的K对数字") @@ -42,8 +42,8 @@ ### Related Topics - [[Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] + [[Heap](../../tag/heap/README.md)] ### Similar Questions - 1. [Kth Smallest Element in a Sorted Matrix](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-element-in-a-sorted-matrix) (Medium) - 1. [Find K-th Smallest Pair Distance](https://github.com/openset/leetcode/tree/master/problems/find-k-th-smallest-pair-distance) (Hard) + 1. [Kth Smallest Element in a Sorted Matrix](../kth-smallest-element-in-a-sorted-matrix) (Medium) + 1. [Find K-th Smallest Pair Distance](../find-k-th-smallest-pair-distance) (Hard) diff --git a/problems/find-k-th-smallest-pair-distance/README.md b/problems/find-k-th-smallest-pair-distance/README.md index 7a8e6bd1d..b977ec166 100644 --- a/problems/find-k-th-smallest-pair-distance/README.md +++ b/problems/find-k-th-smallest-pair-distance/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-length-of-repeated-subarray "Maximum Length of Repeated Subarray") +[< Previous](../maximum-length-of-repeated-subarray "Maximum Length of Repeated Subarray") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/longest-word-in-dictionary "Longest Word in Dictionary") +[Next >](../longest-word-in-dictionary "Longest Word in Dictionary") ## [719. Find K-th Smallest Pair Distance (Hard)](https://leetcode.com/problems/find-k-th-smallest-pair-distance "找出第 k 小的距离对") @@ -37,16 +37,16 @@ Then the 1st smallest distance pair is (1,1), and its distance is 0.

### Related Topics - [[Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Heap](../../tag/heap/README.md)] + [[Array](../../tag/array/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [Find K Pairs with Smallest Sums](https://github.com/openset/leetcode/tree/master/problems/find-k-pairs-with-smallest-sums) (Medium) - 1. [Kth Smallest Element in a Sorted Matrix](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-element-in-a-sorted-matrix) (Medium) - 1. [Find K Closest Elements](https://github.com/openset/leetcode/tree/master/problems/find-k-closest-elements) (Medium) - 1. [Kth Smallest Number in Multiplication Table](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-number-in-multiplication-table) (Hard) - 1. [K-th Smallest Prime Fraction](https://github.com/openset/leetcode/tree/master/problems/k-th-smallest-prime-fraction) (Hard) + 1. [Find K Pairs with Smallest Sums](../find-k-pairs-with-smallest-sums) (Medium) + 1. [Kth Smallest Element in a Sorted Matrix](../kth-smallest-element-in-a-sorted-matrix) (Medium) + 1. [Find K Closest Elements](../find-k-closest-elements) (Medium) + 1. [Kth Smallest Number in Multiplication Table](../kth-smallest-number-in-multiplication-table) (Hard) + 1. [K-th Smallest Prime Fraction](../k-th-smallest-prime-fraction) (Hard) ### Hints
diff --git a/problems/find-largest-value-in-each-tree-row/README.md b/problems/find-largest-value-in-each-tree-row/README.md index de0ee2a27..e5c655338 100644 --- a/problems/find-largest-value-in-each-tree-row/README.md +++ b/problems/find-largest-value-in-each-tree-row/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/freedom-trail "Freedom Trail") +[< Previous](../freedom-trail "Freedom Trail") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/longest-palindromic-subsequence "Longest Palindromic Subsequence") +[Next >](../longest-palindromic-subsequence "Longest Palindromic Subsequence") ## [515. Find Largest Value in Each Tree Row (Medium)](https://leetcode.com/problems/find-largest-value-in-each-tree-row "在每个树行中找最大值") @@ -28,6 +28,6 @@

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] diff --git a/problems/find-leaves-of-binary-tree/README.md b/problems/find-leaves-of-binary-tree/README.md index cc7f1edc9..6c0bda5a5 100644 --- a/problems/find-leaves-of-binary-tree/README.md +++ b/problems/find-leaves-of-binary-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/water-and-jug-problem "Water and Jug Problem") +[< Previous](../water-and-jug-problem "Water and Jug Problem") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/valid-perfect-square "Valid Perfect Square") +[Next >](../valid-perfect-square "Valid Perfect Square") ## [366. Find Leaves of Binary Tree (Medium)](https://leetcode.com/problems/find-leaves-of-binary-tree "寻找完全二叉树的叶子节点") @@ -58,5 +58,5 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] diff --git a/problems/find-median-from-data-stream/README.md b/problems/find-median-from-data-stream/README.md index dc926a24e..3416a3a92 100644 --- a/problems/find-median-from-data-stream/README.md +++ b/problems/find-median-from-data-stream/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/flip-game-ii "Flip Game II") +[< Previous](../flip-game-ii "Flip Game II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/best-meeting-point "Best Meeting Point") +[Next >](../best-meeting-point "Best Meeting Point") ## [295. Find Median from Data Stream (Hard)](https://leetcode.com/problems/find-median-from-data-stream "数据流的中位数") @@ -47,8 +47,8 @@ findMedian() -> 2 ### Related Topics - [[Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] + [[Heap](../../tag/heap/README.md)] + [[Design](../../tag/design/README.md)] ### Similar Questions - 1. [Sliding Window Median](https://github.com/openset/leetcode/tree/master/problems/sliding-window-median) (Hard) + 1. [Sliding Window Median](../sliding-window-median) (Hard) diff --git a/problems/find-median-given-frequency-of-numbers/README.md b/problems/find-median-given-frequency-of-numbers/README.md index bf32d16bb..85b17693e 100644 --- a/problems/find-median-given-frequency-of-numbers/README.md +++ b/problems/find-median-given-frequency-of-numbers/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/managers-with-at-least-5-direct-reports "Managers with at Least 5 Direct Reports") +[< Previous](../managers-with-at-least-5-direct-reports "Managers with at Least 5 Direct Reports") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/subtree-of-another-tree "Subtree of Another Tree") +[Next >](../subtree-of-another-tree "Subtree of Another Tree") ## [571. Find Median Given Frequency of Numbers (Hard)](https://leetcode.com/problems/find-median-given-frequency-of-numbers "给定数字的频率查询中位数") @@ -37,4 +37,4 @@

Write a query to find the median of all numbers and name the result as median.

### Similar Questions - 1. [Median Employee Salary](https://github.com/openset/leetcode/tree/master/problems/median-employee-salary) (Hard) + 1. [Median Employee Salary](../median-employee-salary) (Hard) diff --git a/problems/find-minimum-in-rotated-sorted-array-ii/README.md b/problems/find-minimum-in-rotated-sorted-array-ii/README.md index c1b778710..322b4d2d7 100644 --- a/problems/find-minimum-in-rotated-sorted-array-ii/README.md +++ b/problems/find-minimum-in-rotated-sorted-array-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-minimum-in-rotated-sorted-array "Find Minimum in Rotated Sorted Array") +[< Previous](../find-minimum-in-rotated-sorted-array "Find Minimum in Rotated Sorted Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/min-stack "Min Stack") +[Next >](../min-stack "Min Stack") ## [154. Find Minimum in Rotated Sorted Array II (Hard)](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii "寻找旋转排序数组中的最小值 II") @@ -39,8 +39,8 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Array](../../tag/array/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [Find Minimum in Rotated Sorted Array](https://github.com/openset/leetcode/tree/master/problems/find-minimum-in-rotated-sorted-array) (Medium) + 1. [Find Minimum in Rotated Sorted Array](../find-minimum-in-rotated-sorted-array) (Medium) diff --git a/problems/find-minimum-in-rotated-sorted-array/README.md b/problems/find-minimum-in-rotated-sorted-array/README.md index 462253a0d..eccb58740 100644 --- a/problems/find-minimum-in-rotated-sorted-array/README.md +++ b/problems/find-minimum-in-rotated-sorted-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-product-subarray "Maximum Product Subarray") +[< Previous](../maximum-product-subarray "Maximum Product Subarray") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-minimum-in-rotated-sorted-array-ii "Find Minimum in Rotated Sorted Array II") +[Next >](../find-minimum-in-rotated-sorted-array-ii "Find Minimum in Rotated Sorted Array II") ## [153. Find Minimum in Rotated Sorted Array (Medium)](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array "寻找旋转排序数组中的最小值") @@ -34,12 +34,12 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Array](../../tag/array/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [Search in Rotated Sorted Array](https://github.com/openset/leetcode/tree/master/problems/search-in-rotated-sorted-array) (Medium) - 1. [Find Minimum in Rotated Sorted Array II](https://github.com/openset/leetcode/tree/master/problems/find-minimum-in-rotated-sorted-array-ii) (Hard) + 1. [Search in Rotated Sorted Array](../search-in-rotated-sorted-array) (Medium) + 1. [Find Minimum in Rotated Sorted Array II](../find-minimum-in-rotated-sorted-array-ii) (Hard) ### Hints
diff --git a/problems/find-mode-in-binary-search-tree/README.md b/problems/find-mode-in-binary-search-tree/README.md index a93834723..3c86f61c1 100644 --- a/problems/find-mode-in-binary-search-tree/README.md +++ b/problems/find-mode-in-binary-search-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/keyboard-row "Keyboard Row") +[< Previous](../keyboard-row "Keyboard Row") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/ipo "IPO") +[Next >](../ipo "IPO") ## [501. Find Mode in Binary Search Tree (Easy)](https://leetcode.com/problems/find-mode-in-binary-search-tree "二叉搜索树中的众数") @@ -43,7 +43,7 @@ Given BST [1,null,2,2],

Follow up: Could you do that without using any extra space? (Assume that the implicit stack space incurred due to recursion does not count).

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] ### Similar Questions - 1. [Validate Binary Search Tree](https://github.com/openset/leetcode/tree/master/problems/validate-binary-search-tree) (Medium) + 1. [Validate Binary Search Tree](../validate-binary-search-tree) (Medium) diff --git a/problems/find-peak-element/README.md b/problems/find-peak-element/README.md index 3f853163e..92bf14323 100644 --- a/problems/find-peak-element/README.md +++ b/problems/find-peak-element/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/one-edit-distance "One Edit Distance") +[< Previous](../one-edit-distance "One Edit Distance") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/missing-ranges "Missing Ranges") +[Next >](../missing-ranges "Missing Ranges") ## [162. Find Peak Element (Medium)](https://leetcode.com/problems/find-peak-element "寻找峰值") @@ -40,8 +40,8 @@

Your solution should be in logarithmic complexity.

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Array](../../tag/array/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [Peak Index in a Mountain Array](https://github.com/openset/leetcode/tree/master/problems/peak-index-in-a-mountain-array) (Easy) + 1. [Peak Index in a Mountain Array](../peak-index-in-a-mountain-array) (Easy) diff --git a/problems/find-permutation/README.md b/problems/find-permutation/README.md index 6b22df79e..bfa918ff8 100644 --- a/problems/find-permutation/README.md +++ b/problems/find-permutation/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/smallest-good-base "Smallest Good Base") +[< Previous](../smallest-good-base "Smallest Good Base") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones "Max Consecutive Ones") +[Next >](../max-consecutive-ones "Max Consecutive Ones") ## [484. Find Permutation (Medium)](https://leetcode.com/problems/find-permutation "寻找排列") @@ -39,4 +39,4 @@ On the other hand, now your job is to find the lexicographically smallest permut

### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] + [[Greedy](../../tag/greedy/README.md)] diff --git a/problems/find-pivot-index/README.md b/problems/find-pivot-index/README.md index 29ffd6664..7e653f866 100644 --- a/problems/find-pivot-index/README.md +++ b/problems/find-pivot-index/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/candy-crush "Candy Crush") +[< Previous](../candy-crush "Candy Crush") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/split-linked-list-in-parts "Split Linked List in Parts") +[Next >](../split-linked-list-in-parts "Split Linked List in Parts") ## [724. Find Pivot Index (Easy)](https://leetcode.com/problems/find-pivot-index "寻找数组的中心索引") @@ -52,10 +52,10 @@ There is no index that satisfies the conditions in the problem statement.

 

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Subarray Sum Equals K](https://github.com/openset/leetcode/tree/master/problems/subarray-sum-equals-k) (Medium) + 1. [Subarray Sum Equals K](../subarray-sum-equals-k) (Medium) ### Hints
diff --git a/problems/find-positive-integer-solution-for-a-given-equation/README.md b/problems/find-positive-integer-solution-for-a-given-equation/README.md index 5301d7de2..f70520803 100644 --- a/problems/find-positive-integer-solution-for-a-given-equation/README.md +++ b/problems/find-positive-integer-solution-for-a-given-equation/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/web-crawler "Web Crawler") +[< Previous](../web-crawler "Web Crawler") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/circular-permutation-in-binary-representation "Circular Permutation in Binary Representation") +[Next >](../circular-permutation-in-binary-representation "Circular Permutation in Binary Representation") ## [1237. Find Positive Integer Solution for a Given Equation (Easy)](https://leetcode.com/problems/find-positive-integer-solution-for-a-given-equation "找出给定方程的正整数解") @@ -61,8 +61,8 @@ public: ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Math](../../tag/math/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Hints
diff --git a/problems/find-right-interval/README.md b/problems/find-right-interval/README.md index 52dc003d4..b49f70ba0 100644 --- a/problems/find-right-interval/README.md +++ b/problems/find-right-interval/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/non-overlapping-intervals "Non-overlapping Intervals") +[< Previous](../non-overlapping-intervals "Non-overlapping Intervals") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/path-sum-iii "Path Sum III") +[Next >](../path-sum-iii "Path Sum III") ## [436. Find Right Interval (Medium)](https://leetcode.com/problems/find-right-interval "寻找右区间") @@ -64,7 +64,7 @@ For [2,3], the interval [3,4] has minimum-"right" start point.

NOTE: input types have been changed on April 15, 2019. Please reset to default code definition to get new method signature.

### Related Topics - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [Data Stream as Disjoint Intervals](https://github.com/openset/leetcode/tree/master/problems/data-stream-as-disjoint-intervals) (Hard) + 1. [Data Stream as Disjoint Intervals](../data-stream-as-disjoint-intervals) (Hard) diff --git a/problems/find-smallest-common-element-in-all-rows/README.md b/problems/find-smallest-common-element-in-all-rows/README.md index ad9428e26..8bf0613d1 100644 --- a/problems/find-smallest-common-element-in-all-rows/README.md +++ b/problems/find-smallest-common-element-in-all-rows/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-knight-moves "Minimum Knight Moves") +[< Previous](../minimum-knight-moves "Minimum Knight Moves") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-time-to-build-blocks "Minimum Time to Build Blocks") +[Next >](../minimum-time-to-build-blocks "Minimum Time to Build Blocks") ## [1198. Find Smallest Common Element in All Rows (Medium)](https://leetcode.com/problems/find-smallest-common-element-in-all-rows "找出所有行中最小公共元素") @@ -31,8 +31,8 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Hints
diff --git a/problems/find-smallest-letter-greater-than-target/README.md b/problems/find-smallest-letter-greater-than-target/README.md index 0de26a3ff..c308f8ce4 100644 --- a/problems/find-smallest-letter-greater-than-target/README.md +++ b/problems/find-smallest-letter-greater-than-target/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/network-delay-time "Network Delay Time") +[< Previous](../network-delay-time "Network Delay Time") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/prefix-and-suffix-search "Prefix and Suffix Search") +[Next >](../prefix-and-suffix-search "Prefix and Suffix Search") ## [744. Find Smallest Letter Greater Than Target (Easy)](https://leetcode.com/problems/find-smallest-letter-greater-than-target "寻找比目标字母大的最小字母") @@ -60,7 +60,7 @@ target = "k"

### Related Topics - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Hints
diff --git a/problems/find-the-celebrity/README.md b/problems/find-the-celebrity/README.md index 95cd019c0..1cf1be1e1 100644 --- a/problems/find-the-celebrity/README.md +++ b/problems/find-the-celebrity/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/paint-fence "Paint Fence") +[< Previous](../paint-fence "Paint Fence") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/first-bad-version "First Bad Version") +[Next >](../first-bad-version "First Bad Version") ## [277. Find the Celebrity (Medium)](https://leetcode.com/problems/find-the-celebrity "搜寻名人") @@ -53,10 +53,10 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Find the Town Judge](https://github.com/openset/leetcode/tree/master/problems/find-the-town-judge) (Easy) + 1. [Find the Town Judge](../find-the-town-judge) (Easy) ### Hints
diff --git a/problems/find-the-closest-palindrome/README.md b/problems/find-the-closest-palindrome/README.md index 7e935cd5f..8a6121526 100644 --- a/problems/find-the-closest-palindrome/README.md +++ b/problems/find-the-closest-palindrome/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/binary-tree-tilt "Binary Tree Tilt") +[< Previous](../binary-tree-tilt "Binary Tree Tilt") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/array-nesting "Array Nesting") +[Next >](../array-nesting "Array Nesting") ## [564. Find the Closest Palindrome (Hard)](https://leetcode.com/problems/find-the-closest-palindrome "寻找最近的回文数") @@ -30,7 +30,7 @@

### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Hints
diff --git a/problems/find-the-derangement-of-an-array/README.md b/problems/find-the-derangement-of-an-array/README.md index 75d4f16ed..4274d7cf9 100644 --- a/problems/find-the-derangement-of-an-array/README.md +++ b/problems/find-the-derangement-of-an-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/sum-of-square-numbers "Sum of Square Numbers") +[< Previous](../sum-of-square-numbers "Sum of Square Numbers") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/design-log-storage-system "Design Log Storage System") +[Next >](../design-log-storage-system "Design Log Storage System") ## [634. Find the Derangement of An Array (Medium)](https://leetcode.com/problems/find-the-derangement-of-an-array "寻找数组的错位排列") @@ -36,4 +36,4 @@ Also, since the answer may be very large, you should return the output mod 10 ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/find-the-difference/README.md b/problems/find-the-difference/README.md index 4acc0919f..4382ca887 100644 --- a/problems/find-the-difference/README.md +++ b/problems/find-the-difference/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/longest-absolute-file-path "Longest Absolute File Path") +[< Previous](../longest-absolute-file-path "Longest Absolute File Path") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/elimination-game "Elimination Game") +[Next >](../elimination-game "Elimination Game") ## [389. Find the Difference (Easy)](https://leetcode.com/problems/find-the-difference "找不同") @@ -32,8 +32,8 @@ Explanation: ### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Single Number](https://github.com/openset/leetcode/tree/master/problems/single-number) (Easy) + 1. [Single Number](../single-number) (Easy) diff --git a/problems/find-the-duplicate-number/README.md b/problems/find-the-duplicate-number/README.md index df3d0d69e..5ea4dd5c1 100644 --- a/problems/find-the-duplicate-number/README.md +++ b/problems/find-the-duplicate-number/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/walls-and-gates "Walls and Gates") +[< Previous](../walls-and-gates "Walls and Gates") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/unique-word-abbreviation "Unique Word Abbreviation") +[Next >](../unique-word-abbreviation "Unique Word Abbreviation") ## [287. Find the Duplicate Number (Medium)](https://leetcode.com/problems/find-the-duplicate-number "寻找重复数") @@ -36,13 +36,13 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Array](../../tag/array/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [First Missing Positive](https://github.com/openset/leetcode/tree/master/problems/first-missing-positive) (Hard) - 1. [Single Number](https://github.com/openset/leetcode/tree/master/problems/single-number) (Easy) - 1. [Linked List Cycle II](https://github.com/openset/leetcode/tree/master/problems/linked-list-cycle-ii) (Medium) - 1. [Missing Number](https://github.com/openset/leetcode/tree/master/problems/missing-number) (Easy) - 1. [Set Mismatch](https://github.com/openset/leetcode/tree/master/problems/set-mismatch) (Easy) + 1. [First Missing Positive](../first-missing-positive) (Hard) + 1. [Single Number](../single-number) (Easy) + 1. [Linked List Cycle II](../linked-list-cycle-ii) (Medium) + 1. [Missing Number](../missing-number) (Easy) + 1. [Set Mismatch](../set-mismatch) (Easy) diff --git a/problems/find-the-shortest-superstring/README.md b/problems/find-the-shortest-superstring/README.md index aa5436013..b10ab5c72 100644 --- a/problems/find-the-shortest-superstring/README.md +++ b/problems/find-the-shortest-superstring/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/di-string-match "DI String Match") +[< Previous](../di-string-match "DI String Match") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/delete-columns-to-make-sorted "Delete Columns to Make Sorted") +[Next >](../delete-columns-to-make-sorted "Delete Columns to Make Sorted") ## [943. Find the Shortest Superstring (Hard)](https://leetcode.com/problems/find-the-shortest-superstring "最短超级串") @@ -49,4 +49,4 @@ ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/find-the-smallest-divisor-given-a-threshold/README.md b/problems/find-the-smallest-divisor-given-a-threshold/README.md index af86b2db7..2dec8542a 100644 --- a/problems/find-the-smallest-divisor-given-a-threshold/README.md +++ b/problems/find-the-smallest-divisor-given-a-threshold/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/group-the-people-given-the-group-size-they-belong-to "Group the People Given the Group Size They Belong To") +[< Previous](../group-the-people-given-the-group-size-they-belong-to "Group the People Given the Group Size They Belong To") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix "Minimum Number of Flips to Convert Binary Matrix to Zero Matrix") +[Next >](../minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix "Minimum Number of Flips to Convert Binary Matrix to Zero Matrix") ## [1283. Find the Smallest Divisor Given a Threshold (Medium)](https://leetcode.com/problems/find-the-smallest-divisor-given-a-threshold "使结果不超过阈值的最小除数") @@ -51,7 +51,7 @@ If the divisor is 4 we can get a sum to 7 (1+1+2+3) and if the divisor is 5 the ### Related Topics - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Hints
diff --git a/problems/find-the-start-and-end-number-of-continuous-ranges/README.md b/problems/find-the-start-and-end-number-of-continuous-ranges/README.md index 5cc40e68f..cdc2150a3 100644 --- a/problems/find-the-start-and-end-number-of-continuous-ranges/README.md +++ b/problems/find-the-start-and-end-number-of-continuous-ranges/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix "Minimum Number of Flips to Convert Binary Matrix to Zero Matrix") +[< Previous](../minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix "Minimum Number of Flips to Convert Binary Matrix to Zero Matrix") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/iterator-for-combination "Iterator for Combination") +[Next >](../iterator-for-combination "Iterator for Combination") ## [1285. Find the Start and End Number of Continuous Ranges (Medium)](https://leetcode.com/problems/find-the-start-and-end-number-of-continuous-ranges "") diff --git a/problems/find-the-town-judge/README.md b/problems/find-the-town-judge/README.md index b4d33bf73..89542cda9 100644 --- a/problems/find-the-town-judge/README.md +++ b/problems/find-the-town-judge/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/number-of-squareful-arrays "Number of Squareful Arrays") +[< Previous](../number-of-squareful-arrays "Number of Squareful Arrays") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-binary-tree-ii "Maximum Binary Tree II") +[Next >](../maximum-binary-tree-ii "Maximum Binary Tree II") ## [997. Find the Town Judge (Easy)](https://leetcode.com/problems/find-the-town-judge "找到小镇的法官") @@ -82,7 +82,7 @@ ### Related Topics - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] + [[Graph](../../tag/graph/README.md)] ### Similar Questions - 1. [Find the Celebrity](https://github.com/openset/leetcode/tree/master/problems/find-the-celebrity) (Medium) + 1. [Find the Celebrity](../find-the-celebrity) (Medium) diff --git a/problems/find-winner-on-a-tic-tac-toe-game/README.md b/problems/find-winner-on-a-tic-tac-toe-game/README.md index 6779753e8..25d232e87 100644 --- a/problems/find-winner-on-a-tic-tac-toe-game/README.md +++ b/problems/find-winner-on-a-tic-tac-toe-game/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/number-of-ships-in-a-rectangle "Number of Ships in a Rectangle") +[< Previous](../number-of-ships-in-a-rectangle "Number of Ships in a Rectangle") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-burgers-with-no-waste-of-ingredients "Number of Burgers with No Waste of Ingredients") +[Next >](../number-of-burgers-with-no-waste-of-ingredients "Number of Burgers with No Waste of Ingredients") ## [1275. Find Winner on a Tic Tac Toe Game (Easy)](https://leetcode.com/problems/find-winner-on-a-tic-tac-toe-game "找出井字棋的获胜者") @@ -87,7 +87,7 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Hints
diff --git a/problems/find-words-that-can-be-formed-by-characters/README.md b/problems/find-words-that-can-be-formed-by-characters/README.md index 4099acf07..331d274a2 100644 --- a/problems/find-words-that-can-be-formed-by-characters/README.md +++ b/problems/find-words-that-can-be-formed-by-characters/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/market-analysis-ii "Market Analysis II") +[< Previous](../market-analysis-ii "Market Analysis II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-level-sum-of-a-binary-tree "Maximum Level Sum of a Binary Tree") +[Next >](../maximum-level-sum-of-a-binary-tree "Maximum Level Sum of a Binary Tree") ## [1160. Find Words That Can Be Formed by Characters (Easy)](https://leetcode.com/problems/find-words-that-can-be-formed-by-characters "拼写单词") @@ -48,8 +48,8 @@ The strings that can be formed are "hello" and "world" so th ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Array](../../tag/array/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Hints
diff --git a/problems/first-bad-version/README.md b/problems/first-bad-version/README.md index a276cc7ca..00755c011 100644 --- a/problems/first-bad-version/README.md +++ b/problems/first-bad-version/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-the-celebrity "Find the Celebrity") +[< Previous](../find-the-celebrity "Find the Celebrity") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/perfect-squares "Perfect Squares") +[Next >](../perfect-squares "Perfect Squares") ## [278. First Bad Version (Easy)](https://leetcode.com/problems/first-bad-version "第一个错误的版本") @@ -30,9 +30,9 @@ Then 4 is the first bad version.  ### Related Topics - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [Find First and Last Position of Element in Sorted Array](https://github.com/openset/leetcode/tree/master/problems/find-first-and-last-position-of-element-in-sorted-array) (Medium) - 1. [Search Insert Position](https://github.com/openset/leetcode/tree/master/problems/search-insert-position) (Easy) - 1. [Guess Number Higher or Lower](https://github.com/openset/leetcode/tree/master/problems/guess-number-higher-or-lower) (Easy) + 1. [Find First and Last Position of Element in Sorted Array](../find-first-and-last-position-of-element-in-sorted-array) (Medium) + 1. [Search Insert Position](../search-insert-position) (Easy) + 1. [Guess Number Higher or Lower](../guess-number-higher-or-lower) (Easy) diff --git a/problems/first-missing-positive/README.md b/problems/first-missing-positive/README.md index 6a2455ba1..923cce8fa 100644 --- a/problems/first-missing-positive/README.md +++ b/problems/first-missing-positive/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/combination-sum-ii "Combination Sum II") +[< Previous](../combination-sum-ii "Combination Sum II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/trapping-rain-water "Trapping Rain Water") +[Next >](../trapping-rain-water "Trapping Rain Water") ## [41. First Missing Positive (Hard)](https://leetcode.com/problems/first-missing-positive "缺失的第一个正数") @@ -39,13 +39,13 @@ Output: 1

Your algorithm should run in O(n) time and uses constant extra space.

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Missing Number](https://github.com/openset/leetcode/tree/master/problems/missing-number) (Easy) - 1. [Find the Duplicate Number](https://github.com/openset/leetcode/tree/master/problems/find-the-duplicate-number) (Medium) - 1. [Find All Numbers Disappeared in an Array](https://github.com/openset/leetcode/tree/master/problems/find-all-numbers-disappeared-in-an-array) (Easy) - 1. [Couples Holding Hands](https://github.com/openset/leetcode/tree/master/problems/couples-holding-hands) (Hard) + 1. [Missing Number](../missing-number) (Easy) + 1. [Find the Duplicate Number](../find-the-duplicate-number) (Medium) + 1. [Find All Numbers Disappeared in an Array](../find-all-numbers-disappeared-in-an-array) (Easy) + 1. [Couples Holding Hands](../couples-holding-hands) (Hard) ### Hints
diff --git a/problems/first-unique-character-in-a-string/README.md b/problems/first-unique-character-in-a-string/README.md index 8653cc639..0256e95bc 100644 --- a/problems/first-unique-character-in-a-string/README.md +++ b/problems/first-unique-character-in-a-string/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/lexicographical-numbers "Lexicographical Numbers") +[< Previous](../lexicographical-numbers "Lexicographical Numbers") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/longest-absolute-file-path "Longest Absolute File Path") +[Next >](../longest-absolute-file-path "Longest Absolute File Path") ## [387. First Unique Character in a String (Easy)](https://leetcode.com/problems/first-unique-character-in-a-string "字符串中的第一个唯一字符") @@ -29,8 +29,8 @@ return 2.

### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Sort Characters By Frequency](https://github.com/openset/leetcode/tree/master/problems/sort-characters-by-frequency) (Medium) + 1. [Sort Characters By Frequency](../sort-characters-by-frequency) (Medium) diff --git a/problems/fixed-point/README.md b/problems/fixed-point/README.md index 41d948be5..d3983ae1a 100644 --- a/problems/fixed-point/README.md +++ b/problems/fixed-point/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/number-of-valid-subarrays "Number of Valid Subarrays") +[< Previous](../number-of-valid-subarrays "Number of Valid Subarrays") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/index-pairs-of-a-string "Index Pairs of a String") +[Next >](../index-pairs-of-a-string "Index Pairs of a String") ## [1064. Fixed Point (Easy)](https://leetcode.com/problems/fixed-point "不动点") @@ -52,8 +52,8 @@ There is no such i that A[i] = i, thus the output is - ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Array](../../tag/array/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Hints
diff --git a/problems/fizz-buzz-multithreaded/README.md b/problems/fizz-buzz-multithreaded/README.md index f5a3f3eb7..0f3ef15ab 100644 --- a/problems/fizz-buzz-multithreaded/README.md +++ b/problems/fizz-buzz-multithreaded/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/tournament-winners "Tournament Winners") +[< Previous](../tournament-winners "Tournament Winners") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/how-many-apples-can-you-put-into-the-basket "How Many Apples Can You Put into the Basket") +[Next >](../how-many-apples-can-you-put-into-the-basket "How Many Apples Can You Put into the Basket") ## [1195. Fizz Buzz Multithreaded (Medium)](https://leetcode.com/problems/fizz-buzz-multithreaded "交替打印字符串") diff --git a/problems/fizz-buzz/README.md b/problems/fizz-buzz/README.md index d6844e7d2..cae237242 100644 --- a/problems/fizz-buzz/README.md +++ b/problems/fizz-buzz/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-unique-word-abbreviation "Minimum Unique Word Abbreviation") +[< Previous](../minimum-unique-word-abbreviation "Minimum Unique Word Abbreviation") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/arithmetic-slices "Arithmetic Slices") +[Next >](../arithmetic-slices "Arithmetic Slices") ## [412. Fizz Buzz (Easy)](https://leetcode.com/problems/fizz-buzz "Fizz Buzz") diff --git a/problems/flatten-2d-vector/README.md b/problems/flatten-2d-vector/README.md index 4d0935174..7a8917757 100644 --- a/problems/flatten-2d-vector/README.md +++ b/problems/flatten-2d-vector/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/count-univalue-subtrees "Count Univalue Subtrees") +[< Previous](../count-univalue-subtrees "Count Univalue Subtrees") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/meeting-rooms "Meeting Rooms") +[Next >](../meeting-rooms "Meeting Rooms") ## [251. Flatten 2D Vector (Medium)](https://leetcode.com/problems/flatten-2d-vector "展开二维向量") @@ -45,13 +45,13 @@ iterator.hasNext(); // return false

As an added challenge, try to code it using only iterators in C++ or iterators in Java.

### Related Topics - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] + [[Design](../../tag/design/README.md)] ### Similar Questions - 1. [Binary Search Tree Iterator](https://github.com/openset/leetcode/tree/master/problems/binary-search-tree-iterator) (Medium) - 1. [Zigzag Iterator](https://github.com/openset/leetcode/tree/master/problems/zigzag-iterator) (Medium) - 1. [Peeking Iterator](https://github.com/openset/leetcode/tree/master/problems/peeking-iterator) (Medium) - 1. [Flatten Nested List Iterator](https://github.com/openset/leetcode/tree/master/problems/flatten-nested-list-iterator) (Medium) + 1. [Binary Search Tree Iterator](../binary-search-tree-iterator) (Medium) + 1. [Zigzag Iterator](../zigzag-iterator) (Medium) + 1. [Peeking Iterator](../peeking-iterator) (Medium) + 1. [Flatten Nested List Iterator](../flatten-nested-list-iterator) (Medium) ### Hints
diff --git a/problems/flatten-a-multilevel-doubly-linked-list/README.md b/problems/flatten-a-multilevel-doubly-linked-list/README.md index b43386a6a..6a4366de6 100644 --- a/problems/flatten-a-multilevel-doubly-linked-list/README.md +++ b/problems/flatten-a-multilevel-doubly-linked-list/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-level-order-traversal "N-ary Tree Level Order Traversal") +[< Previous](../n-ary-tree-level-order-traversal "N-ary Tree Level Order Traversal") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/encode-n-ary-tree-to-binary-tree "Encode N-ary Tree to Binary Tree") +[Next >](../encode-n-ary-tree-to-binary-tree "Encode N-ary Tree to Binary Tree") ## [430. Flatten a Multilevel Doubly Linked List (Medium)](https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list "扁平化多级双向链表") @@ -96,8 +96,8 @@ After flattening the multilevel linked list it becomes: ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Linked List](../../tag/linked-list/README.md)] ### Similar Questions - 1. [Flatten Binary Tree to Linked List](https://github.com/openset/leetcode/tree/master/problems/flatten-binary-tree-to-linked-list) (Medium) + 1. [Flatten Binary Tree to Linked List](../flatten-binary-tree-to-linked-list) (Medium) diff --git a/problems/flatten-binary-tree-to-linked-list/README.md b/problems/flatten-binary-tree-to-linked-list/README.md index 19ce00839..52b53dbca 100644 --- a/problems/flatten-binary-tree-to-linked-list/README.md +++ b/problems/flatten-binary-tree-to-linked-list/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/path-sum-ii "Path Sum II") +[< Previous](../path-sum-ii "Path Sum II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/distinct-subsequences "Distinct Subsequences") +[Next >](../distinct-subsequences "Distinct Subsequences") ## [114. Flatten Binary Tree to Linked List (Medium)](https://leetcode.com/problems/flatten-binary-tree-to-linked-list "二叉树展开为链表") @@ -40,11 +40,11 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] ### Similar Questions - 1. [Flatten a Multilevel Doubly Linked List](https://github.com/openset/leetcode/tree/master/problems/flatten-a-multilevel-doubly-linked-list) (Medium) + 1. [Flatten a Multilevel Doubly Linked List](../flatten-a-multilevel-doubly-linked-list) (Medium) ### Hints
diff --git a/problems/flatten-nested-list-iterator/README.md b/problems/flatten-nested-list-iterator/README.md index ba6e79897..183c4401a 100644 --- a/problems/flatten-nested-list-iterator/README.md +++ b/problems/flatten-nested-list-iterator/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-k-distinct-characters "Longest Substring with At Most K Distinct Characters") +[< Previous](../longest-substring-with-at-most-k-distinct-characters "Longest Substring with At Most K Distinct Characters") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/power-of-four "Power of Four") +[Next >](../power-of-four "Power of Four") ## [341. Flatten Nested List Iterator (Medium)](https://leetcode.com/problems/flatten-nested-list-iterator "扁平化嵌套列表迭代器") @@ -37,11 +37,11 @@ ### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] + [[Stack](../../tag/stack/README.md)] + [[Design](../../tag/design/README.md)] ### Similar Questions - 1. [Flatten 2D Vector](https://github.com/openset/leetcode/tree/master/problems/flatten-2d-vector) (Medium) - 1. [Zigzag Iterator](https://github.com/openset/leetcode/tree/master/problems/zigzag-iterator) (Medium) - 1. [Mini Parser](https://github.com/openset/leetcode/tree/master/problems/mini-parser) (Medium) - 1. [Array Nesting](https://github.com/openset/leetcode/tree/master/problems/array-nesting) (Medium) + 1. [Flatten 2D Vector](../flatten-2d-vector) (Medium) + 1. [Zigzag Iterator](../zigzag-iterator) (Medium) + 1. [Mini Parser](../mini-parser) (Medium) + 1. [Array Nesting](../array-nesting) (Medium) diff --git a/problems/flip-binary-tree-to-match-preorder-traversal/README.md b/problems/flip-binary-tree-to-match-preorder-traversal/README.md index ee0574964..00e9baf57 100644 --- a/problems/flip-binary-tree-to-match-preorder-traversal/README.md +++ b/problems/flip-binary-tree-to-match-preorder-traversal/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/powerful-integers "Powerful Integers") +[< Previous](../powerful-integers "Powerful Integers") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/equal-rational-numbers "Equal Rational Numbers") +[Next >](../equal-rational-numbers "Equal Rational Numbers") ## [971. Flip Binary Tree To Match Preorder Traversal (Medium)](https://leetcode.com/problems/flip-binary-tree-to-match-preorder-traversal "翻转二叉树以匹配先序遍历") @@ -69,5 +69,5 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] diff --git a/problems/flip-columns-for-maximum-number-of-equal-rows/README.md b/problems/flip-columns-for-maximum-number-of-equal-rows/README.md index 3ef1408b7..eb25ef95a 100644 --- a/problems/flip-columns-for-maximum-number-of-equal-rows/README.md +++ b/problems/flip-columns-for-maximum-number-of-equal-rows/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/greatest-common-divisor-of-strings "Greatest Common Divisor of Strings") +[< Previous](../greatest-common-divisor-of-strings "Greatest Common Divisor of Strings") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/adding-two-negabinary-numbers "Adding Two Negabinary Numbers") +[Next >](../adding-two-negabinary-numbers "Adding Two Negabinary Numbers") ## [1072. Flip Columns For Maximum Number of Equal Rows (Medium)](https://leetcode.com/problems/flip-columns-for-maximum-number-of-equal-rows "按列翻转得到最大值等行数") @@ -62,7 +62,7 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Hints
diff --git a/problems/flip-equivalent-binary-trees/README.md b/problems/flip-equivalent-binary-trees/README.md index b13f1a5d1..32f6b6ba5 100644 --- a/problems/flip-equivalent-binary-trees/README.md +++ b/problems/flip-equivalent-binary-trees/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/reveal-cards-in-increasing-order "Reveal Cards In Increasing Order") +[< Previous](../reveal-cards-in-increasing-order "Reveal Cards In Increasing Order") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/largest-component-size-by-common-factor "Largest Component Size by Common Factor") +[Next >](../largest-component-size-by-common-factor "Largest Component Size by Common Factor") ## [951. Flip Equivalent Binary Trees (Medium)](https://leetcode.com/problems/flip-equivalent-binary-trees "翻转等价二叉树") @@ -42,4 +42,4 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] diff --git a/problems/flip-game-ii/README.md b/problems/flip-game-ii/README.md index c710e0c82..2f1cb21a4 100644 --- a/problems/flip-game-ii/README.md +++ b/problems/flip-game-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/flip-game "Flip Game") +[< Previous](../flip-game "Flip Game") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-median-from-data-stream "Find Median from Data Stream") +[Next >](../find-median-from-data-stream "Find Median from Data Stream") ## [294. Flip Game II (Medium)](https://leetcode.com/problems/flip-game-ii "翻转游戏 II") @@ -27,11 +27,11 @@ Derive your algorithm's runtime complexity.

### Related Topics - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] - [[Minimax](https://github.com/openset/leetcode/tree/master/tag/minimax/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] + [[Minimax](../../tag/minimax/README.md)] ### Similar Questions - 1. [Nim Game](https://github.com/openset/leetcode/tree/master/problems/nim-game) (Easy) - 1. [Flip Game](https://github.com/openset/leetcode/tree/master/problems/flip-game) (Easy) - 1. [Guess Number Higher or Lower II](https://github.com/openset/leetcode/tree/master/problems/guess-number-higher-or-lower-ii) (Medium) - 1. [Can I Win](https://github.com/openset/leetcode/tree/master/problems/can-i-win) (Medium) + 1. [Nim Game](../nim-game) (Easy) + 1. [Flip Game](../flip-game) (Easy) + 1. [Guess Number Higher or Lower II](../guess-number-higher-or-lower-ii) (Medium) + 1. [Can I Win](../can-i-win) (Medium) diff --git a/problems/flip-game/README.md b/problems/flip-game/README.md index 728d42ce4..5a155f02b 100644 --- a/problems/flip-game/README.md +++ b/problems/flip-game/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/nim-game "Nim Game") +[< Previous](../nim-game "Nim Game") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/flip-game-ii "Flip Game II") +[Next >](../flip-game-ii "Flip Game II") ## [293. Flip Game (Easy)](https://leetcode.com/problems/flip-game "翻转游戏") @@ -30,7 +30,7 @@

Note: If there is no valid move, return an empty list [].

### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Flip Game II](https://github.com/openset/leetcode/tree/master/problems/flip-game-ii) (Medium) + 1. [Flip Game II](../flip-game-ii) (Medium) diff --git a/problems/flip-string-to-monotone-increasing/README.md b/problems/flip-string-to-monotone-increasing/README.md index 84c4939a8..23cf18547 100644 --- a/problems/flip-string-to-monotone-increasing/README.md +++ b/problems/flip-string-to-monotone-increasing/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/long-pressed-name "Long Pressed Name") +[< Previous](../long-pressed-name "Long Pressed Name") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/three-equal-parts "Three Equal Parts") +[Next >](../three-equal-parts "Three Equal Parts") ## [926. Flip String to Monotone Increasing (Medium)](https://leetcode.com/problems/flip-string-to-monotone-increasing "将字符串翻转到单调递增") @@ -59,4 +59,4 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] diff --git a/problems/flipping-an-image/README.md b/problems/flipping-an-image/README.md index b16f0ac6d..a15791ada 100644 --- a/problems/flipping-an-image/README.md +++ b/problems/flipping-an-image/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/masking-personal-information "Masking Personal Information") +[< Previous](../masking-personal-information "Masking Personal Information") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-and-replace-in-string "Find And Replace in String") +[Next >](../find-and-replace-in-string "Find And Replace in String") ## [832. Flipping an Image (Easy)](https://leetcode.com/problems/flipping-an-image "翻转图像") @@ -43,4 +43,4 @@ Then invert the image: [[1,1,0,0],[0,1,1,0],[0,0,0,1],[1,0,1,0]] ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] diff --git a/problems/flood-fill/README.md b/problems/flood-fill/README.md index 82943c989..2b88dd868 100644 --- a/problems/flood-fill/README.md +++ b/problems/flood-fill/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/my-calendar-iii "My Calendar III") +[< Previous](../my-calendar-iii "My Calendar III") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/sentence-similarity "Sentence Similarity") +[Next >](../sentence-similarity "Sentence Similarity") ## [733. Flood Fill (Easy)](https://leetcode.com/problems/flood-fill "图像渲染") @@ -41,10 +41,10 @@ to the starting pixel.

### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] ### Similar Questions - 1. [Island Perimeter](https://github.com/openset/leetcode/tree/master/problems/island-perimeter) (Easy) + 1. [Island Perimeter](../island-perimeter) (Easy) ### Hints
diff --git a/problems/flower-planting-with-no-adjacent/README.md b/problems/flower-planting-with-no-adjacent/README.md index f2af46149..d678c816f 100644 --- a/problems/flower-planting-with-no-adjacent/README.md +++ b/problems/flower-planting-with-no-adjacent/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/robot-bounded-in-circle "Robot Bounded In Circle") +[< Previous](../robot-bounded-in-circle "Robot Bounded In Circle") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/partition-array-for-maximum-sum "Partition Array for Maximum Sum") +[Next >](../partition-array-for-maximum-sum "Partition Array for Maximum Sum") ## [1042. Flower Planting With No Adjacent (Easy)](https://leetcode.com/problems/flower-planting-with-no-adjacent "不邻接植花") @@ -62,7 +62,7 @@ ### Related Topics - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] + [[Graph](../../tag/graph/README.md)] ### Hints
diff --git a/problems/fraction-addition-and-subtraction/README.md b/problems/fraction-addition-and-subtraction/README.md index 0abcb3900..1009fe831 100644 --- a/problems/fraction-addition-and-subtraction/README.md +++ b/problems/fraction-addition-and-subtraction/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/tag-validator "Tag Validator") +[< Previous](../tag-validator "Tag Validator") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/valid-square "Valid Square") +[Next >](../valid-square "Valid Square") ## [592. Fraction Addition and Subtraction (Medium)](https://leetcode.com/problems/fraction-addition-and-subtraction "分数加减运算") @@ -52,7 +52,7 @@

### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Solve the Equation](https://github.com/openset/leetcode/tree/master/problems/solve-the-equation) (Medium) + 1. [Solve the Equation](../solve-the-equation) (Medium) diff --git a/problems/fraction-to-recurring-decimal/README.md b/problems/fraction-to-recurring-decimal/README.md index 954f18ab8..24f9a239c 100644 --- a/problems/fraction-to-recurring-decimal/README.md +++ b/problems/fraction-to-recurring-decimal/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/compare-version-numbers "Compare Version Numbers") +[< Previous](../compare-version-numbers "Compare Version Numbers") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/two-sum-ii-input-array-is-sorted "Two Sum II - Input array is sorted") +[Next >](../two-sum-ii-input-array-is-sorted "Two Sum II - Input array is sorted") ## [166. Fraction to Recurring Decimal (Medium)](https://leetcode.com/problems/fraction-to-recurring-decimal "分数到小数") @@ -36,8 +36,8 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[Math](../../tag/math/README.md)] ### Hints
diff --git a/problems/freedom-trail/README.md b/problems/freedom-trail/README.md index a3fec895b..f565e1c45 100644 --- a/problems/freedom-trail/README.md +++ b/problems/freedom-trail/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-bottom-left-tree-value "Find Bottom Left Tree Value") +[< Previous](../find-bottom-left-tree-value "Find Bottom Left Tree Value") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-largest-value-in-each-tree-row "Find Largest Value in Each Tree Row") +[Next >](../find-largest-value-in-each-tree-row "Find Largest Value in Each Tree Row") ## [514. Freedom Trail (Hard)](https://leetcode.com/problems/freedom-trail "自由之路") @@ -48,6 +48,6 @@ So the final output is 4. ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Divide and Conquer](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Divide and Conquer](../../tag/divide-and-conquer/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/friend-circles/README.md b/problems/friend-circles/README.md index 6e05570a9..d8eb27439 100644 --- a/problems/friend-circles/README.md +++ b/problems/friend-circles/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/remove-boxes "Remove Boxes") +[< Previous](../remove-boxes "Remove Boxes") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/split-array-with-equal-sum "Split Array with Equal Sum") +[Next >](../split-array-with-equal-sum "Split Array with Equal Sum") ## [547. Friend Circles (Medium)](https://leetcode.com/problems/friend-circles "朋友圈") @@ -51,12 +51,12 @@ Given a N*N matrix M representing the friend relationship between

### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Union Find](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Union Find](../../tag/union-find/README.md)] ### Similar Questions - 1. [Number of Connected Components in an Undirected Graph](https://github.com/openset/leetcode/tree/master/problems/number-of-connected-components-in-an-undirected-graph) (Medium) - 1. [Robot Return to Origin](https://github.com/openset/leetcode/tree/master/problems/robot-return-to-origin) (Easy) - 1. [Sentence Similarity](https://github.com/openset/leetcode/tree/master/problems/sentence-similarity) (Easy) - 1. [Sentence Similarity II](https://github.com/openset/leetcode/tree/master/problems/sentence-similarity-ii) (Medium) - 1. [The Earliest Moment When Everyone Become Friends](https://github.com/openset/leetcode/tree/master/problems/the-earliest-moment-when-everyone-become-friends) (Medium) + 1. [Number of Connected Components in an Undirected Graph](../number-of-connected-components-in-an-undirected-graph) (Medium) + 1. [Robot Return to Origin](../robot-return-to-origin) (Easy) + 1. [Sentence Similarity](../sentence-similarity) (Easy) + 1. [Sentence Similarity II](../sentence-similarity-ii) (Medium) + 1. [The Earliest Moment When Everyone Become Friends](../the-earliest-moment-when-everyone-become-friends) (Medium) diff --git a/problems/friend-requests-i-overall-acceptance-rate/README.md b/problems/friend-requests-i-overall-acceptance-rate/README.md index f9b2bc667..455c32bf6 100644 --- a/problems/friend-requests-i-overall-acceptance-rate/README.md +++ b/problems/friend-requests-i-overall-acceptance-rate/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/classes-more-than-5-students "Classes More Than 5 Students") +[< Previous](../classes-more-than-5-students "Classes More Than 5 Students") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/range-addition-ii "Range Addition II") +[Next >](../range-addition-ii "Range Addition II") ## [597. Friend Requests I: Overall Acceptance Rate (Easy)](https://leetcode.com/problems/friend-requests-i-overall-acceptance-rate "好友申请 I ：总体通过率") diff --git a/problems/friend-requests-ii-who-has-the-most-friends/README.md b/problems/friend-requests-ii-who-has-the-most-friends/README.md index 9ee967544..64f9ceb5d 100644 --- a/problems/friend-requests-ii-who-has-the-most-friends/README.md +++ b/problems/friend-requests-ii-who-has-the-most-friends/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/human-traffic-of-stadium "Human Traffic of Stadium") +[< Previous](../human-traffic-of-stadium "Human Traffic of Stadium") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/consecutive-available-seats "Consecutive Available Seats") +[Next >](../consecutive-available-seats "Consecutive Available Seats") ## [602. Friend Requests II: Who Has the Most Friends (Medium)](https://leetcode.com/problems/friend-requests-ii-who-has-the-most-friends "好友申请 II ：谁有最多的好友") diff --git a/problems/friends-of-appropriate-ages/README.md b/problems/friends-of-appropriate-ages/README.md index ff3ee28c5..bb701da97 100644 --- a/problems/friends-of-appropriate-ages/README.md +++ b/problems/friends-of-appropriate-ages/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/goat-latin "Goat Latin") +[< Previous](../goat-latin "Goat Latin") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/most-profit-assigning-work "Most Profit Assigning Work") +[Next >](../most-profit-assigning-work "Most Profit Assigning Work") ## [825. Friends Of Appropriate Ages (Medium)](https://leetcode.com/problems/friends-of-appropriate-ages "适龄的朋友") @@ -60,4 +60,4 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] diff --git a/problems/frog-jump/README.md b/problems/frog-jump/README.md index 683d006d2..d53a1cc85 100644 --- a/problems/frog-jump/README.md +++ b/problems/frog-jump/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/remove-k-digits "Remove K Digits") +[< Previous](../remove-k-digits "Remove K Digits") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/sum-of-left-leaves "Sum of Left Leaves") +[Next >](../sum-of-left-leaves "Sum of Left Leaves") ## [403. Frog Jump (Hard)](https://leetcode.com/problems/frog-jump "青蛙过河") @@ -52,4 +52,4 @@ the gap between the 5th and 6th stone is too large.

### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/fruit-into-baskets/README.md b/problems/fruit-into-baskets/README.md index 4277daa0b..a42a0ee11 100644 --- a/problems/fruit-into-baskets/README.md +++ b/problems/fruit-into-baskets/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/valid-permutations-for-di-sequence "Valid Permutations for DI Sequence") +[< Previous](../valid-permutations-for-di-sequence "Valid Permutations for DI Sequence") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/sort-array-by-parity "Sort Array By Parity") +[Next >](../sort-array-by-parity "Sort Array By Parity") ## [904. Fruit Into Baskets (Medium)](https://leetcode.com/problems/fruit-into-baskets "水果成篮") @@ -79,4 +79,4 @@ If we started at the first tree, we would only collect [0, 1]. ### Related Topics - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] diff --git a/problems/game-of-life/README.md b/problems/game-of-life/README.md index 0689c2701..59dfaf890 100644 --- a/problems/game-of-life/README.md +++ b/problems/game-of-life/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/unique-word-abbreviation "Unique Word Abbreviation") +[< Previous](../unique-word-abbreviation "Unique Word Abbreviation") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/word-pattern "Word Pattern") +[Next >](../word-pattern "Word Pattern") ## [289. Game of Life (Medium)](https://leetcode.com/problems/game-of-life "生命游戏") @@ -51,7 +51,7 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Set Matrix Zeroes](https://github.com/openset/leetcode/tree/master/problems/set-matrix-zeroes) (Medium) + 1. [Set Matrix Zeroes](../set-matrix-zeroes) (Medium) diff --git a/problems/game-play-analysis-i/README.md b/problems/game-play-analysis-i/README.md index 2520d5221..a736f72a2 100644 --- a/problems/game-play-analysis-i/README.md +++ b/problems/game-play-analysis-i/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/inorder-successor-in-bst-ii "Inorder Successor in BST II") +[< Previous](../inorder-successor-in-bst-ii "Inorder Successor in BST II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/game-play-analysis-ii "Game Play Analysis II") +[Next >](../game-play-analysis-ii "Game Play Analysis II") ## [511. Game Play Analysis I (Easy)](https://leetcode.com/problems/game-play-analysis-i "游戏玩法分析 I") @@ -56,4 +56,4 @@ Result table: ### Similar Questions - 1. [Game Play Analysis II](https://github.com/openset/leetcode/tree/master/problems/game-play-analysis-ii) (Easy) + 1. [Game Play Analysis II](../game-play-analysis-ii) (Easy) diff --git a/problems/game-play-analysis-ii/README.md b/problems/game-play-analysis-ii/README.md index 6775ba01d..7db8badb0 100644 --- a/problems/game-play-analysis-ii/README.md +++ b/problems/game-play-analysis-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/game-play-analysis-i "Game Play Analysis I") +[< Previous](../game-play-analysis-i "Game Play Analysis I") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-bottom-left-tree-value "Find Bottom Left Tree Value") +[Next >](../find-bottom-left-tree-value "Find Bottom Left Tree Value") ## [512. Game Play Analysis II (Easy)](https://leetcode.com/problems/game-play-analysis-ii "游戏玩法分析 II") @@ -55,5 +55,5 @@ Result table: +-----------+-----------+ ### Similar Questions - 1. [Game Play Analysis I](https://github.com/openset/leetcode/tree/master/problems/game-play-analysis-i) (Easy) - 1. [Game Play Analysis III](https://github.com/openset/leetcode/tree/master/problems/game-play-analysis-iii) (Medium) + 1. [Game Play Analysis I](../game-play-analysis-i) (Easy) + 1. [Game Play Analysis III](../game-play-analysis-iii) (Medium) diff --git a/problems/game-play-analysis-iii/README.md b/problems/game-play-analysis-iii/README.md index ebbdfc751..555eb3114 100644 --- a/problems/game-play-analysis-iii/README.md +++ b/problems/game-play-analysis-iii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-ii "Lonely Pixel II") +[< Previous](../lonely-pixel-ii "Lonely Pixel II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/encode-and-decode-tinyurl "Encode and Decode TinyURL") +[Next >](../encode-and-decode-tinyurl "Encode and Decode TinyURL") ## [534. Game Play Analysis III (Medium)](https://leetcode.com/problems/game-play-analysis-iii "游戏玩法分析 III") @@ -61,5 +61,5 @@ Note that for each player we only care about the days when the player logged in. ### Similar Questions - 1. [Game Play Analysis II](https://github.com/openset/leetcode/tree/master/problems/game-play-analysis-ii) (Easy) - 1. [Game Play Analysis IV](https://github.com/openset/leetcode/tree/master/problems/game-play-analysis-iv) (Medium) + 1. [Game Play Analysis II](../game-play-analysis-ii) (Easy) + 1. [Game Play Analysis IV](../game-play-analysis-iv) (Medium) diff --git a/problems/game-play-analysis-iv/README.md b/problems/game-play-analysis-iv/README.md index 00e6a5294..d77b91fa4 100644 --- a/problems/game-play-analysis-iv/README.md +++ b/problems/game-play-analysis-iv/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/binary-tree-longest-consecutive-sequence-ii "Binary Tree Longest Consecutive Sequence II") +[< Previous](../binary-tree-longest-consecutive-sequence-ii "Binary Tree Longest Consecutive Sequence II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/student-attendance-record-i "Student Attendance Record I") +[Next >](../student-attendance-record-i "Student Attendance Record I") ## [550. Game Play Analysis IV (Medium)](https://leetcode.com/problems/game-play-analysis-iv "游戏玩法分析 IV") @@ -55,5 +55,5 @@ Only the player with id 1 logged back in after the first day he had logged in so ### Similar Questions - 1. [Game Play Analysis III](https://github.com/openset/leetcode/tree/master/problems/game-play-analysis-iii) (Medium) - 1. [Game Play Analysis V](https://github.com/openset/leetcode/tree/master/problems/game-play-analysis-v) (Hard) + 1. [Game Play Analysis III](../game-play-analysis-iii) (Medium) + 1. [Game Play Analysis V](../game-play-analysis-v) (Hard) diff --git a/problems/game-play-analysis-v/README.md b/problems/game-play-analysis-v/README.md index 1cddfdc34..956b97d1e 100644 --- a/problems/game-play-analysis-v/README.md +++ b/problems/game-play-analysis-v/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/brace-expansion-ii "Brace Expansion II") +[< Previous](../brace-expansion-ii "Brace Expansion II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/unpopular-books "Unpopular Books") +[Next >](../unpopular-books "Unpopular Books") ## [1097. Game Play Analysis V (Hard)](https://leetcode.com/problems/game-play-analysis-v "游戏玩法分析 V") @@ -61,4 +61,4 @@ Player 2 installed the game on 2017-06-25 but didn't log back in on 2017-06- ### Similar Questions - 1. [Game Play Analysis IV](https://github.com/openset/leetcode/tree/master/problems/game-play-analysis-iv) (Medium) + 1. [Game Play Analysis IV](../game-play-analysis-iv) (Medium) diff --git a/problems/gas-station/README.md b/problems/gas-station/README.md index f7d8de52d..2f7fb4a75 100644 --- a/problems/gas-station/README.md +++ b/problems/gas-station/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/clone-graph "Clone Graph") +[< Previous](../clone-graph "Clone Graph") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/candy "Candy") +[Next >](../candy "Candy") ## [134. Gas Station (Medium)](https://leetcode.com/problems/gas-station "加油站") @@ -63,4 +63,4 @@ Therefore, you can't travel around the circuit once no matter where you star ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] + [[Greedy](../../tag/greedy/README.md)] diff --git a/problems/generalized-abbreviation/README.md b/problems/generalized-abbreviation/README.md index 77db54cad..2756ddefe 100644 --- a/problems/generalized-abbreviation/README.md +++ b/problems/generalized-abbreviation/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/bulb-switcher "Bulb Switcher") +[< Previous](../bulb-switcher "Bulb Switcher") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/create-maximum-number "Create Maximum Number") +[Next >](../create-maximum-number "Create Maximum Number") ## [320. Generalized Abbreviation (Medium)](https://leetcode.com/problems/generalized-abbreviation "列举单词的全部缩写") @@ -26,10 +26,10 @@

 

### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Subsets](https://github.com/openset/leetcode/tree/master/problems/subsets) (Medium) - 1. [Unique Word Abbreviation](https://github.com/openset/leetcode/tree/master/problems/unique-word-abbreviation) (Medium) - 1. [Minimum Unique Word Abbreviation](https://github.com/openset/leetcode/tree/master/problems/minimum-unique-word-abbreviation) (Hard) + 1. [Subsets](../subsets) (Medium) + 1. [Unique Word Abbreviation](../unique-word-abbreviation) (Medium) + 1. [Minimum Unique Word Abbreviation](../minimum-unique-word-abbreviation) (Hard) diff --git a/problems/generate-parentheses/README.md b/problems/generate-parentheses/README.md index cc22abf0f..2a97c5fa7 100644 --- a/problems/generate-parentheses/README.md +++ b/problems/generate-parentheses/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/merge-two-sorted-lists "Merge Two Sorted Lists") +[< Previous](../merge-two-sorted-lists "Merge Two Sorted Lists") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/merge-k-sorted-lists "Merge k Sorted Lists") +[Next >](../merge-k-sorted-lists "Merge k Sorted Lists") ## [22. Generate Parentheses (Medium)](https://leetcode.com/problems/generate-parentheses "括号生成") @@ -29,9 +29,9 @@ For example, given n = 3, a solution set is: ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[String](../../tag/string/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Letter Combinations of a Phone Number](https://github.com/openset/leetcode/tree/master/problems/letter-combinations-of-a-phone-number) (Medium) - 1. [Valid Parentheses](https://github.com/openset/leetcode/tree/master/problems/valid-parentheses) (Easy) + 1. [Letter Combinations of a Phone Number](../letter-combinations-of-a-phone-number) (Medium) + 1. [Valid Parentheses](../valid-parentheses) (Easy) diff --git a/problems/generate-random-point-in-a-circle/README.md b/problems/generate-random-point-in-a-circle/README.md index 12f720905..fd63e7eab 100644 --- a/problems/generate-random-point-in-a-circle/README.md +++ b/problems/generate-random-point-in-a-circle/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/total-hamming-distance "Total Hamming Distance") +[< Previous](../total-hamming-distance "Total Hamming Distance") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/largest-palindrome-product "Largest Palindrome Product") +[Next >](../largest-palindrome-product "Largest Palindrome Product") ## [478. Generate Random Point in a Circle (Medium)](https://leetcode.com/problems/generate-random-point-in-a-circle "在圆内随机生成点") @@ -48,9 +48,9 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Random](https://github.com/openset/leetcode/tree/master/tag/random/README.md)] - [[Rejection Sampling](https://github.com/openset/leetcode/tree/master/tag/rejection-sampling/README.md)] + [[Math](../../tag/math/README.md)] + [[Random](../../tag/random/README.md)] + [[Rejection Sampling](../../tag/rejection-sampling/README.md)] ### Similar Questions - 1. [Random Point in Non-overlapping Rectangles](https://github.com/openset/leetcode/tree/master/problems/random-point-in-non-overlapping-rectangles) (Medium) + 1. [Random Point in Non-overlapping Rectangles](../random-point-in-non-overlapping-rectangles) (Medium) diff --git a/problems/get-equal-substrings-within-budget/README.md b/problems/get-equal-substrings-within-budget/README.md index 9b88f63e4..d2cbf28f0 100644 --- a/problems/get-equal-substrings-within-budget/README.md +++ b/problems/get-equal-substrings-within-budget/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/unique-number-of-occurrences "Unique Number of Occurrences") +[< Previous](../unique-number-of-occurrences "Unique Number of Occurrences") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/remove-all-adjacent-duplicates-in-string-ii "Remove All Adjacent Duplicates in String II") +[Next >](../remove-all-adjacent-duplicates-in-string-ii "Remove All Adjacent Duplicates in String II") ## [1208. Get Equal Substrings Within Budget (Medium)](https://leetcode.com/problems/get-equal-substrings-within-budget "尽可能使字符串相等") @@ -53,8 +53,8 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] + [[Array](../../tag/array/README.md)] + [[Sliding Window](../../tag/sliding-window/README.md)] ### Hints
diff --git a/problems/get-highest-answer-rate-question/README.md b/problems/get-highest-answer-rate-question/README.md index 4f9aac8eb..4683e1aa4 100644 --- a/problems/get-highest-answer-rate-question/README.md +++ b/problems/get-highest-answer-rate-question/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/employee-bonus "Employee Bonus") +[< Previous](../employee-bonus "Employee Bonus") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-cumulative-salary-of-an-employee "Find Cumulative Salary of an Employee") +[Next >](../find-cumulative-salary-of-an-employee "Find Cumulative Salary of an Employee") ## [578. Get Highest Answer Rate Question (Medium)](https://leetcode.com/problems/get-highest-answer-rate-question "查询回答率最高的问题") diff --git a/problems/global-and-local-inversions/README.md b/problems/global-and-local-inversions/README.md index ca5c69374..e30189aff 100644 --- a/problems/global-and-local-inversions/README.md +++ b/problems/global-and-local-inversions/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimize-max-distance-to-gas-station "Minimize Max Distance to Gas Station") +[< Previous](../minimize-max-distance-to-gas-station "Minimize Max Distance to Gas Station") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/split-bst "Split BST") +[Next >](../split-bst "Split BST") ## [775. Global and Local Inversions (Medium)](https://leetcode.com/problems/global-and-local-inversions "全局倒置与局部倒置") @@ -44,8 +44,8 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Array](../../tag/array/README.md)] + [[Math](../../tag/math/README.md)] ### Hints
diff --git a/problems/goat-latin/README.md b/problems/goat-latin/README.md index 5725ac1db..2e54aee6b 100644 --- a/problems/goat-latin/README.md +++ b/problems/goat-latin/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/binary-trees-with-factors "Binary Trees With Factors") +[< Previous](../binary-trees-with-factors "Binary Trees With Factors") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/friends-of-appropriate-ages "Friends Of Appropriate Ages") +[Next >](../friends-of-appropriate-ages "Friends Of Appropriate Ages") ## [824. Goat Latin (Easy)](https://leetcode.com/problems/goat-latin "山羊拉丁文") @@ -56,4 +56,4 @@ ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/graph-valid-tree/README.md b/problems/graph-valid-tree/README.md index e6d65ec73..fa7a72d39 100644 --- a/problems/graph-valid-tree/README.md +++ b/problems/graph-valid-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/single-number-iii "Single Number III") +[< Previous](../single-number-iii "Single Number III") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/trips-and-users "Trips and Users") +[Next >](../trips-and-users "Trips and Users") ## [261. Graph Valid Tree (Medium)](https://leetcode.com/problems/graph-valid-tree "以图判树") @@ -28,14 +28,14 @@

Note: you can assume that no duplicate edges will appear in edges. Since all edges are undirected, [0,1] is the same as [1,0] and thus will not appear together in edges.

### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] - [[Union Find](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] + [[Union Find](../../tag/union-find/README.md)] + [[Graph](../../tag/graph/README.md)] ### Similar Questions - 1. [Course Schedule](https://github.com/openset/leetcode/tree/master/problems/course-schedule) (Medium) - 1. [Number of Connected Components in an Undirected Graph](https://github.com/openset/leetcode/tree/master/problems/number-of-connected-components-in-an-undirected-graph) (Medium) + 1. [Course Schedule](../course-schedule) (Medium) + 1. [Number of Connected Components in an Undirected Graph](../number-of-connected-components-in-an-undirected-graph) (Medium) ### Hints
diff --git a/problems/gray-code/README.md b/problems/gray-code/README.md index e2cbe11f9..45b98b773 100644 --- a/problems/gray-code/README.md +++ b/problems/gray-code/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/merge-sorted-array "Merge Sorted Array") +[< Previous](../merge-sorted-array "Merge Sorted Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/subsets-ii "Subsets II") +[Next >](../subsets-ii "Subsets II") ## [89. Gray Code (Medium)](https://leetcode.com/problems/gray-code "格雷编码") @@ -46,7 +46,7 @@ For example, [0,2,3,1] is also a valid gray code sequence. ### Related Topics - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [1-bit and 2-bit Characters](https://github.com/openset/leetcode/tree/master/problems/1-bit-and-2-bit-characters) (Easy) + 1. [1-bit and 2-bit Characters](../1-bit-and-2-bit-characters) (Easy) diff --git a/problems/greatest-common-divisor-of-strings/README.md b/problems/greatest-common-divisor-of-strings/README.md index fe1cafc8e..1b3cb2011 100644 --- a/problems/greatest-common-divisor-of-strings/README.md +++ b/problems/greatest-common-divisor-of-strings/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/product-sales-analysis-iii "Product Sales Analysis III") +[< Previous](../product-sales-analysis-iii "Product Sales Analysis III") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/flip-columns-for-maximum-number-of-equal-rows "Flip Columns For Maximum Number of Equal Rows") +[Next >](../flip-columns-for-maximum-number-of-equal-rows "Flip Columns For Maximum Number of Equal Rows") ## [1071. Greatest Common Divisor of Strings (Easy)](https://leetcode.com/problems/greatest-common-divisor-of-strings "字符串的最大公因子") @@ -49,7 +49,7 @@ ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Hints
diff --git a/problems/greatest-sum-divisible-by-three/README.md b/problems/greatest-sum-divisible-by-three/README.md index ee114840e..da02d3620 100644 --- a/problems/greatest-sum-divisible-by-three/README.md +++ b/problems/greatest-sum-divisible-by-three/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-elements-in-a-contaminated-binary-tree "Find Elements in a Contaminated Binary Tree") +[< Previous](../find-elements-in-a-contaminated-binary-tree "Find Elements in a Contaminated Binary Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-moves-to-move-a-box-to-their-target-location "Minimum Moves to Move a Box to Their Target Location") +[Next >](../minimum-moves-to-move-a-box-to-their-target-location "Minimum Moves to Move a Box to Their Target Location") ## [1262. Greatest Sum Divisible by Three (Medium)](https://leetcode.com/problems/greatest-sum-divisible-by-three "可被三整除的最大和") @@ -49,7 +49,7 @@ ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/grid-illumination/README.md b/problems/grid-illumination/README.md index cb727408e..818a21554 100644 --- a/problems/grid-illumination/README.md +++ b/problems/grid-illumination/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-cost-to-merge-stones "Minimum Cost to Merge Stones") +[< Previous](../minimum-cost-to-merge-stones "Minimum Cost to Merge Stones") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-common-characters "Find Common Characters") +[Next >](../find-common-characters "Find Common Characters") ## [1001. Grid Illumination (Hard)](https://leetcode.com/problems/grid-illumination "网格照明") @@ -57,7 +57,7 @@ Before performing the second query we have only the lamp [4,4] on. Now the quer ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [N-Queens](https://github.com/openset/leetcode/tree/master/problems/n-queens) (Hard) + 1. [N-Queens](../n-queens) (Hard) diff --git a/problems/group-anagrams/README.md b/problems/group-anagrams/README.md index 1b3206ce6..3032aad0f 100644 --- a/problems/group-anagrams/README.md +++ b/problems/group-anagrams/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/rotate-image "Rotate Image") +[< Previous](../rotate-image "Rotate Image") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/powx-n "Pow(x, n)") +[Next >](../powx-n "Pow(x, n)") ## [49. Group Anagrams (Medium)](https://leetcode.com/problems/group-anagrams "字母异位词分组") @@ -32,9 +32,9 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Valid Anagram](https://github.com/openset/leetcode/tree/master/problems/valid-anagram) (Easy) - 1. [Group Shifted Strings](https://github.com/openset/leetcode/tree/master/problems/group-shifted-strings) (Medium) + 1. [Valid Anagram](../valid-anagram) (Easy) + 1. [Group Shifted Strings](../group-shifted-strings) (Medium) diff --git a/problems/group-shifted-strings/README.md b/problems/group-shifted-strings/README.md index 4074686f3..00b649435 100644 --- a/problems/group-shifted-strings/README.md +++ b/problems/group-shifted-strings/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number-iii "Strobogrammatic Number III") +[< Previous](../strobogrammatic-number-iii "Strobogrammatic Number III") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/count-univalue-subtrees "Count Univalue Subtrees") +[Next >](../count-univalue-subtrees "Count Univalue Subtrees") ## [249. Group Shifted Strings (Medium)](https://leetcode.com/problems/group-shifted-strings "移位字符串分组") @@ -32,8 +32,8 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Group Anagrams](https://github.com/openset/leetcode/tree/master/problems/group-anagrams) (Medium) + 1. [Group Anagrams](../group-anagrams) (Medium) diff --git a/problems/group-the-people-given-the-group-size-they-belong-to/README.md b/problems/group-the-people-given-the-group-size-they-belong-to/README.md index c9a4db1e7..cb02db933 100644 --- a/problems/group-the-people-given-the-group-size-they-belong-to/README.md +++ b/problems/group-the-people-given-the-group-size-they-belong-to/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/subtract-the-product-and-sum-of-digits-of-an-integer "Subtract the Product and Sum of Digits of an Integer") +[< Previous](../subtract-the-product-and-sum-of-digits-of-an-integer "Subtract the Product and Sum of Digits of an Integer") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-the-smallest-divisor-given-a-threshold "Find the Smallest Divisor Given a Threshold") +[Next >](../find-the-smallest-divisor-given-a-threshold "Find the Smallest Divisor Given a Threshold") ## [1282. Group the People Given the Group Size They Belong To (Medium)](https://leetcode.com/problems/group-the-people-given-the-group-size-they-belong-to "用户分组") @@ -42,7 +42,7 @@ Other possible solutions are [[2,1,6],[5],[0,4,3]] and [[5],[0,6,2],[4,3,1]]. ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] + [[Greedy](../../tag/greedy/README.md)] ### Hints
diff --git a/problems/groups-of-special-equivalent-strings/README.md b/problems/groups-of-special-equivalent-strings/README.md index 90e9e8a9b..c2a4c5ec0 100644 --- a/problems/groups-of-special-equivalent-strings/README.md +++ b/problems/groups-of-special-equivalent-strings/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/surface-area-of-3d-shapes "Surface Area of 3D Shapes") +[< Previous](../surface-area-of-3d-shapes "Surface Area of 3D Shapes") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/all-possible-full-binary-trees "All Possible Full Binary Trees") +[Next >](../all-possible-full-binary-trees "All Possible Full Binary Trees") ## [893. Groups of Special-Equivalent Strings (Easy)](https://leetcode.com/problems/groups-of-special-equivalent-strings "特殊等价字符串组") @@ -71,4 +71,4 @@ The other two groups are ["xyzz", "zzxy"] and ["zzyx&qu ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/grumpy-bookstore-owner/README.md b/problems/grumpy-bookstore-owner/README.md index d448161e1..0982db199 100644 --- a/problems/grumpy-bookstore-owner/README.md +++ b/problems/grumpy-bookstore-owner/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/height-checker "Height Checker") +[< Previous](../height-checker "Height Checker") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/previous-permutation-with-one-swap "Previous Permutation With One Swap") +[Next >](../previous-permutation-with-one-swap "Previous Permutation With One Swap") ## [1052. Grumpy Bookstore Owner (Medium)](https://leetcode.com/problems/grumpy-bookstore-owner "爱生气的书店老板") @@ -41,8 +41,8 @@ The maximum number of customers that can be satisfied = 1 + 1 + 1 + 1 + 7 + 5 = ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] + [[Array](../../tag/array/README.md)] + [[Sliding Window](../../tag/sliding-window/README.md)] ### Hints
diff --git a/problems/guess-number-higher-or-lower-ii/README.md b/problems/guess-number-higher-or-lower-ii/README.md index 1ba4686b3..f18636f96 100644 --- a/problems/guess-number-higher-or-lower-ii/README.md +++ b/problems/guess-number-higher-or-lower-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/guess-number-higher-or-lower "Guess Number Higher or Lower") +[< Previous](../guess-number-higher-or-lower "Guess Number Higher or Lower") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/wiggle-subsequence "Wiggle Subsequence") +[Next >](../wiggle-subsequence "Wiggle Subsequence") ## [375. Guess Number Higher or Lower II (Medium)](https://leetcode.com/problems/guess-number-higher-or-lower-ii "猜数字大小 II") @@ -36,14 +36,14 @@ You end up paying $5 + $7 + $9 = $21.

Given a particular n ≥ 1, find out how much money you need to have to guarantee a win.

### Related Topics - [[Minimax](https://github.com/openset/leetcode/tree/master/tag/minimax/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Minimax](../../tag/minimax/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Flip Game II](https://github.com/openset/leetcode/tree/master/problems/flip-game-ii) (Medium) - 1. [Guess Number Higher or Lower](https://github.com/openset/leetcode/tree/master/problems/guess-number-higher-or-lower) (Easy) - 1. [Can I Win](https://github.com/openset/leetcode/tree/master/problems/can-i-win) (Medium) - 1. [Find K Closest Elements](https://github.com/openset/leetcode/tree/master/problems/find-k-closest-elements) (Medium) + 1. [Flip Game II](../flip-game-ii) (Medium) + 1. [Guess Number Higher or Lower](../guess-number-higher-or-lower) (Easy) + 1. [Can I Win](../can-i-win) (Medium) + 1. [Find K Closest Elements](../find-k-closest-elements) (Medium) ### Hints
diff --git a/problems/guess-number-higher-or-lower/README.md b/problems/guess-number-higher-or-lower/README.md index 598ab18b4..22924c652 100644 --- a/problems/guess-number-higher-or-lower/README.md +++ b/problems/guess-number-higher-or-lower/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-k-pairs-with-smallest-sums "Find K Pairs with Smallest Sums") +[< Previous](../find-k-pairs-with-smallest-sums "Find K Pairs with Smallest Sums") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/guess-number-higher-or-lower-ii "Guess Number Higher or Lower II") +[Next >](../guess-number-higher-or-lower-ii "Guess Number Higher or Lower II") ## [374. Guess Number Higher or Lower (Easy)](https://leetcode.com/problems/guess-number-higher-or-lower "猜数字大小") @@ -35,9 +35,9 @@ ### Related Topics - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [First Bad Version](https://github.com/openset/leetcode/tree/master/problems/first-bad-version) (Easy) - 1. [Guess Number Higher or Lower II](https://github.com/openset/leetcode/tree/master/problems/guess-number-higher-or-lower-ii) (Medium) - 1. [Find K Closest Elements](https://github.com/openset/leetcode/tree/master/problems/find-k-closest-elements) (Medium) + 1. [First Bad Version](../first-bad-version) (Easy) + 1. [Guess Number Higher or Lower II](../guess-number-higher-or-lower-ii) (Medium) + 1. [Find K Closest Elements](../find-k-closest-elements) (Medium) diff --git a/problems/guess-the-word/README.md b/problems/guess-the-word/README.md index a5cb5b43f..8e640a233 100644 --- a/problems/guess-the-word/README.md +++ b/problems/guess-the-word/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/split-array-into-fibonacci-sequence "Split Array into Fibonacci Sequence") +[< Previous](../split-array-into-fibonacci-sequence "Split Array into Fibonacci Sequence") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/backspace-string-compare "Backspace String Compare") +[Next >](../backspace-string-compare "Backspace String Compare") ## [843. Guess the Word (Hard)](https://leetcode.com/problems/guess-the-word "猜猜这个单词") @@ -41,4 +41,4 @@ We made 5 calls to master.guess and one of them was the secret, so we pass

Note:  Any solutions that attempt to circumvent the judge will result in disqualification.

### Related Topics - [[Minimax](https://github.com/openset/leetcode/tree/master/tag/minimax/README.md)] + [[Minimax](../../tag/minimax/README.md)] diff --git a/problems/h-index-ii/README.md b/problems/h-index-ii/README.md index 8d88f86ae..841f4c137 100644 --- a/problems/h-index-ii/README.md +++ b/problems/h-index-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/h-index "H-Index") +[< Previous](../h-index "H-Index") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/paint-fence "Paint Fence") +[Next >](../paint-fence "Paint Fence") ## [275. H-Index II (Medium)](https://leetcode.com/problems/h-index-ii "H指数 II") @@ -37,10 +37,10 @@ ### Related Topics - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [H-Index](https://github.com/openset/leetcode/tree/master/problems/h-index) (Medium) + 1. [H-Index](../h-index) (Medium) ### Hints
diff --git a/problems/h-index/README.md b/problems/h-index/README.md index 39476a408..0858d62f3 100644 --- a/problems/h-index/README.md +++ b/problems/h-index/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/integer-to-english-words "Integer to English Words") +[< Previous](../integer-to-english-words "Integer to English Words") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/h-index-ii "H-Index II") +[Next >](../h-index-ii "H-Index II") ## [274. H-Index (Medium)](https://leetcode.com/problems/h-index "H指数") @@ -28,11 +28,11 @@

Note: If there are several possible values for h, the maximum one is taken as the h-index.

### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Sort](../../tag/sort/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [H-Index II](https://github.com/openset/leetcode/tree/master/problems/h-index-ii) (Medium) + 1. [H-Index II](../h-index-ii) (Medium) ### Hints
diff --git a/problems/hamming-distance/README.md b/problems/hamming-distance/README.md index 11d24a912..9c1800a39 100644 --- a/problems/hamming-distance/README.md +++ b/problems/hamming-distance/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/lfu-cache "LFU Cache") +[< Previous](../lfu-cache "LFU Cache") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-moves-to-equal-array-elements-ii "Minimum Moves to Equal Array Elements II") +[Next >](../minimum-moves-to-equal-array-elements-ii "Minimum Moves to Equal Array Elements II") ## [461. Hamming Distance (Easy)](https://leetcode.com/problems/hamming-distance "汉明距离") @@ -35,8 +35,8 @@ The above arrows point to positions where the corresponding bits are different.

### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] ### Similar Questions - 1. [Number of 1 Bits](https://github.com/openset/leetcode/tree/master/problems/number-of-1-bits) (Easy) - 1. [Total Hamming Distance](https://github.com/openset/leetcode/tree/master/problems/total-hamming-distance) (Medium) + 1. [Number of 1 Bits](../number-of-1-bits) (Easy) + 1. [Total Hamming Distance](../total-hamming-distance) (Medium) diff --git a/problems/hand-of-straights/README.md b/problems/hand-of-straights/README.md index c2ad4a023..fe56a4df6 100644 --- a/problems/hand-of-straights/README.md +++ b/problems/hand-of-straights/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/longest-mountain-in-array "Longest Mountain in Array") +[< Previous](../longest-mountain-in-array "Longest Mountain in Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/shortest-path-visiting-all-nodes "Shortest Path Visiting All Nodes") +[Next >](../shortest-path-visiting-all-nodes "Shortest Path Visiting All Nodes") ## [846. Hand of Straights (Medium)](https://leetcode.com/problems/hand-of-straights "一手顺子") @@ -47,4 +47,4 @@ ### Related Topics - [[Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md)] + [[Ordered Map](../../tag/ordered-map/README.md)] diff --git a/problems/handshakes-that-dont-cross/README.md b/problems/handshakes-that-dont-cross/README.md index 16bfdfafb..3817221f4 100644 --- a/problems/handshakes-that-dont-cross/README.md +++ b/problems/handshakes-that-dont-cross/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/synonymous-sentences "Synonymous Sentences") +[< Previous](../synonymous-sentences "Synonymous Sentences") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/shift-2d-grid "Shift 2D Grid") +[Next >](../shift-2d-grid "Shift 2D Grid") ## [1259. Handshakes That Don't Cross (Hard)](https://leetcode.com/problems/handshakes-that-dont-cross "不相交的握手") @@ -60,8 +60,8 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Math](../../tag/math/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/happy-number/README.md b/problems/happy-number/README.md index 6c4e98a6e..b1cf88483 100644 --- a/problems/happy-number/README.md +++ b/problems/happy-number/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/bitwise-and-of-numbers-range "Bitwise AND of Numbers Range") +[< Previous](../bitwise-and-of-numbers-range "Bitwise AND of Numbers Range") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/remove-linked-list-elements "Remove Linked List Elements") +[Next >](../remove-linked-list-elements "Remove Linked List Elements") ## [202. Happy Number (Easy)](https://leetcode.com/problems/happy-number "快乐数") @@ -28,10 +28,10 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Linked List Cycle](https://github.com/openset/leetcode/tree/master/problems/linked-list-cycle) (Easy) - 1. [Add Digits](https://github.com/openset/leetcode/tree/master/problems/add-digits) (Easy) - 1. [Ugly Number](https://github.com/openset/leetcode/tree/master/problems/ugly-number) (Easy) + 1. [Linked List Cycle](../linked-list-cycle) (Easy) + 1. [Add Digits](../add-digits) (Easy) + 1. [Ugly Number](../ugly-number) (Easy) diff --git a/problems/heaters/README.md b/problems/heaters/README.md index e1d252034..db6bfe032 100644 --- a/problems/heaters/README.md +++ b/problems/heaters/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/ones-and-zeroes "Ones and Zeroes") +[< Previous](../ones-and-zeroes "Ones and Zeroes") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/number-complement "Number Complement") +[Next >](../number-complement "Number Complement") ## [475. Heaters (Easy)](https://leetcode.com/problems/heaters "供暖器") @@ -49,4 +49,4 @@

 

### Related Topics - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] diff --git a/problems/height-checker/README.md b/problems/height-checker/README.md index c540c1287..e35335df7 100644 --- a/problems/height-checker/README.md +++ b/problems/height-checker/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/actors-and-directors-who-cooperated-at-least-three-times "Actors and Directors Who Cooperated At Least Three Times") +[< Previous](../actors-and-directors-who-cooperated-at-least-three-times "Actors and Directors Who Cooperated At Least Three Times") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/grumpy-bookstore-owner "Grumpy Bookstore Owner") +[Next >](../grumpy-bookstore-owner "Grumpy Bookstore Owner") ## [1051. Height Checker (Easy)](https://leetcode.com/problems/height-checker "高度检查器") @@ -36,7 +36,7 @@ Students with heights 4, 3 and the last 1 are not standing in the right position ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Hints
diff --git a/problems/hexspeak/README.md b/problems/hexspeak/README.md index 05f0646e4..9813d663b 100644 --- a/problems/hexspeak/README.md +++ b/problems/hexspeak/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/all-people-report-to-the-given-manager "All People Report to the Given Manager") +[< Previous](../all-people-report-to-the-given-manager "All People Report to the Given Manager") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/remove-interval "Remove Interval") +[Next >](../remove-interval "Remove Interval") ## [1271. Hexspeak (Easy)](https://leetcode.com/problems/hexspeak "十六进制魔术数字") @@ -41,8 +41,8 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Math](../../tag/math/README.md)] + [[String](../../tag/string/README.md)] ### Hints
diff --git a/problems/high-five/README.md b/problems/high-five/README.md index be848bcad..dfc3770d5 100644 --- a/problems/high-five/README.md +++ b/problems/high-five/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/sum-of-digits-in-the-minimum-number "Sum of Digits in the Minimum Number") +[< Previous](../sum-of-digits-in-the-minimum-number "Sum of Digits in the Minimum Number") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/brace-expansion "Brace Expansion") +[Next >](../brace-expansion "Brace Expansion") ## [1086. High Five (Easy)](https://leetcode.com/problems/high-five "前五科的均分") @@ -40,9 +40,9 @@ The average of the student with id = 2 is 88.6. But with integer division their ### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Sort](../../tag/sort/README.md)] + [[Array](../../tag/array/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Hints
diff --git a/problems/highest-grade-for-each-student/README.md b/problems/highest-grade-for-each-student/README.md index b70a600ae..509bc1cef 100644 --- a/problems/highest-grade-for-each-student/README.md +++ b/problems/highest-grade-for-each-student/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-nesting-depth-of-two-valid-parentheses-strings "Maximum Nesting Depth of Two Valid Parentheses Strings") +[< Previous](../maximum-nesting-depth-of-two-valid-parentheses-strings "Maximum Nesting Depth of Two Valid Parentheses Strings") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/reported-posts "Reported Posts") +[Next >](../reported-posts "Reported Posts") ## [1112. Highest Grade For Each Student (Medium)](https://leetcode.com/problems/highest-grade-for-each-student "每位学生的最高成绩") diff --git a/problems/house-robber-ii/README.md b/problems/house-robber-ii/README.md index f6edda3dd..feedaf417 100644 --- a/problems/house-robber-ii/README.md +++ b/problems/house-robber-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/word-search-ii "Word Search II") +[< Previous](../word-search-ii "Word Search II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/shortest-palindrome "Shortest Palindrome") +[Next >](../shortest-palindrome "Shortest Palindrome") ## [213. House Robber II (Medium)](https://leetcode.com/problems/house-robber-ii "打家劫舍 II") @@ -33,15 +33,15 @@   Total amount you can rob = 1 + 3 = 4. ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [House Robber](https://github.com/openset/leetcode/tree/master/problems/house-robber) (Easy) - 1. [Paint House](https://github.com/openset/leetcode/tree/master/problems/paint-house) (Easy) - 1. [Paint Fence](https://github.com/openset/leetcode/tree/master/problems/paint-fence) (Easy) - 1. [House Robber III](https://github.com/openset/leetcode/tree/master/problems/house-robber-iii) (Medium) - 1. [Non-negative Integers without Consecutive Ones](https://github.com/openset/leetcode/tree/master/problems/non-negative-integers-without-consecutive-ones) (Hard) - 1. [Coin Path](https://github.com/openset/leetcode/tree/master/problems/coin-path) (Hard) + 1. [House Robber](../house-robber) (Easy) + 1. [Paint House](../paint-house) (Easy) + 1. [Paint Fence](../paint-fence) (Easy) + 1. [House Robber III](../house-robber-iii) (Medium) + 1. [Non-negative Integers without Consecutive Ones](../non-negative-integers-without-consecutive-ones) (Hard) + 1. [Coin Path](../coin-path) (Hard) ### Hints
diff --git a/problems/house-robber-iii/README.md b/problems/house-robber-iii/README.md index 8b0537266..55f2fe6f3 100644 --- a/problems/house-robber-iii/README.md +++ b/problems/house-robber-iii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/palindrome-pairs "Palindrome Pairs") +[< Previous](../palindrome-pairs "Palindrome Pairs") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/counting-bits "Counting Bits") +[Next >](../counting-bits "Counting Bits") ## [337. House Robber III (Medium)](https://leetcode.com/problems/house-robber-iii "打家劫舍 III") @@ -45,9 +45,9 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] ### Similar Questions - 1. [House Robber](https://github.com/openset/leetcode/tree/master/problems/house-robber) (Easy) - 1. [House Robber II](https://github.com/openset/leetcode/tree/master/problems/house-robber-ii) (Medium) + 1. [House Robber](../house-robber) (Easy) + 1. [House Robber II](../house-robber-ii) (Medium) diff --git a/problems/house-robber/README.md b/problems/house-robber/README.md index 0ef57af06..e6cf1754f 100644 --- a/problems/house-robber/README.md +++ b/problems/house-robber/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/rising-temperature "Rising Temperature") +[< Previous](../rising-temperature "Rising Temperature") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/binary-tree-right-side-view "Binary Tree Right Side View") +[Next >](../binary-tree-right-side-view "Binary Tree Right Side View") ## [198. House Robber (Easy)](https://leetcode.com/problems/house-robber "打家劫舍") @@ -33,14 +33,14 @@ ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Maximum Product Subarray](https://github.com/openset/leetcode/tree/master/problems/maximum-product-subarray) (Medium) - 1. [House Robber II](https://github.com/openset/leetcode/tree/master/problems/house-robber-ii) (Medium) - 1. [Paint House](https://github.com/openset/leetcode/tree/master/problems/paint-house) (Easy) - 1. [Paint Fence](https://github.com/openset/leetcode/tree/master/problems/paint-fence) (Easy) - 1. [House Robber III](https://github.com/openset/leetcode/tree/master/problems/house-robber-iii) (Medium) - 1. [Non-negative Integers without Consecutive Ones](https://github.com/openset/leetcode/tree/master/problems/non-negative-integers-without-consecutive-ones) (Hard) - 1. [Coin Path](https://github.com/openset/leetcode/tree/master/problems/coin-path) (Hard) - 1. [Delete and Earn](https://github.com/openset/leetcode/tree/master/problems/delete-and-earn) (Medium) + 1. [Maximum Product Subarray](../maximum-product-subarray) (Medium) + 1. [House Robber II](../house-robber-ii) (Medium) + 1. [Paint House](../paint-house) (Easy) + 1. [Paint Fence](../paint-fence) (Easy) + 1. [House Robber III](../house-robber-iii) (Medium) + 1. [Non-negative Integers without Consecutive Ones](../non-negative-integers-without-consecutive-ones) (Hard) + 1. [Coin Path](../coin-path) (Hard) + 1. [Delete and Earn](../delete-and-earn) (Medium) diff --git a/problems/how-many-apples-can-you-put-into-the-basket/README.md b/problems/how-many-apples-can-you-put-into-the-basket/README.md index 862ac9644..db663b1de 100644 --- a/problems/how-many-apples-can-you-put-into-the-basket/README.md +++ b/problems/how-many-apples-can-you-put-into-the-basket/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/fizz-buzz-multithreaded "Fizz Buzz Multithreaded") +[< Previous](../fizz-buzz-multithreaded "Fizz Buzz Multithreaded") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-knight-moves "Minimum Knight Moves") +[Next >](../minimum-knight-moves "Minimum Knight Moves") ## [1196. How Many Apples Can You Put into the Basket (Easy)](https://leetcode.com/problems/how-many-apples-can-you-put-into-the-basket "最多可以买到的苹果数量") @@ -41,7 +41,7 @@ ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] + [[Greedy](../../tag/greedy/README.md)] ### Hints
diff --git a/problems/human-traffic-of-stadium/README.md b/problems/human-traffic-of-stadium/README.md index 7736d01d7..c7af7319b 100644 --- a/problems/human-traffic-of-stadium/README.md +++ b/problems/human-traffic-of-stadium/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/non-negative-integers-without-consecutive-ones "Non-negative Integers without Consecutive Ones") +[< Previous](../non-negative-integers-without-consecutive-ones "Non-negative Integers without Consecutive Ones") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/friend-requests-ii-who-has-the-most-friends "Friend Requests II: Who Has the Most Friends") +[Next >](../friend-requests-ii-who-has-the-most-friends "Friend Requests II: Who Has the Most Friends") ## [601. Human Traffic of Stadium (Hard)](https://leetcode.com/problems/human-traffic-of-stadium "体育馆的人流量") diff --git a/problems/image-overlap/README.md b/problems/image-overlap/README.md index e31ff5267..562c1f0a1 100644 --- a/problems/image-overlap/README.md +++ b/problems/image-overlap/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/sum-of-distances-in-tree "Sum of Distances in Tree") +[< Previous](../sum-of-distances-in-tree "Sum of Distances in Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/rectangle-overlap "Rectangle Overlap") +[Next >](../rectangle-overlap "Rectangle Overlap") ## [835. Image Overlap (Medium)](https://leetcode.com/problems/image-overlap "图像重叠") @@ -39,4 +39,4 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] diff --git a/problems/image-smoother/README.md b/problems/image-smoother/README.md index 1ebcce18f..cad378159 100644 --- a/problems/image-smoother/README.md +++ b/problems/image-smoother/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/remove-9 "Remove 9") +[< Previous](../remove-9 "Remove 9") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-width-of-binary-tree "Maximum Width of Binary Tree") +[Next >](../maximum-width-of-binary-tree "Maximum Width of Binary Tree") ## [661. Image Smoother (Easy)](https://leetcode.com/problems/image-smoother "图片平滑器") @@ -38,4 +38,4 @@ For the point (1,1): floor(8/9) = floor(0.88888889) = 0

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] diff --git a/problems/immediate-food-delivery-i/README.md b/problems/immediate-food-delivery-i/README.md index 383690478..2eb47ffb4 100644 --- a/problems/immediate-food-delivery-i/README.md +++ b/problems/immediate-food-delivery-i/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/dinner-plate-stacks "Dinner Plate Stacks") +[< Previous](../dinner-plate-stacks "Dinner Plate Stacks") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/immediate-food-delivery-ii "Immediate Food Delivery II") +[Next >](../immediate-food-delivery-ii "Immediate Food Delivery II") ## [1173. Immediate Food Delivery I (Easy)](https://leetcode.com/problems/immediate-food-delivery-i "") diff --git a/problems/immediate-food-delivery-ii/README.md b/problems/immediate-food-delivery-ii/README.md index 20ef3c2b9..f2fc1fc9d 100644 --- a/problems/immediate-food-delivery-ii/README.md +++ b/problems/immediate-food-delivery-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/immediate-food-delivery-i "Immediate Food Delivery I") +[< Previous](../immediate-food-delivery-i "Immediate Food Delivery I") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/prime-arrangements "Prime Arrangements") +[Next >](../prime-arrangements "Prime Arrangements") ## [1174. Immediate Food Delivery II (Medium)](https://leetcode.com/problems/immediate-food-delivery-ii "") diff --git a/problems/implement-magic-dictionary/README.md b/problems/implement-magic-dictionary/README.md index 971cd6a4b..5d5cef814 100644 --- a/problems/implement-magic-dictionary/README.md +++ b/problems/implement-magic-dictionary/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/cut-off-trees-for-golf-event "Cut Off Trees for Golf Event") +[< Previous](../cut-off-trees-for-golf-event "Cut Off Trees for Golf Event") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/map-sum-pairs "Map Sum Pairs") +[Next >](../map-sum-pairs "Map Sum Pairs") ## [676. Implement Magic Dictionary (Medium)](https://leetcode.com/problems/implement-magic-dictionary "实现一个魔法字典") @@ -42,9 +42,9 @@ Input: search("leetcoded"), Output: False

### Related Topics - [[Trie](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Trie](../../tag/trie/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Implement Trie (Prefix Tree)](https://github.com/openset/leetcode/tree/master/problems/implement-trie-prefix-tree) (Medium) - 1. [Longest Word in Dictionary](https://github.com/openset/leetcode/tree/master/problems/longest-word-in-dictionary) (Easy) + 1. [Implement Trie (Prefix Tree)](../implement-trie-prefix-tree) (Medium) + 1. [Longest Word in Dictionary](../longest-word-in-dictionary) (Easy) diff --git a/problems/implement-queue-using-stacks/README.md b/problems/implement-queue-using-stacks/README.md index 8d0069b46..09a021b43 100644 --- a/problems/implement-queue-using-stacks/README.md +++ b/problems/implement-queue-using-stacks/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/power-of-two "Power of Two") +[< Previous](../power-of-two "Power of Two") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-digit-one "Number of Digit One") +[Next >](../number-of-digit-one "Number of Digit One") ## [232. Implement Queue using Stacks (Easy)](https://leetcode.com/problems/implement-queue-using-stacks "用栈实现队列") @@ -40,8 +40,8 @@ queue.empty(); // returns false ### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] + [[Stack](../../tag/stack/README.md)] + [[Design](../../tag/design/README.md)] ### Similar Questions - 1. [Implement Stack using Queues](https://github.com/openset/leetcode/tree/master/problems/implement-stack-using-queues) (Easy) + 1. [Implement Stack using Queues](../implement-stack-using-queues) (Easy) diff --git a/problems/implement-rand10-using-rand7/README.md b/problems/implement-rand10-using-rand7/README.md index d0cb8c918..321d10d26 100644 --- a/problems/implement-rand10-using-rand7/README.md +++ b/problems/implement-rand10-using-rand7/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/convex-polygon "Convex Polygon") +[< Previous](../convex-polygon "Convex Polygon") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/encode-string-with-shortest-length "Encode String with Shortest Length") +[Next >](../encode-string-with-shortest-length "Encode String with Shortest Length") ## [470. Implement Rand10() Using Rand7() (Medium)](https://leetcode.com/problems/implement-rand10-using-rand7 "用 Rand7() 实现 Rand10()") @@ -66,5 +66,5 @@ ### Related Topics - [[Random](https://github.com/openset/leetcode/tree/master/tag/random/README.md)] - [[Rejection Sampling](https://github.com/openset/leetcode/tree/master/tag/rejection-sampling/README.md)] + [[Random](../../tag/random/README.md)] + [[Rejection Sampling](../../tag/rejection-sampling/README.md)] diff --git a/problems/implement-stack-using-queues/README.md b/problems/implement-stack-using-queues/README.md index 379c3968e..75c6c6563 100644 --- a/problems/implement-stack-using-queues/README.md +++ b/problems/implement-stack-using-queues/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/basic-calculator "Basic Calculator") +[< Previous](../basic-calculator "Basic Calculator") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/invert-binary-tree "Invert Binary Tree") +[Next >](../invert-binary-tree "Invert Binary Tree") ## [225. Implement Stack using Queues (Easy)](https://leetcode.com/problems/implement-stack-using-queues "用队列实现栈") @@ -40,8 +40,8 @@ stack.empty(); // returns false ### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] + [[Stack](../../tag/stack/README.md)] + [[Design](../../tag/design/README.md)] ### Similar Questions - 1. [Implement Queue using Stacks](https://github.com/openset/leetcode/tree/master/problems/implement-queue-using-stacks) (Easy) + 1. [Implement Queue using Stacks](../implement-queue-using-stacks) (Easy) diff --git a/problems/implement-strstr/README.md b/problems/implement-strstr/README.md index 496f433f8..2c50a5f2d 100644 --- a/problems/implement-strstr/README.md +++ b/problems/implement-strstr/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/remove-element "Remove Element") +[< Previous](../remove-element "Remove Element") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/divide-two-integers "Divide Two Integers") +[Next >](../divide-two-integers "Divide Two Integers") ## [28. Implement strStr() (Easy)](https://leetcode.com/problems/implement-strstr "实现 strStr()") @@ -36,9 +36,9 @@

For the purpose of this problem, we will return 0 when needle is an empty string. This is consistent to C's strstr() and Java's indexOf().

### Related Topics - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Shortest Palindrome](https://github.com/openset/leetcode/tree/master/problems/shortest-palindrome) (Hard) - 1. [Repeated Substring Pattern](https://github.com/openset/leetcode/tree/master/problems/repeated-substring-pattern) (Easy) + 1. [Shortest Palindrome](../shortest-palindrome) (Hard) + 1. [Repeated Substring Pattern](../repeated-substring-pattern) (Easy) diff --git a/problems/implement-trie-prefix-tree/README.md b/problems/implement-trie-prefix-tree/README.md index 2a4891a32..4435545a4 100644 --- a/problems/implement-trie-prefix-tree/README.md +++ b/problems/implement-trie-prefix-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/course-schedule "Course Schedule") +[< Previous](../course-schedule "Course Schedule") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-size-subarray-sum "Minimum Size Subarray Sum") +[Next >](../minimum-size-subarray-sum "Minimum Size Subarray Sum") ## [208. Implement Trie (Prefix Tree) (Medium)](https://leetcode.com/problems/implement-trie-prefix-tree "实现 Trie (前缀树)") @@ -34,11 +34,11 @@ trie.search("app"); // returns true ### Related Topics - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] - [[Trie](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] + [[Design](../../tag/design/README.md)] + [[Trie](../../tag/trie/README.md)] ### Similar Questions - 1. [Add and Search Word - Data structure design](https://github.com/openset/leetcode/tree/master/problems/add-and-search-word-data-structure-design) (Medium) - 1. [Design Search Autocomplete System](https://github.com/openset/leetcode/tree/master/problems/design-search-autocomplete-system) (Hard) - 1. [Replace Words](https://github.com/openset/leetcode/tree/master/problems/replace-words) (Medium) - 1. [Implement Magic Dictionary](https://github.com/openset/leetcode/tree/master/problems/implement-magic-dictionary) (Medium) + 1. [Add and Search Word - Data structure design](../add-and-search-word-data-structure-design) (Medium) + 1. [Design Search Autocomplete System](../design-search-autocomplete-system) (Hard) + 1. [Replace Words](../replace-words) (Medium) + 1. [Implement Magic Dictionary](../implement-magic-dictionary) (Medium) diff --git a/problems/increasing-order-search-tree/README.md b/problems/increasing-order-search-tree/README.md index 54d7a14e3..1343dda37 100644 --- a/problems/increasing-order-search-tree/README.md +++ b/problems/increasing-order-search-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/monotonic-array "Monotonic Array") +[< Previous](../monotonic-array "Monotonic Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/bitwise-ors-of-subarrays "Bitwise ORs of Subarrays") +[Next >](../bitwise-ors-of-subarrays "Bitwise ORs of Subarrays") ## [897. Increasing Order Search Tree (Easy)](https://leetcode.com/problems/increasing-order-search-tree "递增顺序查找树") @@ -53,5 +53,5 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] diff --git a/problems/increasing-subsequences/README.md b/problems/increasing-subsequences/README.md index dc241a1ce..64b6c3668 100644 --- a/problems/increasing-subsequences/README.md +++ b/problems/increasing-subsequences/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/the-maze "The Maze") +[< Previous](../the-maze "The Maze") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/construct-the-rectangle "Construct the Rectangle") +[Next >](../construct-the-rectangle "Construct the Rectangle") ## [491. Increasing Subsequences (Medium)](https://leetcode.com/problems/increasing-subsequences "递增子序列") @@ -33,7 +33,7 @@ ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] ### Similar Questions - 1. [Maximum Length of Pair Chain](https://github.com/openset/leetcode/tree/master/problems/maximum-length-of-pair-chain) (Medium) + 1. [Maximum Length of Pair Chain](../maximum-length-of-pair-chain) (Medium) diff --git a/problems/increasing-triplet-subsequence/README.md b/problems/increasing-triplet-subsequence/README.md index 9dd4ff799..257fbdbac 100644 --- a/problems/increasing-triplet-subsequence/README.md +++ b/problems/increasing-triplet-subsequence/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/largest-bst-subtree "Largest BST Subtree") +[< Previous](../largest-bst-subtree "Largest BST Subtree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/self-crossing "Self Crossing") +[Next >](../self-crossing "Self Crossing") ## [334. Increasing Triplet Subsequence (Medium)](https://leetcode.com/problems/increasing-triplet-subsequence "递增的三元子序列") @@ -39,4 +39,4 @@ such that arr[i] < arr[j] < arr[k] given 0 ≤ i< ### Similar Questions - 1. [Longest Increasing Subsequence](https://github.com/openset/leetcode/tree/master/problems/longest-increasing-subsequence) (Medium) + 1. [Longest Increasing Subsequence](../longest-increasing-subsequence) (Medium) diff --git a/problems/index-pairs-of-a-string/README.md b/problems/index-pairs-of-a-string/README.md index 5de15d158..0c71f38f4 100644 --- a/problems/index-pairs-of-a-string/README.md +++ b/problems/index-pairs-of-a-string/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/fixed-point "Fixed Point") +[< Previous](../fixed-point "Fixed Point") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/campus-bikes-ii "Campus Bikes II") +[Next >](../campus-bikes-ii "Campus Bikes II") ## [1065. Index Pairs of a String (Easy)](https://leetcode.com/problems/index-pairs-of-a-string "字符串的索引对") @@ -45,8 +45,8 @@ Notice that matches can overlap, see "aba" is found in [0,2] and [2,4] ### Related Topics - [[Trie](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Trie](../../tag/trie/README.md)] + [[String](../../tag/string/README.md)] ### Hints
diff --git a/problems/inorder-successor-in-bst-ii/README.md b/problems/inorder-successor-in-bst-ii/README.md index 6248aadad..a9fc233de 100644 --- a/problems/inorder-successor-in-bst-ii/README.md +++ b/problems/inorder-successor-in-bst-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/fibonacci-number "Fibonacci Number") +[< Previous](../fibonacci-number "Fibonacci Number") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/game-play-analysis-i "Game Play Analysis I") +[Next >](../game-play-analysis-i "Game Play Analysis I") ## [510. Inorder Successor in BST II (Medium)](https://leetcode.com/problems/inorder-successor-in-bst-ii "二叉搜索树中的中序后继 II") @@ -74,7 +74,7 @@ p = 13

Could you solve it without looking up any of the node's values?

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] ### Similar Questions - 1. [Inorder Successor in BST](https://github.com/openset/leetcode/tree/master/problems/inorder-successor-in-bst) (Medium) + 1. [Inorder Successor in BST](../inorder-successor-in-bst) (Medium) diff --git a/problems/inorder-successor-in-bst/README.md b/problems/inorder-successor-in-bst/README.md index 94f17f008..649abbec5 100644 --- a/problems/inorder-successor-in-bst/README.md +++ b/problems/inorder-successor-in-bst/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/peeking-iterator "Peeking Iterator") +[< Previous](../peeking-iterator "Peeking Iterator") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/walls-and-gates "Walls and Gates") +[Next >](../walls-and-gates "Walls and Gates") ## [285. Inorder Successor in BST (Medium)](https://leetcode.com/problems/inorder-successor-in-bst "二叉搜索树中的顺序后继") @@ -41,9 +41,9 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] ### Similar Questions - 1. [Binary Tree Inorder Traversal](https://github.com/openset/leetcode/tree/master/problems/binary-tree-inorder-traversal) (Medium) - 1. [Binary Search Tree Iterator](https://github.com/openset/leetcode/tree/master/problems/binary-search-tree-iterator) (Medium) - 1. [Inorder Successor in BST II](https://github.com/openset/leetcode/tree/master/problems/inorder-successor-in-bst-ii) (Medium) + 1. [Binary Tree Inorder Traversal](../binary-tree-inorder-traversal) (Medium) + 1. [Binary Search Tree Iterator](../binary-search-tree-iterator) (Medium) + 1. [Inorder Successor in BST II](../inorder-successor-in-bst-ii) (Medium) diff --git a/problems/insert-delete-getrandom-o1-duplicates-allowed/README.md b/problems/insert-delete-getrandom-o1-duplicates-allowed/README.md index 9fbae1c04..2dff0654c 100644 --- a/problems/insert-delete-getrandom-o1-duplicates-allowed/README.md +++ b/problems/insert-delete-getrandom-o1-duplicates-allowed/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/insert-delete-getrandom-o1 "Insert Delete GetRandom O(1)") +[< Previous](../insert-delete-getrandom-o1 "Insert Delete GetRandom O(1)") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/linked-list-random-node "Linked List Random Node") +[Next >](../linked-list-random-node "Linked List Random Node") ## [381. Insert Delete GetRandom O(1) - Duplicates allowed (Hard)](https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed "O(1) 时间插入、删除和获取随机元素 - 允许重复") @@ -47,9 +47,9 @@ collection.getRandom();

### Related Topics - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Design](../../tag/design/README.md)] + [[Array](../../tag/array/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Insert Delete GetRandom O(1)](https://github.com/openset/leetcode/tree/master/problems/insert-delete-getrandom-o1) (Medium) + 1. [Insert Delete GetRandom O(1)](../insert-delete-getrandom-o1) (Medium) diff --git a/problems/insert-delete-getrandom-o1/README.md b/problems/insert-delete-getrandom-o1/README.md index 48c55f95a..3ce5e63e9 100644 --- a/problems/insert-delete-getrandom-o1/README.md +++ b/problems/insert-delete-getrandom-o1/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/design-phone-directory "Design Phone Directory") +[< Previous](../design-phone-directory "Design Phone Directory") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/insert-delete-getrandom-o1-duplicates-allowed "Insert Delete GetRandom O(1) - Duplicates allowed") +[Next >](../insert-delete-getrandom-o1-duplicates-allowed "Insert Delete GetRandom O(1) - Duplicates allowed") ## [380. Insert Delete GetRandom O(1) (Medium)](https://leetcode.com/problems/insert-delete-getrandom-o1 "常数时间插入、删除和获取随机元素") @@ -50,9 +50,9 @@ randomSet.getRandom();

### Related Topics - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Design](../../tag/design/README.md)] + [[Array](../../tag/array/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Insert Delete GetRandom O(1) - Duplicates allowed](https://github.com/openset/leetcode/tree/master/problems/insert-delete-getrandom-o1-duplicates-allowed) (Hard) + 1. [Insert Delete GetRandom O(1) - Duplicates allowed](../insert-delete-getrandom-o1-duplicates-allowed) (Hard) diff --git a/problems/insert-interval/README.md b/problems/insert-interval/README.md index a2c0cfd5e..55aa7affc 100644 --- a/problems/insert-interval/README.md +++ b/problems/insert-interval/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/merge-intervals "Merge Intervals") +[< Previous](../merge-intervals "Merge Intervals") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/length-of-last-word "Length of Last Word") +[Next >](../length-of-last-word "Length of Last Word") ## [57. Insert Interval (Hard)](https://leetcode.com/problems/insert-interval "插入区间") @@ -32,9 +32,9 @@

NOTE: input types have been changed on April 15, 2019. Please reset to default code definition to get new method signature.

### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Sort](../../tag/sort/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Merge Intervals](https://github.com/openset/leetcode/tree/master/problems/merge-intervals) (Medium) - 1. [Range Module](https://github.com/openset/leetcode/tree/master/problems/range-module) (Hard) + 1. [Merge Intervals](../merge-intervals) (Medium) + 1. [Range Module](../range-module) (Hard) diff --git a/problems/insert-into-a-binary-search-tree/README.md b/problems/insert-into-a-binary-search-tree/README.md index d4b358b18..aadc7c3a0 100644 --- a/problems/insert-into-a-binary-search-tree/README.md +++ b/problems/insert-into-a-binary-search-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/search-in-a-binary-search-tree "Search in a Binary Search Tree") +[< Previous](../search-in-a-binary-search-tree "Search in a Binary Search Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/search-in-a-sorted-array-of-unknown-size "Search in a Sorted Array of Unknown Size") +[Next >](../search-in-a-sorted-array-of-unknown-size "Search in a Sorted Array of Unknown Size") ## [701. Insert into a Binary Search Tree (Medium)](https://leetcode.com/problems/insert-into-a-binary-search-tree "二叉搜索树中的插入操作") @@ -50,7 +50,7 @@ And the value to insert: 5 ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] ### Similar Questions - 1. [Search in a Binary Search Tree](https://github.com/openset/leetcode/tree/master/problems/search-in-a-binary-search-tree) (Easy) + 1. [Search in a Binary Search Tree](../search-in-a-binary-search-tree) (Easy) diff --git a/problems/insert-into-a-sorted-circular-linked-list/README.md b/problems/insert-into-a-sorted-circular-linked-list/README.md index 532e92ac7..d1c4bc30b 100644 --- a/problems/insert-into-a-sorted-circular-linked-list/README.md +++ b/problems/insert-into-a-sorted-circular-linked-list/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/design-linked-list "Design Linked List") +[< Previous](../design-linked-list "Design Linked List") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/to-lower-case "To Lower Case") +[Next >](../to-lower-case "To Lower Case") ## [708. Insert into a Sorted Circular Linked List (Medium)](https://leetcode.com/problems/insert-into-a-sorted-circular-linked-list "循环有序列表的插入") @@ -32,7 +32,7 @@ The new node should insert between node 1 and node 3. After the insertion, the list should look like this, and we should still return node 3.

### Related Topics - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] + [[Linked List](../../tag/linked-list/README.md)] ### Similar Questions - 1. [Insertion Sort List](https://github.com/openset/leetcode/tree/master/problems/insertion-sort-list) (Medium) + 1. [Insertion Sort List](../insertion-sort-list) (Medium) diff --git a/problems/insertion-sort-list/README.md b/problems/insertion-sort-list/README.md index c1c8776f0..e91075c57 100644 --- a/problems/insertion-sort-list/README.md +++ b/problems/insertion-sort-list/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/lru-cache "LRU Cache") +[< Previous](../lru-cache "LRU Cache") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/sort-list "Sort List") +[Next >](../sort-list "Sort List") ## [147. Insertion Sort List (Medium)](https://leetcode.com/problems/insertion-sort-list "对链表进行插入排序") @@ -48,9 +48,9 @@ With each iteration one element (red) is removed from the input data and inserte ### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] + [[Sort](../../tag/sort/README.md)] + [[Linked List](../../tag/linked-list/README.md)] ### Similar Questions - 1. [Sort List](https://github.com/openset/leetcode/tree/master/problems/sort-list) (Medium) - 1. [Insert into a Sorted Circular Linked List](https://github.com/openset/leetcode/tree/master/problems/insert-into-a-sorted-circular-linked-list) (Medium) + 1. [Sort List](../sort-list) (Medium) + 1. [Insert into a Sorted Circular Linked List](../insert-into-a-sorted-circular-linked-list) (Medium) diff --git a/problems/insufficient-nodes-in-root-to-leaf-paths/README.md b/problems/insufficient-nodes-in-root-to-leaf-paths/README.md index 8c31b30a4..5b7fe7400 100644 --- a/problems/insufficient-nodes-in-root-to-leaf-paths/README.md +++ b/problems/insufficient-nodes-in-root-to-leaf-paths/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/letter-tile-possibilities "Letter Tile Possibilities") +[< Previous](../letter-tile-possibilities "Letter Tile Possibilities") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/smallest-subsequence-of-distinct-characters "Smallest Subsequence of Distinct Characters") +[Next >](../smallest-subsequence-of-distinct-characters "Smallest Subsequence of Distinct Characters") ## [1080. Insufficient Nodes in Root to Leaf Paths (Medium)](https://leetcode.com/problems/insufficient-nodes-in-root-to-leaf-paths "根到叶路径上的不足节点") @@ -63,7 +63,7 @@ Output: [1,null,-3,4] ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] ### Hints
diff --git a/problems/integer-break/README.md b/problems/integer-break/README.md index 7e8ca366f..5cf4dc96f 100644 --- a/problems/integer-break/README.md +++ b/problems/integer-break/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/power-of-four "Power of Four") +[< Previous](../power-of-four "Power of Four") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/reverse-string "Reverse String") +[Next >](../reverse-string "Reverse String") ## [343. Integer Break (Medium)](https://leetcode.com/problems/integer-break "整数拆分") @@ -34,8 +34,8 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Math](../../tag/math/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/integer-replacement/README.md b/problems/integer-replacement/README.md index 919ebe4c9..a34ff2c94 100644 --- a/problems/integer-replacement/README.md +++ b/problems/integer-replacement/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/rotate-function "Rotate Function") +[< Previous](../rotate-function "Rotate Function") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/random-pick-index "Random Pick Index") +[Next >](../random-pick-index "Random Pick Index") ## [397. Integer Replacement (Medium)](https://leetcode.com/problems/integer-replacement "整数替换") @@ -57,5 +57,5 @@ or

### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/integer-to-english-words/README.md b/problems/integer-to-english-words/README.md index 4d9d65718..d606efbdb 100644 --- a/problems/integer-to-english-words/README.md +++ b/problems/integer-to-english-words/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/closest-binary-search-tree-value-ii "Closest Binary Search Tree Value II") +[< Previous](../closest-binary-search-tree-value-ii "Closest Binary Search Tree Value II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/h-index "H-Index") +[Next >](../h-index "H-Index") ## [273. Integer to English Words (Hard)](https://leetcode.com/problems/integer-to-english-words "整数转换英文表示") @@ -41,11 +41,11 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Math](../../tag/math/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Integer to Roman](https://github.com/openset/leetcode/tree/master/problems/integer-to-roman) (Medium) + 1. [Integer to Roman](../integer-to-roman) (Medium) ### Hints
diff --git a/problems/integer-to-roman/README.md b/problems/integer-to-roman/README.md index 517255a16..3797f58c5 100644 --- a/problems/integer-to-roman/README.md +++ b/problems/integer-to-roman/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/container-with-most-water "Container With Most Water") +[< Previous](../container-with-most-water "Container With Most Water") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/roman-to-integer "Roman to Integer") +[Next >](../roman-to-integer "Roman to Integer") ## [12. Integer to Roman (Medium)](https://leetcode.com/problems/integer-to-roman "整数转罗马数字") @@ -69,9 +69,9 @@ M 1000 Explanation: M = 1000, CM = 900, XC = 90 and IV = 4. ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Math](../../tag/math/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Roman to Integer](https://github.com/openset/leetcode/tree/master/problems/roman-to-integer) (Easy) - 1. [Integer to English Words](https://github.com/openset/leetcode/tree/master/problems/integer-to-english-words) (Hard) + 1. [Roman to Integer](../roman-to-integer) (Easy) + 1. [Integer to English Words](../integer-to-english-words) (Hard) diff --git a/problems/interleaving-string/README.md b/problems/interleaving-string/README.md index 720d1ab49..54ef595ff 100644 --- a/problems/interleaving-string/README.md +++ b/problems/interleaving-string/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/unique-binary-search-trees "Unique Binary Search Trees") +[< Previous](../unique-binary-search-trees "Unique Binary Search Trees") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/validate-binary-search-tree "Validate Binary Search Tree") +[Next >](../validate-binary-search-tree "Validate Binary Search Tree") ## [97. Interleaving String (Hard)](https://leetcode.com/problems/interleaving-string "交错字符串") @@ -28,5 +28,5 @@ ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[String](../../tag/string/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/intersection-of-three-sorted-arrays/README.md b/problems/intersection-of-three-sorted-arrays/README.md index 1047c1ba3..0b5787a5e 100644 --- a/problems/intersection-of-three-sorted-arrays/README.md +++ b/problems/intersection-of-three-sorted-arrays/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/team-scores-in-football-tournament "Team Scores in Football Tournament") +[< Previous](../team-scores-in-football-tournament "Team Scores in Football Tournament") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/two-sum-bsts "Two Sum BSTs") +[Next >](../two-sum-bsts "Two Sum BSTs") ## [1213. Intersection of Three Sorted Arrays (Easy)](https://leetcode.com/problems/intersection-of-three-sorted-arrays "三个有序数组的交集") @@ -31,11 +31,11 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] ### Similar Questions - 1. [Intersection of Two Arrays](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-arrays) (Easy) + 1. [Intersection of Two Arrays](../intersection-of-two-arrays) (Easy) ### Hints
diff --git a/problems/intersection-of-two-arrays-ii/README.md b/problems/intersection-of-two-arrays-ii/README.md index de9020c26..4bc295a48 100644 --- a/problems/intersection-of-two-arrays-ii/README.md +++ b/problems/intersection-of-two-arrays-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-arrays "Intersection of Two Arrays") +[< Previous](../intersection-of-two-arrays "Intersection of Two Arrays") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/android-unlock-patterns "Android Unlock Patterns") +[Next >](../android-unlock-patterns "Android Unlock Patterns") ## [350. Intersection of Two Arrays II (Easy)](https://leetcode.com/problems/intersection-of-two-arrays-ii "两个数组的交集 II") @@ -44,11 +44,11 @@ ### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Sort](../../tag/sort/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [Intersection of Two Arrays](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-arrays) (Easy) - 1. [Find Common Characters](https://github.com/openset/leetcode/tree/master/problems/find-common-characters) (Easy) + 1. [Intersection of Two Arrays](../intersection-of-two-arrays) (Easy) + 1. [Find Common Characters](../find-common-characters) (Easy) diff --git a/problems/intersection-of-two-arrays/README.md b/problems/intersection-of-two-arrays/README.md index 503266cff..09355375f 100644 --- a/problems/intersection-of-two-arrays/README.md +++ b/problems/intersection-of-two-arrays/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/design-tic-tac-toe "Design Tic-Tac-Toe") +[< Previous](../design-tic-tac-toe "Design Tic-Tac-Toe") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-arrays-ii "Intersection of Two Arrays II") +[Next >](../intersection-of-two-arrays-ii "Intersection of Two Arrays II") ## [349. Intersection of Two Arrays (Easy)](https://leetcode.com/problems/intersection-of-two-arrays "两个数组的交集") @@ -38,11 +38,11 @@

 

### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Sort](../../tag/sort/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [Intersection of Two Arrays II](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-arrays-ii) (Easy) - 1. [Intersection of Three Sorted Arrays](https://github.com/openset/leetcode/tree/master/problems/intersection-of-three-sorted-arrays) (Easy) + 1. [Intersection of Two Arrays II](../intersection-of-two-arrays-ii) (Easy) + 1. [Intersection of Three Sorted Arrays](../intersection-of-three-sorted-arrays) (Easy) diff --git a/problems/intersection-of-two-linked-lists/README.md b/problems/intersection-of-two-linked-lists/README.md index 5cf0c6857..0d9777df9 100644 --- a/problems/intersection-of-two-linked-lists/README.md +++ b/problems/intersection-of-two-linked-lists/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-two-distinct-characters "Longest Substring with At Most Two Distinct Characters") +[< Previous](../longest-substring-with-at-most-two-distinct-characters "Longest Substring with At Most Two Distinct Characters") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/one-edit-distance "One Edit Distance") +[Next >](../one-edit-distance "One Edit Distance") ## [160. Intersection of Two Linked Lists (Easy)](https://leetcode.com/problems/intersection-of-two-linked-lists "相交链表") @@ -63,7 +63,7 @@ ### Related Topics - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] + [[Linked List](../../tag/linked-list/README.md)] ### Similar Questions - 1. [Minimum Index Sum of Two Lists](https://github.com/openset/leetcode/tree/master/problems/minimum-index-sum-of-two-lists) (Easy) + 1. [Minimum Index Sum of Two Lists](../minimum-index-sum-of-two-lists) (Easy) diff --git a/problems/interval-list-intersections/README.md b/problems/interval-list-intersections/README.md index f9effce18..5b31fbeca 100644 --- a/problems/interval-list-intersections/README.md +++ b/problems/interval-list-intersections/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/sum-of-even-numbers-after-queries "Sum of Even Numbers After Queries") +[< Previous](../sum-of-even-numbers-after-queries "Sum of Even Numbers After Queries") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/vertical-order-traversal-of-a-binary-tree "Vertical Order Traversal of a Binary Tree") +[Next >](../vertical-order-traversal-of-a-binary-tree "Vertical Order Traversal of a Binary Tree") ## [986. Interval List Intersections (Medium)](https://leetcode.com/problems/interval-list-intersections "区间列表的交集") @@ -44,9 +44,9 @@ ### Related Topics - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] ### Similar Questions - 1. [Merge Intervals](https://github.com/openset/leetcode/tree/master/problems/merge-intervals) (Medium) - 1. [Merge Sorted Array](https://github.com/openset/leetcode/tree/master/problems/merge-sorted-array) (Easy) - 1. [Employee Free Time](https://github.com/openset/leetcode/tree/master/problems/employee-free-time) (Hard) + 1. [Merge Intervals](../merge-intervals) (Medium) + 1. [Merge Sorted Array](../merge-sorted-array) (Easy) + 1. [Employee Free Time](../employee-free-time) (Hard) diff --git a/problems/invalid-transactions/README.md b/problems/invalid-transactions/README.md index 8b4fb7a99..efdd20ee9 100644 --- a/problems/invalid-transactions/README.md +++ b/problems/invalid-transactions/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/optimize-water-distribution-in-a-village "Optimize Water Distribution in a Village") +[< Previous](../optimize-water-distribution-in-a-village "Optimize Water Distribution in a Village") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/compare-strings-by-frequency-of-the-smallest-character "Compare Strings by Frequency of the Smallest Character") +[Next >](../compare-strings-by-frequency-of-the-smallest-character "Compare Strings by Frequency of the Smallest Character") ## [1169. Invalid Transactions (Medium)](https://leetcode.com/problems/invalid-transactions "查询无效交易") @@ -56,8 +56,8 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Array](../../tag/array/README.md)] + [[String](../../tag/string/README.md)] ### Hints
diff --git a/problems/invert-binary-tree/README.md b/problems/invert-binary-tree/README.md index 3396784cb..10154674f 100644 --- a/problems/invert-binary-tree/README.md +++ b/problems/invert-binary-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/implement-stack-using-queues "Implement Stack using Queues") +[< Previous](../implement-stack-using-queues "Implement Stack using Queues") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-ii "Basic Calculator II") +[Next >](../basic-calculator-ii "Basic Calculator II") ## [226. Invert Binary Tree (Easy)](https://leetcode.com/problems/invert-binary-tree "翻转二叉树") @@ -39,4 +39,4 @@ This problem was inspired by ](https://github.com/openset/leetcode/tree/master/problems/customer-placing-the-largest-number-of-orders "Customer Placing the Largest Number of Orders") +[Next >](../customer-placing-the-largest-number-of-orders "Customer Placing the Largest Number of Orders") ## [585. Investments in 2016 (Medium)](https://leetcode.com/problems/investments-in-2016 "2016年的投资") diff --git a/problems/ip-to-cidr/README.md b/problems/ip-to-cidr/README.md index c12274628..4d421dba8 100644 --- a/problems/ip-to-cidr/README.md +++ b/problems/ip-to-cidr/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/number-of-corner-rectangles "Number Of Corner Rectangles") +[< Previous](../number-of-corner-rectangles "Number Of Corner Rectangles") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/open-the-lock "Open the Lock") +[Next >](../open-the-lock "Open the Lock") ## [751. IP to CIDR (Easy)](https://leetcode.com/problems/ip-to-cidr "IP 到 CIDR") @@ -63,11 +63,11 @@ that are outside the specified range.

### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] ### Similar Questions - 1. [Restore IP Addresses](https://github.com/openset/leetcode/tree/master/problems/restore-ip-addresses) (Medium) - 1. [Validate IP Address](https://github.com/openset/leetcode/tree/master/problems/validate-ip-address) (Medium) + 1. [Restore IP Addresses](../restore-ip-addresses) (Medium) + 1. [Validate IP Address](../validate-ip-address) (Medium) ### Hints
diff --git a/problems/ipo/README.md b/problems/ipo/README.md index e8b474d5b..91afc78e3 100644 --- a/problems/ipo/README.md +++ b/problems/ipo/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-mode-in-binary-search-tree "Find Mode in Binary Search Tree") +[< Previous](../find-mode-in-binary-search-tree "Find Mode in Binary Search Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-ii "Next Greater Element II") +[Next >](../next-greater-element-ii "Next Greater Element II") ## [502. IPO (Hard)](https://leetcode.com/problems/ipo "IPO") @@ -46,5 +46,5 @@ To sum up, pick a list of at most k distinct projects from given projects

### Related Topics - [[Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] + [[Heap](../../tag/heap/README.md)] + [[Greedy](../../tag/greedy/README.md)] diff --git a/problems/is-graph-bipartite/README.md b/problems/is-graph-bipartite/README.md index 207186c72..f3f0bc575 100644 --- a/problems/is-graph-bipartite/README.md +++ b/problems/is-graph-bipartite/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/letter-case-permutation "Letter Case Permutation") +[< Previous](../letter-case-permutation "Letter Case Permutation") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/k-th-smallest-prime-fraction "K-th Smallest Prime Fraction") +[Next >](../k-th-smallest-prime-fraction "K-th Smallest Prime Fraction") ## [785. Is Graph Bipartite? (Medium)](https://leetcode.com/problems/is-graph-bipartite "判断二分图") @@ -55,6 +55,6 @@ We cannot find a way to divide the set of nodes into two independent subsets. ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] + [[Graph](../../tag/graph/README.md)] diff --git a/problems/is-subsequence/README.md b/problems/is-subsequence/README.md index a143bde41..283334728 100644 --- a/problems/is-subsequence/README.md +++ b/problems/is-subsequence/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/perfect-rectangle "Perfect Rectangle") +[< Previous](../perfect-rectangle "Perfect Rectangle") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/utf-8-validation "UTF-8 Validation") +[Next >](../utf-8-validation "UTF-8 Validation") ## [392. Is Subsequence (Easy)](https://leetcode.com/problems/is-subsequence "判断子序列") @@ -43,10 +43,10 @@ If there are lots of incoming S, say S1, S2, ... , Sk where k >= 1B, and you wan

Credits:
Special thanks to @pbrother for adding this problem and creating all test cases.

### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Number of Matching Subsequences](https://github.com/openset/leetcode/tree/master/problems/number-of-matching-subsequences) (Medium) - 1. [Shortest Way to Form String](https://github.com/openset/leetcode/tree/master/problems/shortest-way-to-form-string) (Medium) + 1. [Number of Matching Subsequences](../number-of-matching-subsequences) (Medium) + 1. [Shortest Way to Form String](../shortest-way-to-form-string) (Medium) diff --git a/problems/island-perimeter/README.md b/problems/island-perimeter/README.md index 3554e4726..8d27bd661 100644 --- a/problems/island-perimeter/README.md +++ b/problems/island-perimeter/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-moves-to-equal-array-elements-ii "Minimum Moves to Equal Array Elements II") +[< Previous](../minimum-moves-to-equal-array-elements-ii "Minimum Moves to Equal Array Elements II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/can-i-win "Can I Win") +[Next >](../can-i-win "Can I Win") ## [463. Island Perimeter (Easy)](https://leetcode.com/problems/island-perimeter "岛屿的周长") @@ -36,9 +36,9 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Max Area of Island](https://github.com/openset/leetcode/tree/master/problems/max-area-of-island) (Medium) - 1. [Flood Fill](https://github.com/openset/leetcode/tree/master/problems/flood-fill) (Easy) - 1. [Coloring A Border](https://github.com/openset/leetcode/tree/master/problems/coloring-a-border) (Medium) + 1. [Max Area of Island](../max-area-of-island) (Medium) + 1. [Flood Fill](../flood-fill) (Easy) + 1. [Coloring A Border](../coloring-a-border) (Medium) diff --git a/problems/isomorphic-strings/README.md b/problems/isomorphic-strings/README.md index 592ffa1f0..1634e7f3d 100644 --- a/problems/isomorphic-strings/README.md +++ b/problems/isomorphic-strings/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/count-primes "Count Primes") +[< Previous](../count-primes "Count Primes") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/reverse-linked-list "Reverse Linked List") +[Next >](../reverse-linked-list "Reverse Linked List") ## [205. Isomorphic Strings (Easy)](https://leetcode.com/problems/isomorphic-strings "同构字符串") @@ -40,7 +40,7 @@ You may assume both s and t have the same length.

### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Word Pattern](https://github.com/openset/leetcode/tree/master/problems/word-pattern) (Easy) + 1. [Word Pattern](../word-pattern) (Easy) diff --git a/problems/iterator-for-combination/README.md b/problems/iterator-for-combination/README.md index b4b1c9239..f4afa69bc 100644 --- a/problems/iterator-for-combination/README.md +++ b/problems/iterator-for-combination/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-the-start-and-end-number-of-continuous-ranges "Find the Start and End Number of Continuous Ranges") +[< Previous](../find-the-start-and-end-number-of-continuous-ranges "Find the Start and End Number of Continuous Ranges") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/element-appearing-more-than-25-in-sorted-array "Element Appearing More Than 25% In Sorted Array") +[Next >](../element-appearing-more-than-25-in-sorted-array "Element Appearing More Than 25% In Sorted Array") ## [1286. Iterator for Combination (Medium)](https://leetcode.com/problems/iterator-for-combination "字母组合迭代器") @@ -44,8 +44,8 @@ iterator.hasNext(); // returns false ### Related Topics - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Design](../../tag/design/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Hints
diff --git a/problems/jewels-and-stones/README.md b/problems/jewels-and-stones/README.md index 5a026378d..62e973d48 100644 --- a/problems/jewels-and-stones/README.md +++ b/problems/jewels-and-stones/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-iv "Basic Calculator IV") +[< Previous](../basic-calculator-iv "Basic Calculator IV") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-iii "Basic Calculator III") +[Next >](../basic-calculator-iii "Basic Calculator III") ## [771. Jewels and Stones (Easy)](https://leetcode.com/problems/jewels-and-stones "宝石与石头") @@ -37,7 +37,7 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Hints
diff --git a/problems/jump-game-ii/README.md b/problems/jump-game-ii/README.md index d6de691f2..9a57479a2 100644 --- a/problems/jump-game-ii/README.md +++ b/problems/jump-game-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/wildcard-matching "Wildcard Matching") +[< Previous](../wildcard-matching "Wildcard Matching") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/permutations "Permutations") +[Next >](../permutations "Permutations") ## [45. Jump Game II (Hard)](https://leetcode.com/problems/jump-game-ii "跳跃游戏 II") @@ -30,8 +30,8 @@

You can assume that you can always reach the last index.

### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Jump Game](https://github.com/openset/leetcode/tree/master/problems/jump-game) (Medium) + 1. [Jump Game](../jump-game) (Medium) diff --git a/problems/jump-game/README.md b/problems/jump-game/README.md index 953be26d3..73f8105a1 100644 --- a/problems/jump-game/README.md +++ b/problems/jump-game/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/spiral-matrix "Spiral Matrix") +[< Previous](../spiral-matrix "Spiral Matrix") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/merge-intervals "Merge Intervals") +[Next >](../merge-intervals "Merge Intervals") ## [55. Jump Game (Medium)](https://leetcode.com/problems/jump-game "跳跃游戏") @@ -35,8 +35,8 @@ ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Jump Game II](https://github.com/openset/leetcode/tree/master/problems/jump-game-ii) (Hard) + 1. [Jump Game II](../jump-game-ii) (Hard) diff --git a/problems/k-closest-points-to-origin/README.md b/problems/k-closest-points-to-origin/README.md index f406cbe11..4ae0f6d86 100644 --- a/problems/k-closest-points-to-origin/README.md +++ b/problems/k-closest-points-to-origin/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/equal-rational-numbers "Equal Rational Numbers") +[< Previous](../equal-rational-numbers "Equal Rational Numbers") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/subarray-sums-divisible-by-k "Subarray Sums Divisible by K") +[Next >](../subarray-sums-divisible-by-k "Subarray Sums Divisible by K") ## [973. K Closest Points to Origin (Medium)](https://leetcode.com/problems/k-closest-points-to-origin "最接近原点的 K 个点") @@ -54,11 +54,11 @@ We only want the closest K = 1 points from the origin, so the answer is just [[- ### Related Topics - [[Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] - [[Divide and Conquer](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] + [[Heap](../../tag/heap/README.md)] + [[Sort](../../tag/sort/README.md)] + [[Divide and Conquer](../../tag/divide-and-conquer/README.md)] ### Similar Questions - 1. [Kth Largest Element in an Array](https://github.com/openset/leetcode/tree/master/problems/kth-largest-element-in-an-array) (Medium) - 1. [Top K Frequent Elements](https://github.com/openset/leetcode/tree/master/problems/top-k-frequent-elements) (Medium) - 1. [Top K Frequent Words](https://github.com/openset/leetcode/tree/master/problems/top-k-frequent-words) (Medium) + 1. [Kth Largest Element in an Array](../kth-largest-element-in-an-array) (Medium) + 1. [Top K Frequent Elements](../top-k-frequent-elements) (Medium) + 1. [Top K Frequent Words](../top-k-frequent-words) (Medium) diff --git a/problems/k-concatenation-maximum-sum/README.md b/problems/k-concatenation-maximum-sum/README.md index a369f31d3..5e6b5ecb3 100644 --- a/problems/k-concatenation-maximum-sum/README.md +++ b/problems/k-concatenation-maximum-sum/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/reverse-substrings-between-each-pair-of-parentheses "Reverse Substrings Between Each Pair of Parentheses") +[< Previous](../reverse-substrings-between-each-pair-of-parentheses "Reverse Substrings Between Each Pair of Parentheses") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/critical-connections-in-a-network "Critical Connections in a Network") +[Next >](../critical-connections-in-a-network "Critical Connections in a Network") ## [1191. K-Concatenation Maximum Sum (Medium)](https://leetcode.com/problems/k-concatenation-maximum-sum "K 次串联后最大子数组之和") @@ -51,7 +51,7 @@ ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/k-diff-pairs-in-an-array/README.md b/problems/k-diff-pairs-in-an-array/README.md index 79fe9d09a..0a12fb1b7 100644 --- a/problems/k-diff-pairs-in-an-array/README.md +++ b/problems/k-diff-pairs-in-an-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-i "Lonely Pixel I") +[< Previous](../lonely-pixel-i "Lonely Pixel I") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-ii "Lonely Pixel II") +[Next >](../lonely-pixel-ii "Lonely Pixel II") ## [532. K-diff Pairs in an Array (Easy)](https://leetcode.com/problems/k-diff-pairs-in-an-array "数组中的K-diff数对") @@ -49,8 +49,8 @@ Given an array of integers and an integer k, you need to find the number

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Array](../../tag/array/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] ### Similar Questions - 1. [Minimum Absolute Difference in BST](https://github.com/openset/leetcode/tree/master/problems/minimum-absolute-difference-in-bst) (Easy) + 1. [Minimum Absolute Difference in BST](../minimum-absolute-difference-in-bst) (Easy) diff --git a/problems/k-empty-slots/README.md b/problems/k-empty-slots/README.md index 0ef804aff..6057ff73a 100644 --- a/problems/k-empty-slots/README.md +++ b/problems/k-empty-slots/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/baseball-game "Baseball Game") +[< Previous](../baseball-game "Baseball Game") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/redundant-connection "Redundant Connection") +[Next >](../redundant-connection "Redundant Connection") ## [683. K Empty Slots (Hard)](https://leetcode.com/problems/k-empty-slots "K 个空花盆") @@ -56,4 +56,4 @@ K: 1 ### Related Topics - [[Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md)] + [[Ordered Map](../../tag/ordered-map/README.md)] diff --git a/problems/k-inverse-pairs-array/README.md b/problems/k-inverse-pairs-array/README.md index 992df9c84..e1c7a717d 100644 --- a/problems/k-inverse-pairs-array/README.md +++ b/problems/k-inverse-pairs-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-product-of-three-numbers "Maximum Product of Three Numbers") +[< Previous](../maximum-product-of-three-numbers "Maximum Product of Three Numbers") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/course-schedule-iii "Course Schedule III") +[Next >](../course-schedule-iii "Course Schedule III") ## [629. K Inverse Pairs Array (Hard)](https://leetcode.com/problems/k-inverse-pairs-array "K个逆序对数组") @@ -48,4 +48,4 @@ The array [1,3,2] and [2,1,3] have exactly 1 inverse pair.

 

### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/k-similar-strings/README.md b/problems/k-similar-strings/README.md index df0aea392..66df9c7bd 100644 --- a/problems/k-similar-strings/README.md +++ b/problems/k-similar-strings/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/car-fleet "Car Fleet") +[< Previous](../car-fleet "Car Fleet") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/exam-room "Exam Room") +[Next >](../exam-room "Exam Room") ## [854. K-Similar Strings (Hard)](https://leetcode.com/problems/k-similar-strings "相似度为 K 的字符串") @@ -56,8 +56,8 @@ ### Related Topics - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] + [[Graph](../../tag/graph/README.md)] ### Similar Questions - 1. [Couples Holding Hands](https://github.com/openset/leetcode/tree/master/problems/couples-holding-hands) (Hard) + 1. [Couples Holding Hands](../couples-holding-hands) (Hard) diff --git a/problems/k-th-smallest-in-lexicographical-order/README.md b/problems/k-th-smallest-in-lexicographical-order/README.md index 14c0b9193..23765647c 100644 --- a/problems/k-th-smallest-in-lexicographical-order/README.md +++ b/problems/k-th-smallest-in-lexicographical-order/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/ternary-expression-parser "Ternary Expression Parser") +[< Previous](../ternary-expression-parser "Ternary Expression Parser") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/arranging-coins "Arranging Coins") +[Next >](../arranging-coins "Arranging Coins") ## [440. K-th Smallest in Lexicographical Order (Hard)](https://leetcode.com/problems/k-th-smallest-in-lexicographical-order "字典序的第K小数字") diff --git a/problems/k-th-smallest-prime-fraction/README.md b/problems/k-th-smallest-prime-fraction/README.md index 9ef5aace3..e93afd957 100644 --- a/problems/k-th-smallest-prime-fraction/README.md +++ b/problems/k-th-smallest-prime-fraction/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/is-graph-bipartite "Is Graph Bipartite?") +[< Previous](../is-graph-bipartite "Is Graph Bipartite?") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/cheapest-flights-within-k-stops "Cheapest Flights Within K Stops") +[Next >](../cheapest-flights-within-k-stops "Cheapest Flights Within K Stops") ## [786. K-th Smallest Prime Fraction (Hard)](https://leetcode.com/problems/k-th-smallest-prime-fraction "第 K 个最小的素数分数") @@ -37,10 +37,10 @@ The third fraction is 2/5. ### Related Topics - [[Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Heap](../../tag/heap/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [Kth Smallest Element in a Sorted Matrix](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-element-in-a-sorted-matrix) (Medium) - 1. [Kth Smallest Number in Multiplication Table](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-number-in-multiplication-table) (Hard) - 1. [Find K-th Smallest Pair Distance](https://github.com/openset/leetcode/tree/master/problems/find-k-th-smallest-pair-distance) (Hard) + 1. [Kth Smallest Element in a Sorted Matrix](../kth-smallest-element-in-a-sorted-matrix) (Medium) + 1. [Kth Smallest Number in Multiplication Table](../kth-smallest-number-in-multiplication-table) (Hard) + 1. [Find K-th Smallest Pair Distance](../find-k-th-smallest-pair-distance) (Hard) diff --git a/problems/k-th-symbol-in-grammar/README.md b/problems/k-th-symbol-in-grammar/README.md index b876f07f3..d358592df 100644 --- a/problems/k-th-symbol-in-grammar/README.md +++ b/problems/k-th-symbol-in-grammar/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/swim-in-rising-water "Swim in Rising Water") +[< Previous](../swim-in-rising-water "Swim in Rising Water") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/reaching-points "Reaching Points") +[Next >](../reaching-points "Reaching Points") ## [779. K-th Symbol in Grammar (Medium)](https://leetcode.com/problems/k-th-symbol-in-grammar "第K个语法符号") @@ -44,7 +44,7 @@ row 4: 01101001 ### Related Topics - [[Recursion](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] + [[Recursion](../../tag/recursion/README.md)] ### Hints
diff --git a/problems/keyboard-row/README.md b/problems/keyboard-row/README.md index a233ceb2a..78137a474 100644 --- a/problems/keyboard-row/README.md +++ b/problems/keyboard-row/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/the-maze-iii "The Maze III") +[< Previous](../the-maze-iii "The Maze III") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-mode-in-binary-search-tree "Find Mode in Binary Search Tree") +[Next >](../find-mode-in-binary-search-tree "Find Mode in Binary Search Tree") ## [500. Keyboard Row (Easy)](https://leetcode.com/problems/keyboard-row "键盘行") @@ -35,4 +35,4 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] diff --git a/problems/keys-and-rooms/README.md b/problems/keys-and-rooms/README.md index 122a65ab9..b229c3f06 100644 --- a/problems/keys-and-rooms/README.md +++ b/problems/keys-and-rooms/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/magic-squares-in-grid "Magic Squares In Grid") +[< Previous](../magic-squares-in-grid "Magic Squares In Grid") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/split-array-into-fibonacci-sequence "Split Array into Fibonacci Sequence") +[Next >](../split-array-into-fibonacci-sequence "Split Array into Fibonacci Sequence") ## [841. Keys and Rooms (Medium)](https://leetcode.com/problems/keys-and-rooms "钥匙和房间") @@ -53,5 +53,5 @@ We then go to room 3. Since we were able to go to every room, we return true. ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Graph](../../tag/graph/README.md)] diff --git a/problems/kill-process/README.md b/problems/kill-process/README.md index 5b6be6ce7..3df553616 100644 --- a/problems/kill-process/README.md +++ b/problems/kill-process/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/shortest-unsorted-continuous-subarray "Shortest Unsorted Continuous Subarray") +[< Previous](../shortest-unsorted-continuous-subarray "Shortest Unsorted Continuous Subarray") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/delete-operation-for-two-strings "Delete Operation for Two Strings") +[Next >](../delete-operation-for-two-strings "Delete Operation for Two Strings") ## [582. Kill Process (Medium)](https://leetcode.com/problems/kill-process "杀死进程") @@ -43,5 +43,5 @@ Kill 5 will also kill 10.

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Queue](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Queue](../../tag/queue/README.md)] diff --git a/problems/knight-dialer/README.md b/problems/knight-dialer/README.md index f6deb9d5b..03fc04211 100644 --- a/problems/knight-dialer/README.md +++ b/problems/knight-dialer/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/shortest-bridge "Shortest Bridge") +[< Previous](../shortest-bridge "Shortest Bridge") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/stamping-the-sequence "Stamping The Sequence") +[Next >](../stamping-the-sequence "Stamping The Sequence") ## [935. Knight Dialer (Medium)](https://leetcode.com/problems/knight-dialer "骑士拨号器") @@ -66,4 +66,4 @@ ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/knight-probability-in-chessboard/README.md b/problems/knight-probability-in-chessboard/README.md index 107cb01d1..aa82f4b46 100644 --- a/problems/knight-probability-in-chessboard/README.md +++ b/problems/knight-probability-in-chessboard/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/longest-univalue-path "Longest Univalue Path") +[< Previous](../longest-univalue-path "Longest Univalue Path") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-sum-of-3-non-overlapping-subarrays "Maximum Sum of 3 Non-Overlapping Subarrays") +[Next >](../maximum-sum-of-3-non-overlapping-subarrays "Maximum Sum of 3 Non-Overlapping Subarrays") ## [688. Knight Probability in Chessboard (Medium)](https://leetcode.com/problems/knight-probability-in-chessboard "“马”在棋盘上的概率") @@ -48,7 +48,7 @@ The total probability the knight stays on the board is 0.0625. ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Out of Boundary Paths](https://github.com/openset/leetcode/tree/master/problems/out-of-boundary-paths) (Medium) + 1. [Out of Boundary Paths](../out-of-boundary-paths) (Medium) diff --git a/problems/koko-eating-bananas/README.md b/problems/koko-eating-bananas/README.md index 1d6dba0f0..92d7f7133 100644 --- a/problems/koko-eating-bananas/README.md +++ b/problems/koko-eating-bananas/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/walking-robot-simulation "Walking Robot Simulation") +[< Previous](../walking-robot-simulation "Walking Robot Simulation") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/middle-of-the-linked-list "Middle of the Linked List") +[Next >](../middle-of-the-linked-list "Middle of the Linked List") ## [875. Koko Eating Bananas (Medium)](https://leetcode.com/problems/koko-eating-bananas "爱吃香蕉的珂珂") @@ -62,7 +62,7 @@ ### Related Topics - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [Minimize Max Distance to Gas Station](https://github.com/openset/leetcode/tree/master/problems/minimize-max-distance-to-gas-station) (Hard) + 1. [Minimize Max Distance to Gas Station](../minimize-max-distance-to-gas-station) (Hard) diff --git a/problems/kth-largest-element-in-a-stream/README.md b/problems/kth-largest-element-in-a-stream/README.md index 5aa77bc9c..8b25667eb 100644 --- a/problems/kth-largest-element-in-a-stream/README.md +++ b/problems/kth-largest-element-in-a-stream/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/search-in-a-sorted-array-of-unknown-size "Search in a Sorted Array of Unknown Size") +[< Previous](../search-in-a-sorted-array-of-unknown-size "Search in a Sorted Array of Unknown Size") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/binary-search "Binary Search") +[Next >](../binary-search "Binary Search") ## [703. Kth Largest Element in a Stream (Easy)](https://leetcode.com/problems/kth-largest-element-in-a-stream "数据流中的第K大元素") @@ -32,7 +32,7 @@ kthLargest.add(4);   // returns 8 You may assume that nums' length ≥ k-1 and k ≥ 1.

### Related Topics - [[Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] + [[Heap](../../tag/heap/README.md)] ### Similar Questions - 1. [Kth Largest Element in an Array](https://github.com/openset/leetcode/tree/master/problems/kth-largest-element-in-an-array) (Medium) + 1. [Kth Largest Element in an Array](../kth-largest-element-in-an-array) (Medium) diff --git a/problems/kth-largest-element-in-an-array/README.md b/problems/kth-largest-element-in-an-array/README.md index 301b0c4d3..e3227feed 100644 --- a/problems/kth-largest-element-in-an-array/README.md +++ b/problems/kth-largest-element-in-an-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/shortest-palindrome "Shortest Palindrome") +[< Previous](../shortest-palindrome "Shortest Palindrome") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/combination-sum-iii "Combination Sum III") +[Next >](../combination-sum-iii "Combination Sum III") ## [215. Kth Largest Element in an Array (Medium)](https://leetcode.com/problems/kth-largest-element-in-an-array "数组中的第K个最大元素") @@ -30,12 +30,12 @@ You may assume k is always valid, 1 ≤ k ≤ array's length.

### Related Topics - [[Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] - [[Divide and Conquer](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] + [[Heap](../../tag/heap/README.md)] + [[Divide and Conquer](../../tag/divide-and-conquer/README.md)] ### Similar Questions - 1. [Wiggle Sort II](https://github.com/openset/leetcode/tree/master/problems/wiggle-sort-ii) (Medium) - 1. [Top K Frequent Elements](https://github.com/openset/leetcode/tree/master/problems/top-k-frequent-elements) (Medium) - 1. [Third Maximum Number](https://github.com/openset/leetcode/tree/master/problems/third-maximum-number) (Easy) - 1. [Kth Largest Element in a Stream](https://github.com/openset/leetcode/tree/master/problems/kth-largest-element-in-a-stream) (Easy) - 1. [K Closest Points to Origin](https://github.com/openset/leetcode/tree/master/problems/k-closest-points-to-origin) (Medium) + 1. [Wiggle Sort II](../wiggle-sort-ii) (Medium) + 1. [Top K Frequent Elements](../top-k-frequent-elements) (Medium) + 1. [Third Maximum Number](../third-maximum-number) (Easy) + 1. [Kth Largest Element in a Stream](../kth-largest-element-in-a-stream) (Easy) + 1. [K Closest Points to Origin](../k-closest-points-to-origin) (Medium) diff --git a/problems/kth-smallest-element-in-a-bst/README.md b/problems/kth-smallest-element-in-a-bst/README.md index 9800e1247..a071458bd 100644 --- a/problems/kth-smallest-element-in-a-bst/README.md +++ b/problems/kth-smallest-element-in-a-bst/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/majority-element-ii "Majority Element II") +[< Previous](../majority-element-ii "Majority Element II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/power-of-two "Power of Two") +[Next >](../power-of-two "Power of Two") ## [230. Kth Smallest Element in a BST (Medium)](https://leetcode.com/problems/kth-smallest-element-in-a-bst "二叉搜索树中第K小的元素") @@ -45,12 +45,12 @@ You may assume k is always valid, 1 ≤ k ≤ BST's total elements.

What if the BST is modified (insert/delete operations) often and you need to find the kth smallest frequently? How would you optimize the kthSmallest routine?

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [Binary Tree Inorder Traversal](https://github.com/openset/leetcode/tree/master/problems/binary-tree-inorder-traversal) (Medium) - 1. [Second Minimum Node In a Binary Tree](https://github.com/openset/leetcode/tree/master/problems/second-minimum-node-in-a-binary-tree) (Easy) + 1. [Binary Tree Inorder Traversal](../binary-tree-inorder-traversal) (Medium) + 1. [Second Minimum Node In a Binary Tree](../second-minimum-node-in-a-binary-tree) (Easy) ### Hints
diff --git a/problems/kth-smallest-element-in-a-sorted-matrix/README.md b/problems/kth-smallest-element-in-a-sorted-matrix/README.md index 51d45f218..ae807bcb4 100644 --- a/problems/kth-smallest-element-in-a-sorted-matrix/README.md +++ b/problems/kth-smallest-element-in-a-sorted-matrix/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/combination-sum-iv "Combination Sum IV") +[< Previous](../combination-sum-iv "Combination Sum IV") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/design-phone-directory "Design Phone Directory") +[Next >](../design-phone-directory "Design Phone Directory") ## [378. Kth Smallest Element in a Sorted Matrix (Medium)](https://leetcode.com/problems/kth-smallest-element-in-a-sorted-matrix "有序矩阵中第K小的元素") @@ -34,11 +34,11 @@ return 13. You may assume k is always valid, 1 ≤ k ≤ n2.

### Related Topics - [[Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Heap](../../tag/heap/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [Find K Pairs with Smallest Sums](https://github.com/openset/leetcode/tree/master/problems/find-k-pairs-with-smallest-sums) (Medium) - 1. [Kth Smallest Number in Multiplication Table](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-number-in-multiplication-table) (Hard) - 1. [Find K-th Smallest Pair Distance](https://github.com/openset/leetcode/tree/master/problems/find-k-th-smallest-pair-distance) (Hard) - 1. [K-th Smallest Prime Fraction](https://github.com/openset/leetcode/tree/master/problems/k-th-smallest-prime-fraction) (Hard) + 1. [Find K Pairs with Smallest Sums](../find-k-pairs-with-smallest-sums) (Medium) + 1. [Kth Smallest Number in Multiplication Table](../kth-smallest-number-in-multiplication-table) (Hard) + 1. [Find K-th Smallest Pair Distance](../find-k-th-smallest-pair-distance) (Hard) + 1. [K-th Smallest Prime Fraction](../k-th-smallest-prime-fraction) (Hard) diff --git a/problems/kth-smallest-number-in-multiplication-table/README.md b/problems/kth-smallest-number-in-multiplication-table/README.md index 6711926e3..c8243b0af 100644 --- a/problems/kth-smallest-number-in-multiplication-table/README.md +++ b/problems/kth-smallest-number-in-multiplication-table/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/beautiful-arrangement-ii "Beautiful Arrangement II") +[< Previous](../beautiful-arrangement-ii "Beautiful Arrangement II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/trim-a-binary-search-tree "Trim a Binary Search Tree") +[Next >](../trim-a-binary-search-tree "Trim a Binary Search Tree") ## [668. Kth Smallest Number in Multiplication Table (Hard)](https://leetcode.com/problems/kth-smallest-number-in-multiplication-table "乘法表中第k小的数") @@ -56,9 +56,9 @@ The 6-th smallest number is 6 (1, 2, 2, 3, 4, 6).

### Related Topics - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [Kth Smallest Element in a Sorted Matrix](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-element-in-a-sorted-matrix) (Medium) - 1. [Find K-th Smallest Pair Distance](https://github.com/openset/leetcode/tree/master/problems/find-k-th-smallest-pair-distance) (Hard) - 1. [K-th Smallest Prime Fraction](https://github.com/openset/leetcode/tree/master/problems/k-th-smallest-prime-fraction) (Hard) + 1. [Kth Smallest Element in a Sorted Matrix](../kth-smallest-element-in-a-sorted-matrix) (Medium) + 1. [Find K-th Smallest Pair Distance](../find-k-th-smallest-pair-distance) (Hard) + 1. [K-th Smallest Prime Fraction](../k-th-smallest-prime-fraction) (Hard) diff --git a/problems/largest-1-bordered-square/README.md b/problems/largest-1-bordered-square/README.md index acb3d3a76..be8fb3820 100644 --- a/problems/largest-1-bordered-square/README.md +++ b/problems/largest-1-bordered-square/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/alphabet-board-path "Alphabet Board Path") +[< Previous](../alphabet-board-path "Alphabet Board Path") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/stone-game-ii "Stone Game II") +[Next >](../stone-game-ii "Stone Game II") ## [1139. Largest 1-Bordered Square (Medium)](https://leetcode.com/problems/largest-1-bordered-square "最大的以 1 为边界的正方形") @@ -38,7 +38,7 @@ ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/largest-bst-subtree/README.md b/problems/largest-bst-subtree/README.md index 3bc73859a..b2905ff2b 100644 --- a/problems/largest-bst-subtree/README.md +++ b/problems/largest-bst-subtree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/reconstruct-itinerary "Reconstruct Itinerary") +[< Previous](../reconstruct-itinerary "Reconstruct Itinerary") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/increasing-triplet-subsequence "Increasing Triplet Subsequence") +[Next >](../increasing-triplet-subsequence "Increasing Triplet Subsequence") ## [333. Largest BST Subtree (Medium)](https://leetcode.com/problems/largest-bst-subtree "最大 BST 子树") @@ -36,7 +36,7 @@ A subtree must include all of its descendants.

Can you figure out ways to solve it with O(n) time complexity?

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] ### Hints
diff --git a/problems/largest-component-size-by-common-factor/README.md b/problems/largest-component-size-by-common-factor/README.md index f30b527f9..b163c0f50 100644 --- a/problems/largest-component-size-by-common-factor/README.md +++ b/problems/largest-component-size-by-common-factor/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/flip-equivalent-binary-trees "Flip Equivalent Binary Trees") +[< Previous](../flip-equivalent-binary-trees "Flip Equivalent Binary Trees") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/verifying-an-alien-dictionary "Verifying an Alien Dictionary") +[Next >](../verifying-an-alien-dictionary "Verifying an Alien Dictionary") ## [952. Largest Component Size by Common Factor (Hard)](https://leetcode.com/problems/largest-component-size-by-common-factor "按公因数计算最大组件大小") @@ -63,5 +63,5 @@ ### Related Topics - [[Union Find](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Union Find](../../tag/union-find/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/largest-divisible-subset/README.md b/problems/largest-divisible-subset/README.md index 802b0b65e..50f2cf432 100644 --- a/problems/largest-divisible-subset/README.md +++ b/problems/largest-divisible-subset/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/valid-perfect-square "Valid Perfect Square") +[< Previous](../valid-perfect-square "Valid Perfect Square") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/plus-one-linked-list "Plus One Linked List") +[Next >](../plus-one-linked-list "Plus One Linked List") ## [368. Largest Divisible Subset (Medium)](https://leetcode.com/problems/largest-divisible-subset "最大整除子集") @@ -36,5 +36,5 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Math](../../tag/math/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/largest-number-at-least-twice-of-others/README.md b/problems/largest-number-at-least-twice-of-others/README.md index 661744bae..83800b4a8 100644 --- a/problems/largest-number-at-least-twice-of-others/README.md +++ b/problems/largest-number-at-least-twice-of-others/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/min-cost-climbing-stairs "Min Cost Climbing Stairs") +[< Previous](../min-cost-climbing-stairs "Min Cost Climbing Stairs") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/shortest-completing-word "Shortest Completing Word") +[Next >](../shortest-completing-word "Shortest Completing Word") ## [747. Largest Number At Least Twice of Others (Easy)](https://leetcode.com/problems/largest-number-at-least-twice-of-others "至少是其他数字两倍的最大数") @@ -48,7 +48,7 @@

 

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Hints
diff --git a/problems/largest-number/README.md b/problems/largest-number/README.md index ba5e7c7ac..a0f8e0e6a 100644 --- a/problems/largest-number/README.md +++ b/problems/largest-number/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/rank-scores "Rank Scores") +[< Previous](../rank-scores "Rank Scores") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/consecutive-numbers "Consecutive Numbers") +[Next >](../consecutive-numbers "Consecutive Numbers") ## [179. Largest Number (Medium)](https://leetcode.com/problems/largest-number "最大数") @@ -29,4 +29,4 @@

Note: The result may be very large, so you need to return a string instead of an integer.

### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] + [[Sort](../../tag/sort/README.md)] diff --git a/problems/largest-palindrome-product/README.md b/problems/largest-palindrome-product/README.md index 55aa3844c..c44be8ef6 100644 --- a/problems/largest-palindrome-product/README.md +++ b/problems/largest-palindrome-product/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/generate-random-point-in-a-circle "Generate Random Point in a Circle") +[< Previous](../generate-random-point-in-a-circle "Generate Random Point in a Circle") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/sliding-window-median "Sliding Window Median") +[Next >](../sliding-window-median "Sliding Window Median") ## [479. Largest Palindrome Product (Hard)](https://leetcode.com/problems/largest-palindrome-product "最大回文数乘积") diff --git a/problems/largest-perimeter-triangle/README.md b/problems/largest-perimeter-triangle/README.md index f36682e64..843973455 100644 --- a/problems/largest-perimeter-triangle/README.md +++ b/problems/largest-perimeter-triangle/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/odd-even-jump "Odd Even Jump") +[< Previous](../odd-even-jump "Odd Even Jump") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/squares-of-a-sorted-array "Squares of a Sorted Array") +[Next >](../squares-of-a-sorted-array "Squares of a Sorted Array") ## [976. Largest Perimeter Triangle (Easy)](https://leetcode.com/problems/largest-perimeter-triangle "三角形的最大周长") @@ -66,8 +66,8 @@ ### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Sort](../../tag/sort/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Largest Triangle Area](https://github.com/openset/leetcode/tree/master/problems/largest-triangle-area) (Easy) + 1. [Largest Triangle Area](../largest-triangle-area) (Easy) diff --git a/problems/largest-plus-sign/README.md b/problems/largest-plus-sign/README.md index 65668f2f3..cdb692979 100644 --- a/problems/largest-plus-sign/README.md +++ b/problems/largest-plus-sign/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/partition-labels "Partition Labels") +[< Previous](../partition-labels "Partition Labels") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/couples-holding-hands "Couples Holding Hands") +[Next >](../couples-holding-hands "Couples Holding Hands") ## [764. Largest Plus Sign (Medium)](https://leetcode.com/problems/largest-plus-sign "最大加号标志") @@ -74,10 +74,10 @@ There is no plus sign, so return 0.

### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Maximal Square](https://github.com/openset/leetcode/tree/master/problems/maximal-square) (Medium) + 1. [Maximal Square](../maximal-square) (Medium) ### Hints
diff --git a/problems/largest-rectangle-in-histogram/README.md b/problems/largest-rectangle-in-histogram/README.md index f9f7a7bf8..493e234d5 100644 --- a/problems/largest-rectangle-in-histogram/README.md +++ b/problems/largest-rectangle-in-histogram/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-list "Remove Duplicates from Sorted List") +[< Previous](../remove-duplicates-from-sorted-list "Remove Duplicates from Sorted List") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximal-rectangle "Maximal Rectangle") +[Next >](../maximal-rectangle "Maximal Rectangle") ## [84. Largest Rectangle in Histogram (Hard)](https://leetcode.com/problems/largest-rectangle-in-histogram "柱状图中最大的矩形") @@ -33,8 +33,8 @@ ### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Stack](../../tag/stack/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Maximal Rectangle](https://github.com/openset/leetcode/tree/master/problems/maximal-rectangle) (Hard) + 1. [Maximal Rectangle](../maximal-rectangle) (Hard) diff --git a/problems/largest-sum-of-averages/README.md b/problems/largest-sum-of-averages/README.md index f2ca7d91f..8ce2f1d71 100644 --- a/problems/largest-sum-of-averages/README.md +++ b/problems/largest-sum-of-averages/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/largest-triangle-area "Largest Triangle Area") +[< Previous](../largest-triangle-area "Largest Triangle Area") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/binary-tree-pruning "Binary Tree Pruning") +[Next >](../binary-tree-pruning "Binary Tree Pruning") ## [813. Largest Sum of Averages (Medium)](https://leetcode.com/problems/largest-sum-of-averages "最大平均值和的分组") @@ -39,4 +39,4 @@ That partition would lead to a score of 5 + 2 + 6 = 13, which is worse. ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/largest-time-for-given-digits/README.md b/problems/largest-time-for-given-digits/README.md index 3a799ce67..d364beb40 100644 --- a/problems/largest-time-for-given-digits/README.md +++ b/problems/largest-time-for-given-digits/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/bag-of-tokens "Bag of Tokens") +[< Previous](../bag-of-tokens "Bag of Tokens") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/reveal-cards-in-increasing-order "Reveal Cards In Increasing Order") +[Next >](../reveal-cards-in-increasing-order "Reveal Cards In Increasing Order") ## [949. Largest Time for Given Digits (Easy)](https://leetcode.com/problems/largest-time-for-given-digits "给定数字能组成的最大时间") @@ -47,4 +47,4 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/largest-triangle-area/README.md b/problems/largest-triangle-area/README.md index b8158ebab..e03102598 100644 --- a/problems/largest-triangle-area/README.md +++ b/problems/largest-triangle-area/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/subdomain-visit-count "Subdomain Visit Count") +[< Previous](../subdomain-visit-count "Subdomain Visit Count") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/largest-sum-of-averages "Largest Sum of Averages") +[Next >](../largest-sum-of-averages "Largest Sum of Averages") ## [812. Largest Triangle Area (Easy)](https://leetcode.com/problems/largest-triangle-area "最大三角形面积") @@ -35,7 +35,7 @@ The five points are show in the figure below. The red triangle is the largest.

 

### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Largest Perimeter Triangle](https://github.com/openset/leetcode/tree/master/problems/largest-perimeter-triangle) (Easy) + 1. [Largest Perimeter Triangle](../largest-perimeter-triangle) (Easy) diff --git a/problems/largest-unique-number/README.md b/problems/largest-unique-number/README.md index 00e9015f7..bef0cfe4d 100644 --- a/problems/largest-unique-number/README.md +++ b/problems/largest-unique-number/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/reported-posts-ii "Reported Posts II") +[< Previous](../reported-posts-ii "Reported Posts II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/armstrong-number "Armstrong Number") +[Next >](../armstrong-number "Armstrong Number") ## [1133. Largest Unique Number (Easy)](https://leetcode.com/problems/largest-unique-number "最大唯一数") @@ -45,8 +45,8 @@ There is no number that occurs only once. ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Array](../../tag/array/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Hints
diff --git a/problems/largest-values-from-labels/README.md b/problems/largest-values-from-labels/README.md index 756d02405..a71b155d7 100644 --- a/problems/largest-values-from-labels/README.md +++ b/problems/largest-values-from-labels/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/duplicate-zeros "Duplicate Zeros") +[< Previous](../duplicate-zeros "Duplicate Zeros") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/shortest-path-in-binary-matrix "Shortest Path in Binary Matrix") +[Next >](../shortest-path-in-binary-matrix "Shortest Path in Binary Matrix") ## [1090. Largest Values From Labels (Medium)](https://leetcode.com/problems/largest-values-from-labels "受标签影响的最大值") @@ -75,8 +75,8 @@ ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Hints
diff --git a/problems/last-person-to-fit-in-the-elevator/README.md b/problems/last-person-to-fit-in-the-elevator/README.md index b02077c22..bb8211854 100644 --- a/problems/last-person-to-fit-in-the-elevator/README.md +++ b/problems/last-person-to-fit-in-the-elevator/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/sort-items-by-groups-respecting-dependencies "Sort Items by Groups Respecting Dependencies") +[< Previous](../sort-items-by-groups-respecting-dependencies "Sort Items by Groups Respecting Dependencies") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/monthly-transactions-ii "Monthly Transactions II") +[Next >](../monthly-transactions-ii "Monthly Transactions II") ## [1204. Last Person to Fit in the Elevator (Medium)](https://leetcode.com/problems/last-person-to-fit-in-the-elevator "") diff --git a/problems/last-stone-weight-ii/README.md b/problems/last-stone-weight-ii/README.md index 2d1469310..0686f14ff 100644 --- a/problems/last-stone-weight-ii/README.md +++ b/problems/last-stone-weight-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/longest-string-chain "Longest String Chain") +[< Previous](../longest-string-chain "Longest String Chain") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/actors-and-directors-who-cooperated-at-least-three-times "Actors and Directors Who Cooperated At Least Three Times") +[Next >](../actors-and-directors-who-cooperated-at-least-three-times "Actors and Directors Who Cooperated At Least Three Times") ## [1049. Last Stone Weight II (Medium)](https://leetcode.com/problems/last-stone-weight-ii "最后一块石头的重量 II") @@ -46,7 +46,7 @@ we can combine 1 and 1 to get 0 so the array converts to [1] then that's the ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/last-stone-weight/README.md b/problems/last-stone-weight/README.md index 0964d5b57..b45df5262 100644 --- a/problems/last-stone-weight/README.md +++ b/problems/last-stone-weight/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/customers-who-bought-all-products "Customers Who Bought All Products") +[< Previous](../customers-who-bought-all-products "Customers Who Bought All Products") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/remove-all-adjacent-duplicates-in-string "Remove All Adjacent Duplicates In String") +[Next >](../remove-all-adjacent-duplicates-in-string "Remove All Adjacent Duplicates In String") ## [1046. Last Stone Weight (Easy)](https://leetcode.com/problems/last-stone-weight "最后一块石头的重量") @@ -45,8 +45,8 @@ we combine 1 and 1 to get 0 so the array converts to [1] then that's the val ### Related Topics - [[Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] + [[Heap](../../tag/heap/README.md)] + [[Greedy](../../tag/greedy/README.md)] ### Hints
diff --git a/problems/last-substring-in-lexicographical-order/README.md b/problems/last-substring-in-lexicographical-order/README.md index 799016eab..22c17fd2f 100644 --- a/problems/last-substring-in-lexicographical-order/README.md +++ b/problems/last-substring-in-lexicographical-order/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/as-far-from-land-as-possible "As Far from Land as Possible") +[< Previous](../as-far-from-land-as-possible "As Far from Land as Possible") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/product-price-at-a-given-date "Product Price at a Given Date") +[Next >](../product-price-at-a-given-date "Product Price at a Given Date") ## [1163. Last Substring in Lexicographical Order (Hard)](https://leetcode.com/problems/last-substring-in-lexicographical-order "按字典序排在最后的子串") @@ -40,7 +40,7 @@ ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Hints
diff --git a/problems/leaf-similar-trees/README.md b/problems/leaf-similar-trees/README.md index f19aeff35..c52ca03f0 100644 --- a/problems/leaf-similar-trees/README.md +++ b/problems/leaf-similar-trees/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-number-of-refueling-stops "Minimum Number of Refueling Stops") +[< Previous](../minimum-number-of-refueling-stops "Minimum Number of Refueling Stops") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/length-of-longest-fibonacci-subsequence "Length of Longest Fibonacci Subsequence") +[Next >](../length-of-longest-fibonacci-subsequence "Length of Longest Fibonacci Subsequence") ## [872. Leaf-Similar Trees (Easy)](https://leetcode.com/problems/leaf-similar-trees "叶子相似的树") @@ -30,5 +30,5 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] diff --git a/problems/least-operators-to-express-number/README.md b/problems/least-operators-to-express-number/README.md index 29ca8ddc9..f50bba289 100644 --- a/problems/least-operators-to-express-number/README.md +++ b/problems/least-operators-to-express-number/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-area-rectangle-ii "Minimum Area Rectangle II") +[< Previous](../minimum-area-rectangle-ii "Minimum Area Rectangle II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/univalued-binary-tree "Univalued Binary Tree") +[Next >](../univalued-binary-tree "Univalued Binary Tree") ## [964. Least Operators to Express Number (Hard)](https://leetcode.com/problems/least-operators-to-express-number "表示数字的最少运算符") @@ -71,5 +71,5 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Math](../../tag/math/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/lemonade-change/README.md b/problems/lemonade-change/README.md index 7f8959e1f..0abf8e839 100644 --- a/problems/lemonade-change/README.md +++ b/problems/lemonade-change/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/buddy-strings "Buddy Strings") +[< Previous](../buddy-strings "Buddy Strings") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/score-after-flipping-matrix "Score After Flipping Matrix") +[Next >](../score-after-flipping-matrix "Score After Flipping Matrix") ## [860. Lemonade Change (Easy)](https://leetcode.com/problems/lemonade-change "柠檬水找零") @@ -79,4 +79,4 @@ Since not every customer received correct change, the answer is false. ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] + [[Greedy](../../tag/greedy/README.md)] diff --git a/problems/length-of-last-word/README.md b/problems/length-of-last-word/README.md index 60594f868..3273ade81 100644 --- a/problems/length-of-last-word/README.md +++ b/problems/length-of-last-word/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/insert-interval "Insert Interval") +[< Previous](../insert-interval "Insert Interval") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/spiral-matrix-ii "Spiral Matrix II") +[Next >](../spiral-matrix-ii "Spiral Matrix II") ## [58. Length of Last Word (Easy)](https://leetcode.com/problems/length-of-last-word "最后一个单词的长度") @@ -27,4 +27,4 @@

 

### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/length-of-longest-fibonacci-subsequence/README.md b/problems/length-of-longest-fibonacci-subsequence/README.md index bb1269950..9ee36d6ae 100644 --- a/problems/length-of-longest-fibonacci-subsequence/README.md +++ b/problems/length-of-longest-fibonacci-subsequence/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/leaf-similar-trees "Leaf-Similar Trees") +[< Previous](../leaf-similar-trees "Leaf-Similar Trees") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/walking-robot-simulation "Walking Robot Simulation") +[Next >](../walking-robot-simulation "Walking Robot Simulation") ## [873. Length of Longest Fibonacci Subsequence (Medium)](https://leetcode.com/problems/length-of-longest-fibonacci-subsequence "最长的斐波那契子序列的长度") @@ -57,8 +57,8 @@ The longest subsequence that is fibonacci-like: ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Array](../../tag/array/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Fibonacci Number](https://github.com/openset/leetcode/tree/master/problems/fibonacci-number) (Easy) + 1. [Fibonacci Number](../fibonacci-number) (Easy) diff --git a/problems/letter-case-permutation/README.md b/problems/letter-case-permutation/README.md index 369445ac3..31b3fc159 100644 --- a/problems/letter-case-permutation/README.md +++ b/problems/letter-case-permutation/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-distance-between-bst-nodes "Minimum Distance Between BST Nodes") +[< Previous](../minimum-distance-between-bst-nodes "Minimum Distance Between BST Nodes") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/is-graph-bipartite "Is Graph Bipartite?") +[Next >](../is-graph-bipartite "Is Graph Bipartite?") ## [784. Letter Case Permutation (Easy)](https://leetcode.com/problems/letter-case-permutation "字母大小写全排列") @@ -33,9 +33,9 @@ ### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Subsets](https://github.com/openset/leetcode/tree/master/problems/subsets) (Medium) - 1. [Brace Expansion](https://github.com/openset/leetcode/tree/master/problems/brace-expansion) (Medium) + 1. [Subsets](../subsets) (Medium) + 1. [Brace Expansion](../brace-expansion) (Medium) diff --git a/problems/letter-combinations-of-a-phone-number/README.md b/problems/letter-combinations-of-a-phone-number/README.md index 2263594d0..3ab05823e 100644 --- a/problems/letter-combinations-of-a-phone-number/README.md +++ b/problems/letter-combinations-of-a-phone-number/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/3sum-closest "3Sum Closest") +[< Previous](../3sum-closest "3Sum Closest") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/4sum "4Sum") +[Next >](../4sum "4Sum") ## [17. Letter Combinations of a Phone Number (Medium)](https://leetcode.com/problems/letter-combinations-of-a-phone-number "电话号码的字母组合") @@ -29,10 +29,10 @@

Although the above answer is in lexicographical order, your answer could be in any order you want.

### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[String](../../tag/string/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Generate Parentheses](https://github.com/openset/leetcode/tree/master/problems/generate-parentheses) (Medium) - 1. [Combination Sum](https://github.com/openset/leetcode/tree/master/problems/combination-sum) (Medium) - 1. [Binary Watch](https://github.com/openset/leetcode/tree/master/problems/binary-watch) (Easy) + 1. [Generate Parentheses](../generate-parentheses) (Medium) + 1. [Combination Sum](../combination-sum) (Medium) + 1. [Binary Watch](../binary-watch) (Easy) diff --git a/problems/letter-tile-possibilities/README.md b/problems/letter-tile-possibilities/README.md index 5e6fbeed4..2823e0444 100644 --- a/problems/letter-tile-possibilities/README.md +++ b/problems/letter-tile-possibilities/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/occurrences-after-bigram "Occurrences After Bigram") +[< Previous](../occurrences-after-bigram "Occurrences After Bigram") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/insufficient-nodes-in-root-to-leaf-paths "Insufficient Nodes in Root to Leaf Paths") +[Next >](../insufficient-nodes-in-root-to-leaf-paths "Insufficient Nodes in Root to Leaf Paths") ## [1079. Letter Tile Possibilities (Medium)](https://leetcode.com/problems/letter-tile-possibilities "活字印刷") @@ -42,7 +42,7 @@ ### Related Topics - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Hints
diff --git a/problems/lexicographical-numbers/README.md b/problems/lexicographical-numbers/README.md index 33592c273..202709cbe 100644 --- a/problems/lexicographical-numbers/README.md +++ b/problems/lexicographical-numbers/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/mini-parser "Mini Parser") +[< Previous](../mini-parser "Mini Parser") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/first-unique-character-in-a-string "First Unique Character in a String") +[Next >](../first-unique-character-in-a-string "First Unique Character in a String") ## [386. Lexicographical Numbers (Medium)](https://leetcode.com/problems/lexicographical-numbers "字典序排数") diff --git a/problems/lexicographically-smallest-equivalent-string/README.md b/problems/lexicographically-smallest-equivalent-string/README.md index dd6a66f52..273d83928 100644 --- a/problems/lexicographically-smallest-equivalent-string/README.md +++ b/problems/lexicographically-smallest-equivalent-string/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/missing-element-in-sorted-array "Missing Element in Sorted Array") +[< Previous](../missing-element-in-sorted-array "Missing Element in Sorted Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/longest-repeating-substring "Longest Repeating Substring") +[Next >](../longest-repeating-substring "Longest Repeating Substring") ## [1061. Lexicographically Smallest Equivalent String (Medium)](https://leetcode.com/problems/lexicographically-smallest-equivalent-string "按字典序排列最小的等效字符串") @@ -62,8 +62,8 @@ ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Union Find](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Union Find](../../tag/union-find/README.md)] ### Hints
diff --git a/problems/lfu-cache/README.md b/problems/lfu-cache/README.md index d4952eff2..5f0d76269 100644 --- a/problems/lfu-cache/README.md +++ b/problems/lfu-cache/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/repeated-substring-pattern "Repeated Substring Pattern") +[< Previous](../repeated-substring-pattern "Repeated Substring Pattern") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/hamming-distance "Hamming Distance") +[Next >](../hamming-distance "Hamming Distance") ## [460. LFU Cache (Hard)](https://leetcode.com/problems/lfu-cache "LFU缓存") @@ -45,8 +45,8 @@ cache.get(4); // returns 4

 

### Related Topics - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] + [[Design](../../tag/design/README.md)] ### Similar Questions - 1. [LRU Cache](https://github.com/openset/leetcode/tree/master/problems/lru-cache) (Medium) - 1. [Design In-Memory File System](https://github.com/openset/leetcode/tree/master/problems/design-in-memory-file-system) (Hard) + 1. [LRU Cache](../lru-cache) (Medium) + 1. [Design In-Memory File System](../design-in-memory-file-system) (Hard) diff --git a/problems/license-key-formatting/README.md b/problems/license-key-formatting/README.md index c079a5f43..aca195293 100644 --- a/problems/license-key-formatting/README.md +++ b/problems/license-key-formatting/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/magical-string "Magical String") +[< Previous](../magical-string "Magical String") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/smallest-good-base "Smallest Good Base") +[Next >](../smallest-good-base "Smallest Good Base") ## [482. License Key Formatting (Easy)](https://leetcode.com/problems/license-key-formatting "密钥格式化") diff --git a/problems/line-reflection/README.md b/problems/line-reflection/README.md index 83c967b90..e08b9984f 100644 --- a/problems/line-reflection/README.md +++ b/problems/line-reflection/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/design-twitter "Design Twitter") +[< Previous](../design-twitter "Design Twitter") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/count-numbers-with-unique-digits "Count Numbers with Unique Digits") +[Next >](../count-numbers-with-unique-digits "Count Numbers with Unique Digits") ## [356. Line Reflection (Medium)](https://leetcode.com/problems/line-reflection "直线镜像") @@ -28,12 +28,12 @@ Output: false ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Max Points on a Line](https://github.com/openset/leetcode/tree/master/problems/max-points-on-a-line) (Hard) - 1. [Number of Boomerangs](https://github.com/openset/leetcode/tree/master/problems/number-of-boomerangs) (Easy) + 1. [Max Points on a Line](../max-points-on-a-line) (Hard) + 1. [Number of Boomerangs](../number-of-boomerangs) (Easy) ### Hints
diff --git a/problems/linked-list-components/README.md b/problems/linked-list-components/README.md index 84a14dde1..03075fdf2 100644 --- a/problems/linked-list-components/README.md +++ b/problems/linked-list-components/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/ambiguous-coordinates "Ambiguous Coordinates") +[< Previous](../ambiguous-coordinates "Ambiguous Coordinates") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/race-car "Race Car") +[Next >](../race-car "Race Car") ## [817. Linked List Components (Medium)](https://leetcode.com/problems/linked-list-components "链表组件") @@ -49,4 +49,4 @@ G = [0, 3, 1, 4] ### Related Topics - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] + [[Linked List](../../tag/linked-list/README.md)] diff --git a/problems/linked-list-cycle-ii/README.md b/problems/linked-list-cycle-ii/README.md index 03f237f05..beb38d797 100644 --- a/problems/linked-list-cycle-ii/README.md +++ b/problems/linked-list-cycle-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/linked-list-cycle "Linked List Cycle") +[< Previous](../linked-list-cycle "Linked List Cycle") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/reorder-list "Reorder List") +[Next >](../reorder-list "Reorder List") ## [142. Linked List Cycle II (Medium)](https://leetcode.com/problems/linked-list-cycle-ii "环形链表 II") @@ -55,9 +55,9 @@ Can you solve it without using extra space?

### Related Topics - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Linked List](../../tag/linked-list/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] ### Similar Questions - 1. [Linked List Cycle](https://github.com/openset/leetcode/tree/master/problems/linked-list-cycle) (Easy) - 1. [Find the Duplicate Number](https://github.com/openset/leetcode/tree/master/problems/find-the-duplicate-number) (Medium) + 1. [Linked List Cycle](../linked-list-cycle) (Easy) + 1. [Find the Duplicate Number](../find-the-duplicate-number) (Medium) diff --git a/problems/linked-list-cycle/README.md b/problems/linked-list-cycle/README.md index 28f75ed36..056383919 100644 --- a/problems/linked-list-cycle/README.md +++ b/problems/linked-list-cycle/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/word-break-ii "Word Break II") +[< Previous](../word-break-ii "Word Break II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/linked-list-cycle-ii "Linked List Cycle II") +[Next >](../linked-list-cycle-ii "Linked List Cycle II") ## [141. Linked List Cycle (Easy)](https://leetcode.com/problems/linked-list-cycle "环形链表") @@ -60,9 +60,9 @@

Can you solve it using O(1) (i.e. constant) memory?

### Related Topics - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Linked List](../../tag/linked-list/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] ### Similar Questions - 1. [Linked List Cycle II](https://github.com/openset/leetcode/tree/master/problems/linked-list-cycle-ii) (Medium) - 1. [Happy Number](https://github.com/openset/leetcode/tree/master/problems/happy-number) (Easy) + 1. [Linked List Cycle II](../linked-list-cycle-ii) (Medium) + 1. [Happy Number](../happy-number) (Easy) diff --git a/problems/linked-list-random-node/README.md b/problems/linked-list-random-node/README.md index d07b720db..87e4bdd5e 100644 --- a/problems/linked-list-random-node/README.md +++ b/problems/linked-list-random-node/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/insert-delete-getrandom-o1-duplicates-allowed "Insert Delete GetRandom O(1) - Duplicates allowed") +[< Previous](../insert-delete-getrandom-o1-duplicates-allowed "Insert Delete GetRandom O(1) - Duplicates allowed") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/ransom-note "Ransom Note") +[Next >](../ransom-note "Ransom Note") ## [382. Linked List Random Node (Medium)](https://leetcode.com/problems/linked-list-random-node "链表随机节点") @@ -31,7 +31,7 @@ solution.getRandom();

### Related Topics - [[Reservoir Sampling](https://github.com/openset/leetcode/tree/master/tag/reservoir-sampling/README.md)] + [[Reservoir Sampling](../../tag/reservoir-sampling/README.md)] ### Similar Questions - 1. [Random Pick Index](https://github.com/openset/leetcode/tree/master/problems/random-pick-index) (Medium) + 1. [Random Pick Index](../random-pick-index) (Medium) diff --git a/problems/logger-rate-limiter/README.md b/problems/logger-rate-limiter/README.md index c4218c56c..20267a79e 100644 --- a/problems/logger-rate-limiter/README.md +++ b/problems/logger-rate-limiter/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/rearrange-string-k-distance-apart "Rearrange String k Distance Apart") +[< Previous](../rearrange-string-k-distance-apart "Rearrange String k Distance Apart") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/sort-transformed-array "Sort Transformed Array") +[Next >](../sort-transformed-array "Sort Transformed Array") ## [359. Logger Rate Limiter (Easy)](https://leetcode.com/problems/logger-rate-limiter "日志速率限制器") @@ -42,8 +42,8 @@ logger.shouldPrintMessage(11,"foo"); returns true; ### Related Topics - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Design](../../tag/design/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Design Hit Counter](https://github.com/openset/leetcode/tree/master/problems/design-hit-counter) (Medium) + 1. [Design Hit Counter](../design-hit-counter) (Medium) diff --git a/problems/lonely-pixel-i/README.md b/problems/lonely-pixel-i/README.md index 55cdaa3ff..8e95a9dd8 100644 --- a/problems/lonely-pixel-i/README.md +++ b/problems/lonely-pixel-i/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-absolute-difference-in-bst "Minimum Absolute Difference in BST") +[< Previous](../minimum-absolute-difference-in-bst "Minimum Absolute Difference in BST") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/k-diff-pairs-in-an-array "K-diff Pairs in an Array") +[Next >](../k-diff-pairs-in-an-array "K-diff Pairs in an Array") ## [531. Lonely Pixel I (Medium)](https://leetcode.com/problems/lonely-pixel-i "孤独像素 I") @@ -36,8 +36,8 @@

### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Lonely Pixel II](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-ii) (Medium) + 1. [Lonely Pixel II](../lonely-pixel-ii) (Medium) diff --git a/problems/lonely-pixel-ii/README.md b/problems/lonely-pixel-ii/README.md index f24bb76d2..5d44bbe80 100644 --- a/problems/lonely-pixel-ii/README.md +++ b/problems/lonely-pixel-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/k-diff-pairs-in-an-array "K-diff Pairs in an Array") +[< Previous](../k-diff-pairs-in-an-array "K-diff Pairs in an Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/game-play-analysis-iii "Game Play Analysis III") +[Next >](../game-play-analysis-iii "Game Play Analysis III") ## [533. Lonely Pixel II (Medium)](https://leetcode.com/problems/lonely-pixel-ii "孤独像素 II") @@ -52,8 +52,8 @@ Rule 2, the rows have black pixel at column C = 1 are row 0, row 1 and row 2. Th

### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Lonely Pixel I](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-i) (Medium) + 1. [Lonely Pixel I](../lonely-pixel-i) (Medium) diff --git a/problems/long-pressed-name/README.md b/problems/long-pressed-name/README.md index 0838ab7b2..835dcfa2e 100644 --- a/problems/long-pressed-name/README.md +++ b/problems/long-pressed-name/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimize-malware-spread "Minimize Malware Spread") +[< Previous](../minimize-malware-spread "Minimize Malware Spread") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/flip-string-to-monotone-increasing "Flip String to Monotone Increasing") +[Next >](../flip-string-to-monotone-increasing "Flip String to Monotone Increasing") ## [925. Long Pressed Name (Easy)](https://leetcode.com/problems/long-pressed-name "长按键入") @@ -75,5 +75,5 @@ ### Related Topics - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/longest-absolute-file-path/README.md b/problems/longest-absolute-file-path/README.md index c48e640c3..d1da1f8bd 100644 --- a/problems/longest-absolute-file-path/README.md +++ b/problems/longest-absolute-file-path/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/first-unique-character-in-a-string "First Unique Character in a String") +[< Previous](../first-unique-character-in-a-string "First Unique Character in a String") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-the-difference "Find the Difference") +[Next >](../find-the-difference "Find the Difference") ## [388. Longest Absolute File Path (Medium)](https://leetcode.com/problems/longest-absolute-file-path "文件的最长绝对路径") diff --git a/problems/longest-arithmetic-sequence/README.md b/problems/longest-arithmetic-sequence/README.md index c3f2000bf..8703dfe66 100644 --- a/problems/longest-arithmetic-sequence/README.md +++ b/problems/longest-arithmetic-sequence/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-difference-between-node-and-ancestor "Maximum Difference Between Node and Ancestor") +[< Previous](../maximum-difference-between-node-and-ancestor "Maximum Difference Between Node and Ancestor") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/recover-a-tree-from-preorder-traversal "Recover a Tree From Preorder Traversal") +[Next >](../recover-a-tree-from-preorder-traversal "Recover a Tree From Preorder Traversal") ## [1027. Longest Arithmetic Sequence (Medium)](https://leetcode.com/problems/longest-arithmetic-sequence "最长等差数列") @@ -58,4 +58,4 @@ The longest arithmetic subsequence is [20,15,10,5]. ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/longest-arithmetic-subsequence-of-given-difference/README.md b/problems/longest-arithmetic-subsequence-of-given-difference/README.md index d1f167953..b56061b0a 100644 --- a/problems/longest-arithmetic-subsequence-of-given-difference/README.md +++ b/problems/longest-arithmetic-subsequence-of-given-difference/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/play-with-chips "Play with Chips") +[< Previous](../play-with-chips "Play with Chips") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/path-with-maximum-gold "Path with Maximum Gold") +[Next >](../path-with-maximum-gold "Path with Maximum Gold") ## [1218. Longest Arithmetic Subsequence of Given Difference (Medium)](https://leetcode.com/problems/longest-arithmetic-subsequence-of-given-difference "最长定差子序列") @@ -46,8 +46,8 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Math](../../tag/math/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/longest-chunked-palindrome-decomposition/README.md b/problems/longest-chunked-palindrome-decomposition/README.md index 2c6b04c05..d2b9239a5 100644 --- a/problems/longest-chunked-palindrome-decomposition/README.md +++ b/problems/longest-chunked-palindrome-decomposition/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/snapshot-array "Snapshot Array") +[< Previous](../snapshot-array "Snapshot Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/article-views-i "Article Views I") +[Next >](../article-views-i "Article Views I") ## [1147. Longest Chunked Palindrome Decomposition (Hard)](https://leetcode.com/problems/longest-chunked-palindrome-decomposition "段式回文") @@ -61,7 +61,7 @@ ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/longest-common-prefix/README.md b/problems/longest-common-prefix/README.md index a967ff200..a5b6c63d3 100644 --- a/problems/longest-common-prefix/README.md +++ b/problems/longest-common-prefix/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/roman-to-integer "Roman to Integer") +[< Previous](../roman-to-integer "Roman to Integer") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/3sum "3Sum") +[Next >](../3sum "3Sum") ## [14. Longest Common Prefix (Easy)](https://leetcode.com/problems/longest-common-prefix "最长公共前缀") @@ -35,4 +35,4 @@

All given inputs are in lowercase letters a-z.

### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/longest-common-subsequence/README.md b/problems/longest-common-subsequence/README.md index c16b43e6f..75d8cfed4 100644 --- a/problems/longest-common-subsequence/README.md +++ b/problems/longest-common-subsequence/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/user-activity-for-the-past-30-days-ii "User Activity for the Past 30 Days II") +[< Previous](../user-activity-for-the-past-30-days-ii "User Activity for the Past 30 Days II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/decrease-elements-to-make-array-zigzag "Decrease Elements To Make Array Zigzag") +[Next >](../decrease-elements-to-make-array-zigzag "Decrease Elements To Make Array Zigzag") ## [1143. Longest Common Subsequence (Medium)](https://leetcode.com/problems/longest-common-subsequence "最长公共子序列") @@ -54,7 +54,7 @@ ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/longest-consecutive-sequence/README.md b/problems/longest-consecutive-sequence/README.md index ca0a78204..b85a5bd21 100644 --- a/problems/longest-consecutive-sequence/README.md +++ b/problems/longest-consecutive-sequence/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/word-ladder "Word Ladder") +[< Previous](../word-ladder "Word Ladder") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/sum-root-to-leaf-numbers "Sum Root to Leaf Numbers") +[Next >](../sum-root-to-leaf-numbers "Sum Root to Leaf Numbers") ## [128. Longest Consecutive Sequence (Hard)](https://leetcode.com/problems/longest-consecutive-sequence "最长连续序列") @@ -24,8 +24,8 @@ ### Related Topics - [[Union Find](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Union Find](../../tag/union-find/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Binary Tree Longest Consecutive Sequence](https://github.com/openset/leetcode/tree/master/problems/binary-tree-longest-consecutive-sequence) (Medium) + 1. [Binary Tree Longest Consecutive Sequence](../binary-tree-longest-consecutive-sequence) (Medium) diff --git a/problems/longest-continuous-increasing-subsequence/README.md b/problems/longest-continuous-increasing-subsequence/README.md index 959fa975d..b5b65a90a 100644 --- a/problems/longest-continuous-increasing-subsequence/README.md +++ b/problems/longest-continuous-increasing-subsequence/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/number-of-longest-increasing-subsequence "Number of Longest Increasing Subsequence") +[< Previous](../number-of-longest-increasing-subsequence "Number of Longest Increasing Subsequence") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/cut-off-trees-for-golf-event "Cut Off Trees for Golf Event") +[Next >](../cut-off-trees-for-golf-event "Cut Off Trees for Golf Event") ## [674. Longest Continuous Increasing Subsequence (Easy)](https://leetcode.com/problems/longest-continuous-increasing-subsequence "最长连续递增序列") @@ -37,8 +37,8 @@ Length of the array will not exceed 10,000.

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Number of Longest Increasing Subsequence](https://github.com/openset/leetcode/tree/master/problems/number-of-longest-increasing-subsequence) (Medium) - 1. [Minimum Window Subsequence](https://github.com/openset/leetcode/tree/master/problems/minimum-window-subsequence) (Hard) + 1. [Number of Longest Increasing Subsequence](../number-of-longest-increasing-subsequence) (Medium) + 1. [Minimum Window Subsequence](../minimum-window-subsequence) (Hard) diff --git a/problems/longest-duplicate-substring/README.md b/problems/longest-duplicate-substring/README.md index c457f590a..40e889317 100644 --- a/problems/longest-duplicate-substring/README.md +++ b/problems/longest-duplicate-substring/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/partition-array-for-maximum-sum "Partition Array for Maximum Sum") +[< Previous](../partition-array-for-maximum-sum "Partition Array for Maximum Sum") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/customers-who-bought-all-products "Customers Who Bought All Products") +[Next >](../customers-who-bought-all-products "Customers Who Bought All Products") ## [1044. Longest Duplicate Substring (Hard)](https://leetcode.com/problems/longest-duplicate-substring "最长重复子串") @@ -41,8 +41,8 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Hints
diff --git a/problems/longest-harmonious-subsequence/README.md b/problems/longest-harmonious-subsequence/README.md index d6083ff37..fb83eb1c5 100644 --- a/problems/longest-harmonious-subsequence/README.md +++ b/problems/longest-harmonious-subsequence/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/valid-square "Valid Square") +[< Previous](../valid-square "Valid Square") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/big-countries "Big Countries") +[Next >](../big-countries "Big Countries") ## [594. Longest Harmonious Subsequence (Easy)](https://leetcode.com/problems/longest-harmonious-subsequence "最长和谐子序列") @@ -28,4 +28,4 @@

Note: The length of the input array will not exceed 20,000.

### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] diff --git a/problems/longest-increasing-path-in-a-matrix/README.md b/problems/longest-increasing-path-in-a-matrix/README.md index 578a4eaed..73f1cf63f 100644 --- a/problems/longest-increasing-path-in-a-matrix/README.md +++ b/problems/longest-increasing-path-in-a-matrix/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/odd-even-linked-list "Odd Even Linked List") +[< Previous](../odd-even-linked-list "Odd Even Linked List") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/patching-array "Patching Array") +[Next >](../patching-array "Patching Array") ## [329. Longest Increasing Path in a Matrix (Hard)](https://leetcode.com/problems/longest-increasing-path-in-a-matrix "矩阵中的最长递增路径") @@ -42,6 +42,6 @@ ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Topological Sort](https://github.com/openset/leetcode/tree/master/tag/topological-sort/README.md)] - [[Memoization](https://github.com/openset/leetcode/tree/master/tag/memoization/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Topological Sort](../../tag/topological-sort/README.md)] + [[Memoization](../../tag/memoization/README.md)] diff --git a/problems/longest-increasing-subsequence/README.md b/problems/longest-increasing-subsequence/README.md index 8b05a5d47..1f0fe7f8f 100644 --- a/problems/longest-increasing-subsequence/README.md +++ b/problems/longest-increasing-subsequence/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/bulls-and-cows "Bulls and Cows") +[< Previous](../bulls-and-cows "Bulls and Cows") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/remove-invalid-parentheses "Remove Invalid Parentheses") +[Next >](../remove-invalid-parentheses "Remove Invalid Parentheses") ## [300. Longest Increasing Subsequence (Medium)](https://leetcode.com/problems/longest-increasing-subsequence "最长上升子序列") @@ -30,12 +30,12 @@

Follow up: Could you improve it to O(n log n) time complexity?

### Related Topics - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Increasing Triplet Subsequence](https://github.com/openset/leetcode/tree/master/problems/increasing-triplet-subsequence) (Medium) - 1. [Russian Doll Envelopes](https://github.com/openset/leetcode/tree/master/problems/russian-doll-envelopes) (Hard) - 1. [Maximum Length of Pair Chain](https://github.com/openset/leetcode/tree/master/problems/maximum-length-of-pair-chain) (Medium) - 1. [Number of Longest Increasing Subsequence](https://github.com/openset/leetcode/tree/master/problems/number-of-longest-increasing-subsequence) (Medium) - 1. [Minimum ASCII Delete Sum for Two Strings](https://github.com/openset/leetcode/tree/master/problems/minimum-ascii-delete-sum-for-two-strings) (Medium) + 1. [Increasing Triplet Subsequence](../increasing-triplet-subsequence) (Medium) + 1. [Russian Doll Envelopes](../russian-doll-envelopes) (Hard) + 1. [Maximum Length of Pair Chain](../maximum-length-of-pair-chain) (Medium) + 1. [Number of Longest Increasing Subsequence](../number-of-longest-increasing-subsequence) (Medium) + 1. [Minimum ASCII Delete Sum for Two Strings](../minimum-ascii-delete-sum-for-two-strings) (Medium) diff --git a/problems/longest-line-of-consecutive-one-in-matrix/README.md b/problems/longest-line-of-consecutive-one-in-matrix/README.md index 19a81e4a5..5698e26e0 100644 --- a/problems/longest-line-of-consecutive-one-in-matrix/README.md +++ b/problems/longest-line-of-consecutive-one-in-matrix/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/array-partition-i "Array Partition I") +[< Previous](../array-partition-i "Array Partition I") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/binary-tree-tilt "Binary Tree Tilt") +[Next >](../binary-tree-tilt "Binary Tree Tilt") ## [562. Longest Line of Consecutive One in Matrix (Medium)](https://leetcode.com/problems/longest-line-of-consecutive-one-in-matrix "矩阵中最长的连续1线段") @@ -29,7 +29,7 @@ The number of elements in the given matrix will not exceed 10,000.

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Hints
diff --git a/problems/longest-mountain-in-array/README.md b/problems/longest-mountain-in-array/README.md index b7492086f..11c50003d 100644 --- a/problems/longest-mountain-in-array/README.md +++ b/problems/longest-mountain-in-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/backspace-string-compare "Backspace String Compare") +[< Previous](../backspace-string-compare "Backspace String Compare") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/hand-of-straights "Hand of Straights") +[Next >](../hand-of-straights "Hand of Straights") ## [845. Longest Mountain in Array (Medium)](https://leetcode.com/problems/longest-mountain-in-array "数组中的最长山脉") @@ -55,4 +55,4 @@ ### Related Topics - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] diff --git a/problems/longest-palindrome/README.md b/problems/longest-palindrome/README.md index 8056e0379..61887ae96 100644 --- a/problems/longest-palindrome/README.md +++ b/problems/longest-palindrome/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/valid-word-abbreviation "Valid Word Abbreviation") +[< Previous](../valid-word-abbreviation "Valid Word Abbreviation") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/split-array-largest-sum "Split Array Largest Sum") +[Next >](../split-array-largest-sum "Split Array Largest Sum") ## [409. Longest Palindrome (Easy)](https://leetcode.com/problems/longest-palindrome "最长回文串") @@ -33,7 +33,7 @@ One longest palindrome that can be built is "dccaccd", whose length is 7.

### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Palindrome Permutation](https://github.com/openset/leetcode/tree/master/problems/palindrome-permutation) (Easy) + 1. [Palindrome Permutation](../palindrome-permutation) (Easy) diff --git a/problems/longest-palindromic-subsequence/README.md b/problems/longest-palindromic-subsequence/README.md index 5f6f7f90c..9629d2933 100644 --- a/problems/longest-palindromic-subsequence/README.md +++ b/problems/longest-palindromic-subsequence/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-largest-value-in-each-tree-row "Find Largest Value in Each Tree Row") +[< Previous](../find-largest-value-in-each-tree-row "Find Largest Value in Each Tree Row") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/super-washing-machines "Super Washing Machines") +[Next >](../super-washing-machines "Super Washing Machines") ## [516. Longest Palindromic Subsequence (Medium)](https://leetcode.com/problems/longest-palindromic-subsequence "最长回文子序列") @@ -40,9 +40,9 @@ One possible longest palindromic subsequence is "bb".

### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Longest Palindromic Substring](https://github.com/openset/leetcode/tree/master/problems/longest-palindromic-substring) (Medium) - 1. [Palindromic Substrings](https://github.com/openset/leetcode/tree/master/problems/palindromic-substrings) (Medium) - 1. [Count Different Palindromic Subsequences](https://github.com/openset/leetcode/tree/master/problems/count-different-palindromic-subsequences) (Hard) + 1. [Longest Palindromic Substring](../longest-palindromic-substring) (Medium) + 1. [Palindromic Substrings](../palindromic-substrings) (Medium) + 1. [Count Different Palindromic Subsequences](../count-different-palindromic-subsequences) (Hard) diff --git a/problems/longest-palindromic-substring/README.md b/problems/longest-palindromic-substring/README.md index d149237c7..427626ae3 100644 --- a/problems/longest-palindromic-substring/README.md +++ b/problems/longest-palindromic-substring/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/median-of-two-sorted-arrays "Median of Two Sorted Arrays") +[< Previous](../median-of-two-sorted-arrays "Median of Two Sorted Arrays") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/zigzag-conversion "ZigZag Conversion") +[Next >](../zigzag-conversion "ZigZag Conversion") ## [5. Longest Palindromic Substring (Medium)](https://leetcode.com/problems/longest-palindromic-substring "最长回文子串") @@ -29,15 +29,15 @@ ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[String](../../tag/string/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Shortest Palindrome](https://github.com/openset/leetcode/tree/master/problems/shortest-palindrome) (Hard) - 1. [Palindrome Permutation](https://github.com/openset/leetcode/tree/master/problems/palindrome-permutation) (Easy) - 1. [Palindrome Pairs](https://github.com/openset/leetcode/tree/master/problems/palindrome-pairs) (Hard) - 1. [Longest Palindromic Subsequence](https://github.com/openset/leetcode/tree/master/problems/longest-palindromic-subsequence) (Medium) - 1. [Palindromic Substrings](https://github.com/openset/leetcode/tree/master/problems/palindromic-substrings) (Medium) + 1. [Shortest Palindrome](../shortest-palindrome) (Hard) + 1. [Palindrome Permutation](../palindrome-permutation) (Easy) + 1. [Palindrome Pairs](../palindrome-pairs) (Hard) + 1. [Longest Palindromic Subsequence](../longest-palindromic-subsequence) (Medium) + 1. [Palindromic Substrings](../palindromic-substrings) (Medium) ### Hints
diff --git a/problems/longest-repeating-character-replacement/README.md b/problems/longest-repeating-character-replacement/README.md index 287f5fb0c..4effd154d 100644 --- a/problems/longest-repeating-character-replacement/README.md +++ b/problems/longest-repeating-character-replacement/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/reconstruct-original-digits-from-english "Reconstruct Original Digits from English") +[< Previous](../reconstruct-original-digits-from-english "Reconstruct Original Digits from English") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/word-squares "Word Squares") +[Next >](../word-squares "Word Squares") ## [424. Longest Repeating Character Replacement (Medium)](https://leetcode.com/problems/longest-repeating-character-replacement "替换后的最长重复字符") @@ -52,9 +52,9 @@ The substring "BBBB" has the longest repeating letters, which is 4.

 

### Related Topics - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] - [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] + [[Sliding Window](../../tag/sliding-window/README.md)] ### Similar Questions - 1. [Longest Substring with At Most K Distinct Characters](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-k-distinct-characters) (Hard) - 1. [Max Consecutive Ones III](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones-iii) (Medium) + 1. [Longest Substring with At Most K Distinct Characters](../longest-substring-with-at-most-k-distinct-characters) (Hard) + 1. [Max Consecutive Ones III](../max-consecutive-ones-iii) (Medium) diff --git a/problems/longest-repeating-substring/README.md b/problems/longest-repeating-substring/README.md index 177fab4f7..74d0ab9e0 100644 --- a/problems/longest-repeating-substring/README.md +++ b/problems/longest-repeating-substring/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/lexicographically-smallest-equivalent-string "Lexicographically Smallest Equivalent String") +[< Previous](../lexicographically-smallest-equivalent-string "Lexicographically Smallest Equivalent String") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-valid-subarrays "Number of Valid Subarrays") +[Next >](../number-of-valid-subarrays "Number of Valid Subarrays") ## [1062. Longest Repeating Substring (Medium)](https://leetcode.com/problems/longest-repeating-substring "最长重复子串") @@ -57,7 +57,7 @@ ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Hints
diff --git a/problems/longest-string-chain/README.md b/problems/longest-string-chain/README.md index f6339dad6..0a2b5f042 100644 --- a/problems/longest-string-chain/README.md +++ b/problems/longest-string-chain/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/remove-all-adjacent-duplicates-in-string "Remove All Adjacent Duplicates In String") +[< Previous](../remove-all-adjacent-duplicates-in-string "Remove All Adjacent Duplicates In String") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/last-stone-weight-ii "Last Stone Weight II") +[Next >](../last-stone-weight-ii "Last Stone Weight II") ## [1048. Longest String Chain (Medium)](https://leetcode.com/problems/longest-string-chain "最长字符串链") @@ -44,8 +44,8 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/longest-substring-with-at-least-k-repeating-characters/README.md b/problems/longest-substring-with-at-least-k-repeating-characters/README.md index cd701ca46..0043cf6de 100644 --- a/problems/longest-substring-with-at-least-k-repeating-characters/README.md +++ b/problems/longest-substring-with-at-least-k-repeating-characters/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/decode-string "Decode String") +[< Previous](../decode-string "Decode String") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/rotate-function "Rotate Function") +[Next >](../rotate-function "Rotate Function") ## [395. Longest Substring with At Least K Repeating Characters (Medium)](https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters "至少有K个重复字符的最长子串") diff --git a/problems/longest-substring-with-at-most-k-distinct-characters/README.md b/problems/longest-substring-with-at-most-k-distinct-characters/README.md index 338beeb23..2ef66431a 100644 --- a/problems/longest-substring-with-at-most-k-distinct-characters/README.md +++ b/problems/longest-substring-with-at-most-k-distinct-characters/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/nested-list-weight-sum "Nested List Weight Sum") +[< Previous](../nested-list-weight-sum "Nested List Weight Sum") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/flatten-nested-list-iterator "Flatten Nested List Iterator") +[Next >](../flatten-nested-list-iterator "Flatten Nested List Iterator") ## [340. Longest Substring with At Most K Distinct Characters (Hard)](https://leetcode.com/problems/longest-substring-with-at-most-k-distinct-characters "至多包含 K 个不同字符的最长子串") @@ -31,13 +31,13 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] - [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[String](../../tag/string/README.md)] + [[Sliding Window](../../tag/sliding-window/README.md)] ### Similar Questions - 1. [Longest Substring Without Repeating Characters](https://github.com/openset/leetcode/tree/master/problems/longest-substring-without-repeating-characters) (Medium) - 1. [Longest Substring with At Most Two Distinct Characters](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-two-distinct-characters) (Medium) - 1. [Longest Repeating Character Replacement](https://github.com/openset/leetcode/tree/master/problems/longest-repeating-character-replacement) (Medium) - 1. [Subarrays with K Different Integers](https://github.com/openset/leetcode/tree/master/problems/subarrays-with-k-different-integers) (Hard) - 1. [Max Consecutive Ones III](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones-iii) (Medium) + 1. [Longest Substring Without Repeating Characters](../longest-substring-without-repeating-characters) (Medium) + 1. [Longest Substring with At Most Two Distinct Characters](../longest-substring-with-at-most-two-distinct-characters) (Medium) + 1. [Longest Repeating Character Replacement](../longest-repeating-character-replacement) (Medium) + 1. [Subarrays with K Different Integers](../subarrays-with-k-different-integers) (Hard) + 1. [Max Consecutive Ones III](../max-consecutive-ones-iii) (Medium) diff --git a/problems/longest-substring-with-at-most-two-distinct-characters/README.md b/problems/longest-substring-with-at-most-two-distinct-characters/README.md index 5968b8604..a8177ceef 100644 --- a/problems/longest-substring-with-at-most-two-distinct-characters/README.md +++ b/problems/longest-substring-with-at-most-two-distinct-characters/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/read-n-characters-given-read4-ii-call-multiple-times "Read N Characters Given Read4 II - Call multiple times") +[< Previous](../read-n-characters-given-read4-ii-call-multiple-times "Read N Characters Given Read4 II - Call multiple times") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-linked-lists "Intersection of Two Linked Lists") +[Next >](../intersection-of-two-linked-lists "Intersection of Two Linked Lists") ## [159. Longest Substring with At Most Two Distinct Characters (Medium)](https://leetcode.com/problems/longest-substring-with-at-most-two-distinct-characters "至多包含两个不同字符的最长子串") @@ -28,13 +28,13 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] - [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] + [[String](../../tag/string/README.md)] + [[Sliding Window](../../tag/sliding-window/README.md)] ### Similar Questions - 1. [Longest Substring Without Repeating Characters](https://github.com/openset/leetcode/tree/master/problems/longest-substring-without-repeating-characters) (Medium) - 1. [Sliding Window Maximum](https://github.com/openset/leetcode/tree/master/problems/sliding-window-maximum) (Hard) - 1. [Longest Substring with At Most K Distinct Characters](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-k-distinct-characters) (Hard) - 1. [Subarrays with K Different Integers](https://github.com/openset/leetcode/tree/master/problems/subarrays-with-k-different-integers) (Hard) + 1. [Longest Substring Without Repeating Characters](../longest-substring-without-repeating-characters) (Medium) + 1. [Sliding Window Maximum](../sliding-window-maximum) (Hard) + 1. [Longest Substring with At Most K Distinct Characters](../longest-substring-with-at-most-k-distinct-characters) (Hard) + 1. [Subarrays with K Different Integers](../subarrays-with-k-different-integers) (Hard) diff --git a/problems/longest-substring-without-repeating-characters/README.md b/problems/longest-substring-without-repeating-characters/README.md index 000b16105..584c5f845 100644 --- a/problems/longest-substring-without-repeating-characters/README.md +++ b/problems/longest-substring-without-repeating-characters/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/add-two-numbers "Add Two Numbers") +[< Previous](../add-two-numbers "Add Two Numbers") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/median-of-two-sorted-arrays "Median of Two Sorted Arrays") +[Next >](../median-of-two-sorted-arrays "Median of Two Sorted Arrays") ## [3. Longest Substring Without Repeating Characters (Medium)](https://leetcode.com/problems/longest-substring-without-repeating-characters "无重复字符的最长子串") @@ -45,12 +45,12 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] - [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] + [[String](../../tag/string/README.md)] + [[Sliding Window](../../tag/sliding-window/README.md)] ### Similar Questions - 1. [Longest Substring with At Most Two Distinct Characters](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-two-distinct-characters) (Medium) - 1. [Longest Substring with At Most K Distinct Characters](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-k-distinct-characters) (Hard) - 1. [Subarrays with K Different Integers](https://github.com/openset/leetcode/tree/master/problems/subarrays-with-k-different-integers) (Hard) + 1. [Longest Substring with At Most Two Distinct Characters](../longest-substring-with-at-most-two-distinct-characters) (Medium) + 1. [Longest Substring with At Most K Distinct Characters](../longest-substring-with-at-most-k-distinct-characters) (Hard) + 1. [Subarrays with K Different Integers](../subarrays-with-k-different-integers) (Hard) diff --git a/problems/longest-turbulent-subarray/README.md b/problems/longest-turbulent-subarray/README.md index 6999719c7..6883463ad 100644 --- a/problems/longest-turbulent-subarray/README.md +++ b/problems/longest-turbulent-subarray/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/squares-of-a-sorted-array "Squares of a Sorted Array") +[< Previous](../squares-of-a-sorted-array "Squares of a Sorted Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/distribute-coins-in-binary-tree "Distribute Coins in Binary Tree") +[Next >](../distribute-coins-in-binary-tree "Distribute Coins in Binary Tree") ## [978. Longest Turbulent Subarray (Medium)](https://leetcode.com/problems/longest-turbulent-subarray "最长湍流子数组") @@ -62,9 +62,9 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] - [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] + [[Array](../../tag/array/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] + [[Sliding Window](../../tag/sliding-window/README.md)] ### Similar Questions - 1. [Maximum Subarray](https://github.com/openset/leetcode/tree/master/problems/maximum-subarray) (Easy) + 1. [Maximum Subarray](../maximum-subarray) (Easy) diff --git a/problems/longest-uncommon-subsequence-i/README.md b/problems/longest-uncommon-subsequence-i/README.md index c251c18ec..c4b156e8d 100644 --- a/problems/longest-uncommon-subsequence-i/README.md +++ b/problems/longest-uncommon-subsequence-i/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/detect-capital "Detect Capital") +[< Previous](../detect-capital "Detect Capital") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/longest-uncommon-subsequence-ii "Longest Uncommon Subsequence II") +[Next >](../longest-uncommon-subsequence-ii "Longest Uncommon Subsequence II") ## [521. Longest Uncommon Subsequence I (Easy)](https://leetcode.com/problems/longest-uncommon-subsequence-i "最长特殊序列 Ⅰ") @@ -40,7 +40,7 @@ The input will be two strings, and the output needs to be the length of the long

### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Longest Uncommon Subsequence II](https://github.com/openset/leetcode/tree/master/problems/longest-uncommon-subsequence-ii) (Medium) + 1. [Longest Uncommon Subsequence II](../longest-uncommon-subsequence-ii) (Medium) diff --git a/problems/longest-uncommon-subsequence-ii/README.md b/problems/longest-uncommon-subsequence-ii/README.md index bf2f523dc..996887d76 100644 --- a/problems/longest-uncommon-subsequence-ii/README.md +++ b/problems/longest-uncommon-subsequence-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/longest-uncommon-subsequence-i "Longest Uncommon Subsequence I ") +[< Previous](../longest-uncommon-subsequence-i "Longest Uncommon Subsequence I ") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/continuous-subarray-sum "Continuous Subarray Sum") +[Next >](../continuous-subarray-sum "Continuous Subarray Sum") ## [522. Longest Uncommon Subsequence II (Medium)](https://leetcode.com/problems/longest-uncommon-subsequence-ii "最长特殊序列 II") @@ -38,7 +38,7 @@ The input will be a list of strings, and the output needs to be the length of th

### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Longest Uncommon Subsequence I ](https://github.com/openset/leetcode/tree/master/problems/longest-uncommon-subsequence-i) (Easy) + 1. [Longest Uncommon Subsequence I ](../longest-uncommon-subsequence-i) (Easy) diff --git a/problems/longest-univalue-path/README.md b/problems/longest-univalue-path/README.md index c9e3b9d73..9fb322073 100644 --- a/problems/longest-univalue-path/README.md +++ b/problems/longest-univalue-path/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/repeated-string-match "Repeated String Match") +[< Previous](../repeated-string-match "Repeated String Match") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/knight-probability-in-chessboard "Knight Probability in Chessboard") +[Next >](../knight-probability-in-chessboard "Knight Probability in Chessboard") ## [687. Longest Univalue Path (Easy)](https://leetcode.com/problems/longest-univalue-path "最长同值路径") @@ -52,10 +52,10 @@

Note: The given binary tree has not more than 10000 nodes. The height of the tree is not more than 1000.

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Recursion](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Recursion](../../tag/recursion/README.md)] ### Similar Questions - 1. [Binary Tree Maximum Path Sum](https://github.com/openset/leetcode/tree/master/problems/binary-tree-maximum-path-sum) (Hard) - 1. [Count Univalue Subtrees](https://github.com/openset/leetcode/tree/master/problems/count-univalue-subtrees) (Medium) - 1. [Path Sum III](https://github.com/openset/leetcode/tree/master/problems/path-sum-iii) (Easy) + 1. [Binary Tree Maximum Path Sum](../binary-tree-maximum-path-sum) (Hard) + 1. [Count Univalue Subtrees](../count-univalue-subtrees) (Medium) + 1. [Path Sum III](../path-sum-iii) (Easy) diff --git a/problems/longest-valid-parentheses/README.md b/problems/longest-valid-parentheses/README.md index ace14c050..f459e20a3 100644 --- a/problems/longest-valid-parentheses/README.md +++ b/problems/longest-valid-parentheses/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/next-permutation "Next Permutation") +[< Previous](../next-permutation "Next Permutation") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/search-in-rotated-sorted-array "Search in Rotated Sorted Array") +[Next >](../search-in-rotated-sorted-array "Search in Rotated Sorted Array") ## [32. Longest Valid Parentheses (Hard)](https://leetcode.com/problems/longest-valid-parentheses "最长有效括号") @@ -30,8 +30,8 @@ ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[String](../../tag/string/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Valid Parentheses](https://github.com/openset/leetcode/tree/master/problems/valid-parentheses) (Easy) + 1. [Valid Parentheses](../valid-parentheses) (Easy) diff --git a/problems/longest-well-performing-interval/README.md b/problems/longest-well-performing-interval/README.md index 7c8cc3af6..f146b8769 100644 --- a/problems/longest-well-performing-interval/README.md +++ b/problems/longest-well-performing-interval/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/lowest-common-ancestor-of-deepest-leaves "Lowest Common Ancestor of Deepest Leaves") +[< Previous](../lowest-common-ancestor-of-deepest-leaves "Lowest Common Ancestor of Deepest Leaves") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/smallest-sufficient-team "Smallest Sufficient Team") +[Next >](../smallest-sufficient-team "Smallest Sufficient Team") ## [1124. Longest Well-Performing Interval (Medium)](https://leetcode.com/problems/longest-well-performing-interval "表现良好的最长时间段") @@ -37,7 +37,7 @@ ### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] + [[Stack](../../tag/stack/README.md)] ### Hints
diff --git a/problems/longest-word-in-dictionary-through-deleting/README.md b/problems/longest-word-in-dictionary-through-deleting/README.md index 7cbef0140..6b9cecf28 100644 --- a/problems/longest-word-in-dictionary-through-deleting/README.md +++ b/problems/longest-word-in-dictionary-through-deleting/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/continuous-subarray-sum "Continuous Subarray Sum") +[< Previous](../continuous-subarray-sum "Continuous Subarray Sum") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/contiguous-array "Contiguous Array") +[Next >](../contiguous-array "Contiguous Array") ## [524. Longest Word in Dictionary through Deleting (Medium)](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting "通过删除字母匹配到字典里最长单词") @@ -44,8 +44,8 @@ s = "abpcplea", d = ["a","b","c"]

### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Sort](../../tag/sort/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] ### Similar Questions - 1. [Longest Word in Dictionary](https://github.com/openset/leetcode/tree/master/problems/longest-word-in-dictionary) (Easy) + 1. [Longest Word in Dictionary](../longest-word-in-dictionary) (Easy) diff --git a/problems/longest-word-in-dictionary/README.md b/problems/longest-word-in-dictionary/README.md index de362edb5..13945cc3d 100644 --- a/problems/longest-word-in-dictionary/README.md +++ b/problems/longest-word-in-dictionary/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-k-th-smallest-pair-distance "Find K-th Smallest Pair Distance") +[< Previous](../find-k-th-smallest-pair-distance "Find K-th Smallest Pair Distance") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/accounts-merge "Accounts Merge") +[Next >](../accounts-merge "Accounts Merge") ## [720. Longest Word in Dictionary (Easy)](https://leetcode.com/problems/longest-word-in-dictionary "词典中最长的单词") @@ -40,12 +40,12 @@ Both "apply" and "apple" can be built from other words in the dictionary. Howeve

### Related Topics - [[Trie](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Trie](../../tag/trie/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Longest Word in Dictionary through Deleting](https://github.com/openset/leetcode/tree/master/problems/longest-word-in-dictionary-through-deleting) (Medium) - 1. [Implement Magic Dictionary](https://github.com/openset/leetcode/tree/master/problems/implement-magic-dictionary) (Medium) + 1. [Longest Word in Dictionary through Deleting](../longest-word-in-dictionary-through-deleting) (Medium) + 1. [Implement Magic Dictionary](../implement-magic-dictionary) (Medium) ### Hints
diff --git a/problems/loud-and-rich/README.md b/problems/loud-and-rich/README.md index 45015c10c..f10fc3568 100644 --- a/problems/loud-and-rich/README.md +++ b/problems/loud-and-rich/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/rectangle-area-ii "Rectangle Area II") +[< Previous](../rectangle-area-ii "Rectangle Area II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/peak-index-in-a-mountain-array "Peak Index in a Mountain Array") +[Next >](../peak-index-in-a-mountain-array "Peak Index in a Mountain Array") ## [851. Loud and Rich (Medium)](https://leetcode.com/problems/loud-and-rich "喧闹和富有") @@ -57,4 +57,4 @@ The other answers can be filled out with similar reasoning. ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] diff --git a/problems/lowest-common-ancestor-of-a-binary-search-tree/README.md b/problems/lowest-common-ancestor-of-a-binary-search-tree/README.md index 49e65f3cb..643c0884f 100644 --- a/problems/lowest-common-ancestor-of-a-binary-search-tree/README.md +++ b/problems/lowest-common-ancestor-of-a-binary-search-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/palindrome-linked-list "Palindrome Linked List") +[< Previous](../palindrome-linked-list "Palindrome Linked List") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/lowest-common-ancestor-of-a-binary-tree "Lowest Common Ancestor of a Binary Tree") +[Next >](../lowest-common-ancestor-of-a-binary-tree "Lowest Common Ancestor of a Binary Tree") ## [235. Lowest Common Ancestor of a Binary Search Tree (Easy)](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-search-tree "二叉搜索树的最近公共祖先") @@ -45,8 +45,8 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] ### Similar Questions - 1. [Lowest Common Ancestor of a Binary Tree](https://github.com/openset/leetcode/tree/master/problems/lowest-common-ancestor-of-a-binary-tree) (Medium) - 1. [Smallest Common Region](https://github.com/openset/leetcode/tree/master/problems/smallest-common-region) (Medium) + 1. [Lowest Common Ancestor of a Binary Tree](../lowest-common-ancestor-of-a-binary-tree) (Medium) + 1. [Smallest Common Region](../smallest-common-region) (Medium) diff --git a/problems/lowest-common-ancestor-of-a-binary-tree/README.md b/problems/lowest-common-ancestor-of-a-binary-tree/README.md index b7aea1b81..4224236f9 100644 --- a/problems/lowest-common-ancestor-of-a-binary-tree/README.md +++ b/problems/lowest-common-ancestor-of-a-binary-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/lowest-common-ancestor-of-a-binary-search-tree "Lowest Common Ancestor of a Binary Search Tree") +[< Previous](../lowest-common-ancestor-of-a-binary-search-tree "Lowest Common Ancestor of a Binary Search Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/delete-node-in-a-linked-list "Delete Node in a Linked List") +[Next >](../delete-node-in-a-linked-list "Delete Node in a Linked List") ## [236. Lowest Common Ancestor of a Binary Tree (Medium)](https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree "二叉树的最近公共祖先") @@ -45,8 +45,8 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] ### Similar Questions - 1. [Lowest Common Ancestor of a Binary Search Tree](https://github.com/openset/leetcode/tree/master/problems/lowest-common-ancestor-of-a-binary-search-tree) (Easy) - 1. [Smallest Common Region](https://github.com/openset/leetcode/tree/master/problems/smallest-common-region) (Medium) + 1. [Lowest Common Ancestor of a Binary Search Tree](../lowest-common-ancestor-of-a-binary-search-tree) (Easy) + 1. [Smallest Common Region](../smallest-common-region) (Medium) diff --git a/problems/lowest-common-ancestor-of-deepest-leaves/README.md b/problems/lowest-common-ancestor-of-deepest-leaves/README.md index 1b1771fc5..134767ebe 100644 --- a/problems/lowest-common-ancestor-of-deepest-leaves/README.md +++ b/problems/lowest-common-ancestor-of-deepest-leaves/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/relative-sort-array "Relative Sort Array") +[< Previous](../relative-sort-array "Relative Sort Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/longest-well-performing-interval "Longest Well-Performing Interval") +[Next >](../longest-well-performing-interval "Longest Well-Performing Interval") ## [1123. Lowest Common Ancestor of Deepest Leaves (Medium)](https://leetcode.com/problems/lowest-common-ancestor-of-deepest-leaves "最深叶节点的最近公共祖先") @@ -56,8 +56,8 @@ The answer returned is a TreeNode object (not an array) with serialization " ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] ### Hints
diff --git a/problems/lru-cache/README.md b/problems/lru-cache/README.md index d07901901..9fc8ceb01 100644 --- a/problems/lru-cache/README.md +++ b/problems/lru-cache/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/binary-tree-postorder-traversal "Binary Tree Postorder Traversal") +[< Previous](../binary-tree-postorder-traversal "Binary Tree Postorder Traversal") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/insertion-sort-list "Insertion Sort List") +[Next >](../insertion-sort-list "Insertion Sort List") ## [146. LRU Cache (Medium)](https://leetcode.com/problems/lru-cache "LRU缓存机制") @@ -40,9 +40,9 @@ cache.get(4); // returns 4

 

### Related Topics - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] + [[Design](../../tag/design/README.md)] ### Similar Questions - 1. [LFU Cache](https://github.com/openset/leetcode/tree/master/problems/lfu-cache) (Hard) - 1. [Design In-Memory File System](https://github.com/openset/leetcode/tree/master/problems/design-in-memory-file-system) (Hard) - 1. [Design Compressed String Iterator](https://github.com/openset/leetcode/tree/master/problems/design-compressed-string-iterator) (Easy) + 1. [LFU Cache](../lfu-cache) (Hard) + 1. [Design In-Memory File System](../design-in-memory-file-system) (Hard) + 1. [Design Compressed String Iterator](../design-compressed-string-iterator) (Easy) diff --git a/problems/magic-squares-in-grid/README.md b/problems/magic-squares-in-grid/README.md index 97b317ee3..d7b2a0865 100644 --- a/problems/magic-squares-in-grid/README.md +++ b/problems/magic-squares-in-grid/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/similar-string-groups "Similar String Groups") +[< Previous](../similar-string-groups "Similar String Groups") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/keys-and-rooms "Keys and Rooms") +[Next >](../keys-and-rooms "Keys and Rooms") ## [840. Magic Squares In Grid (Easy)](https://leetcode.com/problems/magic-squares-in-grid "矩阵中的幻方") @@ -47,4 +47,4 @@ In total, there is only one magic square inside the given grid. ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] diff --git a/problems/magical-string/README.md b/problems/magical-string/README.md index 1cbf12567..5a1f060af 100644 --- a/problems/magical-string/README.md +++ b/problems/magical-string/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/sliding-window-median "Sliding Window Median") +[< Previous](../sliding-window-median "Sliding Window Median") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/license-key-formatting "License Key Formatting") +[Next >](../license-key-formatting "License Key Formatting") ## [481. Magical String (Medium)](https://leetcode.com/problems/magical-string "神奇字符串") diff --git a/problems/majority-element-ii/README.md b/problems/majority-element-ii/README.md index 9a8c4e349..ba9295772 100644 --- a/problems/majority-element-ii/README.md +++ b/problems/majority-element-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/summary-ranges "Summary Ranges") +[< Previous](../summary-ranges "Summary Ranges") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-element-in-a-bst "Kth Smallest Element in a BST") +[Next >](../kth-smallest-element-in-a-bst "Kth Smallest Element in a BST") ## [229. Majority Element II (Medium)](https://leetcode.com/problems/majority-element-ii "求众数 II") @@ -28,11 +28,11 @@ Output: [1,2] ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Majority Element](https://github.com/openset/leetcode/tree/master/problems/majority-element) (Easy) - 1. [Check If a Number Is Majority Element in a Sorted Array](https://github.com/openset/leetcode/tree/master/problems/check-if-a-number-is-majority-element-in-a-sorted-array) (Easy) + 1. [Majority Element](../majority-element) (Easy) + 1. [Check If a Number Is Majority Element in a Sorted Array](../check-if-a-number-is-majority-element-in-a-sorted-array) (Easy) ### Hints
diff --git a/problems/majority-element/README.md b/problems/majority-element/README.md index 0c3be1c1f..146a0f308 100644 --- a/problems/majority-element/README.md +++ b/problems/majority-element/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/excel-sheet-column-title "Excel Sheet Column Title") +[< Previous](../excel-sheet-column-title "Excel Sheet Column Title") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/two-sum-iii-data-structure-design "Two Sum III - Data structure design") +[Next >](../two-sum-iii-data-structure-design "Two Sum III - Data structure design") ## [169. Majority Element (Easy)](https://leetcode.com/problems/majority-element "多数元素") @@ -29,10 +29,10 @@ ### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Divide and Conquer](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] + [[Array](../../tag/array/README.md)] + [[Divide and Conquer](../../tag/divide-and-conquer/README.md)] ### Similar Questions - 1. [Majority Element II](https://github.com/openset/leetcode/tree/master/problems/majority-element-ii) (Medium) - 1. [Check If a Number Is Majority Element in a Sorted Array](https://github.com/openset/leetcode/tree/master/problems/check-if-a-number-is-majority-element-in-a-sorted-array) (Easy) + 1. [Majority Element II](../majority-element-ii) (Medium) + 1. [Check If a Number Is Majority Element in a Sorted Array](../check-if-a-number-is-majority-element-in-a-sorted-array) (Easy) diff --git a/problems/make-array-strictly-increasing/README.md b/problems/make-array-strictly-increasing/README.md index 0bc4f461b..b8462c7ad 100644 --- a/problems/make-array-strictly-increasing/README.md +++ b/problems/make-array-strictly-increasing/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-subarray-sum-with-one-deletion "Maximum Subarray Sum with One Deletion") +[< Previous](../maximum-subarray-sum-with-one-deletion "Maximum Subarray Sum with One Deletion") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/design-bounded-blocking-queue "Design Bounded Blocking Queue") +[Next >](../design-bounded-blocking-queue "Design Bounded Blocking Queue") ## [1187. Make Array Strictly Increasing (Hard)](https://leetcode.com/problems/make-array-strictly-increasing "使数组严格递增") @@ -52,7 +52,7 @@

 

### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/making-a-large-island/README.md b/problems/making-a-large-island/README.md index e06c2dd47..539b82767 100644 --- a/problems/making-a-large-island/README.md +++ b/problems/making-a-large-island/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/most-profit-assigning-work "Most Profit Assigning Work") +[< Previous](../most-profit-assigning-work "Most Profit Assigning Work") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/unique-letter-string "Unique Letter String") +[Next >](../unique-letter-string "Unique Letter String") ## [827. Making A Large Island (Hard)](https://leetcode.com/problems/making-a-large-island "最大人工岛") @@ -49,4 +49,4 @@

 

### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] diff --git a/problems/managers-with-at-least-5-direct-reports/README.md b/problems/managers-with-at-least-5-direct-reports/README.md index ea05e7977..f386177bb 100644 --- a/problems/managers-with-at-least-5-direct-reports/README.md +++ b/problems/managers-with-at-least-5-direct-reports/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/median-employee-salary "Median Employee Salary") +[< Previous](../median-employee-salary "Median Employee Salary") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-median-given-frequency-of-numbers "Find Median Given Frequency of Numbers") +[Next >](../find-median-given-frequency-of-numbers "Find Median Given Frequency of Numbers") ## [570. Managers with at Least 5 Direct Reports (Medium)](https://leetcode.com/problems/managers-with-at-least-5-direct-reports "至少有5名直接下属的经理") diff --git a/problems/map-sum-pairs/README.md b/problems/map-sum-pairs/README.md index 1e7f3763c..77155594d 100644 --- a/problems/map-sum-pairs/README.md +++ b/problems/map-sum-pairs/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/implement-magic-dictionary "Implement Magic Dictionary") +[< Previous](../implement-magic-dictionary "Implement Magic Dictionary") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/valid-parenthesis-string "Valid Parenthesis String") +[Next >](../valid-parenthesis-string "Valid Parenthesis String") ## [677. Map Sum Pairs (Medium)](https://leetcode.com/problems/map-sum-pairs "键值映射") @@ -33,4 +33,4 @@ Input: sum("ap"), Output: 5

### Related Topics - [[Trie](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] + [[Trie](../../tag/trie/README.md)] diff --git a/problems/market-analysis-i/README.md b/problems/market-analysis-i/README.md index a1a3c914a..076ba31a2 100644 --- a/problems/market-analysis-i/README.md +++ b/problems/market-analysis-i/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/online-majority-element-in-subarray "Online Majority Element In Subarray") +[< Previous](../online-majority-element-in-subarray "Online Majority Element In Subarray") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/market-analysis-ii "Market Analysis II") +[Next >](../market-analysis-ii "Market Analysis II") ## [1158. Market Analysis I (Medium)](https://leetcode.com/problems/market-analysis-i "") diff --git a/problems/market-analysis-ii/README.md b/problems/market-analysis-ii/README.md index 80d67976c..6638e8aa6 100644 --- a/problems/market-analysis-ii/README.md +++ b/problems/market-analysis-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/market-analysis-i "Market Analysis I") +[< Previous](../market-analysis-i "Market Analysis I") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-words-that-can-be-formed-by-characters "Find Words That Can Be Formed by Characters") +[Next >](../find-words-that-can-be-formed-by-characters "Find Words That Can Be Formed by Characters") ## [1159. Market Analysis II (Hard)](https://leetcode.com/problems/market-analysis-ii "") diff --git a/problems/masking-personal-information/README.md b/problems/masking-personal-information/README.md index f65e421de..0e1e348f6 100644 --- a/problems/masking-personal-information/README.md +++ b/problems/masking-personal-information/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/positions-of-large-groups "Positions of Large Groups") +[< Previous](../positions-of-large-groups "Positions of Large Groups") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/flipping-an-image "Flipping an Image") +[Next >](../flipping-an-image "Flipping an Image") ## [831. Masking Personal Information (Medium)](https://leetcode.com/problems/masking-personal-information "隐藏个人信息") @@ -89,4 +89,4 @@ ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/matchsticks-to-square/README.md b/problems/matchsticks-to-square/README.md index dd98cf31e..237257bd4 100644 --- a/problems/matchsticks-to-square/README.md +++ b/problems/matchsticks-to-square/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/concatenated-words "Concatenated Words") +[< Previous](../concatenated-words "Concatenated Words") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/ones-and-zeroes "Ones and Zeroes") +[Next >](../ones-and-zeroes "Ones and Zeroes") ## [473. Matchsticks to Square (Medium)](https://leetcode.com/problems/matchsticks-to-square "火柴拼正方形") @@ -41,7 +41,7 @@

### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] ### Hints
diff --git a/problems/matrix-cells-in-distance-order/README.md b/problems/matrix-cells-in-distance-order/README.md index 183665526..03b0443b0 100644 --- a/problems/matrix-cells-in-distance-order/README.md +++ b/problems/matrix-cells-in-distance-order/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/two-city-scheduling "Two City Scheduling") +[< Previous](../two-city-scheduling "Two City Scheduling") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-sum-of-two-non-overlapping-subarrays "Maximum Sum of Two Non-Overlapping Subarrays") +[Next >](../maximum-sum-of-two-non-overlapping-subarrays "Maximum Sum of Two Non-Overlapping Subarrays") ## [1030. Matrix Cells in Distance Order (Easy)](https://leetcode.com/problems/matrix-cells-in-distance-order "距离顺序排列矩阵单元格") @@ -63,4 +63,4 @@ There are other answers that would also be accepted as correct, such as [[1,2],[ ### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] + [[Sort](../../tag/sort/README.md)] diff --git a/problems/max-area-of-island/README.md b/problems/max-area-of-island/README.md index 4cc679aaa..da1c96128 100644 --- a/problems/max-area-of-island/README.md +++ b/problems/max-area-of-island/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/number-of-distinct-islands "Number of Distinct Islands") +[< Previous](../number-of-distinct-islands "Number of Distinct Islands") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/count-binary-substrings "Count Binary Substrings") +[Next >](../count-binary-substrings "Count Binary Substrings") ## [695. Max Area of Island (Medium)](https://leetcode.com/problems/max-area-of-island "岛屿的最大面积") @@ -38,9 +38,9 @@ Given the above grid, return 0.

Note: The length of each dimension in the given grid does not exceed 50.

### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Number of Islands](https://github.com/openset/leetcode/tree/master/problems/number-of-islands) (Medium) - 1. [Island Perimeter](https://github.com/openset/leetcode/tree/master/problems/island-perimeter) (Easy) + 1. [Number of Islands](../number-of-islands) (Medium) + 1. [Island Perimeter](../island-perimeter) (Easy) diff --git a/problems/max-chunks-to-make-sorted-ii/README.md b/problems/max-chunks-to-make-sorted-ii/README.md index 30c310ece..001a70daa 100644 --- a/problems/max-chunks-to-make-sorted-ii/README.md +++ b/problems/max-chunks-to-make-sorted-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/reorganize-string "Reorganize String") +[< Previous](../reorganize-string "Reorganize String") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/max-chunks-to-make-sorted "Max Chunks To Make Sorted") +[Next >](../max-chunks-to-make-sorted "Max Chunks To Make Sorted") ## [768. Max Chunks To Make Sorted II (Hard)](https://leetcode.com/problems/max-chunks-to-make-sorted-ii "最多能完成排序的块 II") @@ -49,10 +49,10 @@ However, splitting into [2, 1], [3], [4], [4] is the highest number of chunks po

 

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Max Chunks To Make Sorted](https://github.com/openset/leetcode/tree/master/problems/max-chunks-to-make-sorted) (Medium) + 1. [Max Chunks To Make Sorted](../max-chunks-to-make-sorted) (Medium) ### Hints
diff --git a/problems/max-chunks-to-make-sorted/README.md b/problems/max-chunks-to-make-sorted/README.md index cd0d3cdb5..646b94548 100644 --- a/problems/max-chunks-to-make-sorted/README.md +++ b/problems/max-chunks-to-make-sorted/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/max-chunks-to-make-sorted-ii "Max Chunks To Make Sorted II") +[< Previous](../max-chunks-to-make-sorted-ii "Max Chunks To Make Sorted II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-iv "Basic Calculator IV") +[Next >](../basic-calculator-iv "Basic Calculator IV") ## [769. Max Chunks To Make Sorted (Medium)](https://leetcode.com/problems/max-chunks-to-make-sorted "最多能完成排序的块") @@ -45,10 +45,10 @@ However, splitting into [1, 0], [2], [3], [4] is the highest number of chunks po

 

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Max Chunks To Make Sorted II](https://github.com/openset/leetcode/tree/master/problems/max-chunks-to-make-sorted-ii) (Hard) + 1. [Max Chunks To Make Sorted II](../max-chunks-to-make-sorted-ii) (Hard) ### Hints
diff --git a/problems/max-consecutive-ones-ii/README.md b/problems/max-consecutive-ones-ii/README.md index d15435164..33099eacf 100644 --- a/problems/max-consecutive-ones-ii/README.md +++ b/problems/max-consecutive-ones-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/predict-the-winner "Predict the Winner") +[< Previous](../predict-the-winner "Predict the Winner") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/zuma-game "Zuma Game") +[Next >](../zuma-game "Zuma Game") ## [487. Max Consecutive Ones II (Medium)](https://leetcode.com/problems/max-consecutive-ones-ii "最大连续1的个数 II") @@ -36,8 +36,8 @@ What if the input numbers come in one by one as an infinite stream? In ot

### Related Topics - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] ### Similar Questions - 1. [Max Consecutive Ones](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones) (Easy) - 1. [Max Consecutive Ones III](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones-iii) (Medium) + 1. [Max Consecutive Ones](../max-consecutive-ones) (Easy) + 1. [Max Consecutive Ones III](../max-consecutive-ones-iii) (Medium) diff --git a/problems/max-consecutive-ones-iii/README.md b/problems/max-consecutive-ones-iii/README.md index d4661becf..508de2dfd 100644 --- a/problems/max-consecutive-ones-iii/README.md +++ b/problems/max-consecutive-ones-iii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/check-if-word-is-valid-after-substitutions "Check If Word Is Valid After Substitutions") +[< Previous](../check-if-word-is-valid-after-substitutions "Check If Word Is Valid After Substitutions") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximize-sum-of-array-after-k-negations "Maximize Sum Of Array After K Negations") +[Next >](../maximize-sum-of-array-after-k-negations "Maximize Sum Of Array After K Negations") ## [1004. Max Consecutive Ones III (Medium)](https://leetcode.com/problems/max-consecutive-ones-iii "最大连续1的个数 III") @@ -51,14 +51,14 @@ Bolded numbers were flipped from 0 to 1. The longest subarray is underlined. ### Related Topics - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] - [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] + [[Sliding Window](../../tag/sliding-window/README.md)] ### Similar Questions - 1. [Longest Substring with At Most K Distinct Characters](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-k-distinct-characters) (Hard) - 1. [Longest Repeating Character Replacement](https://github.com/openset/leetcode/tree/master/problems/longest-repeating-character-replacement) (Medium) - 1. [Max Consecutive Ones](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones) (Easy) - 1. [Max Consecutive Ones II](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones-ii) (Medium) + 1. [Longest Substring with At Most K Distinct Characters](../longest-substring-with-at-most-k-distinct-characters) (Hard) + 1. [Longest Repeating Character Replacement](../longest-repeating-character-replacement) (Medium) + 1. [Max Consecutive Ones](../max-consecutive-ones) (Easy) + 1. [Max Consecutive Ones II](../max-consecutive-ones-ii) (Medium) ### Hints
diff --git a/problems/max-consecutive-ones/README.md b/problems/max-consecutive-ones/README.md index 4079de2d3..3b77bb078 100644 --- a/problems/max-consecutive-ones/README.md +++ b/problems/max-consecutive-ones/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-permutation "Find Permutation") +[< Previous](../find-permutation "Find Permutation") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/predict-the-winner "Predict the Winner") +[Next >](../predict-the-winner "Predict the Winner") ## [485. Max Consecutive Ones (Easy)](https://leetcode.com/problems/max-consecutive-ones "最大连续1的个数") @@ -30,11 +30,11 @@

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Max Consecutive Ones II](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones-ii) (Medium) - 1. [Max Consecutive Ones III](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones-iii) (Medium) + 1. [Max Consecutive Ones II](../max-consecutive-ones-ii) (Medium) + 1. [Max Consecutive Ones III](../max-consecutive-ones-iii) (Medium) ### Hints
diff --git a/problems/max-increase-to-keep-city-skyline/README.md b/problems/max-increase-to-keep-city-skyline/README.md index db38fa6f5..74a6a85e5 100644 --- a/problems/max-increase-to-keep-city-skyline/README.md +++ b/problems/max-increase-to-keep-city-skyline/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/number-of-lines-to-write-string "Number of Lines To Write String") +[< Previous](../number-of-lines-to-write-string "Number of Lines To Write String") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/soup-servings "Soup Servings") +[Next >](../soup-servings "Soup Servings") ## [807. Max Increase to Keep City Skyline (Medium)](https://leetcode.com/problems/max-increase-to-keep-city-skyline "保持城市天际线") diff --git a/problems/max-points-on-a-line/README.md b/problems/max-points-on-a-line/README.md index cb95fb3e8..316d5ef75 100644 --- a/problems/max-points-on-a-line/README.md +++ b/problems/max-points-on-a-line/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/sort-list "Sort List") +[< Previous](../sort-list "Sort List") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/evaluate-reverse-polish-notation "Evaluate Reverse Polish Notation") +[Next >](../evaluate-reverse-polish-notation "Evaluate Reverse Polish Notation") ## [149. Max Points on a Line (Hard)](https://leetcode.com/problems/max-points-on-a-line "直线上最多的点数") @@ -47,8 +47,8 @@

NOTE: input types have been changed on April 15, 2019. Please reset to default code definition to get new method signature.

### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Line Reflection](https://github.com/openset/leetcode/tree/master/problems/line-reflection) (Medium) + 1. [Line Reflection](../line-reflection) (Medium) diff --git a/problems/max-stack/README.md b/problems/max-stack/README.md index 4f0e34aee..1f23c43b2 100644 --- a/problems/max-stack/README.md +++ b/problems/max-stack/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/range-module "Range Module") +[< Previous](../range-module "Range Module") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/1-bit-and-2-bit-characters "1-bit and 2-bit Characters") +[Next >](../1-bit-and-2-bit-characters "1-bit and 2-bit Characters") ## [716. Max Stack (Easy)](https://leetcode.com/problems/max-stack "最大栈") @@ -47,7 +47,7 @@ stack.top(); -> 5

### Related Topics - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] + [[Design](../../tag/design/README.md)] ### Similar Questions - 1. [Min Stack](https://github.com/openset/leetcode/tree/master/problems/min-stack) (Easy) + 1. [Min Stack](../min-stack) (Easy) diff --git a/problems/max-sum-of-rectangle-no-larger-than-k/README.md b/problems/max-sum-of-rectangle-no-larger-than-k/README.md index fbbe76882..532527854 100644 --- a/problems/max-sum-of-rectangle-no-larger-than-k/README.md +++ b/problems/max-sum-of-rectangle-no-larger-than-k/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/design-hit-counter "Design Hit Counter") +[< Previous](../design-hit-counter "Design Hit Counter") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/nested-list-weight-sum-ii "Nested List Weight Sum II") +[Next >](../nested-list-weight-sum-ii "Nested List Weight Sum II") ## [363. Max Sum of Rectangle No Larger Than K (Hard)](https://leetcode.com/problems/max-sum-of-rectangle-no-larger-than-k "矩形区域不超过 K 的最大数值和") @@ -29,6 +29,6 @@ ### Related Topics - [[Queue](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Queue](../../tag/queue/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/maximal-rectangle/README.md b/problems/maximal-rectangle/README.md index c727578e5..74cafe69a 100644 --- a/problems/maximal-rectangle/README.md +++ b/problems/maximal-rectangle/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/largest-rectangle-in-histogram "Largest Rectangle in Histogram") +[< Previous](../largest-rectangle-in-histogram "Largest Rectangle in Histogram") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/partition-list "Partition List") +[Next >](../partition-list "Partition List") ## [85. Maximal Rectangle (Hard)](https://leetcode.com/problems/maximal-rectangle "最大矩形") @@ -27,11 +27,11 @@ ### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Stack](../../tag/stack/README.md)] + [[Array](../../tag/array/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Largest Rectangle in Histogram](https://github.com/openset/leetcode/tree/master/problems/largest-rectangle-in-histogram) (Hard) - 1. [Maximal Square](https://github.com/openset/leetcode/tree/master/problems/maximal-square) (Medium) + 1. [Largest Rectangle in Histogram](../largest-rectangle-in-histogram) (Hard) + 1. [Maximal Square](../maximal-square) (Medium) diff --git a/problems/maximal-square/README.md b/problems/maximal-square/README.md index 9266e0698..07e1c6484 100644 --- a/problems/maximal-square/README.md +++ b/problems/maximal-square/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate-iii "Contains Duplicate III") +[< Previous](../contains-duplicate-iii "Contains Duplicate III") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/count-complete-tree-nodes "Count Complete Tree Nodes") +[Next >](../count-complete-tree-nodes "Count Complete Tree Nodes") ## [221. Maximal Square (Medium)](https://leetcode.com/problems/maximal-square "最大正方形") @@ -27,8 +27,8 @@ ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Maximal Rectangle](https://github.com/openset/leetcode/tree/master/problems/maximal-rectangle) (Hard) - 1. [Largest Plus Sign](https://github.com/openset/leetcode/tree/master/problems/largest-plus-sign) (Medium) + 1. [Maximal Rectangle](../maximal-rectangle) (Hard) + 1. [Largest Plus Sign](../largest-plus-sign) (Medium) diff --git a/problems/maximize-distance-to-closest-person/README.md b/problems/maximize-distance-to-closest-person/README.md index 74cf86044..9f748c650 100644 --- a/problems/maximize-distance-to-closest-person/README.md +++ b/problems/maximize-distance-to-closest-person/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/shifting-letters "Shifting Letters") +[< Previous](../shifting-letters "Shifting Letters") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/rectangle-area-ii "Rectangle Area II") +[Next >](../rectangle-area-ii "Rectangle Area II") ## [849. Maximize Distance to Closest Person (Easy)](https://leetcode.com/problems/maximize-distance-to-closest-person "到最近的人的最大距离") @@ -51,7 +51,7 @@ This is the maximum distance possible, so the answer is 3. ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Exam Room](https://github.com/openset/leetcode/tree/master/problems/exam-room) (Medium) + 1. [Exam Room](../exam-room) (Medium) diff --git a/problems/maximize-sum-of-array-after-k-negations/README.md b/problems/maximize-sum-of-array-after-k-negations/README.md index af99ba214..59af8a1bf 100644 --- a/problems/maximize-sum-of-array-after-k-negations/README.md +++ b/problems/maximize-sum-of-array-after-k-negations/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones-iii "Max Consecutive Ones III") +[< Previous](../max-consecutive-ones-iii "Max Consecutive Ones III") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/clumsy-factorial "Clumsy Factorial") +[Next >](../clumsy-factorial "Clumsy Factorial") ## [1005. Maximize Sum Of Array After K Negations (Easy)](https://leetcode.com/problems/maximize-sum-of-array-after-k-negations "K 次取反后最大化的数组和") @@ -56,4 +56,4 @@ ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] + [[Greedy](../../tag/greedy/README.md)] diff --git a/problems/maximum-average-subarray-i/README.md b/problems/maximum-average-subarray-i/README.md index 81d9ac835..b44fcb666 100644 --- a/problems/maximum-average-subarray-i/README.md +++ b/problems/maximum-average-subarray-i/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/design-search-autocomplete-system "Design Search Autocomplete System") +[< Previous](../design-search-autocomplete-system "Design Search Autocomplete System") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-average-subarray-ii "Maximum Average Subarray II") +[Next >](../maximum-average-subarray-ii "Maximum Average Subarray II") ## [643. Maximum Average Subarray I (Easy)](https://leetcode.com/problems/maximum-average-subarray-i "子数组最大平均数 I") @@ -33,7 +33,7 @@

 

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Maximum Average Subarray II](https://github.com/openset/leetcode/tree/master/problems/maximum-average-subarray-ii) (Hard) + 1. [Maximum Average Subarray II](../maximum-average-subarray-ii) (Hard) diff --git a/problems/maximum-average-subarray-ii/README.md b/problems/maximum-average-subarray-ii/README.md index 305e7f7c3..d6203b0d6 100644 --- a/problems/maximum-average-subarray-ii/README.md +++ b/problems/maximum-average-subarray-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-average-subarray-i "Maximum Average Subarray I") +[< Previous](../maximum-average-subarray-i "Maximum Average Subarray I") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/set-mismatch "Set Mismatch") +[Next >](../set-mismatch "Set Mismatch") ## [644. Maximum Average Subarray II (Hard)](https://leetcode.com/problems/maximum-average-subarray-ii "最大平均子段和 II") @@ -37,8 +37,8 @@ Thus return 12.75.

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Array](../../tag/array/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [Maximum Average Subarray I](https://github.com/openset/leetcode/tree/master/problems/maximum-average-subarray-i) (Easy) + 1. [Maximum Average Subarray I](../maximum-average-subarray-i) (Easy) diff --git a/problems/maximum-average-subtree/README.md b/problems/maximum-average-subtree/README.md index 14ebff937..93cadd773 100644 --- a/problems/maximum-average-subtree/README.md +++ b/problems/maximum-average-subtree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/remove-vowels-from-a-string "Remove Vowels from a String") +[< Previous](../remove-vowels-from-a-string "Remove Vowels from a String") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/divide-array-into-increasing-sequences "Divide Array Into Increasing Sequences") +[Next >](../divide-array-into-increasing-sequences "Divide Array Into Increasing Sequences") ## [1120. Maximum Average Subtree (Medium)](https://leetcode.com/problems/maximum-average-subtree "子树的最大平均值") @@ -42,7 +42,7 @@ So the answer is 6 which is the maximum. ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] ### Hints
diff --git a/problems/maximum-binary-tree-ii/README.md b/problems/maximum-binary-tree-ii/README.md index 9e09f6341..cccc87c6a 100644 --- a/problems/maximum-binary-tree-ii/README.md +++ b/problems/maximum-binary-tree-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-the-town-judge "Find the Town Judge") +[< Previous](../find-the-town-judge "Find the Town Judge") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/available-captures-for-rook "Available Captures for Rook") +[Next >](../available-captures-for-rook "Available Captures for Rook") ## [998. Maximum Binary Tree II (Medium)](https://leetcode.com/problems/maximum-binary-tree-ii "最大二叉树 II") @@ -72,7 +72,7 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] ### Similar Questions - 1. [Maximum Binary Tree](https://github.com/openset/leetcode/tree/master/problems/maximum-binary-tree) (Medium) + 1. [Maximum Binary Tree](../maximum-binary-tree) (Medium) diff --git a/problems/maximum-binary-tree/README.md b/problems/maximum-binary-tree/README.md index 736e9759e..0c572f88c 100644 --- a/problems/maximum-binary-tree/README.md +++ b/problems/maximum-binary-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/two-sum-iv-input-is-a-bst "Two Sum IV - Input is a BST") +[< Previous](../two-sum-iv-input-is-a-bst "Two Sum IV - Input is a BST") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/print-binary-tree "Print Binary Tree") +[Next >](../print-binary-tree "Print Binary Tree") ## [654. Maximum Binary Tree (Medium)](https://leetcode.com/problems/maximum-binary-tree "最大二叉树") @@ -46,7 +46,7 @@ Construct the maximum tree by the given array and output the root node of this t

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] ### Similar Questions - 1. [Maximum Binary Tree II](https://github.com/openset/leetcode/tree/master/problems/maximum-binary-tree-ii) (Medium) + 1. [Maximum Binary Tree II](../maximum-binary-tree-ii) (Medium) diff --git a/problems/maximum-depth-of-binary-tree/README.md b/problems/maximum-depth-of-binary-tree/README.md index e16f6eb81..8b17749cf 100644 --- a/problems/maximum-depth-of-binary-tree/README.md +++ b/problems/maximum-depth-of-binary-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/binary-tree-zigzag-level-order-traversal "Binary Tree Zigzag Level Order Traversal") +[< Previous](../binary-tree-zigzag-level-order-traversal "Binary Tree Zigzag Level Order Traversal") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-preorder-and-inorder-traversal "Construct Binary Tree from Preorder and Inorder Traversal") +[Next >](../construct-binary-tree-from-preorder-and-inorder-traversal "Construct Binary Tree from Preorder and Inorder Traversal") ## [104. Maximum Depth of Binary Tree (Easy)](https://leetcode.com/problems/maximum-depth-of-binary-tree "二叉树的最大深度") @@ -31,10 +31,10 @@

return its depth = 3.

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] ### Similar Questions - 1. [Balanced Binary Tree](https://github.com/openset/leetcode/tree/master/problems/balanced-binary-tree) (Easy) - 1. [Minimum Depth of Binary Tree](https://github.com/openset/leetcode/tree/master/problems/minimum-depth-of-binary-tree) (Easy) - 1. [Maximum Depth of N-ary Tree](https://github.com/openset/leetcode/tree/master/problems/maximum-depth-of-n-ary-tree) (Easy) + 1. [Balanced Binary Tree](../balanced-binary-tree) (Easy) + 1. [Minimum Depth of Binary Tree](../minimum-depth-of-binary-tree) (Easy) + 1. [Maximum Depth of N-ary Tree](../maximum-depth-of-n-ary-tree) (Easy) diff --git a/problems/maximum-depth-of-n-ary-tree/README.md b/problems/maximum-depth-of-n-ary-tree/README.md index 2ee83378d..3f997bd6d 100644 --- a/problems/maximum-depth-of-n-ary-tree/README.md +++ b/problems/maximum-depth-of-n-ary-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/quad-tree-intersection "Quad Tree Intersection") +[< Previous](../quad-tree-intersection "Quad Tree Intersection") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/subarray-sum-equals-k "Subarray Sum Equals K") +[Next >](../subarray-sum-equals-k "Subarray Sum Equals K") ## [559. Maximum Depth of N-ary Tree (Easy)](https://leetcode.com/problems/maximum-depth-of-n-ary-tree "N叉树的最大深度") @@ -45,9 +45,9 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] ### Similar Questions - 1. [Maximum Depth of Binary Tree](https://github.com/openset/leetcode/tree/master/problems/maximum-depth-of-binary-tree) (Easy) + 1. [Maximum Depth of Binary Tree](../maximum-depth-of-binary-tree) (Easy) diff --git a/problems/maximum-difference-between-node-and-ancestor/README.md b/problems/maximum-difference-between-node-and-ancestor/README.md index 1ef8c0405..8b2246096 100644 --- a/problems/maximum-difference-between-node-and-ancestor/README.md +++ b/problems/maximum-difference-between-node-and-ancestor/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/divisor-game "Divisor Game") +[< Previous](../divisor-game "Divisor Game") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/longest-arithmetic-sequence "Longest Arithmetic Sequence") +[Next >](../longest-arithmetic-sequence "Longest Arithmetic Sequence") ## [1026. Maximum Difference Between Node and Ancestor (Medium)](https://leetcode.com/problems/maximum-difference-between-node-and-ancestor "节点与其祖先之间的最大差值") @@ -43,8 +43,8 @@ Among all possible differences, the maximum value of 7 is obtained by |8 - 1| = ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] ### Hints
diff --git a/problems/maximum-distance-in-arrays/README.md b/problems/maximum-distance-in-arrays/README.md index 5e3f5d8f4..04caa67f0 100644 --- a/problems/maximum-distance-in-arrays/README.md +++ b/problems/maximum-distance-in-arrays/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/add-one-row-to-tree "Add One Row to Tree") +[< Previous](../add-one-row-to-tree "Add One Row to Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-factorization "Minimum Factorization") +[Next >](../minimum-factorization "Minimum Factorization") ## [624. Maximum Distance in Arrays (Easy)](https://leetcode.com/problems/maximum-distance-in-arrays "数组列表中的最大距离") @@ -35,5 +35,5 @@ One way to reach the maximum distance 4 is to pick 1 in the first or third array

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Array](../../tag/array/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] diff --git a/problems/maximum-equal-frequency/README.md b/problems/maximum-equal-frequency/README.md index 00ac74daa..a8bbb691a 100644 --- a/problems/maximum-equal-frequency/README.md +++ b/problems/maximum-equal-frequency/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/dice-roll-simulation "Dice Roll Simulation") +[< Previous](../dice-roll-simulation "Dice Roll Simulation") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/report-contiguous-dates "Report Contiguous Dates") +[Next >](../report-contiguous-dates "Report Contiguous Dates") ## [1224. Maximum Equal Frequency (Hard)](https://leetcode.com/problems/maximum-equal-frequency "最大相等频率") @@ -54,7 +54,7 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Hints
diff --git a/problems/maximum-frequency-stack/README.md b/problems/maximum-frequency-stack/README.md index 26d80ee53..203c00854 100644 --- a/problems/maximum-frequency-stack/README.md +++ b/problems/maximum-frequency-stack/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/all-possible-full-binary-trees "All Possible Full Binary Trees") +[< Previous](../all-possible-full-binary-trees "All Possible Full Binary Trees") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/monotonic-array "Monotonic Array") +[Next >](../monotonic-array "Monotonic Array") ## [895. Maximum Frequency Stack (Hard)](https://leetcode.com/problems/maximum-frequency-stack "最大频率栈") @@ -66,5 +66,5 @@ The stack becomes [5,7]. ### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Stack](../../tag/stack/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] diff --git a/problems/maximum-gap/README.md b/problems/maximum-gap/README.md index 15109a7a3..bc4492580 100644 --- a/problems/maximum-gap/README.md +++ b/problems/maximum-gap/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/missing-ranges "Missing Ranges") +[< Previous](../missing-ranges "Missing Ranges") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/compare-version-numbers "Compare Version Numbers") +[Next >](../compare-version-numbers "Compare Version Numbers") ## [164. Maximum Gap (Hard)](https://leetcode.com/problems/maximum-gap "最大间距") @@ -38,4 +38,4 @@ ### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] + [[Sort](../../tag/sort/README.md)] diff --git a/problems/maximum-length-of-a-concatenated-string-with-unique-characters/README.md b/problems/maximum-length-of-a-concatenated-string-with-unique-characters/README.md index 309cc81be..95138ca76 100644 --- a/problems/maximum-length-of-a-concatenated-string-with-unique-characters/README.md +++ b/problems/maximum-length-of-a-concatenated-string-with-unique-characters/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/circular-permutation-in-binary-representation "Circular Permutation in Binary Representation") +[< Previous](../circular-permutation-in-binary-representation "Circular Permutation in Binary Representation") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/tiling-a-rectangle-with-the-fewest-squares "Tiling a Rectangle with the Fewest Squares") +[Next >](../tiling-a-rectangle-with-the-fewest-squares "Tiling a Rectangle with the Fewest Squares") ## [1239. Maximum Length of a Concatenated String with Unique Characters (Medium)](https://leetcode.com/problems/maximum-length-of-a-concatenated-string-with-unique-characters "串联字符串的最大长度") @@ -50,8 +50,8 @@ Maximum length is 4. ### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Hints
diff --git a/problems/maximum-length-of-pair-chain/README.md b/problems/maximum-length-of-pair-chain/README.md index 3666514ca..30e3a7061 100644 --- a/problems/maximum-length-of-pair-chain/README.md +++ b/problems/maximum-length-of-pair-chain/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/set-mismatch "Set Mismatch") +[< Previous](../set-mismatch "Set Mismatch") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/palindromic-substrings "Palindromic Substrings") +[Next >](../palindromic-substrings "Palindromic Substrings") ## [646. Maximum Length of Pair Chain (Medium)](https://leetcode.com/problems/maximum-length-of-pair-chain "最长数对链") @@ -39,8 +39,8 @@ Given a set of pairs, find the length longest chain which can be formed. You nee

### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Longest Increasing Subsequence](https://github.com/openset/leetcode/tree/master/problems/longest-increasing-subsequence) (Medium) - 1. [Increasing Subsequences](https://github.com/openset/leetcode/tree/master/problems/increasing-subsequences) (Medium) + 1. [Longest Increasing Subsequence](../longest-increasing-subsequence) (Medium) + 1. [Increasing Subsequences](../increasing-subsequences) (Medium) diff --git a/problems/maximum-length-of-repeated-subarray/README.md b/problems/maximum-length-of-repeated-subarray/README.md index accfa83a0..efa97c82f 100644 --- a/problems/maximum-length-of-repeated-subarray/README.md +++ b/problems/maximum-length-of-repeated-subarray/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/1-bit-and-2-bit-characters "1-bit and 2-bit Characters") +[< Previous](../1-bit-and-2-bit-characters "1-bit and 2-bit Characters") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-k-th-smallest-pair-distance "Find K-th Smallest Pair Distance") +[Next >](../find-k-th-smallest-pair-distance "Find K-th Smallest Pair Distance") ## [718. Maximum Length of Repeated Subarray (Medium)](https://leetcode.com/problems/maximum-length-of-repeated-subarray "最长重复子数组") @@ -36,13 +36,13 @@ The repeated subarray with maximum length is [3, 2, 1].

 

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Array](../../tag/array/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Minimum Size Subarray Sum](https://github.com/openset/leetcode/tree/master/problems/minimum-size-subarray-sum) (Medium) + 1. [Minimum Size Subarray Sum](../minimum-size-subarray-sum) (Medium) ### Hints
diff --git a/problems/maximum-level-sum-of-a-binary-tree/README.md b/problems/maximum-level-sum-of-a-binary-tree/README.md index 4fe1f0eef..4754b1d4f 100644 --- a/problems/maximum-level-sum-of-a-binary-tree/README.md +++ b/problems/maximum-level-sum-of-a-binary-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-words-that-can-be-formed-by-characters "Find Words That Can Be Formed by Characters") +[< Previous](../find-words-that-can-be-formed-by-characters "Find Words That Can Be Formed by Characters") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/as-far-from-land-as-possible "As Far from Land as Possible") +[Next >](../as-far-from-land-as-possible "As Far from Land as Possible") ## [1161. Maximum Level Sum of a Binary Tree (Medium)](https://leetcode.com/problems/maximum-level-sum-of-a-binary-tree "最大层内元素和") @@ -41,7 +41,7 @@ So we return the level with the maximum sum which is level 2. ### Related Topics - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] + [[Graph](../../tag/graph/README.md)] ### Hints
diff --git a/problems/maximum-nesting-depth-of-two-valid-parentheses-strings/README.md b/problems/maximum-nesting-depth-of-two-valid-parentheses-strings/README.md index dd2c49d0a..fcd02181e 100644 --- a/problems/maximum-nesting-depth-of-two-valid-parentheses-strings/README.md +++ b/problems/maximum-nesting-depth-of-two-valid-parentheses-strings/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/delete-nodes-and-return-forest "Delete Nodes And Return Forest") +[< Previous](../delete-nodes-and-return-forest "Delete Nodes And Return Forest") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/highest-grade-for-each-student "Highest Grade For Each Student") +[Next >](../highest-grade-for-each-student "Highest Grade For Each Student") ## [1111. Maximum Nesting Depth of Two Valid Parentheses Strings (Medium)](https://leetcode.com/problems/maximum-nesting-depth-of-two-valid-parentheses-strings "有效括号的嵌套深度") @@ -60,5 +60,5 @@ ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] diff --git a/problems/maximum-number-of-balloons/README.md b/problems/maximum-number-of-balloons/README.md index 734eca84c..c8548021d 100644 --- a/problems/maximum-number-of-balloons/README.md +++ b/problems/maximum-number-of-balloons/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/design-bounded-blocking-queue "Design Bounded Blocking Queue") +[< Previous](../design-bounded-blocking-queue "Design Bounded Blocking Queue") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/reverse-substrings-between-each-pair-of-parentheses "Reverse Substrings Between Each Pair of Parentheses") +[Next >](../reverse-substrings-between-each-pair-of-parentheses "Reverse Substrings Between Each Pair of Parentheses") ## [1189. Maximum Number of Balloons (Easy)](https://leetcode.com/problems/maximum-number-of-balloons "“气球” 的最大数量") @@ -50,8 +50,8 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[String](../../tag/string/README.md)] ### Hints
diff --git a/problems/maximum-number-of-ones/README.md b/problems/maximum-number-of-ones/README.md index fffe911e4..5445b73ec 100644 --- a/problems/maximum-number-of-ones/README.md +++ b/problems/maximum-number-of-ones/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-to-target-color "Shortest Distance to Target Color") +[< Previous](../shortest-distance-to-target-color "Shortest Distance to Target Color") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/distance-between-bus-stops "Distance Between Bus Stops") +[Next >](../distance-between-bus-stops "Distance Between Bus Stops") ## [1183. Maximum Number of Ones (Hard)](https://leetcode.com/problems/maximum-number-of-ones "矩阵中 1 的最大数量") @@ -50,8 +50,8 @@ The best solution that has 4 ones is: ### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Sort](../../tag/sort/README.md)] + [[Math](../../tag/math/README.md)] ### Hints
diff --git a/problems/maximum-of-absolute-value-expression/README.md b/problems/maximum-of-absolute-value-expression/README.md index 06e03c1a5..80a75c955 100644 --- a/problems/maximum-of-absolute-value-expression/README.md +++ b/problems/maximum-of-absolute-value-expression/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-cost-tree-from-leaf-values "Minimum Cost Tree From Leaf Values") +[< Previous](../minimum-cost-tree-from-leaf-values "Minimum Cost Tree From Leaf Values") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/reported-posts-ii "Reported Posts II") +[Next >](../reported-posts-ii "Reported Posts II") ## [1131. Maximum of Absolute Value Expression (Medium)](https://leetcode.com/problems/maximum-of-absolute-value-expression "绝对值表达式的最大值") @@ -41,8 +41,8 @@ ### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] + [[Math](../../tag/math/README.md)] ### Hints
diff --git a/problems/maximum-product-of-three-numbers/README.md b/problems/maximum-product-of-three-numbers/README.md index e82527a72..eda024fee 100644 --- a/problems/maximum-product-of-three-numbers/README.md +++ b/problems/maximum-product-of-three-numbers/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/swap-salary "Swap Salary") +[< Previous](../swap-salary "Swap Salary") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/k-inverse-pairs-array "K Inverse Pairs Array") +[Next >](../k-inverse-pairs-array "K Inverse Pairs Array") ## [628. Maximum Product of Three Numbers (Easy)](https://leetcode.com/problems/maximum-product-of-three-numbers "三个数的最大乘积") @@ -41,8 +41,8 @@

 

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Array](../../tag/array/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Maximum Product Subarray](https://github.com/openset/leetcode/tree/master/problems/maximum-product-subarray) (Medium) + 1. [Maximum Product Subarray](../maximum-product-subarray) (Medium) diff --git a/problems/maximum-product-of-word-lengths/README.md b/problems/maximum-product-of-word-lengths/README.md index 470a1c12e..5b3597874 100644 --- a/problems/maximum-product-of-word-lengths/README.md +++ b/problems/maximum-product-of-word-lengths/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-from-all-buildings "Shortest Distance from All Buildings") +[< Previous](../shortest-distance-from-all-buildings "Shortest Distance from All Buildings") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/bulb-switcher "Bulb Switcher") +[Next >](../bulb-switcher "Bulb Switcher") ## [318. Maximum Product of Word Lengths (Medium)](https://leetcode.com/problems/maximum-product-of-word-lengths "最大单词长度乘积") @@ -36,4 +36,4 @@ ### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] diff --git a/problems/maximum-product-subarray/README.md b/problems/maximum-product-subarray/README.md index 618124ffc..9b93e539b 100644 --- a/problems/maximum-product-subarray/README.md +++ b/problems/maximum-product-subarray/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/reverse-words-in-a-string "Reverse Words in a String") +[< Previous](../reverse-words-in-a-string "Reverse Words in a String") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-minimum-in-rotated-sorted-array "Find Minimum in Rotated Sorted Array") +[Next >](../find-minimum-in-rotated-sorted-array "Find Minimum in Rotated Sorted Array") ## [152. Maximum Product Subarray (Medium)](https://leetcode.com/problems/maximum-product-subarray "乘积最大子序列") @@ -29,12 +29,12 @@ Explanation: The result cannot be 2, because [-2,-1] is not a subarray. ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Array](../../tag/array/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Maximum Subarray](https://github.com/openset/leetcode/tree/master/problems/maximum-subarray) (Easy) - 1. [House Robber](https://github.com/openset/leetcode/tree/master/problems/house-robber) (Easy) - 1. [Product of Array Except Self](https://github.com/openset/leetcode/tree/master/problems/product-of-array-except-self) (Medium) - 1. [Maximum Product of Three Numbers](https://github.com/openset/leetcode/tree/master/problems/maximum-product-of-three-numbers) (Easy) - 1. [Subarray Product Less Than K](https://github.com/openset/leetcode/tree/master/problems/subarray-product-less-than-k) (Medium) + 1. [Maximum Subarray](../maximum-subarray) (Easy) + 1. [House Robber](../house-robber) (Easy) + 1. [Product of Array Except Self](../product-of-array-except-self) (Medium) + 1. [Maximum Product of Three Numbers](../maximum-product-of-three-numbers) (Easy) + 1. [Subarray Product Less Than K](../subarray-product-less-than-k) (Medium) diff --git a/problems/maximum-profit-in-job-scheduling/README.md b/problems/maximum-profit-in-job-scheduling/README.md index 2ec8b7d67..9201f646b 100644 --- a/problems/maximum-profit-in-job-scheduling/README.md +++ b/problems/maximum-profit-in-job-scheduling/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/replace-the-substring-for-balanced-string "Replace the Substring for Balanced String") +[< Previous](../replace-the-substring-for-balanced-string "Replace the Substring for Balanced String") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/web-crawler "Web Crawler") +[Next >](../web-crawler "Web Crawler") ## [1235. Maximum Profit in Job Scheduling (Hard)](https://leetcode.com/problems/maximum-profit-in-job-scheduling "规划兼职工作") @@ -60,9 +60,9 @@ Profit obtained 150 = 20 + 70 + 60. ### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Sort](../../tag/sort/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/maximum-score-words-formed-by-letters/README.md b/problems/maximum-score-words-formed-by-letters/README.md index 91faabd61..1ca66233a 100644 --- a/problems/maximum-score-words-formed-by-letters/README.md +++ b/problems/maximum-score-words-formed-by-letters/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/number-of-closed-islands "Number of Closed Islands") +[< Previous](../number-of-closed-islands "Number of Closed Islands") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/encode-number "Encode Number") +[Next >](../encode-number "Encode Number") ## [1255. Maximum Score Words Formed by Letters (Hard)](https://leetcode.com/problems/maximum-score-words-formed-by-letters "得分最高的单词集合") @@ -60,7 +60,7 @@ Letter "e" can only be used once. ### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] ### Hints
diff --git a/problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold/README.md b/problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold/README.md index ad3036b92..b989ac737 100644 --- a/problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold/README.md +++ b/problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/sequential-digits "Sequential Digits") +[< Previous](../sequential-digits "Sequential Digits") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/shortest-path-in-a-grid-with-obstacles-elimination "Shortest Path in a Grid with Obstacles Elimination") +[Next >](../shortest-path-in-a-grid-with-obstacles-elimination "Shortest Path in a Grid with Obstacles Elimination") ## [1292. Maximum Side Length of a Square with Sum Less than or Equal to Threshold (Medium)](https://leetcode.com/problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold "元素和小于等于阈值的正方形的最大边长") @@ -55,8 +55,8 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Array](../../tag/array/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Hints
diff --git a/problems/maximum-size-subarray-sum-equals-k/README.md b/problems/maximum-size-subarray-sum-equals-k/README.md index d46d32ffa..e963bfaec 100644 --- a/problems/maximum-size-subarray-sum-equals-k/README.md +++ b/problems/maximum-size-subarray-sum-equals-k/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/wiggle-sort-ii "Wiggle Sort II") +[< Previous](../wiggle-sort-ii "Wiggle Sort II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/power-of-three "Power of Three") +[Next >](../power-of-three "Power of Three") ## [325. Maximum Size Subarray Sum Equals k (Medium)](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k "和等于 k 的最长子数组长度") @@ -35,13 +35,13 @@ Explanation: The subarray [-1, 2] sums to 1 and is the lon Can you do it in O(n) time?

### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Minimum Size Subarray Sum](https://github.com/openset/leetcode/tree/master/problems/minimum-size-subarray-sum) (Medium) - 1. [Range Sum Query - Immutable](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-immutable) (Easy) - 1. [Contiguous Array](https://github.com/openset/leetcode/tree/master/problems/contiguous-array) (Medium) - 1. [Subarray Product Less Than K](https://github.com/openset/leetcode/tree/master/problems/subarray-product-less-than-k) (Medium) + 1. [Minimum Size Subarray Sum](../minimum-size-subarray-sum) (Medium) + 1. [Range Sum Query - Immutable](../range-sum-query-immutable) (Easy) + 1. [Contiguous Array](../contiguous-array) (Medium) + 1. [Subarray Product Less Than K](../subarray-product-less-than-k) (Medium) ### Hints
diff --git a/problems/maximum-subarray-sum-with-one-deletion/README.md b/problems/maximum-subarray-sum-with-one-deletion/README.md index 518b82fb3..86a0b4bc9 100644 --- a/problems/maximum-subarray-sum-with-one-deletion/README.md +++ b/problems/maximum-subarray-sum-with-one-deletion/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/day-of-the-week "Day of the Week") +[< Previous](../day-of-the-week "Day of the Week") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/make-array-strictly-increasing "Make Array Strictly Increasing") +[Next >](../make-array-strictly-increasing "Make Array Strictly Increasing") ## [1186. Maximum Subarray Sum with One Deletion (Medium)](https://leetcode.com/problems/maximum-subarray-sum-with-one-deletion "删除一次得到子数组最大和") @@ -48,7 +48,7 @@ ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/maximum-subarray/README.md b/problems/maximum-subarray/README.md index 0a5589864..a16dc4f22 100644 --- a/problems/maximum-subarray/README.md +++ b/problems/maximum-subarray/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/n-queens-ii "N-Queens II") +[< Previous](../n-queens-ii "N-Queens II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/spiral-matrix "Spiral Matrix") +[Next >](../spiral-matrix "Spiral Matrix") ## [53. Maximum Subarray (Easy)](https://leetcode.com/problems/maximum-subarray "最大子序和") @@ -26,12 +26,12 @@

If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Divide and Conquer](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Array](../../tag/array/README.md)] + [[Divide and Conquer](../../tag/divide-and-conquer/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Best Time to Buy and Sell Stock](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock) (Easy) - 1. [Maximum Product Subarray](https://github.com/openset/leetcode/tree/master/problems/maximum-product-subarray) (Medium) - 1. [Degree of an Array](https://github.com/openset/leetcode/tree/master/problems/degree-of-an-array) (Easy) - 1. [Longest Turbulent Subarray](https://github.com/openset/leetcode/tree/master/problems/longest-turbulent-subarray) (Medium) + 1. [Best Time to Buy and Sell Stock](../best-time-to-buy-and-sell-stock) (Easy) + 1. [Maximum Product Subarray](../maximum-product-subarray) (Medium) + 1. [Degree of an Array](../degree-of-an-array) (Easy) + 1. [Longest Turbulent Subarray](../longest-turbulent-subarray) (Medium) diff --git a/problems/maximum-sum-circular-subarray/README.md b/problems/maximum-sum-circular-subarray/README.md index e0b7b364d..333658c86 100644 --- a/problems/maximum-sum-circular-subarray/README.md +++ b/problems/maximum-sum-circular-subarray/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/reverse-only-letters "Reverse Only Letters") +[< Previous](../reverse-only-letters "Reverse Only Letters") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/complete-binary-tree-inserter "Complete Binary Tree Inserter") +[Next >](../complete-binary-tree-inserter "Complete Binary Tree Inserter") ## [918. Maximum Sum Circular Subarray (Medium)](https://leetcode.com/problems/maximum-sum-circular-subarray "环形子数组的最大和") @@ -77,7 +77,7 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Hints
diff --git a/problems/maximum-sum-of-3-non-overlapping-subarrays/README.md b/problems/maximum-sum-of-3-non-overlapping-subarrays/README.md index 88c019729..1e23d04f4 100644 --- a/problems/maximum-sum-of-3-non-overlapping-subarrays/README.md +++ b/problems/maximum-sum-of-3-non-overlapping-subarrays/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/knight-probability-in-chessboard "Knight Probability in Chessboard") +[< Previous](../knight-probability-in-chessboard "Knight Probability in Chessboard") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/employee-importance "Employee Importance") +[Next >](../employee-importance "Employee Importance") ## [689. Maximum Sum of 3 Non-Overlapping Subarrays (Hard)](https://leetcode.com/problems/maximum-sum-of-3-non-overlapping-subarrays "三个无重叠子数组的最大和") @@ -39,8 +39,8 @@ We could have also taken [2, 1], but an answer of [1, 3, 5] would be lexicograph

 

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Array](../../tag/array/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Best Time to Buy and Sell Stock III](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-iii) (Hard) + 1. [Best Time to Buy and Sell Stock III](../best-time-to-buy-and-sell-stock-iii) (Hard) diff --git a/problems/maximum-sum-of-two-non-overlapping-subarrays/README.md b/problems/maximum-sum-of-two-non-overlapping-subarrays/README.md index 8e30edbea..a21696936 100644 --- a/problems/maximum-sum-of-two-non-overlapping-subarrays/README.md +++ b/problems/maximum-sum-of-two-non-overlapping-subarrays/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/matrix-cells-in-distance-order "Matrix Cells in Distance Order") +[< Previous](../matrix-cells-in-distance-order "Matrix Cells in Distance Order") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/stream-of-characters "Stream of Characters") +[Next >](../stream-of-characters "Stream of Characters") ## [1031. Maximum Sum of Two Non-Overlapping Subarrays (Medium)](https://leetcode.com/problems/maximum-sum-of-two-non-overlapping-subarrays "两个非重叠子数组的最大和") @@ -67,7 +67,7 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Hints
diff --git a/problems/maximum-swap/README.md b/problems/maximum-swap/README.md index 13094a7b4..4ad9961e3 100644 --- a/problems/maximum-swap/README.md +++ b/problems/maximum-swap/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/trim-a-binary-search-tree "Trim a Binary Search Tree") +[< Previous](../trim-a-binary-search-tree "Trim a Binary Search Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/second-minimum-node-in-a-binary-tree "Second Minimum Node In a Binary Tree") +[Next >](../second-minimum-node-in-a-binary-tree "Second Minimum Node In a Binary Tree") ## [670. Maximum Swap (Medium)](https://leetcode.com/problems/maximum-swap "最大交换") @@ -39,8 +39,8 @@ Given a non-negative integer, you could swap two digits at most once to g

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Array](../../tag/array/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Create Maximum Number](https://github.com/openset/leetcode/tree/master/problems/create-maximum-number) (Hard) + 1. [Create Maximum Number](../create-maximum-number) (Hard) diff --git a/problems/maximum-vacation-days/README.md b/problems/maximum-vacation-days/README.md index 350f6dd4f..4868ce70c 100644 --- a/problems/maximum-vacation-days/README.md +++ b/problems/maximum-vacation-days/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/permutation-in-string "Permutation in String") +[< Previous](../permutation-in-string "Permutation in String") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/median-employee-salary "Median Employee Salary") +[Next >](../median-employee-salary "Median Employee Salary") ## [568. Maximum Vacation Days (Hard)](https://leetcode.com/problems/maximum-vacation-days "最大休假天数") @@ -72,10 +72,10 @@ One of the best strategies is:

### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Cheapest Flights Within K Stops](https://github.com/openset/leetcode/tree/master/problems/cheapest-flights-within-k-stops) (Medium) + 1. [Cheapest Flights Within K Stops](../cheapest-flights-within-k-stops) (Medium) ### Hints
diff --git a/problems/maximum-width-of-binary-tree/README.md b/problems/maximum-width-of-binary-tree/README.md index ebcfadf24..d94b75efe 100644 --- a/problems/maximum-width-of-binary-tree/README.md +++ b/problems/maximum-width-of-binary-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/image-smoother "Image Smoother") +[< Previous](../image-smoother "Image Smoother") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/equal-tree-partition "Equal Tree Partition") +[Next >](../equal-tree-partition "Equal Tree Partition") ## [662. Maximum Width of Binary Tree (Medium)](https://leetcode.com/problems/maximum-width-of-binary-tree "二叉树最大宽度") @@ -81,4 +81,4 @@

Note: Answer will in the range of 32-bit signed integer.

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] diff --git a/problems/maximum-width-ramp/README.md b/problems/maximum-width-ramp/README.md index 5f81645fe..9710ac3e8 100644 --- a/problems/maximum-width-ramp/README.md +++ b/problems/maximum-width-ramp/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/n-repeated-element-in-size-2n-array "N-Repeated Element in Size 2N Array") +[< Previous](../n-repeated-element-in-size-2n-array "N-Repeated Element in Size 2N Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-area-rectangle-ii "Minimum Area Rectangle II") +[Next >](../minimum-area-rectangle-ii "Minimum Area Rectangle II") ## [962. Maximum Width Ramp (Medium)](https://leetcode.com/problems/maximum-width-ramp "最大宽度坡") @@ -55,4 +55,4 @@ The maximum width ramp is achieved at (i, j) = (2, 9): A[2] = 1 and A[9] = 1. ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] diff --git a/problems/maximum-xor-of-two-numbers-in-an-array/README.md b/problems/maximum-xor-of-two-numbers-in-an-array/README.md index 4763ec29d..f7b9891d7 100644 --- a/problems/maximum-xor-of-two-numbers-in-an-array/README.md +++ b/problems/maximum-xor-of-two-numbers-in-an-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/strong-password-checker "Strong Password Checker") +[< Previous](../strong-password-checker "Strong Password Checker") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/valid-word-square "Valid Word Square") +[Next >](../valid-word-square "Valid Word Square") ## [421. Maximum XOR of Two Numbers in an Array (Medium)](https://leetcode.com/problems/maximum-xor-of-two-numbers-in-an-array "数组中两个数的最大异或值") @@ -30,5 +30,5 @@

 

### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] - [[Trie](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] + [[Trie](../../tag/trie/README.md)] diff --git a/problems/median-employee-salary/README.md b/problems/median-employee-salary/README.md index fedb6e968..67da590a3 100644 --- a/problems/median-employee-salary/README.md +++ b/problems/median-employee-salary/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-vacation-days "Maximum Vacation Days") +[< Previous](../maximum-vacation-days "Maximum Vacation Days") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/managers-with-at-least-5-direct-reports "Managers with at Least 5 Direct Reports") +[Next >](../managers-with-at-least-5-direct-reports "Managers with at Least 5 Direct Reports") ## [569. Median Employee Salary (Hard)](https://leetcode.com/problems/median-employee-salary "员工薪水中位数") @@ -52,7 +52,7 @@ ### Similar Questions - 1. [Find Median Given Frequency of Numbers](https://github.com/openset/leetcode/tree/master/problems/find-median-given-frequency-of-numbers) (Hard) + 1. [Find Median Given Frequency of Numbers](../find-median-given-frequency-of-numbers) (Hard) ### Hints
diff --git a/problems/median-of-two-sorted-arrays/README.md b/problems/median-of-two-sorted-arrays/README.md index 0adff0ffc..b840cf7e6 100644 --- a/problems/median-of-two-sorted-arrays/README.md +++ b/problems/median-of-two-sorted-arrays/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/longest-substring-without-repeating-characters "Longest Substring Without Repeating Characters") +[< Previous](../longest-substring-without-repeating-characters "Longest Substring Without Repeating Characters") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/longest-palindromic-substring "Longest Palindromic Substring") +[Next >](../longest-palindromic-substring "Longest Palindromic Substring") ## [4. Median of Two Sorted Arrays (Hard)](https://leetcode.com/problems/median-of-two-sorted-arrays "寻找两个有序数组的中位数") @@ -36,6 +36,6 @@ The median is (2 + 3)/2 = 2.5 ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] - [[Divide and Conquer](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] + [[Array](../../tag/array/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] + [[Divide and Conquer](../../tag/divide-and-conquer/README.md)] diff --git a/problems/meeting-rooms-ii/README.md b/problems/meeting-rooms-ii/README.md index 7ec49187b..4070e9afe 100644 --- a/problems/meeting-rooms-ii/README.md +++ b/problems/meeting-rooms-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/meeting-rooms "Meeting Rooms") +[< Previous](../meeting-rooms "Meeting Rooms") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/factor-combinations "Factor Combinations") +[Next >](../factor-combinations "Factor Combinations") ## [253. Meeting Rooms II (Medium)](https://leetcode.com/problems/meeting-rooms-ii "会议室 II") @@ -28,15 +28,15 @@

NOTE: input types have been changed on April 15, 2019. Please reset to default code definition to get new method signature.

### Related Topics - [[Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] + [[Heap](../../tag/heap/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[Sort](../../tag/sort/README.md)] ### Similar Questions - 1. [Merge Intervals](https://github.com/openset/leetcode/tree/master/problems/merge-intervals) (Medium) - 1. [Meeting Rooms](https://github.com/openset/leetcode/tree/master/problems/meeting-rooms) (Easy) - 1. [Minimum Number of Arrows to Burst Balloons](https://github.com/openset/leetcode/tree/master/problems/minimum-number-of-arrows-to-burst-balloons) (Medium) - 1. [Car Pooling](https://github.com/openset/leetcode/tree/master/problems/car-pooling) (Medium) + 1. [Merge Intervals](../merge-intervals) (Medium) + 1. [Meeting Rooms](../meeting-rooms) (Easy) + 1. [Minimum Number of Arrows to Burst Balloons](../minimum-number-of-arrows-to-burst-balloons) (Medium) + 1. [Car Pooling](../car-pooling) (Medium) ### Hints
diff --git a/problems/meeting-rooms/README.md b/problems/meeting-rooms/README.md index dea7c3edd..c6a566afe 100644 --- a/problems/meeting-rooms/README.md +++ b/problems/meeting-rooms/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/flatten-2d-vector "Flatten 2D Vector") +[< Previous](../flatten-2d-vector "Flatten 2D Vector") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/meeting-rooms-ii "Meeting Rooms II") +[Next >](../meeting-rooms-ii "Meeting Rooms II") ## [252. Meeting Rooms (Easy)](https://leetcode.com/problems/meeting-rooms "会议室") @@ -30,8 +30,8 @@

NOTE: input types have been changed on April 15, 2019. Please reset to default code definition to get new method signature.

### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] + [[Sort](../../tag/sort/README.md)] ### Similar Questions - 1. [Merge Intervals](https://github.com/openset/leetcode/tree/master/problems/merge-intervals) (Medium) - 1. [Meeting Rooms II](https://github.com/openset/leetcode/tree/master/problems/meeting-rooms-ii) (Medium) + 1. [Merge Intervals](../merge-intervals) (Medium) + 1. [Meeting Rooms II](../meeting-rooms-ii) (Medium) diff --git a/problems/meeting-scheduler/README.md b/problems/meeting-scheduler/README.md index a12f38600..361377598 100644 --- a/problems/meeting-scheduler/README.md +++ b/problems/meeting-scheduler/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/missing-number-in-arithmetic-progression "Missing Number In Arithmetic Progression") +[< Previous](../missing-number-in-arithmetic-progression "Missing Number In Arithmetic Progression") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/toss-strange-coins "Toss Strange Coins") +[Next >](../toss-strange-coins "Toss Strange Coins") ## [1229. Meeting Scheduler (Medium)](https://leetcode.com/problems/meeting-scheduler "安排会议日程") @@ -47,7 +47,7 @@ ### Related Topics - [[Line Sweep](https://github.com/openset/leetcode/tree/master/tag/line-sweep/README.md)] + [[Line Sweep](../../tag/line-sweep/README.md)] ### Hints
diff --git a/problems/merge-intervals/README.md b/problems/merge-intervals/README.md index 9d2bbc4a7..b1da7f102 100644 --- a/problems/merge-intervals/README.md +++ b/problems/merge-intervals/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/jump-game "Jump Game") +[< Previous](../jump-game "Jump Game") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/insert-interval "Insert Interval") +[Next >](../insert-interval "Insert Interval") ## [56. Merge Intervals (Medium)](https://leetcode.com/problems/merge-intervals "合并区间") @@ -31,16 +31,16 @@

NOTE: input types have been changed on April 15, 2019. Please reset to default code definition to get new method signature.

### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Sort](../../tag/sort/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Insert Interval](https://github.com/openset/leetcode/tree/master/problems/insert-interval) (Hard) - 1. [Meeting Rooms](https://github.com/openset/leetcode/tree/master/problems/meeting-rooms) (Easy) - 1. [Meeting Rooms II](https://github.com/openset/leetcode/tree/master/problems/meeting-rooms-ii) (Medium) - 1. [Teemo Attacking](https://github.com/openset/leetcode/tree/master/problems/teemo-attacking) (Medium) - 1. [Add Bold Tag in String](https://github.com/openset/leetcode/tree/master/problems/add-bold-tag-in-string) (Medium) - 1. [Range Module](https://github.com/openset/leetcode/tree/master/problems/range-module) (Hard) - 1. [Employee Free Time](https://github.com/openset/leetcode/tree/master/problems/employee-free-time) (Hard) - 1. [Partition Labels](https://github.com/openset/leetcode/tree/master/problems/partition-labels) (Medium) - 1. [Interval List Intersections](https://github.com/openset/leetcode/tree/master/problems/interval-list-intersections) (Medium) + 1. [Insert Interval](../insert-interval) (Hard) + 1. [Meeting Rooms](../meeting-rooms) (Easy) + 1. [Meeting Rooms II](../meeting-rooms-ii) (Medium) + 1. [Teemo Attacking](../teemo-attacking) (Medium) + 1. [Add Bold Tag in String](../add-bold-tag-in-string) (Medium) + 1. [Range Module](../range-module) (Hard) + 1. [Employee Free Time](../employee-free-time) (Hard) + 1. [Partition Labels](../partition-labels) (Medium) + 1. [Interval List Intersections](../interval-list-intersections) (Medium) diff --git a/problems/merge-k-sorted-lists/README.md b/problems/merge-k-sorted-lists/README.md index 849d58d26..28fc7a4fc 100644 --- a/problems/merge-k-sorted-lists/README.md +++ b/problems/merge-k-sorted-lists/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/generate-parentheses "Generate Parentheses") +[< Previous](../generate-parentheses "Generate Parentheses") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/swap-nodes-in-pairs "Swap Nodes in Pairs") +[Next >](../swap-nodes-in-pairs "Swap Nodes in Pairs") ## [23. Merge k Sorted Lists (Hard)](https://leetcode.com/problems/merge-k-sorted-lists "合并K个排序链表") @@ -26,10 +26,10 @@ ### Related Topics - [[Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] - [[Divide and Conquer](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] + [[Heap](../../tag/heap/README.md)] + [[Linked List](../../tag/linked-list/README.md)] + [[Divide and Conquer](../../tag/divide-and-conquer/README.md)] ### Similar Questions - 1. [Merge Two Sorted Lists](https://github.com/openset/leetcode/tree/master/problems/merge-two-sorted-lists) (Easy) - 1. [Ugly Number II](https://github.com/openset/leetcode/tree/master/problems/ugly-number-ii) (Medium) + 1. [Merge Two Sorted Lists](../merge-two-sorted-lists) (Easy) + 1. [Ugly Number II](../ugly-number-ii) (Medium) diff --git a/problems/merge-sorted-array/README.md b/problems/merge-sorted-array/README.md index e817c123c..9624f6514 100644 --- a/problems/merge-sorted-array/README.md +++ b/problems/merge-sorted-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/scramble-string "Scramble String") +[< Previous](../scramble-string "Scramble String") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/gray-code "Gray Code") +[Next >](../gray-code "Gray Code") ## [88. Merge Sorted Array (Easy)](https://leetcode.com/problems/merge-sorted-array "合并两个有序数组") @@ -31,13 +31,13 @@ nums2 = [2,5,6], n = 3 ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Array](../../tag/array/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] ### Similar Questions - 1. [Merge Two Sorted Lists](https://github.com/openset/leetcode/tree/master/problems/merge-two-sorted-lists) (Easy) - 1. [Squares of a Sorted Array](https://github.com/openset/leetcode/tree/master/problems/squares-of-a-sorted-array) (Easy) - 1. [Interval List Intersections](https://github.com/openset/leetcode/tree/master/problems/interval-list-intersections) (Medium) + 1. [Merge Two Sorted Lists](../merge-two-sorted-lists) (Easy) + 1. [Squares of a Sorted Array](../squares-of-a-sorted-array) (Easy) + 1. [Interval List Intersections](../interval-list-intersections) (Medium) ### Hints
diff --git a/problems/merge-two-binary-trees/README.md b/problems/merge-two-binary-trees/README.md index ec7caa749..36437c476 100644 --- a/problems/merge-two-binary-trees/README.md +++ b/problems/merge-two-binary-trees/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/add-bold-tag-in-string "Add Bold Tag in String") +[< Previous](../add-bold-tag-in-string "Add Bold Tag in String") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/students-report-by-geography "Students Report By Geography") +[Next >](../students-report-by-geography "Students Report By Geography") ## [617. Merge Two Binary Trees (Easy)](https://leetcode.com/problems/merge-two-binary-trees "合并二叉树") @@ -39,4 +39,4 @@ Merged tree:

Note: The merging process must start from the root nodes of both trees.

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] diff --git a/problems/merge-two-sorted-lists/README.md b/problems/merge-two-sorted-lists/README.md index 54d3145d0..565a0b7e3 100644 --- a/problems/merge-two-sorted-lists/README.md +++ b/problems/merge-two-sorted-lists/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/valid-parentheses "Valid Parentheses") +[< Previous](../valid-parentheses "Valid Parentheses") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/generate-parentheses "Generate Parentheses") +[Next >](../generate-parentheses "Generate Parentheses") ## [21. Merge Two Sorted Lists (Easy)](https://leetcode.com/problems/merge-two-sorted-lists "合并两个有序链表") @@ -21,10 +21,10 @@

### Related Topics - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] + [[Linked List](../../tag/linked-list/README.md)] ### Similar Questions - 1. [Merge k Sorted Lists](https://github.com/openset/leetcode/tree/master/problems/merge-k-sorted-lists) (Hard) - 1. [Merge Sorted Array](https://github.com/openset/leetcode/tree/master/problems/merge-sorted-array) (Easy) - 1. [Sort List](https://github.com/openset/leetcode/tree/master/problems/sort-list) (Medium) - 1. [Shortest Word Distance II](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance-ii) (Medium) + 1. [Merge k Sorted Lists](../merge-k-sorted-lists) (Hard) + 1. [Merge Sorted Array](../merge-sorted-array) (Easy) + 1. [Sort List](../sort-list) (Medium) + 1. [Shortest Word Distance II](../shortest-word-distance-ii) (Medium) diff --git a/problems/middle-of-the-linked-list/README.md b/problems/middle-of-the-linked-list/README.md index 42914c432..6b2f44165 100644 --- a/problems/middle-of-the-linked-list/README.md +++ b/problems/middle-of-the-linked-list/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/koko-eating-bananas "Koko Eating Bananas") +[< Previous](../koko-eating-bananas "Koko Eating Bananas") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/stone-game "Stone Game") +[Next >](../stone-game "Stone Game") ## [876. Middle of the Linked List (Easy)](https://leetcode.com/problems/middle-of-the-linked-list "链表的中间结点") @@ -48,4 +48,4 @@ Since the list has two middle nodes with values 3 and 4, we return the second on ### Related Topics - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] + [[Linked List](../../tag/linked-list/README.md)] diff --git a/problems/min-cost-climbing-stairs/README.md b/problems/min-cost-climbing-stairs/README.md index a4afd7abe..1e99f1c43 100644 --- a/problems/min-cost-climbing-stairs/README.md +++ b/problems/min-cost-climbing-stairs/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/prefix-and-suffix-search "Prefix and Suffix Search") +[< Previous](../prefix-and-suffix-search "Prefix and Suffix Search") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/largest-number-at-least-twice-of-others "Largest Number At Least Twice of Others") +[Next >](../largest-number-at-least-twice-of-others "Largest Number At Least Twice of Others") ## [746. Min Cost Climbing Stairs (Easy)](https://leetcode.com/problems/min-cost-climbing-stairs "使用最小花费爬楼梯") @@ -41,11 +41,11 @@ Once you pay the cost, you can either climb one or two steps. You need to find m

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Array](../../tag/array/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Climbing Stairs](https://github.com/openset/leetcode/tree/master/problems/climbing-stairs) (Easy) + 1. [Climbing Stairs](../climbing-stairs) (Easy) ### Hints
diff --git a/problems/min-stack/README.md b/problems/min-stack/README.md index 46c6f646c..769278c94 100644 --- a/problems/min-stack/README.md +++ b/problems/min-stack/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-minimum-in-rotated-sorted-array-ii "Find Minimum in Rotated Sorted Array II") +[< Previous](../find-minimum-in-rotated-sorted-array-ii "Find Minimum in Rotated Sorted Array II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/binary-tree-upside-down "Binary Tree Upside Down") +[Next >](../binary-tree-upside-down "Binary Tree Upside Down") ## [155. Min Stack (Easy)](https://leetcode.com/problems/min-stack "最小栈") @@ -38,12 +38,12 @@ minStack.getMin(); --> Returns -2.

 

### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] + [[Stack](../../tag/stack/README.md)] + [[Design](../../tag/design/README.md)] ### Similar Questions - 1. [Sliding Window Maximum](https://github.com/openset/leetcode/tree/master/problems/sliding-window-maximum) (Hard) - 1. [Max Stack](https://github.com/openset/leetcode/tree/master/problems/max-stack) (Easy) + 1. [Sliding Window Maximum](../sliding-window-maximum) (Hard) + 1. [Max Stack](../max-stack) (Easy) ### Hints
diff --git a/problems/minesweeper/README.md b/problems/minesweeper/README.md index 99123aaad..079809c35 100644 --- a/problems/minesweeper/README.md +++ b/problems/minesweeper/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/random-pick-with-weight "Random Pick with Weight") +[< Previous](../random-pick-with-weight "Random Pick with Weight") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-absolute-difference-in-bst "Minimum Absolute Difference in BST") +[Next >](../minimum-absolute-difference-in-bst "Minimum Absolute Difference in BST") ## [529. Minesweeper (Medium)](https://leetcode.com/problems/minesweeper "扫雷游戏") @@ -84,5 +84,5 @@ Click : [1,2] ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] diff --git a/problems/mini-parser/README.md b/problems/mini-parser/README.md index 031d480e6..8f3720ae7 100644 --- a/problems/mini-parser/README.md +++ b/problems/mini-parser/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/shuffle-an-array "Shuffle an Array") +[< Previous](../shuffle-an-array "Shuffle an Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/lexicographical-numbers "Lexicographical Numbers") +[Next >](../lexicographical-numbers "Lexicographical Numbers") ## [385. Mini Parser (Medium)](https://leetcode.com/problems/mini-parser "迷你语法分析器") @@ -47,10 +47,10 @@ Return a NestedInteger object containing a nested list with 2 elements:

### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Stack](../../tag/stack/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Flatten Nested List Iterator](https://github.com/openset/leetcode/tree/master/problems/flatten-nested-list-iterator) (Medium) - 1. [Ternary Expression Parser](https://github.com/openset/leetcode/tree/master/problems/ternary-expression-parser) (Medium) - 1. [Remove Comments](https://github.com/openset/leetcode/tree/master/problems/remove-comments) (Medium) + 1. [Flatten Nested List Iterator](../flatten-nested-list-iterator) (Medium) + 1. [Ternary Expression Parser](../ternary-expression-parser) (Medium) + 1. [Remove Comments](../remove-comments) (Medium) diff --git a/problems/minimize-malware-spread-ii/README.md b/problems/minimize-malware-spread-ii/README.md index eed9861f8..7c8751027 100644 --- a/problems/minimize-malware-spread-ii/README.md +++ b/problems/minimize-malware-spread-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/three-equal-parts "Three Equal Parts") +[< Previous](../three-equal-parts "Three Equal Parts") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/unique-email-addresses "Unique Email Addresses") +[Next >](../unique-email-addresses "Unique Email Addresses") ## [928. Minimize Malware Spread II (Hard)](https://leetcode.com/problems/minimize-malware-spread-ii "尽量减少恶意软件的传播 II") @@ -66,6 +66,6 @@ ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Union Find](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Union Find](../../tag/union-find/README.md)] + [[Graph](../../tag/graph/README.md)] diff --git a/problems/minimize-malware-spread/README.md b/problems/minimize-malware-spread/README.md index e3d39401e..dcfc452ec 100644 --- a/problems/minimize-malware-spread/README.md +++ b/problems/minimize-malware-spread/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/3sum-with-multiplicity "3Sum With Multiplicity") +[< Previous](../3sum-with-multiplicity "3Sum With Multiplicity") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/long-pressed-name "Long Pressed Name") +[Next >](../long-pressed-name "Long Pressed Name") ## [924. Minimize Malware Spread (Hard)](https://leetcode.com/problems/minimize-malware-spread "尽量减少恶意软件的传播") @@ -60,5 +60,5 @@ ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Union Find](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Union Find](../../tag/union-find/README.md)] diff --git a/problems/minimize-max-distance-to-gas-station/README.md b/problems/minimize-max-distance-to-gas-station/README.md index 57d09d745..d2187464a 100644 --- a/problems/minimize-max-distance-to-gas-station/README.md +++ b/problems/minimize-max-distance-to-gas-station/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/sliding-puzzle "Sliding Puzzle") +[< Previous](../sliding-puzzle "Sliding Puzzle") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/global-and-local-inversions "Global and Local Inversions") +[Next >](../global-and-local-inversions "Global and Local Inversions") ## [774. Minimize Max Distance to Gas Station (Hard)](https://leetcode.com/problems/minimize-max-distance-to-gas-station "最小化去加油站的最大距离") @@ -34,10 +34,10 @@ ### Related Topics - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [Koko Eating Bananas](https://github.com/openset/leetcode/tree/master/problems/koko-eating-bananas) (Medium) + 1. [Koko Eating Bananas](../koko-eating-bananas) (Medium) ### Hints
diff --git a/problems/minimize-rounding-error-to-meet-target/README.md b/problems/minimize-rounding-error-to-meet-target/README.md index c35c22eca..1fa02d885 100644 --- a/problems/minimize-rounding-error-to-meet-target/README.md +++ b/problems/minimize-rounding-error-to-meet-target/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/campus-bikes "Campus Bikes") +[< Previous](../campus-bikes "Campus Bikes") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/all-paths-from-source-lead-to-destination "All Paths from Source Lead to Destination") +[Next >](../all-paths-from-source-lead-to-destination "All Paths from Source Lead to Destination") ## [1058. Minimize Rounding Error to Meet Target (Medium)](https://leetcode.com/problems/minimize-rounding-error-to-meet-target "最小化舍入误差以满足目标") @@ -46,9 +46,9 @@ It is impossible to meet the target. ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[Math](../../tag/math/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/minimum-absolute-difference-in-bst/README.md b/problems/minimum-absolute-difference-in-bst/README.md index 2608ad08c..129639f52 100644 --- a/problems/minimum-absolute-difference-in-bst/README.md +++ b/problems/minimum-absolute-difference-in-bst/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minesweeper "Minesweeper") +[< Previous](../minesweeper "Minesweeper") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-i "Lonely Pixel I") +[Next >](../lonely-pixel-i "Lonely Pixel I") ## [530. Minimum Absolute Difference in BST (Easy)](https://leetcode.com/problems/minimum-absolute-difference-in-bst "二叉搜索树的最小绝对差") @@ -36,7 +36,7 @@ The minimum absolute difference is 1, which is the difference between 2 and 1 (o

Note: There are at least two nodes in this BST.

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] ### Similar Questions - 1. [K-diff Pairs in an Array](https://github.com/openset/leetcode/tree/master/problems/k-diff-pairs-in-an-array) (Easy) + 1. [K-diff Pairs in an Array](../k-diff-pairs-in-an-array) (Easy) diff --git a/problems/minimum-absolute-difference/README.md b/problems/minimum-absolute-difference/README.md index cca15c21f..316cff22b 100644 --- a/problems/minimum-absolute-difference/README.md +++ b/problems/minimum-absolute-difference/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-time-to-build-blocks "Minimum Time to Build Blocks") +[< Previous](../minimum-time-to-build-blocks "Minimum Time to Build Blocks") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/ugly-number-iii "Ugly Number III") +[Next >](../ugly-number-iii "Ugly Number III") ## [1200. Minimum Absolute Difference (Easy)](https://leetcode.com/problems/minimum-absolute-difference "最小绝对差") @@ -52,7 +52,7 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Hints
diff --git a/problems/minimum-add-to-make-parentheses-valid/README.md b/problems/minimum-add-to-make-parentheses-valid/README.md index 77d338a41..986a5f5cb 100644 --- a/problems/minimum-add-to-make-parentheses-valid/README.md +++ b/problems/minimum-add-to-make-parentheses-valid/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/number-of-music-playlists "Number of Music Playlists") +[< Previous](../number-of-music-playlists "Number of Music Playlists") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/sort-array-by-parity-ii "Sort Array By Parity II") +[Next >](../sort-array-by-parity-ii "Sort Array By Parity II") ## [921. Minimum Add to Make Parentheses Valid (Medium)](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid "使括号有效的最少添加") @@ -76,5 +76,5 @@ ### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] + [[Stack](../../tag/stack/README.md)] + [[Greedy](../../tag/greedy/README.md)] diff --git a/problems/minimum-area-rectangle-ii/README.md b/problems/minimum-area-rectangle-ii/README.md index bd77cfbe7..add0abfb5 100644 --- a/problems/minimum-area-rectangle-ii/README.md +++ b/problems/minimum-area-rectangle-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-width-ramp "Maximum Width Ramp") +[< Previous](../maximum-width-ramp "Maximum Width Ramp") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/least-operators-to-express-number "Least Operators to Express Number") +[Next >](../least-operators-to-express-number "Least Operators to Express Number") ## [963. Minimum Area Rectangle II (Medium)](https://leetcode.com/problems/minimum-area-rectangle-ii "最小面积矩形 II") @@ -76,5 +76,5 @@ ### Related Topics - [[Geometry](https://github.com/openset/leetcode/tree/master/tag/geometry/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Geometry](../../tag/geometry/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/minimum-area-rectangle/README.md b/problems/minimum-area-rectangle/README.md index 2f26e23a0..cba1ba034 100644 --- a/problems/minimum-area-rectangle/README.md +++ b/problems/minimum-area-rectangle/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/range-sum-of-bst "Range Sum of BST") +[< Previous](../range-sum-of-bst "Range Sum of BST") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/distinct-subsequences-ii "Distinct Subsequences II") +[Next >](../distinct-subsequences-ii "Distinct Subsequences II") ## [939. Minimum Area Rectangle (Medium)](https://leetcode.com/problems/minimum-area-rectangle "最小面积矩形") @@ -47,4 +47,4 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] diff --git a/problems/minimum-ascii-delete-sum-for-two-strings/README.md b/problems/minimum-ascii-delete-sum-for-two-strings/README.md index 3bf34105c..3418ad60f 100644 --- a/problems/minimum-ascii-delete-sum-for-two-strings/README.md +++ b/problems/minimum-ascii-delete-sum-for-two-strings/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/number-of-distinct-islands-ii "Number of Distinct Islands II") +[< Previous](../number-of-distinct-islands-ii "Number of Distinct Islands II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/subarray-product-less-than-k "Subarray Product Less Than K") +[Next >](../subarray-product-less-than-k "Subarray Product Less Than K") ## [712. Minimum ASCII Delete Sum for Two Strings (Medium)](https://leetcode.com/problems/minimum-ascii-delete-sum-for-two-strings "两个字符串的最小ASCII删除和") @@ -40,12 +40,12 @@ If instead we turned both strings into "lee" or "eet", we would get answers of 4

### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Edit Distance](https://github.com/openset/leetcode/tree/master/problems/edit-distance) (Hard) - 1. [Longest Increasing Subsequence](https://github.com/openset/leetcode/tree/master/problems/longest-increasing-subsequence) (Medium) - 1. [Delete Operation for Two Strings](https://github.com/openset/leetcode/tree/master/problems/delete-operation-for-two-strings) (Medium) + 1. [Edit Distance](../edit-distance) (Hard) + 1. [Longest Increasing Subsequence](../longest-increasing-subsequence) (Medium) + 1. [Delete Operation for Two Strings](../delete-operation-for-two-strings) (Medium) ### Hints
diff --git a/problems/minimum-cost-for-tickets/README.md b/problems/minimum-cost-for-tickets/README.md index 35ac2e6a6..ef7d3fdc9 100644 --- a/problems/minimum-cost-for-tickets/README.md +++ b/problems/minimum-cost-for-tickets/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/triples-with-bitwise-and-equal-to-zero "Triples with Bitwise AND Equal To Zero") +[< Previous](../triples-with-bitwise-and-equal-to-zero "Triples with Bitwise AND Equal To Zero") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/string-without-aaa-or-bbb "String Without AAA or BBB") +[Next >](../string-without-aaa-or-bbb "String Without AAA or BBB") ## [983. Minimum Cost For Tickets (Medium)](https://leetcode.com/problems/minimum-cost-for-tickets "最低票价") @@ -67,7 +67,7 @@ In total you spent $17 and covered all the days of your travel. ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Coin Change](https://github.com/openset/leetcode/tree/master/problems/coin-change) (Medium) + 1. [Coin Change](../coin-change) (Medium) diff --git a/problems/minimum-cost-to-connect-sticks/README.md b/problems/minimum-cost-to-connect-sticks/README.md index d8f8984bc..eb1202625 100644 --- a/problems/minimum-cost-to-connect-sticks/README.md +++ b/problems/minimum-cost-to-connect-sticks/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/design-file-system "Design File System") +[< Previous](../design-file-system "Design File System") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/optimize-water-distribution-in-a-village "Optimize Water Distribution in a Village") +[Next >](../optimize-water-distribution-in-a-village "Optimize Water Distribution in a Village") ## [1167. Minimum Cost to Connect Sticks (Medium)](https://leetcode.com/problems/minimum-cost-to-connect-sticks "连接棒材的最低费用") @@ -34,10 +34,10 @@ ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] + [[Greedy](../../tag/greedy/README.md)] ### Similar Questions - 1. [Minimum Cost to Merge Stones](https://github.com/openset/leetcode/tree/master/problems/minimum-cost-to-merge-stones) (Hard) + 1. [Minimum Cost to Merge Stones](../minimum-cost-to-merge-stones) (Hard) ### Hints
diff --git a/problems/minimum-cost-to-hire-k-workers/README.md b/problems/minimum-cost-to-hire-k-workers/README.md index e1febff1c..20dcf52f7 100644 --- a/problems/minimum-cost-to-hire-k-workers/README.md +++ b/problems/minimum-cost-to-hire-k-workers/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/score-of-parentheses "Score of Parentheses") +[< Previous](../score-of-parentheses "Score of Parentheses") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/mirror-reflection "Mirror Reflection") +[Next >](../mirror-reflection "Mirror Reflection") ## [857. Minimum Cost to Hire K Workers (Hard)](https://leetcode.com/problems/minimum-cost-to-hire-k-workers "雇佣 K 名工人的最低成本") @@ -59,4 +59,4 @@ ### Related Topics - [[Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] + [[Heap](../../tag/heap/README.md)] diff --git a/problems/minimum-cost-to-merge-stones/README.md b/problems/minimum-cost-to-merge-stones/README.md index 719888d7f..f249cea94 100644 --- a/problems/minimum-cost-to-merge-stones/README.md +++ b/problems/minimum-cost-to-merge-stones/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/available-captures-for-rook "Available Captures for Rook") +[< Previous](../available-captures-for-rook "Available Captures for Rook") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/grid-illumination "Grid Illumination") +[Next >](../grid-illumination "Grid Illumination") ## [1000. Minimum Cost to Merge Stones (Hard)](https://leetcode.com/problems/minimum-cost-to-merge-stones "合并石头的最低成本") @@ -69,8 +69,8 @@ The total cost was 25, and this is the minimum possible. ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Burst Balloons](https://github.com/openset/leetcode/tree/master/problems/burst-balloons) (Hard) - 1. [Minimum Cost to Connect Sticks](https://github.com/openset/leetcode/tree/master/problems/minimum-cost-to-connect-sticks) (Medium) + 1. [Burst Balloons](../burst-balloons) (Hard) + 1. [Minimum Cost to Connect Sticks](../minimum-cost-to-connect-sticks) (Medium) diff --git a/problems/minimum-cost-tree-from-leaf-values/README.md b/problems/minimum-cost-tree-from-leaf-values/README.md index ca8a26009..620805ee6 100644 --- a/problems/minimum-cost-tree-from-leaf-values/README.md +++ b/problems/minimum-cost-tree-from-leaf-values/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/shortest-path-with-alternating-colors "Shortest Path with Alternating Colors") +[< Previous](../shortest-path-with-alternating-colors "Shortest Path with Alternating Colors") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-of-absolute-value-expression "Maximum of Absolute Value Expression") +[Next >](../maximum-of-absolute-value-expression "Maximum of Absolute Value Expression") ## [1130. Minimum Cost Tree From Leaf Values (Medium)](https://leetcode.com/problems/minimum-cost-tree-from-leaf-values "叶值的最小代价生成树") @@ -47,9 +47,9 @@ There are two possible trees. The first has non-leaf node sum 36, and the secon ### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Stack](../../tag/stack/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/minimum-depth-of-binary-tree/README.md b/problems/minimum-depth-of-binary-tree/README.md index 0234cc0b0..9fc183496 100644 --- a/problems/minimum-depth-of-binary-tree/README.md +++ b/problems/minimum-depth-of-binary-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/balanced-binary-tree "Balanced Binary Tree") +[< Previous](../balanced-binary-tree "Balanced Binary Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/path-sum "Path Sum") +[Next >](../path-sum "Path Sum") ## [111. Minimum Depth of Binary Tree (Easy)](https://leetcode.com/problems/minimum-depth-of-binary-tree "二叉树的最小深度") @@ -31,10 +31,10 @@

return its minimum depth = 2.

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] ### Similar Questions - 1. [Binary Tree Level Order Traversal](https://github.com/openset/leetcode/tree/master/problems/binary-tree-level-order-traversal) (Medium) - 1. [Maximum Depth of Binary Tree](https://github.com/openset/leetcode/tree/master/problems/maximum-depth-of-binary-tree) (Easy) + 1. [Binary Tree Level Order Traversal](../binary-tree-level-order-traversal) (Medium) + 1. [Maximum Depth of Binary Tree](../maximum-depth-of-binary-tree) (Easy) diff --git a/problems/minimum-distance-between-bst-nodes/README.md b/problems/minimum-distance-between-bst-nodes/README.md index 21bd2bd95..8f741919d 100644 --- a/problems/minimum-distance-between-bst-nodes/README.md +++ b/problems/minimum-distance-between-bst-nodes/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/transform-to-chessboard "Transform to Chessboard") +[< Previous](../transform-to-chessboard "Transform to Chessboard") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/letter-case-permutation "Letter Case Permutation") +[Next >](../letter-case-permutation "Letter Case Permutation") ## [783. Minimum Distance Between BST Nodes (Easy)](https://leetcode.com/problems/minimum-distance-between-bst-nodes "二叉搜索树结点最小距离") @@ -40,8 +40,8 @@ while the minimum difference in this tree is 1, it occurs between node 1 and nod ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Recursion](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Recursion](../../tag/recursion/README.md)] ### Similar Questions - 1. [Binary Tree Inorder Traversal](https://github.com/openset/leetcode/tree/master/problems/binary-tree-inorder-traversal) (Medium) + 1. [Binary Tree Inorder Traversal](../binary-tree-inorder-traversal) (Medium) diff --git a/problems/minimum-domino-rotations-for-equal-row/README.md b/problems/minimum-domino-rotations-for-equal-row/README.md index f0217fceb..a408778be 100644 --- a/problems/minimum-domino-rotations-for-equal-row/README.md +++ b/problems/minimum-domino-rotations-for-equal-row/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/clumsy-factorial "Clumsy Factorial") +[< Previous](../clumsy-factorial "Clumsy Factorial") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/construct-binary-search-tree-from-preorder-traversal "Construct Binary Search Tree from Preorder Traversal") +[Next >](../construct-binary-search-tree-from-preorder-traversal "Construct Binary Search Tree from Preorder Traversal") ## [1007. Minimum Domino Rotations For Equal Row (Medium)](https://leetcode.com/problems/minimum-domino-rotations-for-equal-row "行相等的最少多米诺旋转") @@ -52,5 +52,5 @@ In this case, it is not possible to rotate the dominoes to make one row of value ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[Array](../../tag/array/README.md)] diff --git a/problems/minimum-factorization/README.md b/problems/minimum-factorization/README.md index 202446a33..86bb32c98 100644 --- a/problems/minimum-factorization/README.md +++ b/problems/minimum-factorization/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-distance-in-arrays "Maximum Distance in Arrays") +[< Previous](../maximum-distance-in-arrays "Maximum Distance in Arrays") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/exchange-seats "Exchange Seats") +[Next >](../exchange-seats "Exchange Seats") ## [625. Minimum Factorization (Medium)](https://leetcode.com/problems/minimum-factorization "最小因式分解") @@ -34,5 +34,5 @@ Output:

### Related Topics - [[Recursion](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Recursion](../../tag/recursion/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/minimum-falling-path-sum-ii/README.md b/problems/minimum-falling-path-sum-ii/README.md index 7a123ac89..8c006aab0 100644 --- a/problems/minimum-falling-path-sum-ii/README.md +++ b/problems/minimum-falling-path-sum-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/remove-covered-intervals "Remove Covered Intervals") +[< Previous](../remove-covered-intervals "Remove Covered Intervals") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/convert-binary-number-in-a-linked-list-to-integer "Convert Binary Number in a Linked List to Integer") +[Next >](../convert-binary-number-in-a-linked-list-to-integer "Convert Binary Number in a Linked List to Integer") ## [1289. Minimum Falling Path Sum II (Hard)](https://leetcode.com/problems/minimum-falling-path-sum-ii "下降路径最小和 II") @@ -38,7 +38,7 @@ The falling path with the smallest sum is [1,5,7], so the answer is 13 ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/minimum-falling-path-sum/README.md b/problems/minimum-falling-path-sum/README.md index 59f722bd0..536824f88 100644 --- a/problems/minimum-falling-path-sum/README.md +++ b/problems/minimum-falling-path-sum/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/binary-subarrays-with-sum "Binary Subarrays With Sum") +[< Previous](../binary-subarrays-with-sum "Binary Subarrays With Sum") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/beautiful-array "Beautiful Array") +[Next >](../beautiful-array "Beautiful Array") ## [931. Minimum Falling Path Sum (Medium)](https://leetcode.com/problems/minimum-falling-path-sum "下降路径最小和") @@ -44,4 +44,4 @@ The possible falling paths are: ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/minimum-genetic-mutation/README.md b/problems/minimum-genetic-mutation/README.md index d3451b97b..9ebb42a3c 100644 --- a/problems/minimum-genetic-mutation/README.md +++ b/problems/minimum-genetic-mutation/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/all-oone-data-structure "All O`one Data Structure") +[< Previous](../all-oone-data-structure "All O`one Data Structure") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-segments-in-a-string "Number of Segments in a String") +[Next >](../number-of-segments-in-a-string "Number of Segments in a String") ## [433. Minimum Genetic Mutation (Medium)](https://leetcode.com/problems/minimum-genetic-mutation "最小基因变化") @@ -68,4 +68,4 @@ return: 3

 

### Similar Questions - 1. [Word Ladder](https://github.com/openset/leetcode/tree/master/problems/word-ladder) (Medium) + 1. [Word Ladder](../word-ladder) (Medium) diff --git a/problems/minimum-height-trees/README.md b/problems/minimum-height-trees/README.md index 3450ea3dd..6202f1d64 100644 --- a/problems/minimum-height-trees/README.md +++ b/problems/minimum-height-trees/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-with-cooldown "Best Time to Buy and Sell Stock with Cooldown") +[< Previous](../best-time-to-buy-and-sell-stock-with-cooldown "Best Time to Buy and Sell Stock with Cooldown") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/sparse-matrix-multiplication "Sparse Matrix Multiplication") +[Next >](../sparse-matrix-multiplication "Sparse Matrix Multiplication") ## [310. Minimum Height Trees (Medium)](https://leetcode.com/problems/minimum-height-trees "最小高度树") @@ -55,12 +55,12 @@ The graph contains n nodes which are labeled from 0 to ### Related Topics - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] + [[Graph](../../tag/graph/README.md)] ### Similar Questions - 1. [Course Schedule](https://github.com/openset/leetcode/tree/master/problems/course-schedule) (Medium) - 1. [Course Schedule II](https://github.com/openset/leetcode/tree/master/problems/course-schedule-ii) (Medium) + 1. [Course Schedule](../course-schedule) (Medium) + 1. [Course Schedule II](../course-schedule-ii) (Medium) ### Hints
diff --git a/problems/minimum-increment-to-make-array-unique/README.md b/problems/minimum-increment-to-make-array-unique/README.md index 2fc7fc30c..dbdd57096 100644 --- a/problems/minimum-increment-to-make-array-unique/README.md +++ b/problems/minimum-increment-to-make-array-unique/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/delete-columns-to-make-sorted "Delete Columns to Make Sorted") +[< Previous](../delete-columns-to-make-sorted "Delete Columns to Make Sorted") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/validate-stack-sequences "Validate Stack Sequences") +[Next >](../validate-stack-sequences "Validate Stack Sequences") ## [945. Minimum Increment to Make Array Unique (Medium)](https://leetcode.com/problems/minimum-increment-to-make-array-unique "使数组唯一的最小增量") @@ -50,4 +50,4 @@ It can be shown with 5 or less moves that it is impossible for the array to have ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] diff --git a/problems/minimum-index-sum-of-two-lists/README.md b/problems/minimum-index-sum-of-two-lists/README.md index 25728b723..6b4ef8820 100644 --- a/problems/minimum-index-sum-of-two-lists/README.md +++ b/problems/minimum-index-sum-of-two-lists/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/range-addition-ii "Range Addition II") +[< Previous](../range-addition-ii "Range Addition II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/non-negative-integers-without-consecutive-ones "Non-negative Integers without Consecutive Ones") +[Next >](../non-negative-integers-without-consecutive-ones "Non-negative Integers without Consecutive Ones") ## [599. Minimum Index Sum of Two Lists (Easy)](https://leetcode.com/problems/minimum-index-sum-of-two-lists "两个列表的最小索引总和") @@ -50,7 +50,7 @@ You need to help them find out their common interest with the least li

### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Intersection of Two Linked Lists](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-linked-lists) (Easy) + 1. [Intersection of Two Linked Lists](../intersection-of-two-linked-lists) (Easy) diff --git a/problems/minimum-knight-moves/README.md b/problems/minimum-knight-moves/README.md index 0a4623afd..0b43fe231 100644 --- a/problems/minimum-knight-moves/README.md +++ b/problems/minimum-knight-moves/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/how-many-apples-can-you-put-into-the-basket "How Many Apples Can You Put into the Basket") +[< Previous](../how-many-apples-can-you-put-into-the-basket "How Many Apples Can You Put into the Basket") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-smallest-common-element-in-all-rows "Find Smallest Common Element in All Rows") +[Next >](../find-smallest-common-element-in-all-rows "Find Smallest Common Element in All Rows") ## [1197. Minimum Knight Moves (Medium)](https://leetcode.com/problems/minimum-knight-moves "进击的骑士") @@ -44,7 +44,7 @@ ### Related Topics - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] ### Hints
diff --git a/problems/minimum-moves-to-equal-array-elements-ii/README.md b/problems/minimum-moves-to-equal-array-elements-ii/README.md index 6572a4bcf..47179a8ba 100644 --- a/problems/minimum-moves-to-equal-array-elements-ii/README.md +++ b/problems/minimum-moves-to-equal-array-elements-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/hamming-distance "Hamming Distance") +[< Previous](../hamming-distance "Hamming Distance") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/island-perimeter "Island Perimeter") +[Next >](../island-perimeter "Island Perimeter") ## [462. Minimum Moves to Equal Array Elements II (Medium)](https://leetcode.com/problems/minimum-moves-to-equal-array-elements-ii "最少移动次数使数组元素相等 II") @@ -31,8 +31,8 @@ Only two moves are needed (remember each move increments or decrements one eleme

### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Best Meeting Point](https://github.com/openset/leetcode/tree/master/problems/best-meeting-point) (Hard) - 1. [Minimum Moves to Equal Array Elements](https://github.com/openset/leetcode/tree/master/problems/minimum-moves-to-equal-array-elements) (Easy) + 1. [Best Meeting Point](../best-meeting-point) (Hard) + 1. [Minimum Moves to Equal Array Elements](../minimum-moves-to-equal-array-elements) (Easy) diff --git a/problems/minimum-moves-to-equal-array-elements/README.md b/problems/minimum-moves-to-equal-array-elements/README.md index a26167733..30e37eeb0 100644 --- a/problems/minimum-moves-to-equal-array-elements/README.md +++ b/problems/minimum-moves-to-equal-array-elements/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-number-of-arrows-to-burst-balloons "Minimum Number of Arrows to Burst Balloons") +[< Previous](../minimum-number-of-arrows-to-burst-balloons "Minimum Number of Arrows to Burst Balloons") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/4sum-ii "4Sum II") +[Next >](../4sum-ii "4Sum II") ## [453. Minimum Moves to Equal Array Elements (Easy)](https://leetcode.com/problems/minimum-moves-to-equal-array-elements "最小移动次数使数组元素相等") @@ -29,7 +29,7 @@ Only three moves are needed (remember each move increments two elements):

### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Minimum Moves to Equal Array Elements II](https://github.com/openset/leetcode/tree/master/problems/minimum-moves-to-equal-array-elements-ii) (Medium) + 1. [Minimum Moves to Equal Array Elements II](../minimum-moves-to-equal-array-elements-ii) (Medium) diff --git a/problems/minimum-moves-to-move-a-box-to-their-target-location/README.md b/problems/minimum-moves-to-move-a-box-to-their-target-location/README.md index 9aedc534b..0937eb1f3 100644 --- a/problems/minimum-moves-to-move-a-box-to-their-target-location/README.md +++ b/problems/minimum-moves-to-move-a-box-to-their-target-location/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/greatest-sum-divisible-by-three "Greatest Sum Divisible by Three") +[< Previous](../greatest-sum-divisible-by-three "Greatest Sum Divisible by Three") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/page-recommendations "Page Recommendations") +[Next >](../page-recommendations "Page Recommendations") ## [1263. Minimum Moves to Move a Box to Their Target Location (Hard)](https://leetcode.com/problems/minimum-moves-to-move-a-box-to-their-target-location "推箱子") @@ -90,7 +90,7 @@ ### Related Topics - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] ### Hints
diff --git a/problems/minimum-moves-to-reach-target-with-rotations/README.md b/problems/minimum-moves-to-reach-target-with-rotations/README.md index 6ecbdc7b7..ca126f85c 100644 --- a/problems/minimum-moves-to-reach-target-with-rotations/README.md +++ b/problems/minimum-moves-to-reach-target-with-rotations/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/remove-all-adjacent-duplicates-in-string-ii "Remove All Adjacent Duplicates in String II") +[< Previous](../remove-all-adjacent-duplicates-in-string-ii "Remove All Adjacent Duplicates in String II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/queries-quality-and-percentage "Queries Quality and Percentage") +[Next >](../queries-quality-and-percentage "Queries Quality and Percentage") ## [1210. Minimum Moves to Reach Target with Rotations (Hard)](https://leetcode.com/problems/minimum-moves-to-reach-target-with-rotations "穿过迷宫的最少移动次数") @@ -67,7 +67,7 @@ ### Related Topics - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] ### Hints
diff --git a/problems/minimum-number-of-arrows-to-burst-balloons/README.md b/problems/minimum-number-of-arrows-to-burst-balloons/README.md index 492f9f2fa..a42411d06 100644 --- a/problems/minimum-number-of-arrows-to-burst-balloons/README.md +++ b/problems/minimum-number-of-arrows-to-burst-balloons/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/sort-characters-by-frequency "Sort Characters By Frequency") +[< Previous](../sort-characters-by-frequency "Sort Characters By Frequency") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-moves-to-equal-array-elements "Minimum Moves to Equal Array Elements") +[Next >](../minimum-moves-to-equal-array-elements "Minimum Moves to Equal Array Elements") ## [452. Minimum Number of Arrows to Burst Balloons (Medium)](https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons "用最少数量的箭引爆气球") @@ -31,8 +31,8 @@ One way is to shoot one arrow for example at x = 6 (bursting the balloons [2,8]

 

### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] + [[Greedy](../../tag/greedy/README.md)] ### Similar Questions - 1. [Meeting Rooms II](https://github.com/openset/leetcode/tree/master/problems/meeting-rooms-ii) (Medium) - 1. [Non-overlapping Intervals](https://github.com/openset/leetcode/tree/master/problems/non-overlapping-intervals) (Medium) + 1. [Meeting Rooms II](../meeting-rooms-ii) (Medium) + 1. [Non-overlapping Intervals](../non-overlapping-intervals) (Medium) diff --git a/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix/README.md b/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix/README.md index 1221df4e1..f9be56862 100644 --- a/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix/README.md +++ b/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-the-smallest-divisor-given-a-threshold "Find the Smallest Divisor Given a Threshold") +[< Previous](../find-the-smallest-divisor-given-a-threshold "Find the Smallest Divisor Given a Threshold") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-the-start-and-end-number-of-continuous-ranges "Find the Start and End Number of Continuous Ranges") +[Next >](../find-the-start-and-end-number-of-continuous-ranges "Find the Start and End Number of Continuous Ranges") ## [1284. Minimum Number of Flips to Convert Binary Matrix to Zero Matrix (Hard)](https://leetcode.com/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix "转化为全零矩阵的最少反转次数") @@ -63,7 +63,7 @@ ### Related Topics - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] ### Hints
diff --git a/problems/minimum-number-of-k-consecutive-bit-flips/README.md b/problems/minimum-number-of-k-consecutive-bit-flips/README.md index ca7d138f4..3367943f7 100644 --- a/problems/minimum-number-of-k-consecutive-bit-flips/README.md +++ b/problems/minimum-number-of-k-consecutive-bit-flips/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/rotting-oranges "Rotting Oranges") +[< Previous](../rotting-oranges "Rotting Oranges") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-squareful-arrays "Number of Squareful Arrays") +[Next >](../number-of-squareful-arrays "Number of Squareful Arrays") ## [995. Minimum Number of K Consecutive Bit Flips (Hard)](https://leetcode.com/problems/minimum-number-of-k-consecutive-bit-flips "K 连续位的最小翻转次数") @@ -58,8 +58,8 @@ Flip A[5],A[6],A[7]: A becomes [1,1,1,1,1,1,1,1] ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[Sliding Window](../../tag/sliding-window/README.md)] ### Similar Questions - 1. [Bulb Switcher](https://github.com/openset/leetcode/tree/master/problems/bulb-switcher) (Medium) + 1. [Bulb Switcher](../bulb-switcher) (Medium) diff --git a/problems/minimum-number-of-refueling-stops/README.md b/problems/minimum-number-of-refueling-stops/README.md index 8ba37043f..fc29e86d9 100644 --- a/problems/minimum-number-of-refueling-stops/README.md +++ b/problems/minimum-number-of-refueling-stops/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/advantage-shuffle "Advantage Shuffle") +[< Previous](../advantage-shuffle "Advantage Shuffle") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/leaf-similar-trees "Leaf-Similar Trees") +[Next >](../leaf-similar-trees "Leaf-Similar Trees") ## [871. Minimum Number of Refueling Stops (Hard)](https://leetcode.com/problems/minimum-number-of-refueling-stops "最低加油次数") @@ -71,5 +71,5 @@ We made 2 refueling stops along the way, so we return 2. ### Related Topics - [[Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Heap](../../tag/heap/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/minimum-path-sum/README.md b/problems/minimum-path-sum/README.md index 33ef4a067..43de41172 100644 --- a/problems/minimum-path-sum/README.md +++ b/problems/minimum-path-sum/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/unique-paths-ii "Unique Paths II") +[< Previous](../unique-paths-ii "Unique Paths II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/valid-number "Valid Number") +[Next >](../valid-number "Valid Number") ## [64. Minimum Path Sum (Medium)](https://leetcode.com/problems/minimum-path-sum "最小路径和") @@ -29,10 +29,10 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Array](../../tag/array/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Unique Paths](https://github.com/openset/leetcode/tree/master/problems/unique-paths) (Medium) - 1. [Dungeon Game](https://github.com/openset/leetcode/tree/master/problems/dungeon-game) (Hard) - 1. [Cherry Pickup](https://github.com/openset/leetcode/tree/master/problems/cherry-pickup) (Hard) + 1. [Unique Paths](../unique-paths) (Medium) + 1. [Dungeon Game](../dungeon-game) (Hard) + 1. [Cherry Pickup](../cherry-pickup) (Hard) diff --git a/problems/minimum-remove-to-make-valid-parentheses/README.md b/problems/minimum-remove-to-make-valid-parentheses/README.md index 80f9dd68c..a8280751f 100644 --- a/problems/minimum-remove-to-make-valid-parentheses/README.md +++ b/problems/minimum-remove-to-make-valid-parentheses/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/count-number-of-nice-subarrays "Count Number of Nice Subarrays") +[< Previous](../count-number-of-nice-subarrays "Count Number of Nice Subarrays") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/check-if-it-is-a-good-array "Check If It Is a Good Array") +[Next >](../check-if-it-is-a-good-array "Check If It Is a Good Array") ## [1249. Minimum Remove to Make Valid Parentheses (Medium)](https://leetcode.com/problems/minimum-remove-to-make-valid-parentheses "移除无效的括号") @@ -63,8 +63,8 @@ ### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Stack](../../tag/stack/README.md)] + [[String](../../tag/string/README.md)] ### Hints
diff --git a/problems/minimum-score-triangulation-of-polygon/README.md b/problems/minimum-score-triangulation-of-polygon/README.md index df0e59edb..4ac0645ed 100644 --- a/problems/minimum-score-triangulation-of-polygon/README.md +++ b/problems/minimum-score-triangulation-of-polygon/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/binary-search-tree-to-greater-sum-tree "Binary Search Tree to Greater Sum Tree") +[< Previous](../binary-search-tree-to-greater-sum-tree "Binary Search Tree to Greater Sum Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/moving-stones-until-consecutive-ii "Moving Stones Until Consecutive II") +[Next >](../moving-stones-until-consecutive-ii "Moving Stones Until Consecutive II") ## [1039. Minimum Score Triangulation of Polygon (Medium)](https://leetcode.com/problems/minimum-score-triangulation-of-polygon "多边形三角剖分的最低得分") @@ -64,7 +64,7 @@ ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/minimum-size-subarray-sum/README.md b/problems/minimum-size-subarray-sum/README.md index d6b8e034c..ea6678920 100644 --- a/problems/minimum-size-subarray-sum/README.md +++ b/problems/minimum-size-subarray-sum/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/implement-trie-prefix-tree "Implement Trie (Prefix Tree)") +[< Previous](../implement-trie-prefix-tree "Implement Trie (Prefix Tree)") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/course-schedule-ii "Course Schedule II") +[Next >](../course-schedule-ii "Course Schedule II") ## [209. Minimum Size Subarray Sum (Medium)](https://leetcode.com/problems/minimum-size-subarray-sum "长度最小的子数组") @@ -25,11 +25,11 @@
If you have figured out the O(n) solution, try coding another solution of which the time complexity is O(n log n). 
### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Array](../../tag/array/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [Minimum Window Substring](https://github.com/openset/leetcode/tree/master/problems/minimum-window-substring) (Hard) - 1. [Maximum Size Subarray Sum Equals k](https://github.com/openset/leetcode/tree/master/problems/maximum-size-subarray-sum-equals-k) (Medium) - 1. [Maximum Length of Repeated Subarray](https://github.com/openset/leetcode/tree/master/problems/maximum-length-of-repeated-subarray) (Medium) + 1. [Minimum Window Substring](../minimum-window-substring) (Hard) + 1. [Maximum Size Subarray Sum Equals k](../maximum-size-subarray-sum-equals-k) (Medium) + 1. [Maximum Length of Repeated Subarray](../maximum-length-of-repeated-subarray) (Medium) diff --git a/problems/minimum-swaps-to-group-all-1s-together/README.md b/problems/minimum-swaps-to-group-all-1s-together/README.md index 3095e7ca8..4035377a3 100644 --- a/problems/minimum-swaps-to-group-all-1s-together/README.md +++ b/problems/minimum-swaps-to-group-all-1s-together/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/check-if-a-number-is-majority-element-in-a-sorted-array "Check If a Number Is Majority Element in a Sorted Array") +[< Previous](../check-if-a-number-is-majority-element-in-a-sorted-array "Check If a Number Is Majority Element in a Sorted Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/analyze-user-website-visit-pattern "Analyze User Website Visit Pattern") +[Next >](../analyze-user-website-visit-pattern "Analyze User Website Visit Pattern") ## [1151. Minimum Swaps to Group All 1's Together (Medium)](https://leetcode.com/problems/minimum-swaps-to-group-all-1s-together "最少交换次数来组合所有的 1") @@ -56,8 +56,8 @@ One possible solution that uses 3 swaps is [0,0,0,0,0,1,1,1,1,1,1]. ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] + [[Array](../../tag/array/README.md)] + [[Sliding Window](../../tag/sliding-window/README.md)] ### Hints
diff --git a/problems/minimum-swaps-to-make-sequences-increasing/README.md b/problems/minimum-swaps-to-make-sequences-increasing/README.md index a325cdd42..4f22e38ab 100644 --- a/problems/minimum-swaps-to-make-sequences-increasing/README.md +++ b/problems/minimum-swaps-to-make-sequences-increasing/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/similar-rgb-color "Similar RGB Color") +[< Previous](../similar-rgb-color "Similar RGB Color") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-eventual-safe-states "Find Eventual Safe States") +[Next >](../find-eventual-safe-states "Find Eventual Safe States") ## [801. Minimum Swaps To Make Sequences Increasing (Medium)](https://leetcode.com/problems/minimum-swaps-to-make-sequences-increasing "使序列递增的最小交换次数") @@ -37,4 +37,4 @@ which are both strictly increasing. ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/minimum-swaps-to-make-strings-equal/README.md b/problems/minimum-swaps-to-make-strings-equal/README.md index ec77e4cf2..420c6a2bd 100644 --- a/problems/minimum-swaps-to-make-strings-equal/README.md +++ b/problems/minimum-swaps-to-make-strings-equal/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/palindrome-removal "Palindrome Removal") +[< Previous](../palindrome-removal "Palindrome Removal") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/count-number-of-nice-subarrays "Count Number of Nice Subarrays") +[Next >](../count-number-of-nice-subarrays "Count Number of Nice Subarrays") ## [1247. Minimum Swaps to Make Strings Equal (Medium)](https://leetcode.com/problems/minimum-swaps-to-make-strings-equal "交换字符使得字符串相同") @@ -57,8 +57,8 @@ Note that you can't swap s1[0] and s1[1] to make s1 equal to "yx", ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[String](../../tag/string/README.md)] ### Hints
diff --git a/problems/minimum-time-difference/README.md b/problems/minimum-time-difference/README.md index e57eba38c..6610069b1 100644 --- a/problems/minimum-time-difference/README.md +++ b/problems/minimum-time-difference/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/convert-bst-to-greater-tree "Convert BST to Greater Tree") +[< Previous](../convert-bst-to-greater-tree "Convert BST to Greater Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/single-element-in-a-sorted-array "Single Element in a Sorted Array") +[Next >](../single-element-in-a-sorted-array "Single Element in a Sorted Array") ## [539. Minimum Time Difference (Medium)](https://leetcode.com/problems/minimum-time-difference "最小时间差") @@ -28,4 +28,4 @@ Given a list of 24-hour clock time points in "Hour:Minutes" format, find the min

### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/minimum-time-to-build-blocks/README.md b/problems/minimum-time-to-build-blocks/README.md index 3f1d304dd..b8c54d002 100644 --- a/problems/minimum-time-to-build-blocks/README.md +++ b/problems/minimum-time-to-build-blocks/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-smallest-common-element-in-all-rows "Find Smallest Common Element in All Rows") +[< Previous](../find-smallest-common-element-in-all-rows "Find Smallest Common Element in All Rows") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-absolute-difference "Minimum Absolute Difference") +[Next >](../minimum-absolute-difference "Minimum Absolute Difference") ## [1199. Minimum Time to Build Blocks (Hard)](https://leetcode.com/problems/minimum-time-to-build-blocks "建造街区的最短时间") @@ -58,8 +58,8 @@ The cost is 1 + max(3, 1 + max(1, 2)) = 4. ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Math](../../tag/math/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/minimum-time-visiting-all-points/README.md b/problems/minimum-time-visiting-all-points/README.md index e8994e908..bd6d6dc5f 100644 --- a/problems/minimum-time-visiting-all-points/README.md +++ b/problems/minimum-time-visiting-all-points/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/print-immutable-linked-list-in-reverse "Print Immutable Linked List in Reverse") +[< Previous](../print-immutable-linked-list-in-reverse "Print Immutable Linked List in Reverse") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/count-servers-that-communicate "Count Servers that Communicate") +[Next >](../count-servers-that-communicate "Count Servers that Communicate") ## [1266. Minimum Time Visiting All Points (Easy)](https://leetcode.com/problems/minimum-time-visiting-all-points "访问所有点的最小时间") @@ -49,8 +49,8 @@ Total time = 7 seconds ### Related Topics - [[Geometry](https://github.com/openset/leetcode/tree/master/tag/geometry/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Geometry](../../tag/geometry/README.md)] + [[Array](../../tag/array/README.md)] ### Hints
diff --git a/problems/minimum-unique-word-abbreviation/README.md b/problems/minimum-unique-word-abbreviation/README.md index 9a19da69c..26b1ecb05 100644 --- a/problems/minimum-unique-word-abbreviation/README.md +++ b/problems/minimum-unique-word-abbreviation/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/split-array-largest-sum "Split Array Largest Sum") +[< Previous](../split-array-largest-sum "Split Array Largest Sum") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/fizz-buzz "Fizz Buzz") +[Next >](../fizz-buzz "Fizz Buzz") ## [411. Minimum Unique Word Abbreviation (Hard)](https://leetcode.com/problems/minimum-unique-word-abbreviation "最短特异单词缩写") @@ -36,10 +36,10 @@

### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Generalized Abbreviation](https://github.com/openset/leetcode/tree/master/problems/generalized-abbreviation) (Medium) - 1. [Valid Word Abbreviation](https://github.com/openset/leetcode/tree/master/problems/valid-word-abbreviation) (Easy) - 1. [Word Abbreviation](https://github.com/openset/leetcode/tree/master/problems/word-abbreviation) (Hard) + 1. [Generalized Abbreviation](../generalized-abbreviation) (Medium) + 1. [Valid Word Abbreviation](../valid-word-abbreviation) (Easy) + 1. [Word Abbreviation](../word-abbreviation) (Hard) diff --git a/problems/minimum-window-subsequence/README.md b/problems/minimum-window-subsequence/README.md index d822f47b1..ce91c1346 100644 --- a/problems/minimum-window-subsequence/README.md +++ b/problems/minimum-window-subsequence/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/number-of-atoms "Number of Atoms") +[< Previous](../number-of-atoms "Number of Atoms") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/self-dividing-numbers "Self Dividing Numbers") +[Next >](../self-dividing-numbers "Self Dividing Numbers") ## [727. Minimum Window Subsequence (Hard)](https://leetcode.com/problems/minimum-window-subsequence "最小窗口子序列") @@ -39,12 +39,12 @@ S = "abcdebdde", T = "bde"

 

### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] - [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] + [[Sliding Window](../../tag/sliding-window/README.md)] ### Similar Questions - 1. [Minimum Window Substring](https://github.com/openset/leetcode/tree/master/problems/minimum-window-substring) (Hard) - 1. [Longest Continuous Increasing Subsequence](https://github.com/openset/leetcode/tree/master/problems/longest-continuous-increasing-subsequence) (Easy) + 1. [Minimum Window Substring](../minimum-window-substring) (Hard) + 1. [Longest Continuous Increasing Subsequence](../longest-continuous-increasing-subsequence) (Easy) ### Hints
diff --git a/problems/minimum-window-substring/README.md b/problems/minimum-window-substring/README.md index 4f1d665f8..fd1081335 100644 --- a/problems/minimum-window-substring/README.md +++ b/problems/minimum-window-substring/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/sort-colors "Sort Colors") +[< Previous](../sort-colors "Sort Colors") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/combinations "Combinations") +[Next >](../combinations "Combinations") ## [76. Minimum Window Substring (Hard)](https://leetcode.com/problems/minimum-window-substring "最小覆盖子串") @@ -28,17 +28,17 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] - [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] + [[String](../../tag/string/README.md)] + [[Sliding Window](../../tag/sliding-window/README.md)] ### Similar Questions - 1. [Substring with Concatenation of All Words](https://github.com/openset/leetcode/tree/master/problems/substring-with-concatenation-of-all-words) (Hard) - 1. [Minimum Size Subarray Sum](https://github.com/openset/leetcode/tree/master/problems/minimum-size-subarray-sum) (Medium) - 1. [Sliding Window Maximum](https://github.com/openset/leetcode/tree/master/problems/sliding-window-maximum) (Hard) - 1. [Permutation in String](https://github.com/openset/leetcode/tree/master/problems/permutation-in-string) (Medium) - 1. [Minimum Window Subsequence](https://github.com/openset/leetcode/tree/master/problems/minimum-window-subsequence) (Hard) + 1. [Substring with Concatenation of All Words](../substring-with-concatenation-of-all-words) (Hard) + 1. [Minimum Size Subarray Sum](../minimum-size-subarray-sum) (Medium) + 1. [Sliding Window Maximum](../sliding-window-maximum) (Hard) + 1. [Permutation in String](../permutation-in-string) (Medium) + 1. [Minimum Window Subsequence](../minimum-window-subsequence) (Hard) ### Hints
diff --git a/problems/mirror-reflection/README.md b/problems/mirror-reflection/README.md index e8770f848..69343a8cb 100644 --- a/problems/mirror-reflection/README.md +++ b/problems/mirror-reflection/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-cost-to-hire-k-workers "Minimum Cost to Hire K Workers") +[< Previous](../minimum-cost-to-hire-k-workers "Minimum Cost to Hire K Workers") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/buddy-strings "Buddy Strings") +[Next >](../buddy-strings "Buddy Strings") ## [858. Mirror Reflection (Medium)](https://leetcode.com/problems/mirror-reflection "镜面反射") @@ -39,4 +39,4 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/missing-element-in-sorted-array/README.md b/problems/missing-element-in-sorted-array/README.md index 8f1e5714d..35b3c3c4b 100644 --- a/problems/missing-element-in-sorted-array/README.md +++ b/problems/missing-element-in-sorted-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/all-paths-from-source-lead-to-destination "All Paths from Source Lead to Destination") +[< Previous](../all-paths-from-source-lead-to-destination "All Paths from Source Lead to Destination") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/lexicographically-smallest-equivalent-string "Lexicographically Smallest Equivalent String") +[Next >](../lexicographically-smallest-equivalent-string "Lexicographically Smallest Equivalent String") ## [1060. Missing Element in Sorted Array (Medium)](https://leetcode.com/problems/missing-element-in-sorted-array "有序数组中的缺失元素") @@ -53,7 +53,7 @@ The missing numbers are [3,5,6,7,...], hence the third missing number is 6. ### Related Topics - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Hints
diff --git a/problems/missing-number-in-arithmetic-progression/README.md b/problems/missing-number-in-arithmetic-progression/README.md index 08ae794a8..24b33ae4b 100644 --- a/problems/missing-number-in-arithmetic-progression/README.md +++ b/problems/missing-number-in-arithmetic-progression/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/airplane-seat-assignment-probability "Airplane Seat Assignment Probability") +[< Previous](../airplane-seat-assignment-probability "Airplane Seat Assignment Probability") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/meeting-scheduler "Meeting Scheduler") +[Next >](../meeting-scheduler "Meeting Scheduler") ## [1228. Missing Number In Arithmetic Progression (Easy)](https://leetcode.com/problems/missing-number-in-arithmetic-progression "等差数列中缺失的数字") @@ -42,7 +42,7 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Hints
diff --git a/problems/missing-number/README.md b/problems/missing-number/README.md index 9ce156104..5e0fa0135 100644 --- a/problems/missing-number/README.md +++ b/problems/missing-number/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/palindrome-permutation-ii "Palindrome Permutation II") +[< Previous](../palindrome-permutation-ii "Palindrome Permutation II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/alien-dictionary "Alien Dictionary") +[Next >](../alien-dictionary "Alien Dictionary") ## [268. Missing Number (Easy)](https://leetcode.com/problems/missing-number "缺失数字") @@ -31,12 +31,12 @@ Your algorithm should run in linear runtime complexity. Could you implement it using only constant extra space complexity?

### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] + [[Array](../../tag/array/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [First Missing Positive](https://github.com/openset/leetcode/tree/master/problems/first-missing-positive) (Hard) - 1. [Single Number](https://github.com/openset/leetcode/tree/master/problems/single-number) (Easy) - 1. [Find the Duplicate Number](https://github.com/openset/leetcode/tree/master/problems/find-the-duplicate-number) (Medium) - 1. [Couples Holding Hands](https://github.com/openset/leetcode/tree/master/problems/couples-holding-hands) (Hard) + 1. [First Missing Positive](../first-missing-positive) (Hard) + 1. [Single Number](../single-number) (Easy) + 1. [Find the Duplicate Number](../find-the-duplicate-number) (Medium) + 1. [Couples Holding Hands](../couples-holding-hands) (Hard) diff --git a/problems/missing-ranges/README.md b/problems/missing-ranges/README.md index 02f3b9164..f99e5676f 100644 --- a/problems/missing-ranges/README.md +++ b/problems/missing-ranges/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-peak-element "Find Peak Element") +[< Previous](../find-peak-element "Find Peak Element") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-gap "Maximum Gap") +[Next >](../maximum-gap "Maximum Gap") ## [163. Missing Ranges (Medium)](https://leetcode.com/problems/missing-ranges "缺失的区间") @@ -21,7 +21,7 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Summary Ranges](https://github.com/openset/leetcode/tree/master/problems/summary-ranges) (Medium) + 1. [Summary Ranges](../summary-ranges) (Medium) diff --git a/problems/monotone-increasing-digits/README.md b/problems/monotone-increasing-digits/README.md index 43aac5455..6e9accb6d 100644 --- a/problems/monotone-increasing-digits/README.md +++ b/problems/monotone-increasing-digits/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/sentence-similarity-ii "Sentence Similarity II") +[< Previous](../sentence-similarity-ii "Sentence Similarity II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/daily-temperatures "Daily Temperatures") +[Next >](../daily-temperatures "Daily Temperatures") ## [738. Monotone Increasing Digits (Medium)](https://leetcode.com/problems/monotone-increasing-digits "单调递增的数字") @@ -43,10 +43,10 @@ Given a non-negative integer N, find the largest number that is les

### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] + [[Greedy](../../tag/greedy/README.md)] ### Similar Questions - 1. [Remove K Digits](https://github.com/openset/leetcode/tree/master/problems/remove-k-digits) (Medium) + 1. [Remove K Digits](../remove-k-digits) (Medium) ### Hints
diff --git a/problems/monotonic-array/README.md b/problems/monotonic-array/README.md index d3dd108be..000420821 100644 --- a/problems/monotonic-array/README.md +++ b/problems/monotonic-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-frequency-stack "Maximum Frequency Stack") +[< Previous](../maximum-frequency-stack "Maximum Frequency Stack") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/increasing-order-search-tree "Increasing Order Search Tree") +[Next >](../increasing-order-search-tree "Increasing Order Search Tree") ## [896. Monotonic Array (Easy)](https://leetcode.com/problems/monotonic-array "单调数列") @@ -77,4 +77,4 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] diff --git a/problems/monthly-transactions-i/README.md b/problems/monthly-transactions-i/README.md index 9f269e25a..d98080073 100644 --- a/problems/monthly-transactions-i/README.md +++ b/problems/monthly-transactions-i/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/critical-connections-in-a-network "Critical Connections in a Network") +[< Previous](../critical-connections-in-a-network "Critical Connections in a Network") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/tournament-winners "Tournament Winners") +[Next >](../tournament-winners "Tournament Winners") ## [1193. Monthly Transactions I (Medium)](https://leetcode.com/problems/monthly-transactions-i "每月交易 I") diff --git a/problems/monthly-transactions-ii/README.md b/problems/monthly-transactions-ii/README.md index ba8ed603e..a8c1b1b5c 100644 --- a/problems/monthly-transactions-ii/README.md +++ b/problems/monthly-transactions-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/last-person-to-fit-in-the-elevator "Last Person to Fit in the Elevator") +[< Previous](../last-person-to-fit-in-the-elevator "Last Person to Fit in the Elevator") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/design-skiplist "Design Skiplist") +[Next >](../design-skiplist "Design Skiplist") ## [1205. Monthly Transactions II (Medium)](https://leetcode.com/problems/monthly-transactions-ii "每月交易II") diff --git a/problems/most-common-word/README.md b/problems/most-common-word/README.md index ff2d8d755..f36586ff2 100644 --- a/problems/most-common-word/README.md +++ b/problems/most-common-word/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/race-car "Race Car") +[< Previous](../race-car "Race Car") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/short-encoding-of-words "Short Encoding of Words") +[Next >](../short-encoding-of-words "Short Encoding of Words") ## [819. Most Common Word (Easy)](https://leetcode.com/problems/most-common-word "最常见的单词") @@ -47,4 +47,4 @@ and that "hit" isn't the answer even though it occurs more because ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/most-frequent-subtree-sum/README.md b/problems/most-frequent-subtree-sum/README.md index 41294c4a6..7fd3f56ba 100644 --- a/problems/most-frequent-subtree-sum/README.md +++ b/problems/most-frequent-subtree-sum/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/perfect-number "Perfect Number") +[< Previous](../perfect-number "Perfect Number") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/fibonacci-number "Fibonacci Number") +[Next >](../fibonacci-number "Fibonacci Number") ## [508. Most Frequent Subtree Sum (Medium)](https://leetcode.com/problems/most-frequent-subtree-sum "出现次数最多的子树元素和") @@ -40,8 +40,8 @@ You may assume the sum of values in any subtree is in the range of 32-bit signed

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Subtree of Another Tree](https://github.com/openset/leetcode/tree/master/problems/subtree-of-another-tree) (Easy) + 1. [Subtree of Another Tree](../subtree-of-another-tree) (Easy) diff --git a/problems/most-profit-assigning-work/README.md b/problems/most-profit-assigning-work/README.md index f40a5dbad..9f990e5aa 100644 --- a/problems/most-profit-assigning-work/README.md +++ b/problems/most-profit-assigning-work/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/friends-of-appropriate-ages "Friends Of Appropriate Ages") +[< Previous](../friends-of-appropriate-ages "Friends Of Appropriate Ages") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/making-a-large-island "Making A Large Island") +[Next >](../making-a-large-island "Making A Large Island") ## [826. Most Profit Assigning Work (Medium)](https://leetcode.com/problems/most-profit-assigning-work "安排工作以达到最大收益") @@ -37,4 +37,4 @@ ### Related Topics - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] diff --git a/problems/most-stones-removed-with-same-row-or-column/README.md b/problems/most-stones-removed-with-same-row-or-column/README.md index 26a7a8e59..4be096fc6 100644 --- a/problems/most-stones-removed-with-same-row-or-column/README.md +++ b/problems/most-stones-removed-with-same-row-or-column/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/validate-stack-sequences "Validate Stack Sequences") +[< Previous](../validate-stack-sequences "Validate Stack Sequences") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/bag-of-tokens "Bag of Tokens") +[Next >](../bag-of-tokens "Bag of Tokens") ## [947. Most Stones Removed with Same Row or Column (Medium)](https://leetcode.com/problems/most-stones-removed-with-same-row-or-column "移除最多的同行或同列石头") @@ -56,5 +56,5 @@ ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Union Find](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Union Find](../../tag/union-find/README.md)] diff --git a/problems/move-zeroes/README.md b/problems/move-zeroes/README.md index f2ea21b89..855dd078e 100644 --- a/problems/move-zeroes/README.md +++ b/problems/move-zeroes/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/expression-add-operators "Expression Add Operators") +[< Previous](../expression-add-operators "Expression Add Operators") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/peeking-iterator "Peeking Iterator") +[Next >](../peeking-iterator "Peeking Iterator") ## [283. Move Zeroes (Easy)](https://leetcode.com/problems/move-zeroes "移动零") @@ -27,11 +27,11 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Array](../../tag/array/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] ### Similar Questions - 1. [Remove Element](https://github.com/openset/leetcode/tree/master/problems/remove-element) (Easy) + 1. [Remove Element](../remove-element) (Easy) ### Hints
diff --git a/problems/moving-average-from-data-stream/README.md b/problems/moving-average-from-data-stream/README.md index 42d99a260..36caea0c6 100644 --- a/problems/moving-average-from-data-stream/README.md +++ b/problems/moving-average-from-data-stream/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/reverse-vowels-of-a-string "Reverse Vowels of a String") +[< Previous](../reverse-vowels-of-a-string "Reverse Vowels of a String") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/top-k-frequent-elements "Top K Frequent Elements") +[Next >](../top-k-frequent-elements "Top K Frequent Elements") ## [346. Moving Average from Data Stream (Easy)](https://leetcode.com/problems/moving-average-from-data-stream "数据流中的移动平均值") @@ -26,5 +26,5 @@ m.next(5) = (10 + 3 + 5) / 3

 

### Related Topics - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] - [[Queue](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)] + [[Design](../../tag/design/README.md)] + [[Queue](../../tag/queue/README.md)] diff --git a/problems/moving-stones-until-consecutive-ii/README.md b/problems/moving-stones-until-consecutive-ii/README.md index 9c27bf2c5..28c71a038 100644 --- a/problems/moving-stones-until-consecutive-ii/README.md +++ b/problems/moving-stones-until-consecutive-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-score-triangulation-of-polygon "Minimum Score Triangulation of Polygon") +[< Previous](../minimum-score-triangulation-of-polygon "Minimum Score Triangulation of Polygon") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/robot-bounded-in-circle "Robot Bounded In Circle") +[Next >](../robot-bounded-in-circle "Robot Bounded In Circle") ## [1040. Moving Stones Until Consecutive II (Medium)](https://leetcode.com/problems/moving-stones-until-consecutive-ii "移动石子直到连续 II") @@ -70,8 +70,8 @@ Notice we cannot move 10 -> 2 to finish the game, because that would be an il ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] + [[Array](../../tag/array/README.md)] + [[Sliding Window](../../tag/sliding-window/README.md)] ### Hints
diff --git a/problems/moving-stones-until-consecutive/README.md b/problems/moving-stones-until-consecutive/README.md index 327286c92..9f8c452b1 100644 --- a/problems/moving-stones-until-consecutive/README.md +++ b/problems/moving-stones-until-consecutive/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/stream-of-characters "Stream of Characters") +[< Previous](../stream-of-characters "Stream of Characters") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/coloring-a-border "Coloring A Border") +[Next >](../coloring-a-border "Coloring A Border") ## [1033. Moving Stones Until Consecutive (Easy)](https://leetcode.com/problems/moving-stones-until-consecutive "移动石子直到连续") @@ -69,7 +69,7 @@ ### Related Topics - [[Brainteaser](https://github.com/openset/leetcode/tree/master/tag/brainteaser/README.md)] + [[Brainteaser](../../tag/brainteaser/README.md)] ### Hints
diff --git a/problems/multiply-strings/README.md b/problems/multiply-strings/README.md index 424c34457..28290addf 100644 --- a/problems/multiply-strings/README.md +++ b/problems/multiply-strings/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/trapping-rain-water "Trapping Rain Water") +[< Previous](../trapping-rain-water "Trapping Rain Water") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/wildcard-matching "Wildcard Matching") +[Next >](../wildcard-matching "Wildcard Matching") ## [43. Multiply Strings (Medium)](https://leetcode.com/problems/multiply-strings "字符串相乘") @@ -36,11 +36,11 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Math](../../tag/math/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Add Two Numbers](https://github.com/openset/leetcode/tree/master/problems/add-two-numbers) (Medium) - 1. [Plus One](https://github.com/openset/leetcode/tree/master/problems/plus-one) (Easy) - 1. [Add Binary](https://github.com/openset/leetcode/tree/master/problems/add-binary) (Easy) - 1. [Add Strings](https://github.com/openset/leetcode/tree/master/problems/add-strings) (Easy) + 1. [Add Two Numbers](../add-two-numbers) (Medium) + 1. [Plus One](../plus-one) (Easy) + 1. [Add Binary](../add-binary) (Easy) + 1. [Add Strings](../add-strings) (Easy) diff --git a/problems/my-calendar-i/README.md b/problems/my-calendar-i/README.md index 1b4f18777..52c0248f7 100644 --- a/problems/my-calendar-i/README.md +++ b/problems/my-calendar-i/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/self-dividing-numbers "Self Dividing Numbers") +[< Previous](../self-dividing-numbers "Self Dividing Numbers") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/count-different-palindromic-subsequences "Count Different Palindromic Subsequences") +[Next >](../count-different-palindromic-subsequences "Count Different Palindromic Subsequences") ## [729. My Calendar I (Medium)](https://leetcode.com/problems/my-calendar-i "我的日程安排表 I") @@ -44,11 +44,11 @@ The third event can be booked, as the first event takes every time less than 20,

 

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [My Calendar II](https://github.com/openset/leetcode/tree/master/problems/my-calendar-ii) (Medium) - 1. [My Calendar III](https://github.com/openset/leetcode/tree/master/problems/my-calendar-iii) (Hard) + 1. [My Calendar II](../my-calendar-ii) (Medium) + 1. [My Calendar III](../my-calendar-iii) (Hard) ### Hints
diff --git a/problems/my-calendar-ii/README.md b/problems/my-calendar-ii/README.md index 2337c03cb..e062b2ad1 100644 --- a/problems/my-calendar-ii/README.md +++ b/problems/my-calendar-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/count-different-palindromic-subsequences "Count Different Palindromic Subsequences") +[< Previous](../count-different-palindromic-subsequences "Count Different Palindromic Subsequences") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/my-calendar-iii "My Calendar III") +[Next >](../my-calendar-iii "My Calendar III") ## [731. My Calendar II (Medium)](https://leetcode.com/problems/my-calendar-ii "我的日程安排表 II") @@ -50,11 +50,11 @@ the time [40, 50) will be single booked, and the time [50, 55) will be double bo

 

### Related Topics - [[Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md)] + [[Ordered Map](../../tag/ordered-map/README.md)] ### Similar Questions - 1. [My Calendar I](https://github.com/openset/leetcode/tree/master/problems/my-calendar-i) (Medium) - 1. [My Calendar III](https://github.com/openset/leetcode/tree/master/problems/my-calendar-iii) (Hard) + 1. [My Calendar I](../my-calendar-i) (Medium) + 1. [My Calendar III](../my-calendar-iii) (Hard) ### Hints
diff --git a/problems/my-calendar-iii/README.md b/problems/my-calendar-iii/README.md index 655a9223d..14f448754 100644 --- a/problems/my-calendar-iii/README.md +++ b/problems/my-calendar-iii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/my-calendar-ii "My Calendar II") +[< Previous](../my-calendar-ii "My Calendar II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/flood-fill "Flood Fill") +[Next >](../flood-fill "Flood Fill") ## [732. My Calendar III (Hard)](https://leetcode.com/problems/my-calendar-iii "我的日程安排表 III") @@ -50,12 +50,12 @@ eg. [10, 20), [10, 40), and [5, 15) are still triple booked.

 

### Related Topics - [[Segment Tree](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] - [[Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md)] + [[Segment Tree](../../tag/segment-tree/README.md)] + [[Ordered Map](../../tag/ordered-map/README.md)] ### Similar Questions - 1. [My Calendar I](https://github.com/openset/leetcode/tree/master/problems/my-calendar-i) (Medium) - 1. [My Calendar II](https://github.com/openset/leetcode/tree/master/problems/my-calendar-ii) (Medium) + 1. [My Calendar I](../my-calendar-i) (Medium) + 1. [My Calendar II](../my-calendar-ii) (Medium) ### Hints
diff --git a/problems/n-ary-tree-level-order-traversal/README.md b/problems/n-ary-tree-level-order-traversal/README.md index 8eef2948c..97c8fc45d 100644 --- a/problems/n-ary-tree-level-order-traversal/README.md +++ b/problems/n-ary-tree-level-order-traversal/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-n-ary-tree "Serialize and Deserialize N-ary Tree") +[< Previous](../serialize-and-deserialize-n-ary-tree "Serialize and Deserialize N-ary Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/flatten-a-multilevel-doubly-linked-list "Flatten a Multilevel Doubly Linked List") +[Next >](../flatten-a-multilevel-doubly-linked-list "Flatten a Multilevel Doubly Linked List") ## [429. N-ary Tree Level Order Traversal (Medium)](https://leetcode.com/problems/n-ary-tree-level-order-traversal "N叉树的层序遍历") @@ -43,10 +43,10 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] ### Similar Questions - 1. [Binary Tree Level Order Traversal](https://github.com/openset/leetcode/tree/master/problems/binary-tree-level-order-traversal) (Medium) - 1. [N-ary Tree Preorder Traversal](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-preorder-traversal) (Easy) - 1. [N-ary Tree Postorder Traversal](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-postorder-traversal) (Easy) + 1. [Binary Tree Level Order Traversal](../binary-tree-level-order-traversal) (Medium) + 1. [N-ary Tree Preorder Traversal](../n-ary-tree-preorder-traversal) (Easy) + 1. [N-ary Tree Postorder Traversal](../n-ary-tree-postorder-traversal) (Easy) diff --git a/problems/n-ary-tree-postorder-traversal/README.md b/problems/n-ary-tree-postorder-traversal/README.md index fb020b613..bab91f0cb 100644 --- a/problems/n-ary-tree-postorder-traversal/README.md +++ b/problems/n-ary-tree-postorder-traversal/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-preorder-traversal "N-ary Tree Preorder Traversal") +[< Previous](../n-ary-tree-preorder-traversal "N-ary Tree Preorder Traversal") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/tag-validator "Tag Validator") +[Next >](../tag-validator "Tag Validator") ## [590. N-ary Tree Postorder Traversal (Easy)](https://leetcode.com/problems/n-ary-tree-postorder-traversal "N叉树的后序遍历") @@ -49,9 +49,9 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] ### Similar Questions - 1. [Binary Tree Postorder Traversal](https://github.com/openset/leetcode/tree/master/problems/binary-tree-postorder-traversal) (Hard) - 1. [N-ary Tree Level Order Traversal](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-level-order-traversal) (Medium) - 1. [N-ary Tree Preorder Traversal](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-preorder-traversal) (Easy) + 1. [Binary Tree Postorder Traversal](../binary-tree-postorder-traversal) (Hard) + 1. [N-ary Tree Level Order Traversal](../n-ary-tree-level-order-traversal) (Medium) + 1. [N-ary Tree Preorder Traversal](../n-ary-tree-preorder-traversal) (Easy) diff --git a/problems/n-ary-tree-preorder-traversal/README.md b/problems/n-ary-tree-preorder-traversal/README.md index 55e926914..ec719eca8 100644 --- a/problems/n-ary-tree-preorder-traversal/README.md +++ b/problems/n-ary-tree-preorder-traversal/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/design-in-memory-file-system "Design In-Memory File System") +[< Previous](../design-in-memory-file-system "Design In-Memory File System") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-postorder-traversal "N-ary Tree Postorder Traversal") +[Next >](../n-ary-tree-postorder-traversal "N-ary Tree Postorder Traversal") ## [589. N-ary Tree Preorder Traversal (Easy)](https://leetcode.com/problems/n-ary-tree-preorder-traversal "N叉树的前序遍历") @@ -49,9 +49,9 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] ### Similar Questions - 1. [Binary Tree Preorder Traversal](https://github.com/openset/leetcode/tree/master/problems/binary-tree-preorder-traversal) (Medium) - 1. [N-ary Tree Level Order Traversal](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-level-order-traversal) (Medium) - 1. [N-ary Tree Postorder Traversal](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-postorder-traversal) (Easy) + 1. [Binary Tree Preorder Traversal](../binary-tree-preorder-traversal) (Medium) + 1. [N-ary Tree Level Order Traversal](../n-ary-tree-level-order-traversal) (Medium) + 1. [N-ary Tree Postorder Traversal](../n-ary-tree-postorder-traversal) (Easy) diff --git a/problems/n-queens-ii/README.md b/problems/n-queens-ii/README.md index 8e3dcd20c..8aba5974f 100644 --- a/problems/n-queens-ii/README.md +++ b/problems/n-queens-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/n-queens "N-Queens") +[< Previous](../n-queens "N-Queens") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-subarray "Maximum Subarray") +[Next >](../maximum-subarray "Maximum Subarray") ## [52. N-Queens II (Hard)](https://leetcode.com/problems/n-queens-ii "N皇后 II") @@ -37,7 +37,7 @@ ### Related Topics - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [N-Queens](https://github.com/openset/leetcode/tree/master/problems/n-queens) (Hard) + 1. [N-Queens](../n-queens) (Hard) diff --git a/problems/n-queens/README.md b/problems/n-queens/README.md index 34e14423c..490a35e02 100644 --- a/problems/n-queens/README.md +++ b/problems/n-queens/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/powx-n "Pow(x, n)") +[< Previous](../powx-n "Pow(x, n)") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/n-queens-ii "N-Queens II") +[Next >](../n-queens-ii "N-Queens II") ## [51. N-Queens (Hard)](https://leetcode.com/problems/n-queens "N皇后") @@ -38,8 +38,8 @@ ### Related Topics - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [N-Queens II](https://github.com/openset/leetcode/tree/master/problems/n-queens-ii) (Hard) - 1. [Grid Illumination](https://github.com/openset/leetcode/tree/master/problems/grid-illumination) (Hard) + 1. [N-Queens II](../n-queens-ii) (Hard) + 1. [Grid Illumination](../grid-illumination) (Hard) diff --git a/problems/n-repeated-element-in-size-2n-array/README.md b/problems/n-repeated-element-in-size-2n-array/README.md index abc9a2414..45338a589 100644 --- a/problems/n-repeated-element-in-size-2n-array/README.md +++ b/problems/n-repeated-element-in-size-2n-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/delete-columns-to-make-sorted-iii "Delete Columns to Make Sorted III") +[< Previous](../delete-columns-to-make-sorted-iii "Delete Columns to Make Sorted III") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-width-ramp "Maximum Width Ramp") +[Next >](../maximum-width-ramp "Maximum Width Ramp") ## [961. N-Repeated Element in Size 2N Array (Easy)](https://leetcode.com/problems/n-repeated-element-in-size-2n-array "重复 N 次的元素") @@ -58,4 +58,4 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] diff --git a/problems/n-th-tribonacci-number/README.md b/problems/n-th-tribonacci-number/README.md index a6827838c..be7bd369e 100644 --- a/problems/n-th-tribonacci-number/README.md +++ b/problems/n-th-tribonacci-number/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/parallel-courses "Parallel Courses") +[< Previous](../parallel-courses "Parallel Courses") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/alphabet-board-path "Alphabet Board Path") +[Next >](../alphabet-board-path "Alphabet Board Path") ## [1137. N-th Tribonacci Number (Easy)](https://leetcode.com/problems/n-th-tribonacci-number "第 N 个泰波那契数") @@ -44,10 +44,10 @@ T_4 = 1 + 1 + 2 = 4 ### Related Topics - [[Recursion](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] + [[Recursion](../../tag/recursion/README.md)] ### Similar Questions - 1. [Climbing Stairs](https://github.com/openset/leetcode/tree/master/problems/climbing-stairs) (Easy) + 1. [Climbing Stairs](../climbing-stairs) (Easy) ### Hints
diff --git a/problems/nested-list-weight-sum-ii/README.md b/problems/nested-list-weight-sum-ii/README.md index 5a1322d87..7ebb10aa4 100644 --- a/problems/nested-list-weight-sum-ii/README.md +++ b/problems/nested-list-weight-sum-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/max-sum-of-rectangle-no-larger-than-k "Max Sum of Rectangle No Larger Than K") +[< Previous](../max-sum-of-rectangle-no-larger-than-k "Max Sum of Rectangle No Larger Than K") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/water-and-jug-problem "Water and Jug Problem") +[Next >](../water-and-jug-problem "Water and Jug Problem") ## [364. Nested List Weight Sum II (Medium)](https://leetcode.com/problems/nested-list-weight-sum-ii "加权嵌套序列和 II") @@ -36,8 +36,8 @@ ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] ### Similar Questions - 1. [Nested List Weight Sum](https://github.com/openset/leetcode/tree/master/problems/nested-list-weight-sum) (Easy) - 1. [Array Nesting](https://github.com/openset/leetcode/tree/master/problems/array-nesting) (Medium) + 1. [Nested List Weight Sum](../nested-list-weight-sum) (Easy) + 1. [Array Nesting](../array-nesting) (Medium) diff --git a/problems/nested-list-weight-sum/README.md b/problems/nested-list-weight-sum/README.md index c78b48f3a..18040d25a 100644 --- a/problems/nested-list-weight-sum/README.md +++ b/problems/nested-list-weight-sum/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/counting-bits "Counting Bits") +[< Previous](../counting-bits "Counting Bits") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-k-distinct-characters "Longest Substring with At Most K Distinct Characters") +[Next >](../longest-substring-with-at-most-k-distinct-characters "Longest Substring with At Most K Distinct Characters") ## [339. Nested List Weight Sum (Easy)](https://leetcode.com/problems/nested-list-weight-sum "嵌套列表权重和") @@ -32,9 +32,9 @@ Explanation: One 1 at depth 1, one 4 at depth 2, and one 6 at depth 3; 1 + 4*2 + 6*3 = 27. ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] ### Similar Questions - 1. [Nested List Weight Sum II](https://github.com/openset/leetcode/tree/master/problems/nested-list-weight-sum-ii) (Medium) - 1. [Array Nesting](https://github.com/openset/leetcode/tree/master/problems/array-nesting) (Medium) - 1. [Employee Importance](https://github.com/openset/leetcode/tree/master/problems/employee-importance) (Easy) + 1. [Nested List Weight Sum II](../nested-list-weight-sum-ii) (Medium) + 1. [Array Nesting](../array-nesting) (Medium) + 1. [Employee Importance](../employee-importance) (Easy) diff --git a/problems/network-delay-time/README.md b/problems/network-delay-time/README.md index 97e5070fe..a5703b8f6 100644 --- a/problems/network-delay-time/README.md +++ b/problems/network-delay-time/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/closest-leaf-in-a-binary-tree "Closest Leaf in a Binary Tree") +[< Previous](../closest-leaf-in-a-binary-tree "Closest Leaf in a Binary Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-smallest-letter-greater-than-target "Find Smallest Letter Greater Than Target") +[Next >](../find-smallest-letter-greater-than-target "Find Smallest Letter Greater Than Target") ## [743. Network Delay Time (Medium)](https://leetcode.com/problems/network-delay-time "网络延迟时间") @@ -40,10 +40,10 @@ ### Related Topics - [[Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] + [[Heap](../../tag/heap/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] + [[Graph](../../tag/graph/README.md)] ### Hints
diff --git a/problems/new-21-game/README.md b/problems/new-21-game/README.md index 9ff2ad99e..e6b258219 100644 --- a/problems/new-21-game/README.md +++ b/problems/new-21-game/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/rectangle-overlap "Rectangle Overlap") +[< Previous](../rectangle-overlap "Rectangle Overlap") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/push-dominoes "Push Dominoes") +[Next >](../push-dominoes "Push Dominoes") ## [837. New 21 Game (Medium)](https://leetcode.com/problems/new-21-game "新21点") @@ -50,4 +50,4 @@ In 6 out of W = 10 possibilities, she is at or below N = 6 points. ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/new-users-daily-count/README.md b/problems/new-users-daily-count/README.md index 3a1482854..01c9e4357 100644 --- a/problems/new-users-daily-count/README.md +++ b/problems/new-users-daily-count/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/parsing-a-boolean-expression "Parsing A Boolean Expression") +[< Previous](../parsing-a-boolean-expression "Parsing A Boolean Expression") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/defanging-an-ip-address "Defanging an IP Address") +[Next >](../defanging-an-ip-address "Defanging an IP Address") ## [1107. New Users Daily Count (Medium)](https://leetcode.com/problems/new-users-daily-count "每日新用户统计") diff --git a/problems/next-closest-time/README.md b/problems/next-closest-time/README.md index 76439bcea..2971f096b 100644 --- a/problems/next-closest-time/README.md +++ b/problems/next-closest-time/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/valid-palindrome-ii "Valid Palindrome II") +[< Previous](../valid-palindrome-ii "Valid Palindrome II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/baseball-game "Baseball Game") +[Next >](../baseball-game "Baseball Game") ## [681. Next Closest Time (Medium)](https://leetcode.com/problems/next-closest-time "最近时刻") @@ -32,4 +32,4 @@

### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/next-greater-element-i/README.md b/problems/next-greater-element-i/README.md index 7872c7bc6..eacbe1de6 100644 --- a/problems/next-greater-element-i/README.md +++ b/problems/next-greater-element-i/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/teemo-attacking "Teemo Attacking") +[< Previous](../teemo-attacking "Teemo Attacking") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/random-point-in-non-overlapping-rectangles "Random Point in Non-overlapping Rectangles") +[Next >](../random-point-in-non-overlapping-rectangles "Random Point in Non-overlapping Rectangles") ## [496. Next Greater Element I (Easy)](https://leetcode.com/problems/next-greater-element-i "下一个更大元素 I") @@ -49,9 +49,9 @@ The Next Greater Number of a number x in nums1 is the first

### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] + [[Stack](../../tag/stack/README.md)] ### Similar Questions - 1. [Next Greater Element II](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-ii) (Medium) - 1. [Next Greater Element III](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-iii) (Medium) - 1. [Daily Temperatures](https://github.com/openset/leetcode/tree/master/problems/daily-temperatures) (Medium) + 1. [Next Greater Element II](../next-greater-element-ii) (Medium) + 1. [Next Greater Element III](../next-greater-element-iii) (Medium) + 1. [Daily Temperatures](../daily-temperatures) (Medium) diff --git a/problems/next-greater-element-ii/README.md b/problems/next-greater-element-ii/README.md index 9319385f9..50f96bf30 100644 --- a/problems/next-greater-element-ii/README.md +++ b/problems/next-greater-element-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/ipo "IPO") +[< Previous](../ipo "IPO") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/base-7 "Base 7") +[Next >](../base-7 "Base 7") ## [503. Next Greater Element II (Medium)](https://leetcode.com/problems/next-greater-element-ii "下一个更大元素 II") @@ -28,8 +28,8 @@ The length of given array won't exceed 10000.

### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] + [[Stack](../../tag/stack/README.md)] ### Similar Questions - 1. [Next Greater Element I](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-i) (Easy) - 1. [Next Greater Element III](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-iii) (Medium) + 1. [Next Greater Element I](../next-greater-element-i) (Easy) + 1. [Next Greater Element III](../next-greater-element-iii) (Medium) diff --git a/problems/next-greater-element-iii/README.md b/problems/next-greater-element-iii/README.md index e4142ef55..a3728a178 100644 --- a/problems/next-greater-element-iii/README.md +++ b/problems/next-greater-element-iii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/split-concatenated-strings "Split Concatenated Strings") +[< Previous](../split-concatenated-strings "Split Concatenated Strings") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/reverse-words-in-a-string-iii "Reverse Words in a String III") +[Next >](../reverse-words-in-a-string-iii "Reverse Words in a String III") ## [556. Next Greater Element III (Medium)](https://leetcode.com/problems/next-greater-element-iii "下一个更大元素 III") @@ -32,8 +32,8 @@

 

### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Next Greater Element I](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-i) (Easy) - 1. [Next Greater Element II](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-ii) (Medium) + 1. [Next Greater Element I](../next-greater-element-i) (Easy) + 1. [Next Greater Element II](../next-greater-element-ii) (Medium) diff --git a/problems/next-greater-node-in-linked-list/README.md b/problems/next-greater-node-in-linked-list/README.md index f6d719a3e..0e9acc0b4 100644 --- a/problems/next-greater-node-in-linked-list/README.md +++ b/problems/next-greater-node-in-linked-list/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/binary-prefix-divisible-by-5 "Binary Prefix Divisible By 5") +[< Previous](../binary-prefix-divisible-by-5 "Binary Prefix Divisible By 5") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-enclaves "Number of Enclaves") +[Next >](../number-of-enclaves "Number of Enclaves") ## [1019. Next Greater Node In Linked List (Medium)](https://leetcode.com/problems/next-greater-node-in-linked-list "链表中的下一个更大节点") @@ -58,8 +58,8 @@ ### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] + [[Stack](../../tag/stack/README.md)] + [[Linked List](../../tag/linked-list/README.md)] ### Hints
diff --git a/problems/next-permutation/README.md b/problems/next-permutation/README.md index 01640d01a..f56c5cab4 100644 --- a/problems/next-permutation/README.md +++ b/problems/next-permutation/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/substring-with-concatenation-of-all-words "Substring with Concatenation of All Words") +[< Previous](../substring-with-concatenation-of-all-words "Substring with Concatenation of All Words") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/longest-valid-parentheses "Longest Valid Parentheses") +[Next >](../longest-valid-parentheses "Longest Valid Parentheses") ## [31. Next Permutation (Medium)](https://leetcode.com/problems/next-permutation "下一个排列") @@ -24,10 +24,10 @@ 1,1,5 → 1,5,1

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Permutations](https://github.com/openset/leetcode/tree/master/problems/permutations) (Medium) - 1. [Permutations II](https://github.com/openset/leetcode/tree/master/problems/permutations-ii) (Medium) - 1. [Permutation Sequence](https://github.com/openset/leetcode/tree/master/problems/permutation-sequence) (Medium) - 1. [Palindrome Permutation II](https://github.com/openset/leetcode/tree/master/problems/palindrome-permutation-ii) (Medium) + 1. [Permutations](../permutations) (Medium) + 1. [Permutations II](../permutations-ii) (Medium) + 1. [Permutation Sequence](../permutation-sequence) (Medium) + 1. [Palindrome Permutation II](../palindrome-permutation-ii) (Medium) diff --git a/problems/nim-game/README.md b/problems/nim-game/README.md index 97383164b..7e542acab 100644 --- a/problems/nim-game/README.md +++ b/problems/nim-game/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/word-pattern-ii "Word Pattern II") +[< Previous](../word-pattern-ii "Word Pattern II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/flip-game "Flip Game") +[Next >](../flip-game "Flip Game") ## [292. Nim Game (Easy)](https://leetcode.com/problems/nim-game "Nim 游戏") @@ -25,11 +25,11 @@   removed by your friend. ### Related Topics - [[Brainteaser](https://github.com/openset/leetcode/tree/master/tag/brainteaser/README.md)] - [[Minimax](https://github.com/openset/leetcode/tree/master/tag/minimax/README.md)] + [[Brainteaser](../../tag/brainteaser/README.md)] + [[Minimax](../../tag/minimax/README.md)] ### Similar Questions - 1. [Flip Game II](https://github.com/openset/leetcode/tree/master/problems/flip-game-ii) (Medium) + 1. [Flip Game II](../flip-game-ii) (Medium) ### Hints
diff --git a/problems/non-decreasing-array/README.md b/problems/non-decreasing-array/README.md index 749fe28f8..02506054e 100644 --- a/problems/non-decreasing-array/README.md +++ b/problems/non-decreasing-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/strange-printer "Strange Printer") +[< Previous](../strange-printer "Strange Printer") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/path-sum-iv "Path Sum IV") +[Next >](../path-sum-iv "Path Sum IV") ## [665. Non-decreasing Array (Easy)](https://leetcode.com/problems/non-decreasing-array "非递减数列") @@ -40,4 +40,4 @@ The n belongs to [1, 10,000].

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] diff --git a/problems/non-negative-integers-without-consecutive-ones/README.md b/problems/non-negative-integers-without-consecutive-ones/README.md index 63ca0feba..a8a48a286 100644 --- a/problems/non-negative-integers-without-consecutive-ones/README.md +++ b/problems/non-negative-integers-without-consecutive-ones/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-index-sum-of-two-lists "Minimum Index Sum of Two Lists") +[< Previous](../minimum-index-sum-of-two-lists "Minimum Index Sum of Two Lists") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/human-traffic-of-stadium "Human Traffic of Stadium") +[Next >](../human-traffic-of-stadium "Human Traffic of Stadium") ## [600. Non-negative Integers without Consecutive Ones (Hard)](https://leetcode.com/problems/non-negative-integers-without-consecutive-ones "不含连续1的非负整数") @@ -34,9 +34,9 @@ Among them, only integer 3 disobeys the rule (two consecutive ones) and the othe

### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [House Robber](https://github.com/openset/leetcode/tree/master/problems/house-robber) (Easy) - 1. [House Robber II](https://github.com/openset/leetcode/tree/master/problems/house-robber-ii) (Medium) - 1. [Ones and Zeroes](https://github.com/openset/leetcode/tree/master/problems/ones-and-zeroes) (Medium) + 1. [House Robber](../house-robber) (Easy) + 1. [House Robber II](../house-robber-ii) (Medium) + 1. [Ones and Zeroes](../ones-and-zeroes) (Medium) diff --git a/problems/non-overlapping-intervals/README.md b/problems/non-overlapping-intervals/README.md index 3c8d9bd33..c65355f63 100644 --- a/problems/non-overlapping-intervals/README.md +++ b/problems/non-overlapping-intervals/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/number-of-segments-in-a-string "Number of Segments in a String") +[< Previous](../number-of-segments-in-a-string "Number of Segments in a String") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-right-interval "Find Right Interval") +[Next >](../find-right-interval "Find Right Interval") ## [435. Non-overlapping Intervals (Medium)](https://leetcode.com/problems/non-overlapping-intervals "无重叠区间") @@ -52,7 +52,7 @@ ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] + [[Greedy](../../tag/greedy/README.md)] ### Similar Questions - 1. [Minimum Number of Arrows to Burst Balloons](https://github.com/openset/leetcode/tree/master/problems/minimum-number-of-arrows-to-burst-balloons) (Medium) + 1. [Minimum Number of Arrows to Burst Balloons](../minimum-number-of-arrows-to-burst-balloons) (Medium) diff --git a/problems/not-boring-movies/README.md b/problems/not-boring-movies/README.md index 31351aa46..abdd6c9ba 100644 --- a/problems/not-boring-movies/README.md +++ b/problems/not-boring-movies/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/biggest-single-number "Biggest Single Number") +[< Previous](../biggest-single-number "Biggest Single Number") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/task-scheduler "Task Scheduler") +[Next >](../task-scheduler "Task Scheduler") ## [620. Not Boring Movies (Easy)](https://leetcode.com/problems/not-boring-movies "有趣的电影") diff --git a/problems/nth-digit/README.md b/problems/nth-digit/README.md index c608196b6..dc096e6ca 100644 --- a/problems/nth-digit/README.md +++ b/problems/nth-digit/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/evaluate-division "Evaluate Division") +[< Previous](../evaluate-division "Evaluate Division") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/binary-watch "Binary Watch") +[Next >](../binary-watch "Binary Watch") ## [400. Nth Digit (Medium)](https://leetcode.com/problems/nth-digit "第N个数字") @@ -41,4 +41,4 @@ The 11th digit of the sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, ... is a 0, wh

### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/nth-highest-salary/README.md b/problems/nth-highest-salary/README.md index 1e339e539..98fac1c6c 100644 --- a/problems/nth-highest-salary/README.md +++ b/problems/nth-highest-salary/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/second-highest-salary "Second Highest Salary") +[< Previous](../second-highest-salary "Second Highest Salary") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/rank-scores "Rank Scores") +[Next >](../rank-scores "Rank Scores") ## [177. Nth Highest Salary (Medium)](https://leetcode.com/problems/nth-highest-salary "第N高的薪水") diff --git a/problems/nth-magical-number/README.md b/problems/nth-magical-number/README.md index 4a99f6b3f..88e9ae5b7 100644 --- a/problems/nth-magical-number/README.md +++ b/problems/nth-magical-number/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/stone-game "Stone Game") +[< Previous](../stone-game "Stone Game") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/profitable-schemes "Profitable Schemes") +[Next >](../profitable-schemes "Profitable Schemes") ## [878. Nth Magical Number (Hard)](https://leetcode.com/problems/nth-magical-number "第 N 个神奇数字") @@ -67,5 +67,5 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Math](../../tag/math/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] diff --git a/problems/number-complement/README.md b/problems/number-complement/README.md index 2c097e868..61f12dde8 100644 --- a/problems/number-complement/README.md +++ b/problems/number-complement/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/heaters "Heaters") +[< Previous](../heaters "Heaters") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/total-hamming-distance "Total Hamming Distance") +[Next >](../total-hamming-distance "Total Hamming Distance") ## [476. Number Complement (Easy)](https://leetcode.com/problems/number-complement "数字的补数") @@ -37,4 +37,4 @@

### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] diff --git a/problems/number-of-1-bits/README.md b/problems/number-of-1-bits/README.md index 22b05d93e..5afa56ced 100644 --- a/problems/number-of-1-bits/README.md +++ b/problems/number-of-1-bits/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/reverse-bits "Reverse Bits") +[< Previous](../reverse-bits "Reverse Bits") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/word-frequency "Word Frequency") +[Next >](../word-frequency "Word Frequency") ## [191. Number of 1 Bits (Easy)](https://leetcode.com/problems/number-of-1-bits "位1的个数") @@ -54,13 +54,13 @@

If this function is called many times, how would you optimize it?

### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] ### Similar Questions - 1. [Reverse Bits](https://github.com/openset/leetcode/tree/master/problems/reverse-bits) (Easy) - 1. [Power of Two](https://github.com/openset/leetcode/tree/master/problems/power-of-two) (Easy) - 1. [Counting Bits](https://github.com/openset/leetcode/tree/master/problems/counting-bits) (Medium) - 1. [Binary Watch](https://github.com/openset/leetcode/tree/master/problems/binary-watch) (Easy) - 1. [Hamming Distance](https://github.com/openset/leetcode/tree/master/problems/hamming-distance) (Easy) - 1. [Binary Number with Alternating Bits](https://github.com/openset/leetcode/tree/master/problems/binary-number-with-alternating-bits) (Easy) - 1. [Prime Number of Set Bits in Binary Representation](https://github.com/openset/leetcode/tree/master/problems/prime-number-of-set-bits-in-binary-representation) (Easy) + 1. [Reverse Bits](../reverse-bits) (Easy) + 1. [Power of Two](../power-of-two) (Easy) + 1. [Counting Bits](../counting-bits) (Medium) + 1. [Binary Watch](../binary-watch) (Easy) + 1. [Hamming Distance](../hamming-distance) (Easy) + 1. [Binary Number with Alternating Bits](../binary-number-with-alternating-bits) (Easy) + 1. [Prime Number of Set Bits in Binary Representation](../prime-number-of-set-bits-in-binary-representation) (Easy) diff --git a/problems/number-of-atoms/README.md b/problems/number-of-atoms/README.md index 5ff5aea5d..26381eb74 100644 --- a/problems/number-of-atoms/README.md +++ b/problems/number-of-atoms/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/split-linked-list-in-parts "Split Linked List in Parts") +[< Previous](../split-linked-list-in-parts "Split Linked List in Parts") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-window-subsequence "Minimum Window Subsequence") +[Next >](../minimum-window-subsequence "Minimum Window Subsequence") ## [726. Number of Atoms (Hard)](https://leetcode.com/problems/number-of-atoms "原子的数量") @@ -60,14 +60,14 @@ The count of elements are {'K': 4, 'N': 2, 'O': 14, 'S': 4}.

### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[Recursion](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Stack](../../tag/stack/README.md)] + [[Recursion](../../tag/recursion/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Decode String](https://github.com/openset/leetcode/tree/master/problems/decode-string) (Medium) - 1. [Encode String with Shortest Length](https://github.com/openset/leetcode/tree/master/problems/encode-string-with-shortest-length) (Hard) - 1. [Parse Lisp Expression](https://github.com/openset/leetcode/tree/master/problems/parse-lisp-expression) (Hard) + 1. [Decode String](../decode-string) (Medium) + 1. [Encode String with Shortest Length](../encode-string-with-shortest-length) (Hard) + 1. [Parse Lisp Expression](../parse-lisp-expression) (Hard) ### Hints
diff --git a/problems/number-of-boomerangs/README.md b/problems/number-of-boomerangs/README.md index d34651dbb..607602129 100644 --- a/problems/number-of-boomerangs/README.md +++ b/problems/number-of-boomerangs/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/arithmetic-slices-ii-subsequence "Arithmetic Slices II - Subsequence") +[< Previous](../arithmetic-slices-ii-subsequence "Arithmetic Slices II - Subsequence") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-all-numbers-disappeared-in-an-array "Find All Numbers Disappeared in an Array") +[Next >](../find-all-numbers-disappeared-in-an-array "Find All Numbers Disappeared in an Array") ## [447. Number of Boomerangs (Easy)](https://leetcode.com/problems/number-of-boomerangs "回旋镖的数量") @@ -31,7 +31,7 @@ The two boomerangs are [[1,0],[0,0],[2,0]] and [[1,0],[2,0],[0,0]]

 

### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Line Reflection](https://github.com/openset/leetcode/tree/master/problems/line-reflection) (Medium) + 1. [Line Reflection](../line-reflection) (Medium) diff --git a/problems/number-of-burgers-with-no-waste-of-ingredients/README.md b/problems/number-of-burgers-with-no-waste-of-ingredients/README.md index fb6b656c3..b2ab77f09 100644 --- a/problems/number-of-burgers-with-no-waste-of-ingredients/README.md +++ b/problems/number-of-burgers-with-no-waste-of-ingredients/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-winner-on-a-tic-tac-toe-game "Find Winner on a Tic Tac Toe Game") +[< Previous](../find-winner-on-a-tic-tac-toe-game "Find Winner on a Tic Tac Toe Game") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/count-square-submatrices-with-all-ones "Count Square Submatrices with All Ones") +[Next >](../count-square-submatrices-with-all-ones "Count Square Submatrices with All Ones") ## [1276. Number of Burgers with No Waste of Ingredients (Medium)](https://leetcode.com/problems/number-of-burgers-with-no-waste-of-ingredients "不浪费原料的汉堡制作方案") @@ -68,8 +68,8 @@ ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[Math](../../tag/math/README.md)] ### Hints
diff --git a/problems/number-of-closed-islands/README.md b/problems/number-of-closed-islands/README.md index e601c5275..f959a2ae7 100644 --- a/problems/number-of-closed-islands/README.md +++ b/problems/number-of-closed-islands/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/reconstruct-a-2-row-binary-matrix "Reconstruct a 2-Row Binary Matrix") +[< Previous](../reconstruct-a-2-row-binary-matrix "Reconstruct a 2-Row Binary Matrix") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-score-words-formed-by-letters "Maximum Score Words Formed by Letters") +[Next >](../maximum-score-words-formed-by-letters "Maximum Score Words Formed by Letters") ## [1254. Number of Closed Islands (Medium)](https://leetcode.com/problems/number-of-closed-islands "统计封闭岛屿的数目") @@ -57,7 +57,7 @@ Islands in gray are closed because they are completely surrounded by water (grou ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] ### Hints
diff --git a/problems/number-of-comments-per-post/README.md b/problems/number-of-comments-per-post/README.md index b2acd2df8..af1169aa8 100644 --- a/problems/number-of-comments-per-post/README.md +++ b/problems/number-of-comments-per-post/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/tiling-a-rectangle-with-the-fewest-squares "Tiling a Rectangle with the Fewest Squares") +[< Previous](../tiling-a-rectangle-with-the-fewest-squares "Tiling a Rectangle with the Fewest Squares") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/web-crawler-multithreaded "Web Crawler Multithreaded") +[Next >](../web-crawler-multithreaded "Web Crawler Multithreaded") ## [1241. Number of Comments per Post (Easy)](https://leetcode.com/problems/number-of-comments-per-post "每个帖子的评论数") diff --git a/problems/number-of-connected-components-in-an-undirected-graph/README.md b/problems/number-of-connected-components-in-an-undirected-graph/README.md index 8e01ebec0..2985f5ffb 100644 --- a/problems/number-of-connected-components-in-an-undirected-graph/README.md +++ b/problems/number-of-connected-components-in-an-undirected-graph/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/coin-change "Coin Change") +[< Previous](../coin-change "Coin Change") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/wiggle-sort-ii "Wiggle Sort II") +[Next >](../wiggle-sort-ii "Wiggle Sort II") ## [323. Number of Connected Components in an Undirected Graph (Medium)](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph "无向图中连通分量的数目") @@ -41,12 +41,12 @@ You can assume that no duplicate edges will appear in edges. Since all edges are undirected, [0, 1] is the same as [1, 0] and thus will not appear together in edges.

### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] - [[Union Find](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] + [[Union Find](../../tag/union-find/README.md)] + [[Graph](../../tag/graph/README.md)] ### Similar Questions - 1. [Number of Islands](https://github.com/openset/leetcode/tree/master/problems/number-of-islands) (Medium) - 1. [Graph Valid Tree](https://github.com/openset/leetcode/tree/master/problems/graph-valid-tree) (Medium) - 1. [Friend Circles](https://github.com/openset/leetcode/tree/master/problems/friend-circles) (Medium) + 1. [Number of Islands](../number-of-islands) (Medium) + 1. [Graph Valid Tree](../graph-valid-tree) (Medium) + 1. [Friend Circles](../friend-circles) (Medium) diff --git a/problems/number-of-corner-rectangles/README.md b/problems/number-of-corner-rectangles/README.md index a0a672c3f..3daba39d4 100644 --- a/problems/number-of-corner-rectangles/README.md +++ b/problems/number-of-corner-rectangles/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/contain-virus "Contain Virus") +[< Previous](../contain-virus "Contain Virus") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/ip-to-cidr "IP to CIDR") +[Next >](../ip-to-cidr "IP to CIDR") ## [750. Number Of Corner Rectangles (Medium)](https://leetcode.com/problems/number-of-corner-rectangles "角矩形的数量") @@ -66,7 +66,7 @@

 

### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/number-of-days-in-a-month/README.md b/problems/number-of-days-in-a-month/README.md index 91ba236ec..749631781 100644 --- a/problems/number-of-days-in-a-month/README.md +++ b/problems/number-of-days-in-a-month/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/building-h2o "Building H2O") +[< Previous](../building-h2o "Building H2O") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/remove-vowels-from-a-string "Remove Vowels from a String") +[Next >](../remove-vowels-from-a-string "Remove Vowels from a String") ## [1118. Number of Days in a Month (Easy)](https://leetcode.com/problems/number-of-days-in-a-month "一月有多少天") diff --git a/problems/number-of-dice-rolls-with-target-sum/README.md b/problems/number-of-dice-rolls-with-target-sum/README.md index cab7bd01b..8f2e91845 100644 --- a/problems/number-of-dice-rolls-with-target-sum/README.md +++ b/problems/number-of-dice-rolls-with-target-sum/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/day-of-the-year "Day of the Year") +[< Previous](../day-of-the-year "Day of the Year") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/swap-for-longest-repeated-character-substring "Swap For Longest Repeated Character Substring") +[Next >](../swap-for-longest-repeated-character-substring "Swap For Longest Repeated Character Substring") ## [1155. Number of Dice Rolls With Target Sum (Medium)](https://leetcode.com/problems/number-of-dice-rolls-with-target-sum "掷骰子的N种方法") @@ -71,7 +71,7 @@ The answer must be returned modulo 10^9 + 7. ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/number-of-digit-one/README.md b/problems/number-of-digit-one/README.md index a3856ae7b..787f8f7e0 100644 --- a/problems/number-of-digit-one/README.md +++ b/problems/number-of-digit-one/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/implement-queue-using-stacks "Implement Queue using Stacks") +[< Previous](../implement-queue-using-stacks "Implement Queue using Stacks") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/palindrome-linked-list "Palindrome Linked List") +[Next >](../palindrome-linked-list "Palindrome Linked List") ## [233. Number of Digit One (Hard)](https://leetcode.com/problems/number-of-digit-one "数字 1 的个数") @@ -22,11 +22,11 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Factorial Trailing Zeroes](https://github.com/openset/leetcode/tree/master/problems/factorial-trailing-zeroes) (Easy) - 1. [Digit Count in Range](https://github.com/openset/leetcode/tree/master/problems/digit-count-in-range) (Hard) + 1. [Factorial Trailing Zeroes](../factorial-trailing-zeroes) (Easy) + 1. [Digit Count in Range](../digit-count-in-range) (Hard) ### Hints
diff --git a/problems/number-of-distinct-islands-ii/README.md b/problems/number-of-distinct-islands-ii/README.md index d414a18eb..16b2f586f 100644 --- a/problems/number-of-distinct-islands-ii/README.md +++ b/problems/number-of-distinct-islands-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/random-pick-with-blacklist "Random Pick with Blacklist") +[< Previous](../random-pick-with-blacklist "Random Pick with Blacklist") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-ascii-delete-sum-for-two-strings "Minimum ASCII Delete Sum for Two Strings") +[Next >](../minimum-ascii-delete-sum-for-two-strings "Minimum ASCII Delete Sum for Two Strings") ## [711. Number of Distinct Islands II (Hard)](https://leetcode.com/problems/number-of-distinct-islands-ii "不同岛屿的数量 II") @@ -74,8 +74,8 @@ The length of each dimension in the given grid does not exceed 50.

### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Number of Distinct Islands](https://github.com/openset/leetcode/tree/master/problems/number-of-distinct-islands) (Medium) + 1. [Number of Distinct Islands](../number-of-distinct-islands) (Medium) diff --git a/problems/number-of-distinct-islands/README.md b/problems/number-of-distinct-islands/README.md index 425ffc39a..5148275d5 100644 --- a/problems/number-of-distinct-islands/README.md +++ b/problems/number-of-distinct-islands/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/binary-number-with-alternating-bits "Binary Number with Alternating Bits") +[< Previous](../binary-number-with-alternating-bits "Binary Number with Alternating Bits") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/max-area-of-island "Max Area of Island") +[Next >](../max-area-of-island "Max Area of Island") ## [694. Number of Distinct Islands (Medium)](https://leetcode.com/problems/number-of-distinct-islands "不同岛屿的数量") @@ -49,9 +49,9 @@ The length of each dimension in the given grid does not exceed 50.

### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Number of Islands](https://github.com/openset/leetcode/tree/master/problems/number-of-islands) (Medium) - 1. [Number of Distinct Islands II](https://github.com/openset/leetcode/tree/master/problems/number-of-distinct-islands-ii) (Hard) + 1. [Number of Islands](../number-of-islands) (Medium) + 1. [Number of Distinct Islands II](../number-of-distinct-islands-ii) (Hard) diff --git a/problems/number-of-enclaves/README.md b/problems/number-of-enclaves/README.md index 6f3695bc7..e578da4be 100644 --- a/problems/number-of-enclaves/README.md +++ b/problems/number-of-enclaves/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/next-greater-node-in-linked-list "Next Greater Node In Linked List") +[< Previous](../next-greater-node-in-linked-list "Next Greater Node In Linked List") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/remove-outermost-parentheses "Remove Outermost Parentheses") +[Next >](../remove-outermost-parentheses "Remove Outermost Parentheses") ## [1020. Number of Enclaves (Medium)](https://leetcode.com/problems/number-of-enclaves "飞地的数量") @@ -48,7 +48,7 @@ All 1s are either on the boundary or can reach the boundary. ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] ### Hints
diff --git a/problems/number-of-equivalent-domino-pairs/README.md b/problems/number-of-equivalent-domino-pairs/README.md index 9f3bf8ac0..822b0b648 100644 --- a/problems/number-of-equivalent-domino-pairs/README.md +++ b/problems/number-of-equivalent-domino-pairs/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/user-purchase-platform "User Purchase Platform") +[< Previous](../user-purchase-platform "User Purchase Platform") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/shortest-path-with-alternating-colors "Shortest Path with Alternating Colors") +[Next >](../shortest-path-with-alternating-colors "Shortest Path with Alternating Colors") ## [1128. Number of Equivalent Domino Pairs (Easy)](https://leetcode.com/problems/number-of-equivalent-domino-pairs "等价多米诺骨牌对的数量") @@ -29,7 +29,7 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Hints
diff --git a/problems/number-of-islands-ii/README.md b/problems/number-of-islands-ii/README.md index c8cd4e6bb..3c9b2b9fd 100644 --- a/problems/number-of-islands-ii/README.md +++ b/problems/number-of-islands-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-immutable "Range Sum Query 2D - Immutable") +[< Previous](../range-sum-query-2d-immutable "Range Sum Query 2D - Immutable") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/additive-number "Additive Number") +[Next >](../additive-number "Additive Number") ## [305. Number of Islands II (Hard)](https://leetcode.com/problems/number-of-islands-ii "岛屿数量 II") @@ -67,7 +67,7 @@

Can you do it in time complexity O(k log mn), where k is the length of the positions?

### Related Topics - [[Union Find](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] + [[Union Find](../../tag/union-find/README.md)] ### Similar Questions - 1. [Number of Islands](https://github.com/openset/leetcode/tree/master/problems/number-of-islands) (Medium) + 1. [Number of Islands](../number-of-islands) (Medium) diff --git a/problems/number-of-islands/README.md b/problems/number-of-islands/README.md index b60f77966..bac05bb22 100644 --- a/problems/number-of-islands/README.md +++ b/problems/number-of-islands/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/binary-tree-right-side-view "Binary Tree Right Side View") +[< Previous](../binary-tree-right-side-view "Binary Tree Right Side View") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/bitwise-and-of-numbers-range "Bitwise AND of Numbers Range") +[Next >](../bitwise-and-of-numbers-range "Bitwise AND of Numbers Range") ## [200. Number of Islands (Medium)](https://leetcode.com/problems/number-of-islands "岛屿数量") @@ -38,14 +38,14 @@ ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] - [[Union Find](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] + [[Union Find](../../tag/union-find/README.md)] ### Similar Questions - 1. [Surrounded Regions](https://github.com/openset/leetcode/tree/master/problems/surrounded-regions) (Medium) - 1. [Walls and Gates](https://github.com/openset/leetcode/tree/master/problems/walls-and-gates) (Medium) - 1. [Number of Islands II](https://github.com/openset/leetcode/tree/master/problems/number-of-islands-ii) (Hard) - 1. [Number of Connected Components in an Undirected Graph](https://github.com/openset/leetcode/tree/master/problems/number-of-connected-components-in-an-undirected-graph) (Medium) - 1. [Number of Distinct Islands](https://github.com/openset/leetcode/tree/master/problems/number-of-distinct-islands) (Medium) - 1. [Max Area of Island](https://github.com/openset/leetcode/tree/master/problems/max-area-of-island) (Medium) + 1. [Surrounded Regions](../surrounded-regions) (Medium) + 1. [Walls and Gates](../walls-and-gates) (Medium) + 1. [Number of Islands II](../number-of-islands-ii) (Hard) + 1. [Number of Connected Components in an Undirected Graph](../number-of-connected-components-in-an-undirected-graph) (Medium) + 1. [Number of Distinct Islands](../number-of-distinct-islands) (Medium) + 1. [Max Area of Island](../max-area-of-island) (Medium) diff --git a/problems/number-of-lines-to-write-string/README.md b/problems/number-of-lines-to-write-string/README.md index e6a3e521b..b4d78966f 100644 --- a/problems/number-of-lines-to-write-string/README.md +++ b/problems/number-of-lines-to-write-string/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/split-array-with-same-average "Split Array With Same Average") +[< Previous](../split-array-with-same-average "Split Array With Same Average") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/max-increase-to-keep-city-skyline "Max Increase to Keep City Skyline") +[Next >](../max-increase-to-keep-city-skyline "Max Increase to Keep City Skyline") ## [806. Number of Lines To Write String (Easy)](https://leetcode.com/problems/number-of-lines-to-write-string "写字符串需要的行数") diff --git a/problems/number-of-longest-increasing-subsequence/README.md b/problems/number-of-longest-increasing-subsequence/README.md index c900871b6..2f7a971ee 100644 --- a/problems/number-of-longest-increasing-subsequence/README.md +++ b/problems/number-of-longest-increasing-subsequence/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/bulb-switcher-ii "Bulb Switcher II") +[< Previous](../bulb-switcher-ii "Bulb Switcher II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/longest-continuous-increasing-subsequence "Longest Continuous Increasing Subsequence") +[Next >](../longest-continuous-increasing-subsequence "Longest Continuous Increasing Subsequence") ## [673. Number of Longest Increasing Subsequence (Medium)](https://leetcode.com/problems/number-of-longest-increasing-subsequence "最长递增子序列的个数") @@ -36,8 +36,8 @@ Length of the given array will be not exceed 2000 and the answer is guaranteed t

### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Longest Increasing Subsequence](https://github.com/openset/leetcode/tree/master/problems/longest-increasing-subsequence) (Medium) - 1. [Longest Continuous Increasing Subsequence](https://github.com/openset/leetcode/tree/master/problems/longest-continuous-increasing-subsequence) (Easy) + 1. [Longest Increasing Subsequence](../longest-increasing-subsequence) (Medium) + 1. [Longest Continuous Increasing Subsequence](../longest-continuous-increasing-subsequence) (Easy) diff --git a/problems/number-of-matching-subsequences/README.md b/problems/number-of-matching-subsequences/README.md index 1318a7084..a73b2dbec 100644 --- a/problems/number-of-matching-subsequences/README.md +++ b/problems/number-of-matching-subsequences/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/custom-sort-string "Custom Sort String") +[< Previous](../custom-sort-string "Custom Sort String") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/preimage-size-of-factorial-zeroes-function "Preimage Size of Factorial Zeroes Function") +[Next >](../preimage-size-of-factorial-zeroes-function "Preimage Size of Factorial Zeroes Function") ## [792. Number of Matching Subsequences (Medium)](https://leetcode.com/problems/number-of-matching-subsequences "匹配子序列的单词数") @@ -32,7 +32,7 @@ words = ["a", "bb", "acd", "ace"] ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Is Subsequence](https://github.com/openset/leetcode/tree/master/problems/is-subsequence) (Easy) + 1. [Is Subsequence](../is-subsequence) (Easy) diff --git a/problems/number-of-music-playlists/README.md b/problems/number-of-music-playlists/README.md index 6bd851271..03d3874e3 100644 --- a/problems/number-of-music-playlists/README.md +++ b/problems/number-of-music-playlists/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/complete-binary-tree-inserter "Complete Binary Tree Inserter") +[< Previous](../complete-binary-tree-inserter "Complete Binary Tree Inserter") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-add-to-make-parentheses-valid "Minimum Add to Make Parentheses Valid") +[Next >](../minimum-add-to-make-parentheses-valid "Minimum Add to Make Parentheses Valid") ## [920. Number of Music Playlists (Hard)](https://leetcode.com/problems/number-of-music-playlists "播放列表的数量") @@ -65,4 +65,4 @@ ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/number-of-recent-calls/README.md b/problems/number-of-recent-calls/README.md index 6247df9d7..71a679ce1 100644 --- a/problems/number-of-recent-calls/README.md +++ b/problems/number-of-recent-calls/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/beautiful-array "Beautiful Array") +[< Previous](../beautiful-array "Beautiful Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/shortest-bridge "Shortest Bridge") +[Next >](../shortest-bridge "Shortest Bridge") ## [933. Number of Recent Calls (Easy)](https://leetcode.com/problems/number-of-recent-calls "最近的请求次数") @@ -44,4 +44,4 @@ ### Related Topics - [[Queue](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)] + [[Queue](../../tag/queue/README.md)] diff --git a/problems/number-of-segments-in-a-string/README.md b/problems/number-of-segments-in-a-string/README.md index 3e0061558..099f18bfb 100644 --- a/problems/number-of-segments-in-a-string/README.md +++ b/problems/number-of-segments-in-a-string/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-genetic-mutation "Minimum Genetic Mutation") +[< Previous](../minimum-genetic-mutation "Minimum Genetic Mutation") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/non-overlapping-intervals "Non-overlapping Intervals") +[Next >](../non-overlapping-intervals "Non-overlapping Intervals") ## [434. Number of Segments in a String (Easy)](https://leetcode.com/problems/number-of-segments-in-a-string "字符串中的单词数") @@ -23,4 +23,4 @@

### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/number-of-ships-in-a-rectangle/README.md b/problems/number-of-ships-in-a-rectangle/README.md index 179de2fa2..3e3c6bf7a 100644 --- a/problems/number-of-ships-in-a-rectangle/README.md +++ b/problems/number-of-ships-in-a-rectangle/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/delete-tree-nodes "Delete Tree Nodes") +[< Previous](../delete-tree-nodes "Delete Tree Nodes") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-winner-on-a-tic-tac-toe-game "Find Winner on a Tic Tac Toe Game") +[Next >](../find-winner-on-a-tic-tac-toe-game "Find Winner on a Tic Tac Toe Game") ## [1274. Number of Ships in a Rectangle (Hard)](https://leetcode.com/problems/number-of-ships-in-a-rectangle "矩形内船只的数目") @@ -43,7 +43,7 @@ ships = [[1,1],[2,2],[3,3],[5,5]], topRight = [4,4], bottomLeft = [0,0] ### Related Topics - [[Divide and Conquer](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] + [[Divide and Conquer](../../tag/divide-and-conquer/README.md)] ### Hints
diff --git a/problems/number-of-squareful-arrays/README.md b/problems/number-of-squareful-arrays/README.md index 2bbd316fe..d405b7b41 100644 --- a/problems/number-of-squareful-arrays/README.md +++ b/problems/number-of-squareful-arrays/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-number-of-k-consecutive-bit-flips "Minimum Number of K Consecutive Bit Flips") +[< Previous](../minimum-number-of-k-consecutive-bit-flips "Minimum Number of K Consecutive Bit Flips") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-the-town-judge "Find the Town Judge") +[Next >](../find-the-town-judge "Find the Town Judge") ## [996. Number of Squareful Arrays (Hard)](https://leetcode.com/problems/number-of-squareful-arrays "正方形数组的数目") @@ -43,9 +43,9 @@ ### Related Topics - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Graph](../../tag/graph/README.md)] + [[Math](../../tag/math/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Permutations II](https://github.com/openset/leetcode/tree/master/problems/permutations-ii) (Medium) + 1. [Permutations II](../permutations-ii) (Medium) diff --git a/problems/number-of-subarrays-with-bounded-maximum/README.md b/problems/number-of-subarrays-with-bounded-maximum/README.md index d922e90b9..47f6125cd 100644 --- a/problems/number-of-subarrays-with-bounded-maximum/README.md +++ b/problems/number-of-subarrays-with-bounded-maximum/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/valid-tic-tac-toe-state "Valid Tic-Tac-Toe State") +[< Previous](../valid-tic-tac-toe-state "Valid Tic-Tac-Toe State") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/rotate-string "Rotate String") +[Next >](../rotate-string "Rotate String") ## [795. Number of Subarrays with Bounded Maximum (Medium)](https://leetcode.com/problems/number-of-subarrays-with-bounded-maximum "区间子数组个数") @@ -33,4 +33,4 @@ R = 3 ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] diff --git a/problems/number-of-submatrices-that-sum-to-target/README.md b/problems/number-of-submatrices-that-sum-to-target/README.md index b496db698..64a0cf50b 100644 --- a/problems/number-of-submatrices-that-sum-to-target/README.md +++ b/problems/number-of-submatrices-that-sum-to-target/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/adding-two-negabinary-numbers "Adding Two Negabinary Numbers") +[< Previous](../adding-two-negabinary-numbers "Adding Two Negabinary Numbers") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/project-employees-i "Project Employees I") +[Next >](../project-employees-i "Project Employees I") ## [1074. Number of Submatrices That Sum to Target (Hard)](https://leetcode.com/problems/number-of-submatrices-that-sum-to-target "元素和为目标值的子矩阵数量") @@ -49,9 +49,9 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] - [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] + [[Array](../../tag/array/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] + [[Sliding Window](../../tag/sliding-window/README.md)] ### Hints
diff --git a/problems/number-of-valid-subarrays/README.md b/problems/number-of-valid-subarrays/README.md index d416e1775..3e0cb7181 100644 --- a/problems/number-of-valid-subarrays/README.md +++ b/problems/number-of-valid-subarrays/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/longest-repeating-substring "Longest Repeating Substring") +[< Previous](../longest-repeating-substring "Longest Repeating Substring") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/fixed-point "Fixed Point") +[Next >](../fixed-point "Fixed Point") ## [1063. Number of Valid Subarrays (Hard)](https://leetcode.com/problems/number-of-valid-subarrays "有效子数组的数目") @@ -51,7 +51,7 @@ ### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] + [[Stack](../../tag/stack/README.md)] ### Hints
diff --git a/problems/number-of-valid-words-for-each-puzzle/README.md b/problems/number-of-valid-words-for-each-puzzle/README.md index 3639bcb3d..e6a98be57 100644 --- a/problems/number-of-valid-words-for-each-puzzle/README.md +++ b/problems/number-of-valid-words-for-each-puzzle/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/can-make-palindrome-from-substring "Can Make Palindrome from Substring") +[< Previous](../can-make-palindrome-from-substring "Can Make Palindrome from Substring") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/reformat-department-table "Reformat Department Table") +[Next >](../reformat-department-table "Reformat Department Table") ## [1178. Number of Valid Words for Each Puzzle (Hard)](https://leetcode.com/problems/number-of-valid-words-for-each-puzzle "猜字谜") @@ -48,8 +48,8 @@ There're no valid words for "gaswxyz" cause none of the ### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Hints
diff --git a/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps/README.md b/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps/README.md index 2bde286e7..0ab7b4892 100644 --- a/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps/README.md +++ b/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/search-suggestions-system "Search Suggestions System") +[< Previous](../search-suggestions-system "Search Suggestions System") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/all-people-report-to-the-given-manager "All People Report to the Given Manager") +[Next >](../all-people-report-to-the-given-manager "All People Report to the Given Manager") ## [1269. Number of Ways to Stay in the Same Place After Some Steps (Hard)](https://leetcode.com/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps "停在原地的方案数") @@ -56,7 +56,7 @@ Stay, Stay ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/numbers-at-most-n-given-digit-set/README.md b/problems/numbers-at-most-n-given-digit-set/README.md index da7c4b88d..6f2a2ecc8 100644 --- a/problems/numbers-at-most-n-given-digit-set/README.md +++ b/problems/numbers-at-most-n-given-digit-set/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/online-stock-span "Online Stock Span") +[< Previous](../online-stock-span "Online Stock Span") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/valid-permutations-for-di-sequence "Valid Permutations for DI Sequence") +[Next >](../valid-permutations-for-di-sequence "Valid Permutations for DI Sequence") ## [902. Numbers At Most N Given Digit Set (Hard)](https://leetcode.com/problems/numbers-at-most-n-given-digit-set "最大为 N 的数字组合") @@ -52,5 +52,5 @@ In total, this is 29523 integers that can be written using the digits of D. ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Math](../../tag/math/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/numbers-with-repeated-digits/README.md b/problems/numbers-with-repeated-digits/README.md index eb00fb3bd..72bbbd957 100644 --- a/problems/numbers-with-repeated-digits/README.md +++ b/problems/numbers-with-repeated-digits/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/capacity-to-ship-packages-within-d-days "Capacity To Ship Packages Within D Days") +[< Previous](../capacity-to-ship-packages-within-d-days "Capacity To Ship Packages Within D Days") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/partition-array-into-three-parts-with-equal-sum "Partition Array Into Three Parts With Equal Sum") +[Next >](../partition-array-into-three-parts-with-equal-sum "Partition Array Into Three Parts With Equal Sum") ## [1012. Numbers With Repeated Digits (Hard)](https://leetcode.com/problems/numbers-with-repeated-digits "至少有 1 位重复的数字") @@ -53,8 +53,8 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Math](../../tag/math/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/numbers-with-same-consecutive-differences/README.md b/problems/numbers-with-same-consecutive-differences/README.md index 74419a222..ca2e28dfb 100644 --- a/problems/numbers-with-same-consecutive-differences/README.md +++ b/problems/numbers-with-same-consecutive-differences/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/vowel-spellchecker "Vowel Spellchecker") +[< Previous](../vowel-spellchecker "Vowel Spellchecker") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/binary-tree-cameras "Binary Tree Cameras") +[Next >](../binary-tree-cameras "Binary Tree Cameras") ## [967. Numbers With Same Consecutive Differences (Medium)](https://leetcode.com/problems/numbers-with-same-consecutive-differences "连续差相同的数字") @@ -45,4 +45,4 @@ ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/occurrences-after-bigram/README.md b/problems/occurrences-after-bigram/README.md index 3b766fd6c..71a72d9a5 100644 --- a/problems/occurrences-after-bigram/README.md +++ b/problems/occurrences-after-bigram/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/project-employees-iii "Project Employees III") +[< Previous](../project-employees-iii "Project Employees III") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/letter-tile-possibilities "Letter Tile Possibilities") +[Next >](../letter-tile-possibilities "Letter Tile Possibilities") ## [1078. Occurrences After Bigram (Easy)](https://leetcode.com/problems/occurrences-after-bigram "Bigram 分词") @@ -45,7 +45,7 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Hints
diff --git a/problems/odd-even-jump/README.md b/problems/odd-even-jump/README.md index 499efc796..6495a0e72 100644 --- a/problems/odd-even-jump/README.md +++ b/problems/odd-even-jump/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/subarray-sums-divisible-by-k "Subarray Sums Divisible by K") +[< Previous](../subarray-sums-divisible-by-k "Subarray Sums Divisible by K") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/largest-perimeter-triangle "Largest Perimeter Triangle") +[Next >](../largest-perimeter-triangle "Largest Perimeter Triangle") ## [975. Odd Even Jump (Hard)](https://leetcode.com/problems/odd-even-jump "奇偶跳") @@ -87,6 +87,6 @@ We can reach the end from starting indexes 1, 2, and 4. ### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] - [[Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md)] + [[Stack](../../tag/stack/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] + [[Ordered Map](../../tag/ordered-map/README.md)] diff --git a/problems/odd-even-linked-list/README.md b/problems/odd-even-linked-list/README.md index 809c5d64d..45f2449b2 100644 --- a/problems/odd-even-linked-list/README.md +++ b/problems/odd-even-linked-list/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/count-of-range-sum "Count of Range Sum") +[< Previous](../count-of-range-sum "Count of Range Sum") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/longest-increasing-path-in-a-matrix "Longest Increasing Path in a Matrix") +[Next >](../longest-increasing-path-in-a-matrix "Longest Increasing Path in a Matrix") ## [328. Odd Even Linked List (Medium)](https://leetcode.com/problems/odd-even-linked-list "奇偶链表") @@ -37,7 +37,7 @@ ### Related Topics - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] + [[Linked List](../../tag/linked-list/README.md)] ### Similar Questions - 1. [Split Linked List in Parts](https://github.com/openset/leetcode/tree/master/problems/split-linked-list-in-parts) (Medium) + 1. [Split Linked List in Parts](../split-linked-list-in-parts) (Medium) diff --git a/problems/one-edit-distance/README.md b/problems/one-edit-distance/README.md index 80b022090..1237b5476 100644 --- a/problems/one-edit-distance/README.md +++ b/problems/one-edit-distance/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-linked-lists "Intersection of Two Linked Lists") +[< Previous](../intersection-of-two-linked-lists "Intersection of Two Linked Lists") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-peak-element "Find Peak Element") +[Next >](../find-peak-element "Find Peak Element") ## [161. One Edit Distance (Medium)](https://leetcode.com/problems/one-edit-distance "相隔为 1 的编辑距离") @@ -43,7 +43,7 @@ Explanation: We can replace '0' with '1' to get t. ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Edit Distance](https://github.com/openset/leetcode/tree/master/problems/edit-distance) (Hard) + 1. [Edit Distance](../edit-distance) (Hard) diff --git a/problems/ones-and-zeroes/README.md b/problems/ones-and-zeroes/README.md index 1f1dab26f..dbbe1cc58 100644 --- a/problems/ones-and-zeroes/README.md +++ b/problems/ones-and-zeroes/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/matchsticks-to-square "Matchsticks to Square") +[< Previous](../matchsticks-to-square "Matchsticks to Square") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/heaters "Heaters") +[Next >](../heaters "Heaters") ## [474. Ones and Zeroes (Medium)](https://leetcode.com/problems/ones-and-zeroes "一和零") @@ -49,7 +49,7 @@

 

### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Non-negative Integers without Consecutive Ones](https://github.com/openset/leetcode/tree/master/problems/non-negative-integers-without-consecutive-ones) (Hard) + 1. [Non-negative Integers without Consecutive Ones](../non-negative-integers-without-consecutive-ones) (Hard) diff --git a/problems/online-election/README.md b/problems/online-election/README.md index 095e48566..de4117996 100644 --- a/problems/online-election/README.md +++ b/problems/online-election/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/smallest-range-ii "Smallest Range II") +[< Previous](../smallest-range-ii "Smallest Range II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/sort-an-array "Sort an Array") +[Next >](../sort-an-array "Sort an Array") ## [911. Online Election (Medium)](https://leetcode.com/problems/online-election "在线选举") @@ -46,4 +46,4 @@ This continues for 3 more queries at time 15, 24, and 8. ### Related Topics - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] diff --git a/problems/online-majority-element-in-subarray/README.md b/problems/online-majority-element-in-subarray/README.md index 3bafa6159..550e63118 100644 --- a/problems/online-majority-element-in-subarray/README.md +++ b/problems/online-majority-element-in-subarray/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/swap-for-longest-repeated-character-substring "Swap For Longest Repeated Character Substring") +[< Previous](../swap-for-longest-repeated-character-substring "Swap For Longest Repeated Character Substring") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/market-analysis-i "Market Analysis I") +[Next >](../market-analysis-i "Market Analysis I") ## [1157. Online Majority Element In Subarray (Hard)](https://leetcode.com/problems/online-majority-element-in-subarray "子数组中占绝大多数的元素") @@ -48,9 +48,9 @@ majorityChecker.query(2,3,2); // returns 2 ### Related Topics - [[Segment Tree](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Segment Tree](../../tag/segment-tree/README.md)] + [[Array](../../tag/array/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Hints
diff --git a/problems/online-stock-span/README.md b/problems/online-stock-span/README.md index 22c885cf1..9a8c473ca 100644 --- a/problems/online-stock-span/README.md +++ b/problems/online-stock-span/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/rle-iterator "RLE Iterator") +[< Previous](../rle-iterator "RLE Iterator") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/numbers-at-most-n-given-digit-set "Numbers At Most N Given Digit Set") +[Next >](../numbers-at-most-n-given-digit-set "Numbers At Most N Given Digit Set") ## [901. Online Stock Span (Medium)](https://leetcode.com/problems/online-stock-span "股票价格跨度") @@ -52,4 +52,4 @@ Note that (for example) S.next(75) returned 4, because the last 4 prices ### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] + [[Stack](../../tag/stack/README.md)] diff --git a/problems/open-the-lock/README.md b/problems/open-the-lock/README.md index ca151345b..94e887a81 100644 --- a/problems/open-the-lock/README.md +++ b/problems/open-the-lock/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/ip-to-cidr "IP to CIDR") +[< Previous](../ip-to-cidr "IP to CIDR") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/cracking-the-safe "Cracking the Safe") +[Next >](../cracking-the-safe "Cracking the Safe") ## [752. Open the Lock (Medium)](https://leetcode.com/problems/open-the-lock "打开转盘锁") @@ -66,7 +66,7 @@ We can't reach the target without getting stuck.

### Related Topics - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] ### Hints
diff --git a/problems/optimal-account-balancing/README.md b/problems/optimal-account-balancing/README.md index e9d09522d..0bb3b3b4f 100644 --- a/problems/optimal-account-balancing/README.md +++ b/problems/optimal-account-balancing/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/can-i-win "Can I Win") +[< Previous](../can-i-win "Can I Win") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/count-the-repetitions "Count The Repetitions") +[Next >](../count-the-repetitions "Count The Repetitions") ## [465. Optimal Account Balancing (Hard)](https://leetcode.com/problems/optimal-account-balancing "最优账单平衡") diff --git a/problems/optimal-division/README.md b/problems/optimal-division/README.md index d72f3a290..3dd845203 100644 --- a/problems/optimal-division/README.md +++ b/problems/optimal-division/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/student-attendance-record-ii "Student Attendance Record II") +[< Previous](../student-attendance-record-ii "Student Attendance Record II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/brick-wall "Brick Wall") +[Next >](../brick-wall "Brick Wall") ## [553. Optimal Division (Medium)](https://leetcode.com/problems/optimal-division "最优除法") @@ -40,5 +40,5 @@ Other cases:

### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Math](../../tag/math/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/optimize-water-distribution-in-a-village/README.md b/problems/optimize-water-distribution-in-a-village/README.md index 2a3e4db94..2c9ea50d0 100644 --- a/problems/optimize-water-distribution-in-a-village/README.md +++ b/problems/optimize-water-distribution-in-a-village/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-cost-to-connect-sticks "Minimum Cost to Connect Sticks") +[< Previous](../minimum-cost-to-connect-sticks "Minimum Cost to Connect Sticks") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/invalid-transactions "Invalid Transactions") +[Next >](../invalid-transactions "Invalid Transactions") ## [1168. Optimize Water Distribution in a Village (Hard)](https://leetcode.com/problems/optimize-water-distribution-in-a-village "水资源分配优化") @@ -44,8 +44,8 @@ The best strategy is to build a well in the first house with cost 1 and connect ### Related Topics - [[Union Find](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] + [[Union Find](../../tag/union-find/README.md)] + [[Graph](../../tag/graph/README.md)] ### Hints
diff --git a/problems/orderly-queue/README.md b/problems/orderly-queue/README.md index c26709ec0..f245fb700 100644 --- a/problems/orderly-queue/README.md +++ b/problems/orderly-queue/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/bitwise-ors-of-subarrays "Bitwise ORs of Subarrays") +[< Previous](../bitwise-ors-of-subarrays "Bitwise ORs of Subarrays") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/rle-iterator "RLE Iterator") +[Next >](../rle-iterator "RLE Iterator") ## [899. Orderly Queue (Hard)](https://leetcode.com/problems/orderly-queue "有序队列") @@ -53,5 +53,5 @@ In the second move, we move the 3rd character ("c") to the end, obtain ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Math](../../tag/math/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/out-of-boundary-paths/README.md b/problems/out-of-boundary-paths/README.md index a3719733d..31811361b 100644 --- a/problems/out-of-boundary-paths/README.md +++ b/problems/out-of-boundary-paths/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/distribute-candies "Distribute Candies") +[< Previous](../distribute-candies "Distribute Candies") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/employee-bonus "Employee Bonus") +[Next >](../employee-bonus "Employee Bonus") ## [576. Out of Boundary Paths (Medium)](https://leetcode.com/problems/out-of-boundary-paths "出界的路径数") @@ -44,11 +44,11 @@ ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Knight Probability in Chessboard](https://github.com/openset/leetcode/tree/master/problems/knight-probability-in-chessboard) (Medium) + 1. [Knight Probability in Chessboard](../knight-probability-in-chessboard) (Medium) ### Hints
diff --git a/problems/output-contest-matches/README.md b/problems/output-contest-matches/README.md index 5dd263202..784571272 100644 --- a/problems/output-contest-matches/README.md +++ b/problems/output-contest-matches/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/diameter-of-binary-tree "Diameter of Binary Tree") +[< Previous](../diameter-of-binary-tree "Diameter of Binary Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/boundary-of-binary-tree "Boundary of Binary Tree") +[Next >](../boundary-of-binary-tree "Boundary of Binary Tree") ## [544. Output Contest Matches (Medium)](https://leetcode.com/problems/output-contest-matches "输出比赛匹配对") @@ -56,5 +56,5 @@ Since the third round will generate the final winner, you need to output the ans

### Related Topics - [[Recursion](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Recursion](../../tag/recursion/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/pacific-atlantic-water-flow/README.md b/problems/pacific-atlantic-water-flow/README.md index ade44570b..0b253b797 100644 --- a/problems/pacific-atlantic-water-flow/README.md +++ b/problems/pacific-atlantic-water-flow/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/partition-equal-subset-sum "Partition Equal Subset Sum") +[< Previous](../partition-equal-subset-sum "Partition Equal Subset Sum") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/sentence-screen-fitting "Sentence Screen Fitting") +[Next >](../sentence-screen-fitting "Sentence Screen Fitting") ## [417. Pacific Atlantic Water Flow (Medium)](https://leetcode.com/problems/pacific-atlantic-water-flow "太平洋大西洋水流问题") @@ -47,5 +47,5 @@ Return:

 

### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] diff --git a/problems/page-recommendations/README.md b/problems/page-recommendations/README.md index ed8e615fa..e7a369734 100644 --- a/problems/page-recommendations/README.md +++ b/problems/page-recommendations/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-moves-to-move-a-box-to-their-target-location "Minimum Moves to Move a Box to Their Target Location") +[< Previous](../minimum-moves-to-move-a-box-to-their-target-location "Minimum Moves to Move a Box to Their Target Location") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/print-immutable-linked-list-in-reverse "Print Immutable Linked List in Reverse") +[Next >](../print-immutable-linked-list-in-reverse "Print Immutable Linked List in Reverse") ## [1264. Page Recommendations (Medium)](https://leetcode.com/problems/page-recommendations "") diff --git a/problems/paint-fence/README.md b/problems/paint-fence/README.md index bc0e1e428..03eb7abea 100644 --- a/problems/paint-fence/README.md +++ b/problems/paint-fence/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/h-index-ii "H-Index II") +[< Previous](../h-index-ii "H-Index II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-the-celebrity "Find the Celebrity") +[Next >](../find-the-celebrity "Find the Celebrity") ## [276. Paint Fence (Easy)](https://leetcode.com/problems/paint-fence "栅栏涂色") @@ -38,10 +38,10 @@ n and k are non-negative integers.

### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [House Robber](https://github.com/openset/leetcode/tree/master/problems/house-robber) (Easy) - 1. [House Robber II](https://github.com/openset/leetcode/tree/master/problems/house-robber-ii) (Medium) - 1. [Paint House](https://github.com/openset/leetcode/tree/master/problems/paint-house) (Easy) - 1. [Paint House II](https://github.com/openset/leetcode/tree/master/problems/paint-house-ii) (Hard) + 1. [House Robber](../house-robber) (Easy) + 1. [House Robber II](../house-robber-ii) (Medium) + 1. [Paint House](../paint-house) (Easy) + 1. [Paint House II](../paint-house-ii) (Hard) diff --git a/problems/paint-house-ii/README.md b/problems/paint-house-ii/README.md index 6c67ad2d3..4cf6ca2a3 100644 --- a/problems/paint-house-ii/README.md +++ b/problems/paint-house-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/ugly-number-ii "Ugly Number II") +[< Previous](../ugly-number-ii "Ugly Number II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/palindrome-permutation "Palindrome Permutation") +[Next >](../palindrome-permutation "Palindrome Permutation") ## [265. Paint House II (Hard)](https://leetcode.com/problems/paint-house-ii "粉刷房子 II") @@ -31,10 +31,10 @@ All costs are positive integers.

Could you solve it in O(nk) runtime?

### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Product of Array Except Self](https://github.com/openset/leetcode/tree/master/problems/product-of-array-except-self) (Medium) - 1. [Sliding Window Maximum](https://github.com/openset/leetcode/tree/master/problems/sliding-window-maximum) (Hard) - 1. [Paint House](https://github.com/openset/leetcode/tree/master/problems/paint-house) (Easy) - 1. [Paint Fence](https://github.com/openset/leetcode/tree/master/problems/paint-fence) (Easy) + 1. [Product of Array Except Self](../product-of-array-except-self) (Medium) + 1. [Sliding Window Maximum](../sliding-window-maximum) (Hard) + 1. [Paint House](../paint-house) (Easy) + 1. [Paint Fence](../paint-fence) (Easy) diff --git a/problems/paint-house/README.md b/problems/paint-house/README.md index d2a630ea7..ca0ca2513 100644 --- a/problems/paint-house/README.md +++ b/problems/paint-house/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/verify-preorder-sequence-in-binary-search-tree "Verify Preorder Sequence in Binary Search Tree") +[< Previous](../verify-preorder-sequence-in-binary-search-tree "Verify Preorder Sequence in Binary Search Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/binary-tree-paths "Binary Tree Paths") +[Next >](../binary-tree-paths "Binary Tree Paths") ## [256. Paint House (Easy)](https://leetcode.com/problems/paint-house "粉刷房子") @@ -28,10 +28,10 @@ All costs are positive integers.

### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [House Robber](https://github.com/openset/leetcode/tree/master/problems/house-robber) (Easy) - 1. [House Robber II](https://github.com/openset/leetcode/tree/master/problems/house-robber-ii) (Medium) - 1. [Paint House II](https://github.com/openset/leetcode/tree/master/problems/paint-house-ii) (Hard) - 1. [Paint Fence](https://github.com/openset/leetcode/tree/master/problems/paint-fence) (Easy) + 1. [House Robber](../house-robber) (Easy) + 1. [House Robber II](../house-robber-ii) (Medium) + 1. [Paint House II](../paint-house-ii) (Hard) + 1. [Paint Fence](../paint-fence) (Easy) diff --git a/problems/pairs-of-songs-with-total-durations-divisible-by-60/README.md b/problems/pairs-of-songs-with-total-durations-divisible-by-60/README.md index 34ecb218e..9e5ac8d38 100644 --- a/problems/pairs-of-songs-with-total-durations-divisible-by-60/README.md +++ b/problems/pairs-of-songs-with-total-durations-divisible-by-60/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/complement-of-base-10-integer "Complement of Base 10 Integer") +[< Previous](../complement-of-base-10-integer "Complement of Base 10 Integer") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/capacity-to-ship-packages-within-d-days "Capacity To Ship Packages Within D Days") +[Next >](../capacity-to-ship-packages-within-d-days "Capacity To Ship Packages Within D Days") ## [1010. Pairs of Songs With Total Durations Divisible by 60 (Easy)](https://leetcode.com/problems/pairs-of-songs-with-total-durations-divisible-by-60 "总持续时间可被 60 整除的歌曲") @@ -48,7 +48,7 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Hints
diff --git a/problems/palindrome-linked-list/README.md b/problems/palindrome-linked-list/README.md index a70f16f45..1bb515a82 100644 --- a/problems/palindrome-linked-list/README.md +++ b/problems/palindrome-linked-list/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/number-of-digit-one "Number of Digit One") +[< Previous](../number-of-digit-one "Number of Digit One") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/lowest-common-ancestor-of-a-binary-search-tree "Lowest Common Ancestor of a Binary Search Tree") +[Next >](../lowest-common-ancestor-of-a-binary-search-tree "Lowest Common Ancestor of a Binary Search Tree") ## [234. Palindrome Linked List (Easy)](https://leetcode.com/problems/palindrome-linked-list "回文链表") @@ -29,10 +29,10 @@ Could you do it in O(n) time and O(1) space?

### Related Topics - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Linked List](../../tag/linked-list/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] ### Similar Questions - 1. [Palindrome Number](https://github.com/openset/leetcode/tree/master/problems/palindrome-number) (Easy) - 1. [Valid Palindrome](https://github.com/openset/leetcode/tree/master/problems/valid-palindrome) (Easy) - 1. [Reverse Linked List](https://github.com/openset/leetcode/tree/master/problems/reverse-linked-list) (Easy) + 1. [Palindrome Number](../palindrome-number) (Easy) + 1. [Valid Palindrome](../valid-palindrome) (Easy) + 1. [Reverse Linked List](../reverse-linked-list) (Easy) diff --git a/problems/palindrome-number/README.md b/problems/palindrome-number/README.md index bf22a0386..2fb012ce4 100644 --- a/problems/palindrome-number/README.md +++ b/problems/palindrome-number/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/string-to-integer-atoi "String to Integer (atoi)") +[< Previous](../string-to-integer-atoi "String to Integer (atoi)") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/regular-expression-matching "Regular Expression Matching") +[Next >](../regular-expression-matching "Regular Expression Matching") ## [9. Palindrome Number (Easy)](https://leetcode.com/problems/palindrome-number "回文数") @@ -41,10 +41,10 @@

Coud you solve it without converting the integer to a string?

### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Palindrome Linked List](https://github.com/openset/leetcode/tree/master/problems/palindrome-linked-list) (Easy) + 1. [Palindrome Linked List](../palindrome-linked-list) (Easy) ### Hints
diff --git a/problems/palindrome-pairs/README.md b/problems/palindrome-pairs/README.md index 797712f1f..a1005a77d 100644 --- a/problems/palindrome-pairs/README.md +++ b/problems/palindrome-pairs/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/self-crossing "Self Crossing") +[< Previous](../self-crossing "Self Crossing") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/house-robber-iii "House Robber III") +[Next >](../house-robber-iii "House Robber III") ## [336. Palindrome Pairs (Hard)](https://leetcode.com/problems/palindrome-pairs "回文对") @@ -34,10 +34,10 @@ ### Related Topics - [[Trie](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Trie](../../tag/trie/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Longest Palindromic Substring](https://github.com/openset/leetcode/tree/master/problems/longest-palindromic-substring) (Medium) - 1. [Shortest Palindrome](https://github.com/openset/leetcode/tree/master/problems/shortest-palindrome) (Hard) + 1. [Longest Palindromic Substring](../longest-palindromic-substring) (Medium) + 1. [Shortest Palindrome](../shortest-palindrome) (Hard) diff --git a/problems/palindrome-partitioning-ii/README.md b/problems/palindrome-partitioning-ii/README.md index 7c5520f4d..f511bd3c9 100644 --- a/problems/palindrome-partitioning-ii/README.md +++ b/problems/palindrome-partitioning-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/palindrome-partitioning "Palindrome Partitioning") +[< Previous](../palindrome-partitioning "Palindrome Partitioning") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/clone-graph "Clone Graph") +[Next >](../clone-graph "Clone Graph") ## [132. Palindrome Partitioning II (Hard)](https://leetcode.com/problems/palindrome-partitioning-ii "分割回文串 II") @@ -24,7 +24,7 @@ ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Palindrome Partitioning](https://github.com/openset/leetcode/tree/master/problems/palindrome-partitioning) (Medium) + 1. [Palindrome Partitioning](../palindrome-partitioning) (Medium) diff --git a/problems/palindrome-partitioning-iii/README.md b/problems/palindrome-partitioning-iii/README.md index 756123c04..0dc5381f5 100644 --- a/problems/palindrome-partitioning-iii/README.md +++ b/problems/palindrome-partitioning-iii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/count-square-submatrices-with-all-ones "Count Square Submatrices with All Ones") +[< Previous](../count-square-submatrices-with-all-ones "Count Square Submatrices with All Ones") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/traffic-light-controlled-intersection "Traffic Light Controlled Intersection") +[Next >](../traffic-light-controlled-intersection "Traffic Light Controlled Intersection") ## [1278. Palindrome Partitioning III (Hard)](https://leetcode.com/problems/palindrome-partitioning-iii "分割回文串 III") @@ -52,7 +52,7 @@ ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/palindrome-partitioning/README.md b/problems/palindrome-partitioning/README.md index edfc550cf..8fefdf049 100644 --- a/problems/palindrome-partitioning/README.md +++ b/problems/palindrome-partitioning/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/surrounded-regions "Surrounded Regions") +[< Previous](../surrounded-regions "Surrounded Regions") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/palindrome-partitioning-ii "Palindrome Partitioning II") +[Next >](../palindrome-partitioning-ii "Palindrome Partitioning II") ## [131. Palindrome Partitioning (Medium)](https://leetcode.com/problems/palindrome-partitioning "分割回文串") @@ -27,7 +27,7 @@ ### Related Topics - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Palindrome Partitioning II](https://github.com/openset/leetcode/tree/master/problems/palindrome-partitioning-ii) (Hard) + 1. [Palindrome Partitioning II](../palindrome-partitioning-ii) (Hard) diff --git a/problems/palindrome-permutation-ii/README.md b/problems/palindrome-permutation-ii/README.md index ac5d96264..955fa468f 100644 --- a/problems/palindrome-permutation-ii/README.md +++ b/problems/palindrome-permutation-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/palindrome-permutation "Palindrome Permutation") +[< Previous](../palindrome-permutation "Palindrome Permutation") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/missing-number "Missing Number") +[Next >](../missing-number "Missing Number") ## [267. Palindrome Permutation II (Medium)](https://leetcode.com/problems/palindrome-permutation-ii "回文排列 II") @@ -24,12 +24,12 @@ Output: [] ### Related Topics - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Next Permutation](https://github.com/openset/leetcode/tree/master/problems/next-permutation) (Medium) - 1. [Permutations II](https://github.com/openset/leetcode/tree/master/problems/permutations-ii) (Medium) - 1. [Palindrome Permutation](https://github.com/openset/leetcode/tree/master/problems/palindrome-permutation) (Easy) + 1. [Next Permutation](../next-permutation) (Medium) + 1. [Permutations II](../permutations-ii) (Medium) + 1. [Palindrome Permutation](../palindrome-permutation) (Easy) ### Hints
diff --git a/problems/palindrome-permutation/README.md b/problems/palindrome-permutation/README.md index 935bf732b..865215b59 100644 --- a/problems/palindrome-permutation/README.md +++ b/problems/palindrome-permutation/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/paint-house-ii "Paint House II") +[< Previous](../paint-house-ii "Paint House II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/palindrome-permutation-ii "Palindrome Permutation II") +[Next >](../palindrome-permutation-ii "Palindrome Permutation II") ## [266. Palindrome Permutation (Easy)](https://leetcode.com/problems/palindrome-permutation "回文排列") @@ -29,13 +29,13 @@ Output: true ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Longest Palindromic Substring](https://github.com/openset/leetcode/tree/master/problems/longest-palindromic-substring) (Medium) - 1. [Valid Anagram](https://github.com/openset/leetcode/tree/master/problems/valid-anagram) (Easy) - 1. [Palindrome Permutation II](https://github.com/openset/leetcode/tree/master/problems/palindrome-permutation-ii) (Medium) - 1. [Longest Palindrome](https://github.com/openset/leetcode/tree/master/problems/longest-palindrome) (Easy) + 1. [Longest Palindromic Substring](../longest-palindromic-substring) (Medium) + 1. [Valid Anagram](../valid-anagram) (Easy) + 1. [Palindrome Permutation II](../palindrome-permutation-ii) (Medium) + 1. [Longest Palindrome](../longest-palindrome) (Easy) ### Hints
diff --git a/problems/palindrome-removal/README.md b/problems/palindrome-removal/README.md index 6705ece34..30cd1b25d 100644 --- a/problems/palindrome-removal/README.md +++ b/problems/palindrome-removal/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/tree-diameter "Tree Diameter") +[< Previous](../tree-diameter "Tree Diameter") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-swaps-to-make-strings-equal "Minimum Swaps to Make Strings Equal") +[Next >](../minimum-swaps-to-make-strings-equal "Minimum Swaps to Make Strings Equal") ## [1246. Palindrome Removal (Hard)](https://leetcode.com/problems/palindrome-removal "删除回文子数组") @@ -40,7 +40,7 @@ ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/palindromic-substrings/README.md b/problems/palindromic-substrings/README.md index e197ee619..05e2e21f5 100644 --- a/problems/palindromic-substrings/README.md +++ b/problems/palindromic-substrings/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-length-of-pair-chain "Maximum Length of Pair Chain") +[< Previous](../maximum-length-of-pair-chain "Maximum Length of Pair Chain") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/replace-words "Replace Words") +[Next >](../replace-words "Replace Words") ## [647. Palindromic Substrings (Medium)](https://leetcode.com/problems/palindromic-substrings "回文子串") @@ -44,13 +44,13 @@

 

### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[String](../../tag/string/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Longest Palindromic Substring](https://github.com/openset/leetcode/tree/master/problems/longest-palindromic-substring) (Medium) - 1. [Longest Palindromic Subsequence](https://github.com/openset/leetcode/tree/master/problems/longest-palindromic-subsequence) (Medium) - 1. [Palindromic Substrings](https://github.com/openset/leetcode/tree/master/problems/palindromic-substrings) (Medium) + 1. [Longest Palindromic Substring](../longest-palindromic-substring) (Medium) + 1. [Longest Palindromic Subsequence](../longest-palindromic-subsequence) (Medium) + 1. [Palindromic Substrings](../palindromic-substrings) (Medium) ### Hints
diff --git a/problems/pancake-sorting/README.md b/problems/pancake-sorting/README.md index 7befdf534..7c0d1e180 100644 --- a/problems/pancake-sorting/README.md +++ b/problems/pancake-sorting/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/binary-tree-cameras "Binary Tree Cameras") +[< Previous](../binary-tree-cameras "Binary Tree Cameras") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/powerful-integers "Powerful Integers") +[Next >](../powerful-integers "Powerful Integers") ## [969. Pancake Sorting (Medium)](https://leetcode.com/problems/pancake-sorting "煎饼排序") @@ -52,5 +52,5 @@ Note that other answers, such as [3, 3], would also be accepted. ### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Sort](../../tag/sort/README.md)] + [[Array](../../tag/array/README.md)] diff --git a/problems/parallel-courses/README.md b/problems/parallel-courses/README.md index d0ba637d3..823516bf4 100644 --- a/problems/parallel-courses/README.md +++ b/problems/parallel-courses/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/connecting-cities-with-minimum-cost "Connecting Cities With Minimum Cost") +[< Previous](../connecting-cities-with-minimum-cost "Connecting Cities With Minimum Cost") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/n-th-tribonacci-number "N-th Tribonacci Number") +[Next >](../n-th-tribonacci-number "N-th Tribonacci Number") ## [1136. Parallel Courses (Hard)](https://leetcode.com/problems/parallel-courses "平行课程") @@ -55,9 +55,9 @@ No course can be studied because they depend on each other. ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Graph](../../tag/graph/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/parse-lisp-expression/README.md b/problems/parse-lisp-expression/README.md index 8d240afae..a90237542 100644 --- a/problems/parse-lisp-expression/README.md +++ b/problems/parse-lisp-expression/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/asteroid-collision "Asteroid Collision") +[< Previous](../asteroid-collision "Asteroid Collision") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/sentence-similarity-ii "Sentence Similarity II") +[Next >](../sentence-similarity-ii "Sentence Similarity II") ## [736. Parse Lisp Expression (Hard)](https://leetcode.com/problems/parse-lisp-expression "Lisp 语法解析") @@ -75,12 +75,12 @@ of the final x in the add-expression. That final x will equal 2.

### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Ternary Expression Parser](https://github.com/openset/leetcode/tree/master/problems/ternary-expression-parser) (Medium) - 1. [Number of Atoms](https://github.com/openset/leetcode/tree/master/problems/number-of-atoms) (Hard) - 1. [Basic Calculator IV](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-iv) (Hard) + 1. [Ternary Expression Parser](../ternary-expression-parser) (Medium) + 1. [Number of Atoms](../number-of-atoms) (Hard) + 1. [Basic Calculator IV](../basic-calculator-iv) (Hard) ### Hints
diff --git a/problems/parsing-a-boolean-expression/README.md b/problems/parsing-a-boolean-expression/README.md index 30029252d..227146bce 100644 --- a/problems/parsing-a-boolean-expression/README.md +++ b/problems/parsing-a-boolean-expression/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/filling-bookcase-shelves "Filling Bookcase Shelves") +[< Previous](../filling-bookcase-shelves "Filling Bookcase Shelves") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/new-users-daily-count "New Users Daily Count") +[Next >](../new-users-daily-count "New Users Daily Count") ## [1106. Parsing A Boolean Expression (Hard)](https://leetcode.com/problems/parsing-a-boolean-expression "解析布尔表达式") @@ -62,7 +62,7 @@ ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Hints
diff --git a/problems/partition-array-for-maximum-sum/README.md b/problems/partition-array-for-maximum-sum/README.md index 08ebc734e..0c2ac4cbc 100644 --- a/problems/partition-array-for-maximum-sum/README.md +++ b/problems/partition-array-for-maximum-sum/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/flower-planting-with-no-adjacent "Flower Planting With No Adjacent") +[< Previous](../flower-planting-with-no-adjacent "Flower Planting With No Adjacent") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/longest-duplicate-substring "Longest Duplicate Substring") +[Next >](../longest-duplicate-substring "Longest Duplicate Substring") ## [1043. Partition Array for Maximum Sum (Medium)](https://leetcode.com/problems/partition-array-for-maximum-sum "分隔数组以得到最大和") @@ -34,7 +34,7 @@ ### Related Topics - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] + [[Graph](../../tag/graph/README.md)] ### Hints
diff --git a/problems/partition-array-into-disjoint-intervals/README.md b/problems/partition-array-into-disjoint-intervals/README.md index e0f1e8953..28bb1ce3f 100644 --- a/problems/partition-array-into-disjoint-intervals/README.md +++ b/problems/partition-array-into-disjoint-intervals/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/x-of-a-kind-in-a-deck-of-cards "X of a Kind in a Deck of Cards") +[< Previous](../x-of-a-kind-in-a-deck-of-cards "X of a Kind in a Deck of Cards") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/word-subsets "Word Subsets") +[Next >](../word-subsets "Word Subsets") ## [915. Partition Array into Disjoint Intervals (Medium)](https://leetcode.com/problems/partition-array-into-disjoint-intervals "分割数组") @@ -56,4 +56,4 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] diff --git a/problems/partition-array-into-three-parts-with-equal-sum/README.md b/problems/partition-array-into-three-parts-with-equal-sum/README.md index 617d531c1..17458db56 100644 --- a/problems/partition-array-into-three-parts-with-equal-sum/README.md +++ b/problems/partition-array-into-three-parts-with-equal-sum/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/numbers-with-repeated-digits "Numbers With Repeated Digits") +[< Previous](../numbers-with-repeated-digits "Numbers With Repeated Digits") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/best-sightseeing-pair "Best Sightseeing Pair") +[Next >](../best-sightseeing-pair "Best Sightseeing Pair") ## [1013. Partition Array Into Three Parts With Equal Sum (Easy)](https://leetcode.com/problems/partition-array-into-three-parts-with-equal-sum "将数组分成和相等的三个部分") @@ -54,7 +54,7 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Hints
diff --git a/problems/partition-equal-subset-sum/README.md b/problems/partition-equal-subset-sum/README.md index de9e9da24..2a8918ccf 100644 --- a/problems/partition-equal-subset-sum/README.md +++ b/problems/partition-equal-subset-sum/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/add-strings "Add Strings") +[< Previous](../add-strings "Add Strings") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/pacific-atlantic-water-flow "Pacific Atlantic Water Flow") +[Next >](../pacific-atlantic-water-flow "Pacific Atlantic Water Flow") ## [416. Partition Equal Subset Sum (Medium)](https://leetcode.com/problems/partition-equal-subset-sum "分割等和子集") @@ -47,7 +47,7 @@ Explanation: The array cannot be partitioned into equal sum subsets.

 

### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Partition to K Equal Sum Subsets](https://github.com/openset/leetcode/tree/master/problems/partition-to-k-equal-sum-subsets) (Medium) + 1. [Partition to K Equal Sum Subsets](../partition-to-k-equal-sum-subsets) (Medium) diff --git a/problems/partition-labels/README.md b/problems/partition-labels/README.md index a712e88e2..52a9a5fab 100644 --- a/problems/partition-labels/README.md +++ b/problems/partition-labels/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/prime-number-of-set-bits-in-binary-representation "Prime Number of Set Bits in Binary Representation") +[< Previous](../prime-number-of-set-bits-in-binary-representation "Prime Number of Set Bits in Binary Representation") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/largest-plus-sign "Largest Plus Sign") +[Next >](../largest-plus-sign "Largest Plus Sign") ## [763. Partition Labels (Medium)](https://leetcode.com/problems/partition-labels "划分字母区间") @@ -32,11 +32,11 @@ A partition like "ababcbacadefegde", "hijhklij" is incorrect, because it splits

### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] ### Similar Questions - 1. [Merge Intervals](https://github.com/openset/leetcode/tree/master/problems/merge-intervals) (Medium) + 1. [Merge Intervals](../merge-intervals) (Medium) ### Hints
diff --git a/problems/partition-list/README.md b/problems/partition-list/README.md index 50f89c4d6..9d88e31d5 100644 --- a/problems/partition-list/README.md +++ b/problems/partition-list/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximal-rectangle "Maximal Rectangle") +[< Previous](../maximal-rectangle "Maximal Rectangle") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/scramble-string "Scramble String") +[Next >](../scramble-string "Scramble String") ## [86. Partition List (Medium)](https://leetcode.com/problems/partition-list "分隔链表") @@ -23,5 +23,5 @@ ### Related Topics - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Linked List](../../tag/linked-list/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] diff --git a/problems/partition-to-k-equal-sum-subsets/README.md b/problems/partition-to-k-equal-sum-subsets/README.md index 8e6965555..9d06a68ed 100644 --- a/problems/partition-to-k-equal-sum-subsets/README.md +++ b/problems/partition-to-k-equal-sum-subsets/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/degree-of-an-array "Degree of an Array") +[< Previous](../degree-of-an-array "Degree of an Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/falling-squares "Falling Squares") +[Next >](../falling-squares "Falling Squares") ## [698. Partition to K Equal Sum Subsets (Medium)](https://leetcode.com/problems/partition-to-k-equal-sum-subsets "划分为k个相等的子集") @@ -33,11 +33,11 @@ ### Related Topics - [[Recursion](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Recursion](../../tag/recursion/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Partition Equal Subset Sum](https://github.com/openset/leetcode/tree/master/problems/partition-equal-subset-sum) (Medium) + 1. [Partition Equal Subset Sum](../partition-equal-subset-sum) (Medium) ### Hints
diff --git a/problems/pascals-triangle-ii/README.md b/problems/pascals-triangle-ii/README.md index e8ae762da..1aba95a12 100644 --- a/problems/pascals-triangle-ii/README.md +++ b/problems/pascals-triangle-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/pascals-triangle "Pascal's Triangle") +[< Previous](../pascals-triangle "Pascal's Triangle") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/triangle "Triangle") +[Next >](../triangle "Triangle") ## [119. Pascal's Triangle II (Easy)](https://leetcode.com/problems/pascals-triangle-ii "杨辉三角 II") @@ -30,7 +30,7 @@

Could you optimize your algorithm to use only O(k) extra space?

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Pascal's Triangle](https://github.com/openset/leetcode/tree/master/problems/pascals-triangle) (Easy) + 1. [Pascal's Triangle](../pascals-triangle) (Easy) diff --git a/problems/pascals-triangle/README.md b/problems/pascals-triangle/README.md index 84634d9b5..2ef0d3e30 100644 --- a/problems/pascals-triangle/README.md +++ b/problems/pascals-triangle/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/populating-next-right-pointers-in-each-node-ii "Populating Next Right Pointers in Each Node II") +[< Previous](../populating-next-right-pointers-in-each-node-ii "Populating Next Right Pointers in Each Node II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/pascals-triangle-ii "Pascal's Triangle II") +[Next >](../pascals-triangle-ii "Pascal's Triangle II") ## [118. Pascal's Triangle (Easy)](https://leetcode.com/problems/pascals-triangle "杨辉三角") @@ -31,7 +31,7 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Pascal's Triangle II](https://github.com/openset/leetcode/tree/master/problems/pascals-triangle-ii) (Easy) + 1. [Pascal's Triangle II](../pascals-triangle-ii) (Easy) diff --git a/problems/patching-array/README.md b/problems/patching-array/README.md index 30f0a78d8..d89e2785c 100644 --- a/problems/patching-array/README.md +++ b/problems/patching-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/longest-increasing-path-in-a-matrix "Longest Increasing Path in a Matrix") +[< Previous](../longest-increasing-path-in-a-matrix "Longest Increasing Path in a Matrix") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/verify-preorder-serialization-of-a-binary-tree "Verify Preorder Serialization of a Binary Tree") +[Next >](../verify-preorder-serialization-of-a-binary-tree "Verify Preorder Serialization of a Binary Tree") ## [330. Patching Array (Hard)](https://leetcode.com/problems/patching-array "按要求补齐数组") @@ -40,4 +40,4 @@ So we only need 1 patch. ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] + [[Greedy](../../tag/greedy/README.md)] diff --git a/problems/path-in-zigzag-labelled-binary-tree/README.md b/problems/path-in-zigzag-labelled-binary-tree/README.md index ef8048b43..c32c25e76 100644 --- a/problems/path-in-zigzag-labelled-binary-tree/README.md +++ b/problems/path-in-zigzag-labelled-binary-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/distribute-candies-to-people "Distribute Candies to People") +[< Previous](../distribute-candies-to-people "Distribute Candies to People") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/filling-bookcase-shelves "Filling Bookcase Shelves") +[Next >](../filling-bookcase-shelves "Filling Bookcase Shelves") ## [1104. Path In Zigzag Labelled Binary Tree (Medium)](https://leetcode.com/problems/path-in-zigzag-labelled-binary-tree "二叉树寻路") @@ -42,8 +42,8 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Math](../../tag/math/README.md)] ### Hints
diff --git a/problems/path-sum-ii/README.md b/problems/path-sum-ii/README.md index c866b5769..06f289c5c 100644 --- a/problems/path-sum-ii/README.md +++ b/problems/path-sum-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/path-sum "Path Sum") +[< Previous](../path-sum "Path Sum") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/flatten-binary-tree-to-linked-list "Flatten Binary Tree to Linked List") +[Next >](../flatten-binary-tree-to-linked-list "Flatten Binary Tree to Linked List") ## [113. Path Sum II (Medium)](https://leetcode.com/problems/path-sum-ii "路径总和 II") @@ -39,11 +39,11 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] ### Similar Questions - 1. [Path Sum](https://github.com/openset/leetcode/tree/master/problems/path-sum) (Easy) - 1. [Binary Tree Paths](https://github.com/openset/leetcode/tree/master/problems/binary-tree-paths) (Easy) - 1. [Path Sum III](https://github.com/openset/leetcode/tree/master/problems/path-sum-iii) (Easy) - 1. [Path Sum IV](https://github.com/openset/leetcode/tree/master/problems/path-sum-iv) (Medium) + 1. [Path Sum](../path-sum) (Easy) + 1. [Binary Tree Paths](../binary-tree-paths) (Easy) + 1. [Path Sum III](../path-sum-iii) (Easy) + 1. [Path Sum IV](../path-sum-iv) (Medium) diff --git a/problems/path-sum-iii/README.md b/problems/path-sum-iii/README.md index 6eb2edb78..5aefe3f75 100644 --- a/problems/path-sum-iii/README.md +++ b/problems/path-sum-iii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-right-interval "Find Right Interval") +[< Previous](../find-right-interval "Find Right Interval") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-all-anagrams-in-a-string "Find All Anagrams in a String") +[Next >](../find-all-anagrams-in-a-string "Find All Anagrams in a String") ## [437. Path Sum III (Easy)](https://leetcode.com/problems/path-sum-iii "路径总和 III") @@ -41,10 +41,10 @@ Return 3. The paths that sum to 8 are:

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] ### Similar Questions - 1. [Path Sum](https://github.com/openset/leetcode/tree/master/problems/path-sum) (Easy) - 1. [Path Sum II](https://github.com/openset/leetcode/tree/master/problems/path-sum-ii) (Medium) - 1. [Path Sum IV](https://github.com/openset/leetcode/tree/master/problems/path-sum-iv) (Medium) - 1. [Longest Univalue Path](https://github.com/openset/leetcode/tree/master/problems/longest-univalue-path) (Easy) + 1. [Path Sum](../path-sum) (Easy) + 1. [Path Sum II](../path-sum-ii) (Medium) + 1. [Path Sum IV](../path-sum-iv) (Medium) + 1. [Longest Univalue Path](../longest-univalue-path) (Easy) diff --git a/problems/path-sum-iv/README.md b/problems/path-sum-iv/README.md index b34a4feb6..c24266555 100644 --- a/problems/path-sum-iv/README.md +++ b/problems/path-sum-iv/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/non-decreasing-array "Non-decreasing Array") +[< Previous](../non-decreasing-array "Non-decreasing Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/beautiful-arrangement-ii "Beautiful Arrangement II") +[Next >](../beautiful-arrangement-ii "Beautiful Arrangement II") ## [666. Path Sum IV (Medium)](https://leetcode.com/problems/path-sum-iv "路径和 IV") @@ -56,10 +56,10 @@ The path sum is (3 + 1) = 4.

 

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] ### Similar Questions - 1. [Path Sum](https://github.com/openset/leetcode/tree/master/problems/path-sum) (Easy) - 1. [Path Sum II](https://github.com/openset/leetcode/tree/master/problems/path-sum-ii) (Medium) - 1. [Binary Tree Maximum Path Sum](https://github.com/openset/leetcode/tree/master/problems/binary-tree-maximum-path-sum) (Hard) - 1. [Path Sum III](https://github.com/openset/leetcode/tree/master/problems/path-sum-iii) (Easy) + 1. [Path Sum](../path-sum) (Easy) + 1. [Path Sum II](../path-sum-ii) (Medium) + 1. [Binary Tree Maximum Path Sum](../binary-tree-maximum-path-sum) (Hard) + 1. [Path Sum III](../path-sum-iii) (Easy) diff --git a/problems/path-sum/README.md b/problems/path-sum/README.md index a86e50a66..4938fdd45 100644 --- a/problems/path-sum/README.md +++ b/problems/path-sum/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-depth-of-binary-tree "Minimum Depth of Binary Tree") +[< Previous](../minimum-depth-of-binary-tree "Minimum Depth of Binary Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/path-sum-ii "Path Sum II") +[Next >](../path-sum-ii "Path Sum II") ## [112. Path Sum (Easy)](https://leetcode.com/problems/path-sum "路径总和") @@ -32,12 +32,12 @@

return true, as there exist a root-to-leaf path 5->4->11->2 which sum is 22.

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] ### Similar Questions - 1. [Path Sum II](https://github.com/openset/leetcode/tree/master/problems/path-sum-ii) (Medium) - 1. [Binary Tree Maximum Path Sum](https://github.com/openset/leetcode/tree/master/problems/binary-tree-maximum-path-sum) (Hard) - 1. [Sum Root to Leaf Numbers](https://github.com/openset/leetcode/tree/master/problems/sum-root-to-leaf-numbers) (Medium) - 1. [Path Sum III](https://github.com/openset/leetcode/tree/master/problems/path-sum-iii) (Easy) - 1. [Path Sum IV](https://github.com/openset/leetcode/tree/master/problems/path-sum-iv) (Medium) + 1. [Path Sum II](../path-sum-ii) (Medium) + 1. [Binary Tree Maximum Path Sum](../binary-tree-maximum-path-sum) (Hard) + 1. [Sum Root to Leaf Numbers](../sum-root-to-leaf-numbers) (Medium) + 1. [Path Sum III](../path-sum-iii) (Easy) + 1. [Path Sum IV](../path-sum-iv) (Medium) diff --git a/problems/path-with-maximum-gold/README.md b/problems/path-with-maximum-gold/README.md index 1d0dcf23a..451de7d4d 100644 --- a/problems/path-with-maximum-gold/README.md +++ b/problems/path-with-maximum-gold/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/longest-arithmetic-subsequence-of-given-difference "Longest Arithmetic Subsequence of Given Difference") +[< Previous](../longest-arithmetic-subsequence-of-given-difference "Longest Arithmetic Subsequence of Given Difference") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/count-vowels-permutation "Count Vowels Permutation") +[Next >](../count-vowels-permutation "Count Vowels Permutation") ## [1219. Path with Maximum Gold (Medium)](https://leetcode.com/problems/path-with-maximum-gold "黄金矿工") @@ -60,7 +60,7 @@ Path to get the maximum gold, 1 -> 2 -> 3 -> 4 -> 5 -> 6 -> 7. ### Related Topics - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Hints
diff --git a/problems/path-with-maximum-minimum-value/README.md b/problems/path-with-maximum-minimum-value/README.md index 2855bc72f..3a1a7ed12 100644 --- a/problems/path-with-maximum-minimum-value/README.md +++ b/problems/path-with-maximum-minimum-value/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/the-earliest-moment-when-everyone-become-friends "The Earliest Moment When Everyone Become Friends") +[< Previous](../the-earliest-moment-when-everyone-become-friends "The Earliest Moment When Everyone Become Friends") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/distribute-candies-to-people "Distribute Candies to People") +[Next >](../distribute-candies-to-people "Distribute Candies to People") ## [1102. Path With Maximum Minimum Value (Medium)](https://leetcode.com/problems/path-with-maximum-minimum-value "得分最高的路径") @@ -56,9 +56,9 @@ The path with the maximum score is highlighted in yellow. ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Union Find](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Union Find](../../tag/union-find/README.md)] + [[Graph](../../tag/graph/README.md)] ### Hints
diff --git a/problems/peak-index-in-a-mountain-array/README.md b/problems/peak-index-in-a-mountain-array/README.md index 71bdd1705..7d7bb7613 100644 --- a/problems/peak-index-in-a-mountain-array/README.md +++ b/problems/peak-index-in-a-mountain-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/loud-and-rich "Loud and Rich") +[< Previous](../loud-and-rich "Loud and Rich") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/car-fleet "Car Fleet") +[Next >](../car-fleet "Car Fleet") ## [852. Peak Index in a Mountain Array (Easy)](https://leetcode.com/problems/peak-index-in-a-mountain-array "山脉数组的峰顶索引") @@ -44,7 +44,7 @@ ### Related Topics - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [Find Peak Element](https://github.com/openset/leetcode/tree/master/problems/find-peak-element) (Medium) + 1. [Find Peak Element](../find-peak-element) (Medium) diff --git a/problems/peeking-iterator/README.md b/problems/peeking-iterator/README.md index bafc60b67..62371eb61 100644 --- a/problems/peeking-iterator/README.md +++ b/problems/peeking-iterator/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/move-zeroes "Move Zeroes") +[< Previous](../move-zeroes "Move Zeroes") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/inorder-successor-in-bst "Inorder Successor in BST") +[Next >](../inorder-successor-in-bst "Inorder Successor in BST") ## [284. Peeking Iterator (Medium)](https://leetcode.com/problems/peeking-iterator "顶端迭代器") @@ -27,12 +27,12 @@ Calling hasNext() after that should return Follow up: How would you extend your design to be generic and work with all types, not just integer?

### Related Topics - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] + [[Design](../../tag/design/README.md)] ### Similar Questions - 1. [Binary Search Tree Iterator](https://github.com/openset/leetcode/tree/master/problems/binary-search-tree-iterator) (Medium) - 1. [Flatten 2D Vector](https://github.com/openset/leetcode/tree/master/problems/flatten-2d-vector) (Medium) - 1. [Zigzag Iterator](https://github.com/openset/leetcode/tree/master/problems/zigzag-iterator) (Medium) + 1. [Binary Search Tree Iterator](../binary-search-tree-iterator) (Medium) + 1. [Flatten 2D Vector](../flatten-2d-vector) (Medium) + 1. [Zigzag Iterator](../zigzag-iterator) (Medium) ### Hints
diff --git a/problems/perfect-number/README.md b/problems/perfect-number/README.md index 8a9994fcf..ad5382ff1 100644 --- a/problems/perfect-number/README.md +++ b/problems/perfect-number/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/relative-ranks "Relative Ranks") +[< Previous](../relative-ranks "Relative Ranks") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/most-frequent-subtree-sum "Most Frequent Subtree Sum") +[Next >](../most-frequent-subtree-sum "Most Frequent Subtree Sum") ## [507. Perfect Number (Easy)](https://leetcode.com/problems/perfect-number "完美数") @@ -29,7 +29,7 @@ The input number n will not exceed 100,000,000. (1e8)

### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Self Dividing Numbers](https://github.com/openset/leetcode/tree/master/problems/self-dividing-numbers) (Easy) + 1. [Self Dividing Numbers](../self-dividing-numbers) (Easy) diff --git a/problems/perfect-rectangle/README.md b/problems/perfect-rectangle/README.md index c3dac2ecc..fdfef1386 100644 --- a/problems/perfect-rectangle/README.md +++ b/problems/perfect-rectangle/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/elimination-game "Elimination Game") +[< Previous](../elimination-game "Elimination Game") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/is-subsequence "Is Subsequence") +[Next >](../is-subsequence "Is Subsequence") ## [391. Perfect Rectangle (Hard)](https://leetcode.com/problems/perfect-rectangle "完美矩形") @@ -91,4 +91,4 @@ Return false. Because two of the rectangles overlap with each other.

 

### Related Topics - [[Line Sweep](https://github.com/openset/leetcode/tree/master/tag/line-sweep/README.md)] + [[Line Sweep](../../tag/line-sweep/README.md)] diff --git a/problems/perfect-squares/README.md b/problems/perfect-squares/README.md index 4d091cd7d..71e721af9 100644 --- a/problems/perfect-squares/README.md +++ b/problems/perfect-squares/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/first-bad-version "First Bad Version") +[< Previous](../first-bad-version "First Bad Version") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/wiggle-sort "Wiggle Sort") +[Next >](../wiggle-sort "Wiggle Sort") ## [279. Perfect Squares (Medium)](https://leetcode.com/problems/perfect-squares "完全平方数") @@ -28,10 +28,10 @@ Explanation: 13 = 4 + 9. ### Related Topics - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] + [[Math](../../tag/math/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Count Primes](https://github.com/openset/leetcode/tree/master/problems/count-primes) (Easy) - 1. [Ugly Number II](https://github.com/openset/leetcode/tree/master/problems/ugly-number-ii) (Medium) + 1. [Count Primes](../count-primes) (Easy) + 1. [Ugly Number II](../ugly-number-ii) (Medium) diff --git a/problems/permutation-in-string/README.md b/problems/permutation-in-string/README.md index 9ece515a4..3c3b8fb52 100644 --- a/problems/permutation-in-string/README.md +++ b/problems/permutation-in-string/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/reshape-the-matrix "Reshape the Matrix") +[< Previous](../reshape-the-matrix "Reshape the Matrix") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-vacation-days "Maximum Vacation Days") +[Next >](../maximum-vacation-days "Maximum Vacation Days") ## [567. Permutation in String (Medium)](https://leetcode.com/problems/permutation-in-string "字符串的排列") @@ -40,12 +40,12 @@ ### Related Topics - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] - [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] + [[Sliding Window](../../tag/sliding-window/README.md)] ### Similar Questions - 1. [Minimum Window Substring](https://github.com/openset/leetcode/tree/master/problems/minimum-window-substring) (Hard) - 1. [Find All Anagrams in a String](https://github.com/openset/leetcode/tree/master/problems/find-all-anagrams-in-a-string) (Medium) + 1. [Minimum Window Substring](../minimum-window-substring) (Hard) + 1. [Find All Anagrams in a String](../find-all-anagrams-in-a-string) (Medium) ### Hints
diff --git a/problems/permutation-sequence/README.md b/problems/permutation-sequence/README.md index 3b7a4b88e..4f57d9204 100644 --- a/problems/permutation-sequence/README.md +++ b/problems/permutation-sequence/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/spiral-matrix-ii "Spiral Matrix II") +[< Previous](../spiral-matrix-ii "Spiral Matrix II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/rotate-list "Rotate List") +[Next >](../rotate-list "Rotate List") ## [60. Permutation Sequence (Medium)](https://leetcode.com/problems/permutation-sequence "第k个排列") @@ -48,9 +48,9 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Math](../../tag/math/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Next Permutation](https://github.com/openset/leetcode/tree/master/problems/next-permutation) (Medium) - 1. [Permutations](https://github.com/openset/leetcode/tree/master/problems/permutations) (Medium) + 1. [Next Permutation](../next-permutation) (Medium) + 1. [Permutations](../permutations) (Medium) diff --git a/problems/permutations-ii/README.md b/problems/permutations-ii/README.md index 70cd26333..2aa447990 100644 --- a/problems/permutations-ii/README.md +++ b/problems/permutations-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/permutations "Permutations") +[< Previous](../permutations "Permutations") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/rotate-image "Rotate Image") +[Next >](../rotate-image "Rotate Image") ## [47. Permutations II (Medium)](https://leetcode.com/problems/permutations-ii "全排列 II") @@ -26,10 +26,10 @@ ### Related Topics - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Next Permutation](https://github.com/openset/leetcode/tree/master/problems/next-permutation) (Medium) - 1. [Permutations](https://github.com/openset/leetcode/tree/master/problems/permutations) (Medium) - 1. [Palindrome Permutation II](https://github.com/openset/leetcode/tree/master/problems/palindrome-permutation-ii) (Medium) - 1. [Number of Squareful Arrays](https://github.com/openset/leetcode/tree/master/problems/number-of-squareful-arrays) (Hard) + 1. [Next Permutation](../next-permutation) (Medium) + 1. [Permutations](../permutations) (Medium) + 1. [Palindrome Permutation II](../palindrome-permutation-ii) (Medium) + 1. [Number of Squareful Arrays](../number-of-squareful-arrays) (Hard) diff --git a/problems/permutations/README.md b/problems/permutations/README.md index 1dcb5d5fc..68fceb164 100644 --- a/problems/permutations/README.md +++ b/problems/permutations/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/jump-game-ii "Jump Game II") +[< Previous](../jump-game-ii "Jump Game II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/permutations-ii "Permutations II") +[Next >](../permutations-ii "Permutations II") ## [46. Permutations (Medium)](https://leetcode.com/problems/permutations "全排列") @@ -29,10 +29,10 @@ ### Related Topics - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Next Permutation](https://github.com/openset/leetcode/tree/master/problems/next-permutation) (Medium) - 1. [Permutations II](https://github.com/openset/leetcode/tree/master/problems/permutations-ii) (Medium) - 1. [Permutation Sequence](https://github.com/openset/leetcode/tree/master/problems/permutation-sequence) (Medium) - 1. [Combinations](https://github.com/openset/leetcode/tree/master/problems/combinations) (Medium) + 1. [Next Permutation](../next-permutation) (Medium) + 1. [Permutations II](../permutations-ii) (Medium) + 1. [Permutation Sequence](../permutation-sequence) (Medium) + 1. [Combinations](../combinations) (Medium) diff --git a/problems/play-with-chips/README.md b/problems/play-with-chips/README.md index 1431404cd..7c45594d3 100644 --- a/problems/play-with-chips/README.md +++ b/problems/play-with-chips/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/valid-palindrome-iii "Valid Palindrome III") +[< Previous](../valid-palindrome-iii "Valid Palindrome III") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/longest-arithmetic-subsequence-of-given-difference "Longest Arithmetic Subsequence of Given Difference") +[Next >](../longest-arithmetic-subsequence-of-given-difference "Longest Arithmetic Subsequence of Given Difference") ## [1217. Play with Chips (Easy)](https://leetcode.com/problems/play-with-chips "玩筹码") @@ -50,9 +50,9 @@ ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[Array](../../tag/array/README.md)] + [[Math](../../tag/math/README.md)] ### Hints
diff --git a/problems/plus-one-linked-list/README.md b/problems/plus-one-linked-list/README.md index c047895c2..63596dd4e 100644 --- a/problems/plus-one-linked-list/README.md +++ b/problems/plus-one-linked-list/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/largest-divisible-subset "Largest Divisible Subset") +[< Previous](../largest-divisible-subset "Largest Divisible Subset") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/range-addition "Range Addition") +[Next >](../range-addition "Range Addition") ## [369. Plus One Linked List (Medium)](https://leetcode.com/problems/plus-one-linked-list "给单链表加一") @@ -26,7 +26,7 @@ ### Related Topics - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] + [[Linked List](../../tag/linked-list/README.md)] ### Similar Questions - 1. [Plus One](https://github.com/openset/leetcode/tree/master/problems/plus-one) (Easy) + 1. [Plus One](../plus-one) (Easy) diff --git a/problems/plus-one/README.md b/problems/plus-one/README.md index 173a1578e..1d9485ad7 100644 --- a/problems/plus-one/README.md +++ b/problems/plus-one/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/valid-number "Valid Number") +[< Previous](../valid-number "Valid Number") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/add-binary "Add Binary") +[Next >](../add-binary "Add Binary") ## [66. Plus One (Easy)](https://leetcode.com/problems/plus-one "加一") @@ -34,10 +34,10 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Multiply Strings](https://github.com/openset/leetcode/tree/master/problems/multiply-strings) (Medium) - 1. [Add Binary](https://github.com/openset/leetcode/tree/master/problems/add-binary) (Easy) - 1. [Plus One Linked List](https://github.com/openset/leetcode/tree/master/problems/plus-one-linked-list) (Medium) - 1. [Add to Array-Form of Integer](https://github.com/openset/leetcode/tree/master/problems/add-to-array-form-of-integer) (Easy) + 1. [Multiply Strings](../multiply-strings) (Medium) + 1. [Add Binary](../add-binary) (Easy) + 1. [Plus One Linked List](../plus-one-linked-list) (Medium) + 1. [Add to Array-Form of Integer](../add-to-array-form-of-integer) (Easy) diff --git a/problems/poor-pigs/README.md b/problems/poor-pigs/README.md index a72ee4e6e..fd4ed9099 100644 --- a/problems/poor-pigs/README.md +++ b/problems/poor-pigs/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/circular-array-loop "Circular Array Loop") +[< Previous](../circular-array-loop "Circular Array Loop") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/repeated-substring-pattern "Repeated Substring Pattern") +[Next >](../repeated-substring-pattern "Repeated Substring Pattern") ## [458. Poor Pigs (Hard)](https://leetcode.com/problems/poor-pigs "可怜的小猪") @@ -32,7 +32,7 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Hints
diff --git a/problems/populating-next-right-pointers-in-each-node-ii/README.md b/problems/populating-next-right-pointers-in-each-node-ii/README.md index 4f3ba254b..fa85e4142 100644 --- a/problems/populating-next-right-pointers-in-each-node-ii/README.md +++ b/problems/populating-next-right-pointers-in-each-node-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/populating-next-right-pointers-in-each-node "Populating Next Right Pointers in Each Node") +[< Previous](../populating-next-right-pointers-in-each-node "Populating Next Right Pointers in Each Node") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/pascals-triangle "Pascal's Triangle") +[Next >](../pascals-triangle "Pascal's Triangle") ## [117. Populating Next Right Pointers in Each Node II (Medium)](https://leetcode.com/problems/populating-next-right-pointers-in-each-node-ii "填充每个节点的下一个右侧节点指针 II") @@ -55,8 +55,8 @@ struct Node { ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] ### Similar Questions - 1. [Populating Next Right Pointers in Each Node](https://github.com/openset/leetcode/tree/master/problems/populating-next-right-pointers-in-each-node) (Medium) + 1. [Populating Next Right Pointers in Each Node](../populating-next-right-pointers-in-each-node) (Medium) diff --git a/problems/populating-next-right-pointers-in-each-node/README.md b/problems/populating-next-right-pointers-in-each-node/README.md index 3609677d7..06b846950 100644 --- a/problems/populating-next-right-pointers-in-each-node/README.md +++ b/problems/populating-next-right-pointers-in-each-node/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/distinct-subsequences "Distinct Subsequences") +[< Previous](../distinct-subsequences "Distinct Subsequences") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/populating-next-right-pointers-in-each-node-ii "Populating Next Right Pointers in Each Node II") +[Next >](../populating-next-right-pointers-in-each-node-ii "Populating Next Right Pointers in Each Node II") ## [116. Populating Next Right Pointers in Each Node (Medium)](https://leetcode.com/problems/populating-next-right-pointers-in-each-node "填充每个节点的下一个右侧节点指针") @@ -55,9 +55,9 @@ struct Node { ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] ### Similar Questions - 1. [Populating Next Right Pointers in Each Node II](https://github.com/openset/leetcode/tree/master/problems/populating-next-right-pointers-in-each-node-ii) (Medium) - 1. [Binary Tree Right Side View](https://github.com/openset/leetcode/tree/master/problems/binary-tree-right-side-view) (Medium) + 1. [Populating Next Right Pointers in Each Node II](../populating-next-right-pointers-in-each-node-ii) (Medium) + 1. [Binary Tree Right Side View](../binary-tree-right-side-view) (Medium) diff --git a/problems/positions-of-large-groups/README.md b/problems/positions-of-large-groups/README.md index b36d002f7..29f7789c5 100644 --- a/problems/positions-of-large-groups/README.md +++ b/problems/positions-of-large-groups/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/consecutive-numbers-sum "Consecutive Numbers Sum") +[< Previous](../consecutive-numbers-sum "Consecutive Numbers Sum") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/masking-personal-information "Masking Personal Information") +[Next >](../masking-personal-information "Masking Personal Information") ## [830. Positions of Large Groups (Easy)](https://leetcode.com/problems/positions-of-large-groups "较大分组的位置") @@ -48,4 +48,4 @@

Note:  1 <= S.length <= 1000

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] diff --git a/problems/possible-bipartition/README.md b/problems/possible-bipartition/README.md index 760353ff2..55fbc1546 100644 --- a/problems/possible-bipartition/README.md +++ b/problems/possible-bipartition/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/spiral-matrix-iii "Spiral Matrix III") +[< Previous](../spiral-matrix-iii "Spiral Matrix III") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/super-egg-drop "Super Egg Drop") +[Next >](../super-egg-drop "Super Egg Drop") ## [886. Possible Bipartition (Medium)](https://leetcode.com/problems/possible-bipartition "可能的二分法") @@ -69,4 +69,4 @@ ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] diff --git a/problems/pour-water/README.md b/problems/pour-water/README.md index 63711c7bb..cf4184a63 100644 --- a/problems/pour-water/README.md +++ b/problems/pour-water/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/reach-a-number "Reach a Number") +[< Previous](../reach-a-number "Reach a Number") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/pyramid-transition-matrix "Pyramid Transition Matrix") +[Next >](../pyramid-transition-matrix "Pyramid Transition Matrix") ## [755. Pour Water (Medium)](https://leetcode.com/problems/pour-water "倒水") @@ -136,7 +136,7 @@ The last droplet settles at index 1, since moving further left would not cause i

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Trapping Rain Water](https://github.com/openset/leetcode/tree/master/problems/trapping-rain-water) (Hard) + 1. [Trapping Rain Water](../trapping-rain-water) (Hard) diff --git a/problems/power-of-four/README.md b/problems/power-of-four/README.md index 9b345c1c9..5b577262f 100644 --- a/problems/power-of-four/README.md +++ b/problems/power-of-four/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/flatten-nested-list-iterator "Flatten Nested List Iterator") +[< Previous](../flatten-nested-list-iterator "Flatten Nested List Iterator") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/integer-break "Integer Break") +[Next >](../integer-break "Integer Break") ## [342. Power of Four (Easy)](https://leetcode.com/problems/power-of-four "4的幂") @@ -31,8 +31,8 @@

Follow up: Could you solve it without loops/recursion?

### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] ### Similar Questions - 1. [Power of Two](https://github.com/openset/leetcode/tree/master/problems/power-of-two) (Easy) - 1. [Power of Three](https://github.com/openset/leetcode/tree/master/problems/power-of-three) (Easy) + 1. [Power of Two](../power-of-two) (Easy) + 1. [Power of Three](../power-of-three) (Easy) diff --git a/problems/power-of-three/README.md b/problems/power-of-three/README.md index 1d12a691c..5e4d3b688 100644 --- a/problems/power-of-three/README.md +++ b/problems/power-of-three/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-size-subarray-sum-equals-k "Maximum Size Subarray Sum Equals k") +[< Previous](../maximum-size-subarray-sum-equals-k "Maximum Size Subarray Sum Equals k") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/count-of-range-sum "Count of Range Sum") +[Next >](../count-of-range-sum "Count of Range Sum") ## [326. Power of Three (Easy)](https://leetcode.com/problems/power-of-three "3的幂") @@ -42,8 +42,8 @@ Could you do it without using any loop / recursion?

### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Power of Two](https://github.com/openset/leetcode/tree/master/problems/power-of-two) (Easy) - 1. [Power of Four](https://github.com/openset/leetcode/tree/master/problems/power-of-four) (Easy) + 1. [Power of Two](../power-of-two) (Easy) + 1. [Power of Four](../power-of-four) (Easy) diff --git a/problems/power-of-two/README.md b/problems/power-of-two/README.md index b25cb49c4..4c9067ae3 100644 --- a/problems/power-of-two/README.md +++ b/problems/power-of-two/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-element-in-a-bst "Kth Smallest Element in a BST") +[< Previous](../kth-smallest-element-in-a-bst "Kth Smallest Element in a BST") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/implement-queue-using-stacks "Implement Queue using Stacks") +[Next >](../implement-queue-using-stacks "Implement Queue using Stacks") ## [231. Power of Two (Easy)](https://leetcode.com/problems/power-of-two "2的幂") @@ -35,10 +35,10 @@ Output: false ### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Number of 1 Bits](https://github.com/openset/leetcode/tree/master/problems/number-of-1-bits) (Easy) - 1. [Power of Three](https://github.com/openset/leetcode/tree/master/problems/power-of-three) (Easy) - 1. [Power of Four](https://github.com/openset/leetcode/tree/master/problems/power-of-four) (Easy) + 1. [Number of 1 Bits](../number-of-1-bits) (Easy) + 1. [Power of Three](../power-of-three) (Easy) + 1. [Power of Four](../power-of-four) (Easy) diff --git a/problems/powerful-integers/README.md b/problems/powerful-integers/README.md index 73a76c2a0..23a348d75 100644 --- a/problems/powerful-integers/README.md +++ b/problems/powerful-integers/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/pancake-sorting "Pancake Sorting") +[< Previous](../pancake-sorting "Pancake Sorting") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/flip-binary-tree-to-match-preorder-traversal "Flip Binary Tree To Match Preorder Traversal") +[Next >](../flip-binary-tree-to-match-preorder-traversal "Flip Binary Tree To Match Preorder Traversal") ## [970. Powerful Integers (Easy)](https://leetcode.com/problems/powerful-integers "强整数") @@ -56,5 +56,5 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/powx-n/README.md b/problems/powx-n/README.md index ce4e532e6..d3c41f6ff 100644 --- a/problems/powx-n/README.md +++ b/problems/powx-n/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/group-anagrams "Group Anagrams") +[< Previous](../group-anagrams "Group Anagrams") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/n-queens "N-Queens") +[Next >](../n-queens "N-Queens") ## [50. Pow(x, n) (Medium)](https://leetcode.com/problems/powx-n "Pow(x, n)") @@ -43,9 +43,9 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Math](../../tag/math/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [Sqrt(x)](https://github.com/openset/leetcode/tree/master/problems/sqrtx) (Easy) - 1. [Super Pow](https://github.com/openset/leetcode/tree/master/problems/super-pow) (Medium) + 1. [Sqrt(x)](../sqrtx) (Easy) + 1. [Super Pow](../super-pow) (Medium) diff --git a/problems/predict-the-winner/README.md b/problems/predict-the-winner/README.md index db3326063..af29a033d 100644 --- a/problems/predict-the-winner/README.md +++ b/problems/predict-the-winner/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones "Max Consecutive Ones") +[< Previous](../max-consecutive-ones "Max Consecutive Ones") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones-ii "Max Consecutive Ones II") +[Next >](../max-consecutive-ones-ii "Max Consecutive Ones II") ## [486. Predict the Winner (Medium)](https://leetcode.com/problems/predict-the-winner "预测赢家") @@ -40,8 +40,8 @@

### Related Topics - [[Minimax](https://github.com/openset/leetcode/tree/master/tag/minimax/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Minimax](../../tag/minimax/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Can I Win](https://github.com/openset/leetcode/tree/master/problems/can-i-win) (Medium) + 1. [Can I Win](../can-i-win) (Medium) diff --git a/problems/prefix-and-suffix-search/README.md b/problems/prefix-and-suffix-search/README.md index 7d38cfaae..f7fb85160 100644 --- a/problems/prefix-and-suffix-search/README.md +++ b/problems/prefix-and-suffix-search/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-smallest-letter-greater-than-target "Find Smallest Letter Greater Than Target") +[< Previous](../find-smallest-letter-greater-than-target "Find Smallest Letter Greater Than Target") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/min-cost-climbing-stairs "Min Cost Climbing Stairs") +[Next >](../min-cost-climbing-stairs "Min Cost Climbing Stairs") ## [745. Prefix and Suffix Search (Hard)](https://leetcode.com/problems/prefix-and-suffix-search "前缀和后缀搜索") @@ -39,10 +39,10 @@ WordFilter.f("b", "") // returns -1

 

### Related Topics - [[Trie](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] + [[Trie](../../tag/trie/README.md)] ### Similar Questions - 1. [Add and Search Word - Data structure design](https://github.com/openset/leetcode/tree/master/problems/add-and-search-word-data-structure-design) (Medium) + 1. [Add and Search Word - Data structure design](../add-and-search-word-data-structure-design) (Medium) ### Hints
diff --git a/problems/preimage-size-of-factorial-zeroes-function/README.md b/problems/preimage-size-of-factorial-zeroes-function/README.md index 18caa7eaf..782d598d5 100644 --- a/problems/preimage-size-of-factorial-zeroes-function/README.md +++ b/problems/preimage-size-of-factorial-zeroes-function/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/number-of-matching-subsequences "Number of Matching Subsequences") +[< Previous](../number-of-matching-subsequences "Number of Matching Subsequences") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/valid-tic-tac-toe-state "Valid Tic-Tac-Toe State") +[Next >](../valid-tic-tac-toe-state "Valid Tic-Tac-Toe State") ## [793. Preimage Size of Factorial Zeroes Function (Hard)](https://leetcode.com/problems/preimage-size-of-factorial-zeroes-function "阶乘函数后K个零") @@ -34,7 +34,7 @@ ### Related Topics - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [Factorial Trailing Zeroes](https://github.com/openset/leetcode/tree/master/problems/factorial-trailing-zeroes) (Easy) + 1. [Factorial Trailing Zeroes](../factorial-trailing-zeroes) (Easy) diff --git a/problems/previous-permutation-with-one-swap/README.md b/problems/previous-permutation-with-one-swap/README.md index 83e650de7..dffedec5a 100644 --- a/problems/previous-permutation-with-one-swap/README.md +++ b/problems/previous-permutation-with-one-swap/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/grumpy-bookstore-owner "Grumpy Bookstore Owner") +[< Previous](../grumpy-bookstore-owner "Grumpy Bookstore Owner") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/distant-barcodes "Distant Barcodes") +[Next >](../distant-barcodes "Distant Barcodes") ## [1053. Previous Permutation With One Swap (Medium)](https://leetcode.com/problems/previous-permutation-with-one-swap "交换一次的先前排列") @@ -57,8 +57,8 @@ ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[Array](../../tag/array/README.md)] ### Hints
diff --git a/problems/prime-arrangements/README.md b/problems/prime-arrangements/README.md index 7eb23ed01..b85fa61f2 100644 --- a/problems/prime-arrangements/README.md +++ b/problems/prime-arrangements/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/immediate-food-delivery-ii "Immediate Food Delivery II") +[< Previous](../immediate-food-delivery-ii "Immediate Food Delivery II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/diet-plan-performance "Diet Plan Performance") +[Next >](../diet-plan-performance "Diet Plan Performance") ## [1175. Prime Arrangements (Easy)](https://leetcode.com/problems/prime-arrangements "质数排列") @@ -41,7 +41,7 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Hints
diff --git a/problems/prime-number-of-set-bits-in-binary-representation/README.md b/problems/prime-number-of-set-bits-in-binary-representation/README.md index c0eed9934..6baa890be 100644 --- a/problems/prime-number-of-set-bits-in-binary-representation/README.md +++ b/problems/prime-number-of-set-bits-in-binary-representation/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/special-binary-string "Special Binary String") +[< Previous](../special-binary-string "Special Binary String") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/partition-labels "Partition Labels") +[Next >](../partition-labels "Partition Labels") ## [762. Prime Number of Set Bits in Binary Representation (Easy)](https://leetcode.com/problems/prime-number-of-set-bits-in-binary-representation "二进制表示中质数个计算置位") @@ -45,10 +45,10 @@ Given two integers L and R, find the count of numbers

### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] ### Similar Questions - 1. [Number of 1 Bits](https://github.com/openset/leetcode/tree/master/problems/number-of-1-bits) (Easy) + 1. [Number of 1 Bits](../number-of-1-bits) (Easy) ### Hints
diff --git a/problems/prime-palindrome/README.md b/problems/prime-palindrome/README.md index 8a0c4f7d2..a5b7dfaa6 100644 --- a/problems/prime-palindrome/README.md +++ b/problems/prime-palindrome/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/smallest-subtree-with-all-the-deepest-nodes "Smallest Subtree with all the Deepest Nodes") +[< Previous](../smallest-subtree-with-all-the-deepest-nodes "Smallest Subtree with all the Deepest Nodes") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/transpose-matrix "Transpose Matrix") +[Next >](../transpose-matrix "Transpose Matrix") ## [866. Prime Palindrome (Medium)](https://leetcode.com/problems/prime-palindrome "回文素数") @@ -59,4 +59,4 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/print-binary-tree/README.md b/problems/print-binary-tree/README.md index 2ed2a19f9..c313e3106 100644 --- a/problems/print-binary-tree/README.md +++ b/problems/print-binary-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-binary-tree "Maximum Binary Tree") +[< Previous](../maximum-binary-tree "Maximum Binary Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/coin-path "Coin Path") +[Next >](../coin-path "Coin Path") ## [655. Print Binary Tree (Medium)](https://leetcode.com/problems/print-binary-tree "输出二叉树") @@ -73,4 +73,4 @@ The height of binary tree is in the range of [1, 10].

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] diff --git a/problems/print-foobar-alternately/README.md b/problems/print-foobar-alternately/README.md index b447009b1..04d558ad2 100644 --- a/problems/print-foobar-alternately/README.md +++ b/problems/print-foobar-alternately/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/print-in-order "Print in Order") +[< Previous](../print-in-order "Print in Order") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/print-zero-even-odd "Print Zero Even Odd") +[Next >](../print-zero-even-odd "Print Zero Even Odd") ## [1115. Print FooBar Alternately (Medium)](https://leetcode.com/problems/print-foobar-alternately "交替打印FooBar") @@ -50,5 +50,5 @@ class FooBar { ### Similar Questions - 1. [Print in Order](https://github.com/openset/leetcode/tree/master/problems/print-in-order) (Easy) - 1. [Print Zero Even Odd](https://github.com/openset/leetcode/tree/master/problems/print-zero-even-odd) (Medium) + 1. [Print in Order](../print-in-order) (Easy) + 1. [Print Zero Even Odd](../print-zero-even-odd) (Medium) diff --git a/problems/print-immutable-linked-list-in-reverse/README.md b/problems/print-immutable-linked-list-in-reverse/README.md index ebf90bce2..61bb8638d 100644 --- a/problems/print-immutable-linked-list-in-reverse/README.md +++ b/problems/print-immutable-linked-list-in-reverse/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/page-recommendations "Page Recommendations") +[< Previous](../page-recommendations "Page Recommendations") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-time-visiting-all-points "Minimum Time Visiting All Points") +[Next >](../minimum-time-visiting-all-points "Minimum Time Visiting All Points") ## [1265. Print Immutable Linked List in Reverse (Medium)](https://leetcode.com/problems/print-immutable-linked-list-in-reverse "") diff --git a/problems/print-in-order/README.md b/problems/print-in-order/README.md index fa6fc8612..ee1d4c7e1 100644 --- a/problems/print-in-order/README.md +++ b/problems/print-in-order/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/reported-posts "Reported Posts") +[< Previous](../reported-posts "Reported Posts") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/print-foobar-alternately "Print FooBar Alternately") +[Next >](../print-foobar-alternately "Print FooBar Alternately") ## [1114. Print in Order (Easy)](https://leetcode.com/problems/print-in-order "按序打印") @@ -47,4 +47,4 @@ public class Foo {

We do not know how the threads will be scheduled in the operating system, even though the numbers in the input seems to imply the ordering. The input format you see is mainly to ensure our tests' comprehensiveness.

### Similar Questions - 1. [Print FooBar Alternately](https://github.com/openset/leetcode/tree/master/problems/print-foobar-alternately) (Medium) + 1. [Print FooBar Alternately](../print-foobar-alternately) (Medium) diff --git a/problems/print-zero-even-odd/README.md b/problems/print-zero-even-odd/README.md index 9654abf57..7ab4b9e8b 100644 --- a/problems/print-zero-even-odd/README.md +++ b/problems/print-zero-even-odd/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/print-foobar-alternately "Print FooBar Alternately") +[< Previous](../print-foobar-alternately "Print FooBar Alternately") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/building-h2o "Building H2O") +[Next >](../building-h2o "Building H2O") ## [1116. Print Zero Even Odd (Medium)](https://leetcode.com/problems/print-zero-even-odd "打印零与奇偶数") @@ -50,4 +50,4 @@ class ZeroEvenOdd { ### Similar Questions - 1. [Print FooBar Alternately](https://github.com/openset/leetcode/tree/master/problems/print-foobar-alternately) (Medium) + 1. [Print FooBar Alternately](../print-foobar-alternately) (Medium) diff --git a/problems/prison-cells-after-n-days/README.md b/problems/prison-cells-after-n-days/README.md index 9202cde3a..e11dfd15f 100644 --- a/problems/prison-cells-after-n-days/README.md +++ b/problems/prison-cells-after-n-days/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/tallest-billboard "Tallest Billboard") +[< Previous](../tallest-billboard "Tallest Billboard") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/check-completeness-of-a-binary-tree "Check Completeness of a Binary Tree") +[Next >](../check-completeness-of-a-binary-tree "Check Completeness of a Binary Tree") ## [957. Prison Cells After N Days (Medium)](https://leetcode.com/problems/prison-cells-after-n-days "N 天后的牢房") @@ -73,4 +73,4 @@ Day 7: [0, 0, 1, 1, 0, 0, 0, 0] ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] diff --git a/problems/product-of-array-except-self/README.md b/problems/product-of-array-except-self/README.md index b4a11bf7a..bdf68599c 100644 --- a/problems/product-of-array-except-self/README.md +++ b/problems/product-of-array-except-self/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/delete-node-in-a-linked-list "Delete Node in a Linked List") +[< Previous](../delete-node-in-a-linked-list "Delete Node in a Linked List") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/sliding-window-maximum "Sliding Window Maximum") +[Next >](../sliding-window-maximum "Sliding Window Maximum") ## [238. Product of Array Except Self (Medium)](https://leetcode.com/problems/product-of-array-except-self "除自身以外数组的乘积") @@ -26,9 +26,9 @@ Could you solve it with constant space complexity? (The output array does not count as extra space for the purpose of space complexity analysis.)

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Trapping Rain Water](https://github.com/openset/leetcode/tree/master/problems/trapping-rain-water) (Hard) - 1. [Maximum Product Subarray](https://github.com/openset/leetcode/tree/master/problems/maximum-product-subarray) (Medium) - 1. [Paint House II](https://github.com/openset/leetcode/tree/master/problems/paint-house-ii) (Hard) + 1. [Trapping Rain Water](../trapping-rain-water) (Hard) + 1. [Maximum Product Subarray](../maximum-product-subarray) (Medium) + 1. [Paint House II](../paint-house-ii) (Hard) diff --git a/problems/product-price-at-a-given-date/README.md b/problems/product-price-at-a-given-date/README.md index 2477fd617..e03c4c84c 100644 --- a/problems/product-price-at-a-given-date/README.md +++ b/problems/product-price-at-a-given-date/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/last-substring-in-lexicographical-order "Last Substring in Lexicographical Order") +[< Previous](../last-substring-in-lexicographical-order "Last Substring in Lexicographical Order") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/single-row-keyboard "Single-Row Keyboard") +[Next >](../single-row-keyboard "Single-Row Keyboard") ## [1164. Product Price at a Given Date (Medium)](https://leetcode.com/problems/product-price-at-a-given-date "") diff --git a/problems/product-sales-analysis-i/README.md b/problems/product-sales-analysis-i/README.md index 08fdc81f7..791ae7179 100644 --- a/problems/product-sales-analysis-i/README.md +++ b/problems/product-sales-analysis-i/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/digit-count-in-range "Digit Count in Range") +[< Previous](../digit-count-in-range "Digit Count in Range") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/product-sales-analysis-ii "Product Sales Analysis II") +[Next >](../product-sales-analysis-ii "Product Sales Analysis II") ## [1068. Product Sales Analysis I (Easy)](https://leetcode.com/problems/product-sales-analysis-i "产品销售分析 I") diff --git a/problems/product-sales-analysis-ii/README.md b/problems/product-sales-analysis-ii/README.md index 08c193352..e0c5912a7 100644 --- a/problems/product-sales-analysis-ii/README.md +++ b/problems/product-sales-analysis-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/product-sales-analysis-i "Product Sales Analysis I") +[< Previous](../product-sales-analysis-i "Product Sales Analysis I") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/product-sales-analysis-iii "Product Sales Analysis III") +[Next >](../product-sales-analysis-iii "Product Sales Analysis III") ## [1069. Product Sales Analysis II (Easy)](https://leetcode.com/problems/product-sales-analysis-ii "产品销售分析 II") diff --git a/problems/product-sales-analysis-iii/README.md b/problems/product-sales-analysis-iii/README.md index 8ac139c1d..611a1157b 100644 --- a/problems/product-sales-analysis-iii/README.md +++ b/problems/product-sales-analysis-iii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/product-sales-analysis-ii "Product Sales Analysis II") +[< Previous](../product-sales-analysis-ii "Product Sales Analysis II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/greatest-common-divisor-of-strings "Greatest Common Divisor of Strings") +[Next >](../greatest-common-divisor-of-strings "Greatest Common Divisor of Strings") ## [1070. Product Sales Analysis III (Medium)](https://leetcode.com/problems/product-sales-analysis-iii "产品销售分析 III") diff --git a/problems/profitable-schemes/README.md b/problems/profitable-schemes/README.md index 03e35b4b2..91e524a43 100644 --- a/problems/profitable-schemes/README.md +++ b/problems/profitable-schemes/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/nth-magical-number "Nth Magical Number") +[< Previous](../nth-magical-number "Nth Magical Number") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/decoded-string-at-index "Decoded String at Index") +[Next >](../decoded-string-at-index "Decoded String at Index") ## [879. Profitable Schemes (Hard)](https://leetcode.com/problems/profitable-schemes "盈利计划") @@ -62,4 +62,4 @@ There are 7 possible schemes: (0), (1), (2), (0,1), (0,2), (1,2), and (0,1,2). ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/project-employees-i/README.md b/problems/project-employees-i/README.md index 3b3c50553..ddd837561 100644 --- a/problems/project-employees-i/README.md +++ b/problems/project-employees-i/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/number-of-submatrices-that-sum-to-target "Number of Submatrices That Sum to Target") +[< Previous](../number-of-submatrices-that-sum-to-target "Number of Submatrices That Sum to Target") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/project-employees-ii "Project Employees II") +[Next >](../project-employees-ii "Project Employees II") ## [1075. Project Employees I (Easy)](https://leetcode.com/problems/project-employees-i "项目员工 I") diff --git a/problems/project-employees-ii/README.md b/problems/project-employees-ii/README.md index d0c16a00d..d8f033adc 100644 --- a/problems/project-employees-ii/README.md +++ b/problems/project-employees-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/project-employees-i "Project Employees I") +[< Previous](../project-employees-i "Project Employees I") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/project-employees-iii "Project Employees III") +[Next >](../project-employees-iii "Project Employees III") ## [1076. Project Employees II (Easy)](https://leetcode.com/problems/project-employees-ii "项目员工II") diff --git a/problems/project-employees-iii/README.md b/problems/project-employees-iii/README.md index 675abc7d6..7e6f0c7bd 100644 --- a/problems/project-employees-iii/README.md +++ b/problems/project-employees-iii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/project-employees-ii "Project Employees II") +[< Previous](../project-employees-ii "Project Employees II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/occurrences-after-bigram "Occurrences After Bigram") +[Next >](../occurrences-after-bigram "Occurrences After Bigram") ## [1077. Project Employees III (Medium)](https://leetcode.com/problems/project-employees-iii "项目员工 III") diff --git a/problems/projection-area-of-3d-shapes/README.md b/problems/projection-area-of-3d-shapes/README.md index 491b51041..4b9df535e 100644 --- a/problems/projection-area-of-3d-shapes/README.md +++ b/problems/projection-area-of-3d-shapes/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/reachable-nodes-in-subdivided-graph "Reachable Nodes In Subdivided Graph") +[< Previous](../reachable-nodes-in-subdivided-graph "Reachable Nodes In Subdivided Graph") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/uncommon-words-from-two-sentences "Uncommon Words from Two Sentences") +[Next >](../uncommon-words-from-two-sentences "Uncommon Words from Two Sentences") ## [883. Projection Area of 3D Shapes (Easy)](https://leetcode.com/problems/projection-area-of-3d-shapes "三维形体投影面积") @@ -131,4 +131,4 @@ Here are the three projections ("shadows") of the shape made with each ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/push-dominoes/README.md b/problems/push-dominoes/README.md index f065ddbb1..b846d55ec 100644 --- a/problems/push-dominoes/README.md +++ b/problems/push-dominoes/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/new-21-game "New 21 Game") +[< Previous](../new-21-game "New 21 Game") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/similar-string-groups "Similar String Groups") +[Next >](../similar-string-groups "Similar String Groups") ## [838. Push Dominoes (Medium)](https://leetcode.com/problems/push-dominoes "推多米诺") @@ -52,5 +52,5 @@ ### Related Topics - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/pyramid-transition-matrix/README.md b/problems/pyramid-transition-matrix/README.md index d7dc3cc24..4cdb08326 100644 --- a/problems/pyramid-transition-matrix/README.md +++ b/problems/pyramid-transition-matrix/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/pour-water "Pour Water") +[< Previous](../pour-water "Pour Water") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/set-intersection-size-at-least-two "Set Intersection Size At Least Two") +[Next >](../set-intersection-size-at-least-two "Set Intersection Size At Least Two") ## [756. Pyramid Transition Matrix (Medium)](https://leetcode.com/problems/pyramid-transition-matrix "金字塔转换矩阵") @@ -59,5 +59,5 @@ Note that there could be allowed triples (A, B, C) and (A, B, D) with C != D.

 

### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] diff --git a/problems/quad-tree-intersection/README.md b/problems/quad-tree-intersection/README.md index 66d41f9e3..8eca3810f 100644 --- a/problems/quad-tree-intersection/README.md +++ b/problems/quad-tree-intersection/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/reverse-words-in-a-string-iii "Reverse Words in a String III") +[< Previous](../reverse-words-in-a-string-iii "Reverse Words in a String III") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-depth-of-n-ary-tree "Maximum Depth of N-ary Tree") +[Next >](../maximum-depth-of-n-ary-tree "Maximum Depth of N-ary Tree") ## [558. Quad Tree Intersection (Easy)](https://leetcode.com/problems/quad-tree-intersection "四叉树交集") diff --git a/problems/queens-that-can-attack-the-king/README.md b/problems/queens-that-can-attack-the-king/README.md index a69d5e1a3..53edb6653 100644 --- a/problems/queens-that-can-attack-the-king/README.md +++ b/problems/queens-that-can-attack-the-king/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/split-a-string-in-balanced-strings "Split a String in Balanced Strings") +[< Previous](../split-a-string-in-balanced-strings "Split a String in Balanced Strings") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/dice-roll-simulation "Dice Roll Simulation") +[Next >](../dice-roll-simulation "Dice Roll Simulation") ## [1222. Queens That Can Attack the King (Medium)](https://leetcode.com/problems/queens-that-can-attack-the-king "可以攻击国王的皇后") @@ -63,7 +63,7 @@ The queen at [2,4] can't attack the king cause it's not in the same row/ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Hints
diff --git a/problems/queries-quality-and-percentage/README.md b/problems/queries-quality-and-percentage/README.md index bc31ace35..508c9449b 100644 --- a/problems/queries-quality-and-percentage/README.md +++ b/problems/queries-quality-and-percentage/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-moves-to-reach-target-with-rotations "Minimum Moves to Reach Target with Rotations") +[< Previous](../minimum-moves-to-reach-target-with-rotations "Minimum Moves to Reach Target with Rotations") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/team-scores-in-football-tournament "Team Scores in Football Tournament") +[Next >](../team-scores-in-football-tournament "Team Scores in Football Tournament") ## [1211. Queries Quality and Percentage (Easy)](https://leetcode.com/problems/queries-quality-and-percentage "") diff --git a/problems/queue-reconstruction-by-height/README.md b/problems/queue-reconstruction-by-height/README.md index c8ac990e3..01a24bfa6 100644 --- a/problems/queue-reconstruction-by-height/README.md +++ b/problems/queue-reconstruction-by-height/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/convert-a-number-to-hexadecimal "Convert a Number to Hexadecimal") +[< Previous](../convert-a-number-to-hexadecimal "Convert a Number to Hexadecimal") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/trapping-rain-water-ii "Trapping Rain Water II") +[Next >](../trapping-rain-water-ii "Trapping Rain Water II") ## [406. Queue Reconstruction by Height (Medium)](https://leetcode.com/problems/queue-reconstruction-by-height "根据身高重建队列") @@ -30,10 +30,10 @@ Output:

 

### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] + [[Greedy](../../tag/greedy/README.md)] ### Similar Questions - 1. [Count of Smaller Numbers After Self](https://github.com/openset/leetcode/tree/master/problems/count-of-smaller-numbers-after-self) (Hard) + 1. [Count of Smaller Numbers After Self](../count-of-smaller-numbers-after-self) (Hard) ### Hints
diff --git a/problems/rabbits-in-forest/README.md b/problems/rabbits-in-forest/README.md index 22639b128..1f8153873 100644 --- a/problems/rabbits-in-forest/README.md +++ b/problems/rabbits-in-forest/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/reaching-points "Reaching Points") +[< Previous](../reaching-points "Reaching Points") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/transform-to-chessboard "Transform to Chessboard") +[Next >](../transform-to-chessboard "Transform to Chessboard") ## [781. Rabbits in Forest (Medium)](https://leetcode.com/problems/rabbits-in-forest "森林中的兔子") @@ -41,5 +41,5 @@ The smallest possible number of rabbits in the forest is therefore 5: 3 that ans ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/race-car/README.md b/problems/race-car/README.md index f2a79fc81..036b3d397 100644 --- a/problems/race-car/README.md +++ b/problems/race-car/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/linked-list-components "Linked List Components") +[< Previous](../linked-list-components "Linked List Components") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/most-common-word "Most Common Word") +[Next >](../most-common-word "Most Common Word") ## [818. Race Car (Hard)](https://leetcode.com/problems/race-car "赛车") @@ -52,5 +52,5 @@ Your position goes from 0->1->3->7->7->6. ### Related Topics - [[Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Heap](../../tag/heap/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/random-flip-matrix/README.md b/problems/random-flip-matrix/README.md index a72b17742..7ab9fdd9b 100644 --- a/problems/random-flip-matrix/README.md +++ b/problems/random-flip-matrix/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/coin-change-2 "Coin Change 2") +[< Previous](../coin-change-2 "Coin Change 2") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/detect-capital "Detect Capital") +[Next >](../detect-capital "Detect Capital") ## [519. Random Flip Matrix (Medium)](https://leetcode.com/problems/random-flip-matrix "随机翻转矩阵") @@ -46,4 +46,4 @@

The input is two lists: the subroutines called and their arguments. Solution's constructor has two arguments, n_rows and n_cols. flip and reset have no arguments. Arguments are always wrapped with a list, even if there aren't any.

### Related Topics - [[Random](https://github.com/openset/leetcode/tree/master/tag/random/README.md)] + [[Random](../../tag/random/README.md)] diff --git a/problems/random-pick-index/README.md b/problems/random-pick-index/README.md index 071d06f1f..377cef862 100644 --- a/problems/random-pick-index/README.md +++ b/problems/random-pick-index/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/integer-replacement "Integer Replacement") +[< Previous](../integer-replacement "Integer Replacement") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/evaluate-division "Evaluate Division") +[Next >](../evaluate-division "Evaluate Division") ## [398. Random Pick Index (Medium)](https://leetcode.com/problems/random-pick-index "随机数索引") @@ -30,9 +30,9 @@ solution.pick(1); ### Related Topics - [[Reservoir Sampling](https://github.com/openset/leetcode/tree/master/tag/reservoir-sampling/README.md)] + [[Reservoir Sampling](../../tag/reservoir-sampling/README.md)] ### Similar Questions - 1. [Linked List Random Node](https://github.com/openset/leetcode/tree/master/problems/linked-list-random-node) (Medium) - 1. [Random Pick with Blacklist](https://github.com/openset/leetcode/tree/master/problems/random-pick-with-blacklist) (Hard) - 1. [Random Pick with Weight](https://github.com/openset/leetcode/tree/master/problems/random-pick-with-weight) (Medium) + 1. [Linked List Random Node](../linked-list-random-node) (Medium) + 1. [Random Pick with Blacklist](../random-pick-with-blacklist) (Hard) + 1. [Random Pick with Weight](../random-pick-with-weight) (Medium) diff --git a/problems/random-pick-with-blacklist/README.md b/problems/random-pick-with-blacklist/README.md index 3e58fc9f6..f1bbf992c 100644 --- a/problems/random-pick-with-blacklist/README.md +++ b/problems/random-pick-with-blacklist/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/to-lower-case "To Lower Case") +[< Previous](../to-lower-case "To Lower Case") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-distinct-islands-ii "Number of Distinct Islands II") +[Next >](../number-of-distinct-islands-ii "Number of Distinct Islands II") ## [710. Random Pick with Blacklist (Hard)](https://leetcode.com/problems/random-pick-with-blacklist "黑名单中的随机数") @@ -64,11 +64,11 @@

The input is two lists: the subroutines called and their arguments. Solution's constructor has two arguments, N and the blacklist B. pick has no arguments. Arguments are always wrapped with a list, even if there aren't any.

### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] - [[Random](https://github.com/openset/leetcode/tree/master/tag/random/README.md)] + [[Sort](../../tag/sort/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] + [[Random](../../tag/random/README.md)] ### Similar Questions - 1. [Random Pick Index](https://github.com/openset/leetcode/tree/master/problems/random-pick-index) (Medium) - 1. [Random Pick with Weight](https://github.com/openset/leetcode/tree/master/problems/random-pick-with-weight) (Medium) + 1. [Random Pick Index](../random-pick-index) (Medium) + 1. [Random Pick with Weight](../random-pick-with-weight) (Medium) diff --git a/problems/random-pick-with-weight/README.md b/problems/random-pick-with-weight/README.md index bd51b9db2..0c9c0a786 100644 --- a/problems/random-pick-with-weight/README.md +++ b/problems/random-pick-with-weight/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/word-abbreviation "Word Abbreviation") +[< Previous](../word-abbreviation "Word Abbreviation") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minesweeper "Minesweeper") +[Next >](../minesweeper "Minesweeper") ## [528. Random Pick with Weight (Medium)](https://leetcode.com/problems/random-pick-with-weight "按权重随机选择") @@ -45,10 +45,10 @@

The input is two lists: the subroutines called and their arguments. Solution's constructor has one argument, the array w. pickIndex has no arguments. Arguments are always wrapped with a list, even if there aren't any.

### Related Topics - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] - [[Random](https://github.com/openset/leetcode/tree/master/tag/random/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] + [[Random](../../tag/random/README.md)] ### Similar Questions - 1. [Random Pick Index](https://github.com/openset/leetcode/tree/master/problems/random-pick-index) (Medium) - 1. [Random Pick with Blacklist](https://github.com/openset/leetcode/tree/master/problems/random-pick-with-blacklist) (Hard) - 1. [Random Point in Non-overlapping Rectangles](https://github.com/openset/leetcode/tree/master/problems/random-point-in-non-overlapping-rectangles) (Medium) + 1. [Random Pick Index](../random-pick-index) (Medium) + 1. [Random Pick with Blacklist](../random-pick-with-blacklist) (Hard) + 1. [Random Point in Non-overlapping Rectangles](../random-point-in-non-overlapping-rectangles) (Medium) diff --git a/problems/random-point-in-non-overlapping-rectangles/README.md b/problems/random-point-in-non-overlapping-rectangles/README.md index 2beed348c..9631b5baa 100644 --- a/problems/random-point-in-non-overlapping-rectangles/README.md +++ b/problems/random-point-in-non-overlapping-rectangles/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-i "Next Greater Element I") +[< Previous](../next-greater-element-i "Next Greater Element I") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/diagonal-traverse "Diagonal Traverse") +[Next >](../diagonal-traverse "Diagonal Traverse") ## [497. Random Point in Non-overlapping Rectangles (Medium)](https://leetcode.com/problems/random-point-in-non-overlapping-rectangles "非重叠矩形中的随机点") @@ -59,9 +59,9 @@ ### Related Topics - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] - [[Random](https://github.com/openset/leetcode/tree/master/tag/random/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] + [[Random](../../tag/random/README.md)] ### Similar Questions - 1. [Random Pick with Weight](https://github.com/openset/leetcode/tree/master/problems/random-pick-with-weight) (Medium) - 1. [Generate Random Point in a Circle](https://github.com/openset/leetcode/tree/master/problems/generate-random-point-in-a-circle) (Medium) + 1. [Random Pick with Weight](../random-pick-with-weight) (Medium) + 1. [Generate Random Point in a Circle](../generate-random-point-in-a-circle) (Medium) diff --git a/problems/range-addition-ii/README.md b/problems/range-addition-ii/README.md index 8b233264b..50752f199 100644 --- a/problems/range-addition-ii/README.md +++ b/problems/range-addition-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/friend-requests-i-overall-acceptance-rate "Friend Requests I: Overall Acceptance Rate") +[< Previous](../friend-requests-i-overall-acceptance-rate "Friend Requests I: Overall Acceptance Rate") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-index-sum-of-two-lists "Minimum Index Sum of Two Lists") +[Next >](../minimum-index-sum-of-two-lists "Minimum Index Sum of Two Lists") ## [598. Range Addition II (Easy)](https://leetcode.com/problems/range-addition-ii "范围求和 II") @@ -50,7 +50,7 @@ So the maximum integer in M is 2, and there are four of it in M. So return 4.

### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Range Addition](https://github.com/openset/leetcode/tree/master/problems/range-addition) (Medium) + 1. [Range Addition](../range-addition) (Medium) diff --git a/problems/range-addition/README.md b/problems/range-addition/README.md index 70d781b5c..f15faa682 100644 --- a/problems/range-addition/README.md +++ b/problems/range-addition/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/plus-one-linked-list "Plus One Linked List") +[< Previous](../plus-one-linked-list "Plus One Linked List") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/sum-of-two-integers "Sum of Two Integers") +[Next >](../sum-of-two-integers "Sum of Two Integers") ## [370. Range Addition (Medium)](https://leetcode.com/problems/range-addition "区间加法") @@ -41,10 +41,10 @@ After applying operation [0,2,-2]: ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Range Addition II](https://github.com/openset/leetcode/tree/master/problems/range-addition-ii) (Easy) + 1. [Range Addition II](../range-addition-ii) (Easy) ### Hints
diff --git a/problems/range-module/README.md b/problems/range-module/README.md index e84f60fb3..53f405c50 100644 --- a/problems/range-module/README.md +++ b/problems/range-module/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-with-transaction-fee "Best Time to Buy and Sell Stock with Transaction Fee") +[< Previous](../best-time-to-buy-and-sell-stock-with-transaction-fee "Best Time to Buy and Sell Stock with Transaction Fee") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/max-stack "Max Stack") +[Next >](../max-stack "Max Stack") ## [715. Range Module (Hard)](https://leetcode.com/problems/range-module "Range 模块") @@ -40,13 +40,13 @@

### Related Topics - [[Segment Tree](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] - [[Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md)] + [[Segment Tree](../../tag/segment-tree/README.md)] + [[Ordered Map](../../tag/ordered-map/README.md)] ### Similar Questions - 1. [Merge Intervals](https://github.com/openset/leetcode/tree/master/problems/merge-intervals) (Medium) - 1. [Insert Interval](https://github.com/openset/leetcode/tree/master/problems/insert-interval) (Hard) - 1. [Data Stream as Disjoint Intervals](https://github.com/openset/leetcode/tree/master/problems/data-stream-as-disjoint-intervals) (Hard) + 1. [Merge Intervals](../merge-intervals) (Medium) + 1. [Insert Interval](../insert-interval) (Hard) + 1. [Data Stream as Disjoint Intervals](../data-stream-as-disjoint-intervals) (Hard) ### Hints
diff --git a/problems/range-sum-of-bst/README.md b/problems/range-sum-of-bst/README.md index 356f00373..118d72922 100644 --- a/problems/range-sum-of-bst/README.md +++ b/problems/range-sum-of-bst/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/reorder-data-in-log-files "Reorder Data in Log Files") +[< Previous](../reorder-data-in-log-files "Reorder Data in Log Files") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-area-rectangle "Minimum Area Rectangle") +[Next >](../minimum-area-rectangle "Minimum Area Rectangle") ## [938. Range Sum of BST (Easy)](https://leetcode.com/problems/range-sum-of-bst "二叉搜索树的范围和") @@ -45,5 +45,5 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Recursion](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Recursion](../../tag/recursion/README.md)] diff --git a/problems/range-sum-query-2d-immutable/README.md b/problems/range-sum-query-2d-immutable/README.md index 58ef930c4..0798fa03e 100644 --- a/problems/range-sum-query-2d-immutable/README.md +++ b/problems/range-sum-query-2d-immutable/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-immutable "Range Sum Query - Immutable") +[< Previous](../range-sum-query-immutable "Range Sum Query - Immutable") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-islands-ii "Number of Islands II") +[Next >](../number-of-islands-ii "Number of Islands II") ## [304. Range Sum Query 2D - Immutable (Medium)](https://leetcode.com/problems/range-sum-query-2d-immutable "二维区域和检索 - 矩阵不可变") @@ -43,8 +43,8 @@ sumRegion(1, 2, 2, 4) -> 12

### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Range Sum Query - Immutable](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-immutable) (Easy) - 1. [Range Sum Query 2D - Mutable](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-mutable) (Hard) + 1. [Range Sum Query - Immutable](../range-sum-query-immutable) (Easy) + 1. [Range Sum Query 2D - Mutable](../range-sum-query-2d-mutable) (Hard) diff --git a/problems/range-sum-query-2d-mutable/README.md b/problems/range-sum-query-2d-mutable/README.md index 57e92fd07..d52fb6950 100644 --- a/problems/range-sum-query-2d-mutable/README.md +++ b/problems/range-sum-query-2d-mutable/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-mutable "Range Sum Query - Mutable") +[< Previous](../range-sum-query-mutable "Range Sum Query - Mutable") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-with-cooldown "Best Time to Buy and Sell Stock with Cooldown") +[Next >](../best-time-to-buy-and-sell-stock-with-cooldown "Best Time to Buy and Sell Stock with Cooldown") ## [308. Range Sum Query 2D - Mutable (Hard)](https://leetcode.com/problems/range-sum-query-2d-mutable "二维区域和检索 - 可变") @@ -43,9 +43,9 @@ sumRegion(2, 1, 4, 3) -> 10

### Related Topics - [[Binary Indexed Tree](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] - [[Segment Tree](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] + [[Binary Indexed Tree](../../tag/binary-indexed-tree/README.md)] + [[Segment Tree](../../tag/segment-tree/README.md)] ### Similar Questions - 1. [Range Sum Query 2D - Immutable](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-immutable) (Medium) - 1. [Range Sum Query - Mutable](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-mutable) (Medium) + 1. [Range Sum Query 2D - Immutable](../range-sum-query-2d-immutable) (Medium) + 1. [Range Sum Query - Mutable](../range-sum-query-mutable) (Medium) diff --git a/problems/range-sum-query-immutable/README.md b/problems/range-sum-query-immutable/README.md index fc3a0444e..e1baedfd5 100644 --- a/problems/range-sum-query-immutable/README.md +++ b/problems/range-sum-query-immutable/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/smallest-rectangle-enclosing-black-pixels "Smallest Rectangle Enclosing Black Pixels") +[< Previous](../smallest-rectangle-enclosing-black-pixels "Smallest Rectangle Enclosing Black Pixels") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-immutable "Range Sum Query 2D - Immutable") +[Next >](../range-sum-query-2d-immutable "Range Sum Query 2D - Immutable") ## [303. Range Sum Query - Immutable (Easy)](https://leetcode.com/problems/range-sum-query-immutable "区域和检索 - 数组不可变") @@ -31,9 +31,9 @@ sumRange(0, 5) -> -3

### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Range Sum Query 2D - Immutable](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-immutable) (Medium) - 1. [Range Sum Query - Mutable](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-mutable) (Medium) - 1. [Maximum Size Subarray Sum Equals k](https://github.com/openset/leetcode/tree/master/problems/maximum-size-subarray-sum-equals-k) (Medium) + 1. [Range Sum Query 2D - Immutable](../range-sum-query-2d-immutable) (Medium) + 1. [Range Sum Query - Mutable](../range-sum-query-mutable) (Medium) + 1. [Maximum Size Subarray Sum Equals k](../maximum-size-subarray-sum-equals-k) (Medium) diff --git a/problems/range-sum-query-mutable/README.md b/problems/range-sum-query-mutable/README.md index 0922ceb77..2ab29effe 100644 --- a/problems/range-sum-query-mutable/README.md +++ b/problems/range-sum-query-mutable/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/additive-number "Additive Number") +[< Previous](../additive-number "Additive Number") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-mutable "Range Sum Query 2D - Mutable") +[Next >](../range-sum-query-2d-mutable "Range Sum Query 2D - Mutable") ## [307. Range Sum Query - Mutable (Medium)](https://leetcode.com/problems/range-sum-query-mutable "区域和检索 - 数组可修改") @@ -33,9 +33,9 @@ sumRange(0, 2) -> 8 ### Related Topics - [[Binary Indexed Tree](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] - [[Segment Tree](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] + [[Binary Indexed Tree](../../tag/binary-indexed-tree/README.md)] + [[Segment Tree](../../tag/segment-tree/README.md)] ### Similar Questions - 1. [Range Sum Query - Immutable](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-immutable) (Easy) - 1. [Range Sum Query 2D - Mutable](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-mutable) (Hard) + 1. [Range Sum Query - Immutable](../range-sum-query-immutable) (Easy) + 1. [Range Sum Query 2D - Mutable](../range-sum-query-2d-mutable) (Hard) diff --git a/problems/rank-scores/README.md b/problems/rank-scores/README.md index 98a80e882..348ec520c 100644 --- a/problems/rank-scores/README.md +++ b/problems/rank-scores/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/nth-highest-salary "Nth Highest Salary") +[< Previous](../nth-highest-salary "Nth Highest Salary") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/largest-number "Largest Number") +[Next >](../largest-number "Largest Number") ## [178. Rank Scores (Medium)](https://leetcode.com/problems/rank-scores "分数排名") diff --git a/problems/ransom-note/README.md b/problems/ransom-note/README.md index f3bc42a43..4b4f4adc0 100644 --- a/problems/ransom-note/README.md +++ b/problems/ransom-note/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/linked-list-random-node "Linked List Random Node") +[< Previous](../linked-list-random-node "Linked List Random Node") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/shuffle-an-array "Shuffle an Array") +[Next >](../shuffle-an-array "Shuffle an Array") ## [383. Ransom Note (Easy)](https://leetcode.com/problems/ransom-note "赎金信") @@ -30,7 +30,7 @@ canConstruct("aa", "aab") -> true ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Stickers to Spell Word](https://github.com/openset/leetcode/tree/master/problems/stickers-to-spell-word) (Hard) + 1. [Stickers to Spell Word](../stickers-to-spell-word) (Hard) diff --git a/problems/reach-a-number/README.md b/problems/reach-a-number/README.md index 52f48248a..85e70c34a 100644 --- a/problems/reach-a-number/README.md +++ b/problems/reach-a-number/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/cracking-the-safe "Cracking the Safe") +[< Previous](../cracking-the-safe "Cracking the Safe") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/pour-water "Pour Water") +[Next >](../pour-water "Pour Water") ## [754. Reach a Number (Medium)](https://leetcode.com/problems/reach-a-number "到达终点数字") @@ -45,4 +45,4 @@ On the third move we step from -1 to 2.

### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/reachable-nodes-in-subdivided-graph/README.md b/problems/reachable-nodes-in-subdivided-graph/README.md index 8cd936a5b..b33cd0903 100644 --- a/problems/reachable-nodes-in-subdivided-graph/README.md +++ b/problems/reachable-nodes-in-subdivided-graph/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/boats-to-save-people "Boats to Save People") +[< Previous](../boats-to-save-people "Boats to Save People") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/projection-area-of-3d-shapes "Projection Area of 3D Shapes") +[Next >](../projection-area-of-3d-shapes "Projection Area of 3D Shapes") ## [882. Reachable Nodes In Subdivided Graph (Hard)](https://leetcode.com/problems/reachable-nodes-in-subdivided-graph "细分图中的可到达结点") @@ -65,4 +65,4 @@ The nodes that are reachable in the final graph after M = 6 moves are indicated ### Related Topics - [[Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] + [[Heap](../../tag/heap/README.md)] diff --git a/problems/reaching-points/README.md b/problems/reaching-points/README.md index 383a2a695..989d99986 100644 --- a/problems/reaching-points/README.md +++ b/problems/reaching-points/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/k-th-symbol-in-grammar "K-th Symbol in Grammar") +[< Previous](../k-th-symbol-in-grammar "K-th Symbol in Grammar") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/rabbits-in-forest "Rabbits in Forest") +[Next >](../rabbits-in-forest "Rabbits in Forest") ## [780. Reaching Points (Hard)](https://leetcode.com/problems/reaching-points "到达终点") @@ -40,4 +40,4 @@ One series of moves that transforms the starting point to the target is: ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/read-n-characters-given-read4-ii-call-multiple-times/README.md b/problems/read-n-characters-given-read4-ii-call-multiple-times/README.md index 3f4779cdc..366605e89 100644 --- a/problems/read-n-characters-given-read4-ii-call-multiple-times/README.md +++ b/problems/read-n-characters-given-read4-ii-call-multiple-times/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/read-n-characters-given-read4 "Read N Characters Given Read4") +[< Previous](../read-n-characters-given-read4 "Read N Characters Given Read4") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-two-distinct-characters "Longest Substring with At Most Two Distinct Characters") +[Next >](../longest-substring-with-at-most-two-distinct-characters "Longest Substring with At Most Two Distinct Characters") ## [158. Read N Characters Given Read4 II - Call multiple times (Hard)](https://leetcode.com/problems/read-n-characters-given-read4-ii-call-multiple-times "用 Read4 读取 N 个字符 II") @@ -94,7 +94,7 @@ sol.read(buf, 1); // We have reached the end of file, no more characters can be ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Read N Characters Given Read4](https://github.com/openset/leetcode/tree/master/problems/read-n-characters-given-read4) (Easy) + 1. [Read N Characters Given Read4](../read-n-characters-given-read4) (Easy) diff --git a/problems/read-n-characters-given-read4/README.md b/problems/read-n-characters-given-read4/README.md index 7e777ec38..ec9cf5d10 100644 --- a/problems/read-n-characters-given-read4/README.md +++ b/problems/read-n-characters-given-read4/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/binary-tree-upside-down "Binary Tree Upside Down") +[< Previous](../binary-tree-upside-down "Binary Tree Upside Down") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/read-n-characters-given-read4-ii-call-multiple-times "Read N Characters Given Read4 II - Call multiple times") +[Next >](../read-n-characters-given-read4-ii-call-multiple-times "Read N Characters Given Read4 II - Call multiple times") ## [157. Read N Characters Given Read4 (Easy)](https://leetcode.com/problems/read-n-characters-given-read4 "用 Read4 读取 N 个字符") @@ -104,7 +104,7 @@ Note: buf[] is destination not source, you will need to write the results to buf ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Read N Characters Given Read4 II - Call multiple times](https://github.com/openset/leetcode/tree/master/problems/read-n-characters-given-read4-ii-call-multiple-times) (Hard) + 1. [Read N Characters Given Read4 II - Call multiple times](../read-n-characters-given-read4-ii-call-multiple-times) (Hard) diff --git a/problems/rearrange-string-k-distance-apart/README.md b/problems/rearrange-string-k-distance-apart/README.md index c540b1737..8ab0f8b6e 100644 --- a/problems/rearrange-string-k-distance-apart/README.md +++ b/problems/rearrange-string-k-distance-apart/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/count-numbers-with-unique-digits "Count Numbers with Unique Digits") +[< Previous](../count-numbers-with-unique-digits "Count Numbers with Unique Digits") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/logger-rate-limiter "Logger Rate Limiter") +[Next >](../logger-rate-limiter "Logger Rate Limiter") ## [358. Rearrange String k Distance Apart (Hard)](https://leetcode.com/problems/rearrange-string-k-distance-apart "K 距离间隔重排字符串") @@ -43,10 +43,10 @@ ### Related Topics - [[Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Heap](../../tag/heap/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Task Scheduler](https://github.com/openset/leetcode/tree/master/problems/task-scheduler) (Medium) - 1. [Reorganize String](https://github.com/openset/leetcode/tree/master/problems/reorganize-string) (Medium) + 1. [Task Scheduler](../task-scheduler) (Medium) + 1. [Reorganize String](../reorganize-string) (Medium) diff --git a/problems/reconstruct-a-2-row-binary-matrix/README.md b/problems/reconstruct-a-2-row-binary-matrix/README.md index e52c04fe5..05e21c189 100644 --- a/problems/reconstruct-a-2-row-binary-matrix/README.md +++ b/problems/reconstruct-a-2-row-binary-matrix/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/cells-with-odd-values-in-a-matrix "Cells with Odd Values in a Matrix") +[< Previous](../cells-with-odd-values-in-a-matrix "Cells with Odd Values in a Matrix") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-closed-islands "Number of Closed Islands") +[Next >](../number-of-closed-islands "Number of Closed Islands") ## [1253. Reconstruct a 2-Row Binary Matrix (Medium)](https://leetcode.com/problems/reconstruct-a-2-row-binary-matrix "重构 2 行二进制矩阵") @@ -61,8 +61,8 @@ ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[Math](../../tag/math/README.md)] ### Hints
diff --git a/problems/reconstruct-itinerary/README.md b/problems/reconstruct-itinerary/README.md index 09afa8ff3..b7cfcce7f 100644 --- a/problems/reconstruct-itinerary/README.md +++ b/problems/reconstruct-itinerary/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/verify-preorder-serialization-of-a-binary-tree "Verify Preorder Serialization of a Binary Tree") +[< Previous](../verify-preorder-serialization-of-a-binary-tree "Verify Preorder Serialization of a Binary Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/largest-bst-subtree "Largest BST Subtree") +[Next >](../largest-bst-subtree "Largest BST Subtree") ## [332. Reconstruct Itinerary (Medium)](https://leetcode.com/problems/reconstruct-itinerary "重新安排行程") @@ -38,5 +38,5 @@ ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Graph](../../tag/graph/README.md)] diff --git a/problems/reconstruct-original-digits-from-english/README.md b/problems/reconstruct-original-digits-from-english/README.md index a3a9d6ed8..f4f520891 100644 --- a/problems/reconstruct-original-digits-from-english/README.md +++ b/problems/reconstruct-original-digits-from-english/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/valid-word-square "Valid Word Square") +[< Previous](../valid-word-square "Valid Word Square") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/longest-repeating-character-replacement "Longest Repeating Character Replacement") +[Next >](../longest-repeating-character-replacement "Longest Repeating Character Replacement") ## [423. Reconstruct Original Digits from English (Medium)](https://leetcode.com/problems/reconstruct-original-digits-from-english "从英文中重建数字") @@ -38,4 +38,4 @@ Output: "45"

### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/recover-a-tree-from-preorder-traversal/README.md b/problems/recover-a-tree-from-preorder-traversal/README.md index 806ef8f48..f76b12e26 100644 --- a/problems/recover-a-tree-from-preorder-traversal/README.md +++ b/problems/recover-a-tree-from-preorder-traversal/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/longest-arithmetic-sequence "Longest Arithmetic Sequence") +[< Previous](../longest-arithmetic-sequence "Longest Arithmetic Sequence") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/two-city-scheduling "Two City Scheduling") +[Next >](../two-city-scheduling "Two City Scheduling") ## [1028. Recover a Tree From Preorder Traversal (Hard)](https://leetcode.com/problems/recover-a-tree-from-preorder-traversal "从先序遍历还原二叉树") @@ -65,8 +65,8 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] ### Hints
diff --git a/problems/recover-binary-search-tree/README.md b/problems/recover-binary-search-tree/README.md index 59bc3e33c..81af2a3a8 100644 --- a/problems/recover-binary-search-tree/README.md +++ b/problems/recover-binary-search-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/validate-binary-search-tree "Validate Binary Search Tree") +[< Previous](../validate-binary-search-tree "Validate Binary Search Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/same-tree "Same Tree") +[Next >](../same-tree "Same Tree") ## [99. Recover Binary Search Tree (Hard)](https://leetcode.com/problems/recover-binary-search-tree "恢复二叉搜索树") @@ -63,5 +63,5 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] diff --git a/problems/rectangle-area-ii/README.md b/problems/rectangle-area-ii/README.md index 1fdb74c03..eac757cc8 100644 --- a/problems/rectangle-area-ii/README.md +++ b/problems/rectangle-area-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximize-distance-to-closest-person "Maximize Distance to Closest Person") +[< Previous](../maximize-distance-to-closest-person "Maximize Distance to Closest Person") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/loud-and-rich "Loud and Rich") +[Next >](../loud-and-rich "Loud and Rich") ## [850. Rectangle Area II (Hard)](https://leetcode.com/problems/rectangle-area-ii "矩形面积 II") @@ -43,5 +43,5 @@ ### Related Topics - [[Segment Tree](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] - [[Line Sweep](https://github.com/openset/leetcode/tree/master/tag/line-sweep/README.md)] + [[Segment Tree](../../tag/segment-tree/README.md)] + [[Line Sweep](../../tag/line-sweep/README.md)] diff --git a/problems/rectangle-area/README.md b/problems/rectangle-area/README.md index 8cc6f2f84..a90cbf5dd 100644 --- a/problems/rectangle-area/README.md +++ b/problems/rectangle-area/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/count-complete-tree-nodes "Count Complete Tree Nodes") +[< Previous](../count-complete-tree-nodes "Count Complete Tree Nodes") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/basic-calculator "Basic Calculator") +[Next >](../basic-calculator "Basic Calculator") ## [223. Rectangle Area (Medium)](https://leetcode.com/problems/rectangle-area "矩形面积") @@ -28,7 +28,7 @@

Assume that the total area is never beyond the maximum possible value of int.

### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Rectangle Overlap](https://github.com/openset/leetcode/tree/master/problems/rectangle-overlap) (Easy) + 1. [Rectangle Overlap](../rectangle-overlap) (Easy) diff --git a/problems/rectangle-overlap/README.md b/problems/rectangle-overlap/README.md index ee40280ab..1665c47ed 100644 --- a/problems/rectangle-overlap/README.md +++ b/problems/rectangle-overlap/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/image-overlap "Image Overlap") +[< Previous](../image-overlap "Image Overlap") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/new-21-game "New 21 Game") +[Next >](../new-21-game "New 21 Game") ## [836. Rectangle Overlap (Easy)](https://leetcode.com/problems/rectangle-overlap "矩形重叠") @@ -39,7 +39,7 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Rectangle Area](https://github.com/openset/leetcode/tree/master/problems/rectangle-area) (Medium) + 1. [Rectangle Area](../rectangle-area) (Medium) diff --git a/problems/redundant-connection-ii/README.md b/problems/redundant-connection-ii/README.md index 7b6adc70d..32c267e4d 100644 --- a/problems/redundant-connection-ii/README.md +++ b/problems/redundant-connection-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/redundant-connection "Redundant Connection") +[< Previous](../redundant-connection "Redundant Connection") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/repeated-string-match "Repeated String Match") +[Next >](../repeated-string-match "Repeated String Match") ## [685. Redundant Connection II (Hard)](https://leetcode.com/problems/redundant-connection-ii "冗余连接 II") @@ -47,10 +47,10 @@ v v

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Union Find](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Union Find](../../tag/union-find/README.md)] + [[Graph](../../tag/graph/README.md)] ### Similar Questions - 1. [Redundant Connection](https://github.com/openset/leetcode/tree/master/problems/redundant-connection) (Medium) + 1. [Redundant Connection](../redundant-connection) (Medium) diff --git a/problems/redundant-connection/README.md b/problems/redundant-connection/README.md index 27cf22c9c..6d8db4840 100644 --- a/problems/redundant-connection/README.md +++ b/problems/redundant-connection/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/k-empty-slots "K Empty Slots") +[< Previous](../k-empty-slots "K Empty Slots") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/redundant-connection-ii "Redundant Connection II") +[Next >](../redundant-connection-ii "Redundant Connection II") ## [684. Redundant Connection (Medium)](https://leetcode.com/problems/redundant-connection "冗余连接") @@ -52,10 +52,10 @@ We have overhauled the problem description + test cases and specified clearly th

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Union Find](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Union Find](../../tag/union-find/README.md)] + [[Graph](../../tag/graph/README.md)] ### Similar Questions - 1. [Redundant Connection II](https://github.com/openset/leetcode/tree/master/problems/redundant-connection-ii) (Hard) - 1. [Accounts Merge](https://github.com/openset/leetcode/tree/master/problems/accounts-merge) (Medium) + 1. [Redundant Connection II](../redundant-connection-ii) (Hard) + 1. [Accounts Merge](../accounts-merge) (Medium) diff --git a/problems/reformat-department-table/README.md b/problems/reformat-department-table/README.md index 4ed39a47c..dbbf71b3a 100644 --- a/problems/reformat-department-table/README.md +++ b/problems/reformat-department-table/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/number-of-valid-words-for-each-puzzle "Number of Valid Words for Each Puzzle") +[< Previous](../number-of-valid-words-for-each-puzzle "Number of Valid Words for Each Puzzle") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/count-substrings-with-only-one-distinct-letter "Count Substrings with Only One Distinct Letter") +[Next >](../count-substrings-with-only-one-distinct-letter "Count Substrings with Only One Distinct Letter") ## [1179. Reformat Department Table (Easy)](https://leetcode.com/problems/reformat-department-table "重新格式化部门表") diff --git a/problems/regions-cut-by-slashes/README.md b/problems/regions-cut-by-slashes/README.md index b96d8c349..920a4ff39 100644 --- a/problems/regions-cut-by-slashes/README.md +++ b/problems/regions-cut-by-slashes/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/check-completeness-of-a-binary-tree "Check Completeness of a Binary Tree") +[< Previous](../check-completeness-of-a-binary-tree "Check Completeness of a Binary Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/delete-columns-to-make-sorted-iii "Delete Columns to Make Sorted III") +[Next >](../delete-columns-to-make-sorted-iii "Delete Columns to Make Sorted III") ## [959. Regions Cut By Slashes (Medium)](https://leetcode.com/problems/regions-cut-by-slashes "由斜杠划分区域") @@ -119,6 +119,6 @@ The 2x2 grid is as follows: ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Union Find](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Union Find](../../tag/union-find/README.md)] + [[Graph](../../tag/graph/README.md)] diff --git a/problems/regular-expression-matching/README.md b/problems/regular-expression-matching/README.md index 5e5d65f82..62ae6afc9 100644 --- a/problems/regular-expression-matching/README.md +++ b/problems/regular-expression-matching/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/palindrome-number "Palindrome Number") +[< Previous](../palindrome-number "Palindrome Number") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/container-with-most-water "Container With Most Water") +[Next >](../container-with-most-water "Container With Most Water") ## [10. Regular Expression Matching (Hard)](https://leetcode.com/problems/regular-expression-matching "正则表达式匹配") @@ -77,9 +77,9 @@ p = "mis*is*p*." ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[String](../../tag/string/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Wildcard Matching](https://github.com/openset/leetcode/tree/master/problems/wildcard-matching) (Hard) + 1. [Wildcard Matching](../wildcard-matching) (Hard) diff --git a/problems/relative-ranks/README.md b/problems/relative-ranks/README.md index e8c796d4b..ab21ccd9a 100644 --- a/problems/relative-ranks/README.md +++ b/problems/relative-ranks/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/the-maze-ii "The Maze II") +[< Previous](../the-maze-ii "The Maze II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/perfect-number "Perfect Number") +[Next >](../perfect-number "Perfect Number") ## [506. Relative Ranks (Easy)](https://leetcode.com/problems/relative-ranks "相对名次") diff --git a/problems/relative-sort-array/README.md b/problems/relative-sort-array/README.md index 95a21fd99..b3de2b749 100644 --- a/problems/relative-sort-array/README.md +++ b/problems/relative-sort-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/divide-array-into-increasing-sequences "Divide Array Into Increasing Sequences") +[< Previous](../divide-array-into-increasing-sequences "Divide Array Into Increasing Sequences") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/lowest-common-ancestor-of-deepest-leaves "Lowest Common Ancestor of Deepest Leaves") +[Next >](../lowest-common-ancestor-of-deepest-leaves "Lowest Common Ancestor of Deepest Leaves") ## [1122. Relative Sort Array (Easy)](https://leetcode.com/problems/relative-sort-array "数组的相对排序") @@ -31,8 +31,8 @@ ### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Sort](../../tag/sort/README.md)] + [[Array](../../tag/array/README.md)] ### Hints
diff --git a/problems/remove-9/README.md b/problems/remove-9/README.md index 5a8abb0b8..c186217f6 100644 --- a/problems/remove-9/README.md +++ b/problems/remove-9/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/split-array-into-consecutive-subsequences "Split Array into Consecutive Subsequences") +[< Previous](../split-array-into-consecutive-subsequences "Split Array into Consecutive Subsequences") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/image-smoother "Image Smoother") +[Next >](../image-smoother "Image Smoother") ## [660. Remove 9 (Hard)](https://leetcode.com/problems/remove-9 "移除 9") @@ -28,4 +28,4 @@

### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/remove-all-adjacent-duplicates-in-string-ii/README.md b/problems/remove-all-adjacent-duplicates-in-string-ii/README.md index 1343fa3b9..206bea2c3 100644 --- a/problems/remove-all-adjacent-duplicates-in-string-ii/README.md +++ b/problems/remove-all-adjacent-duplicates-in-string-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/get-equal-substrings-within-budget "Get Equal Substrings Within Budget") +[< Previous](../get-equal-substrings-within-budget "Get Equal Substrings Within Budget") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-moves-to-reach-target-with-rotations "Minimum Moves to Reach Target with Rotations") +[Next >](../minimum-moves-to-reach-target-with-rotations "Minimum Moves to Reach Target with Rotations") ## [1209. Remove All Adjacent Duplicates in String II (Medium)](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string-ii "删除字符串中的所有相邻重复项 II") @@ -54,7 +54,7 @@ Finally delete "ddd", get "aa" ### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] + [[Stack](../../tag/stack/README.md)] ### Hints
diff --git a/problems/remove-all-adjacent-duplicates-in-string/README.md b/problems/remove-all-adjacent-duplicates-in-string/README.md index 12f0aa56c..2ec524ed2 100644 --- a/problems/remove-all-adjacent-duplicates-in-string/README.md +++ b/problems/remove-all-adjacent-duplicates-in-string/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/last-stone-weight "Last Stone Weight") +[< Previous](../last-stone-weight "Last Stone Weight") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/longest-string-chain "Longest String Chain") +[Next >](../longest-string-chain "Longest String Chain") ## [1047. Remove All Adjacent Duplicates In String (Easy)](https://leetcode.com/problems/remove-all-adjacent-duplicates-in-string "删除字符串中的所有相邻重复项") @@ -38,7 +38,7 @@ For example, in "abbaca" we could remove "bb" since the lett ### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] + [[Stack](../../tag/stack/README.md)] ### Hints
diff --git a/problems/remove-boxes/README.md b/problems/remove-boxes/README.md index 56bea8406..ff1ac85fb 100644 --- a/problems/remove-boxes/README.md +++ b/problems/remove-boxes/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/boundary-of-binary-tree "Boundary of Binary Tree") +[< Previous](../boundary-of-binary-tree "Boundary of Binary Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/friend-circles "Friend Circles") +[Next >](../friend-circles "Friend Circles") ## [546. Remove Boxes (Hard)](https://leetcode.com/problems/remove-boxes "移除盒子") @@ -40,8 +40,8 @@ The number of boxes n would not exceed 100.

### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Strange Printer](https://github.com/openset/leetcode/tree/master/problems/strange-printer) (Hard) + 1. [Strange Printer](../strange-printer) (Hard) diff --git a/problems/remove-comments/README.md b/problems/remove-comments/README.md index 3a981fc79..08ced295f 100644 --- a/problems/remove-comments/README.md +++ b/problems/remove-comments/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/accounts-merge "Accounts Merge") +[< Previous](../accounts-merge "Accounts Merge") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/candy-crush "Candy Crush") +[Next >](../candy-crush "Candy Crush") ## [722. Remove Comments (Medium)](https://leetcode.com/problems/remove-comments "删除注释") @@ -82,11 +82,11 @@ source = ["a/*comment", "line", "more_comment*/b"]

### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Mini Parser](https://github.com/openset/leetcode/tree/master/problems/mini-parser) (Medium) - 1. [Ternary Expression Parser](https://github.com/openset/leetcode/tree/master/problems/ternary-expression-parser) (Medium) + 1. [Mini Parser](../mini-parser) (Medium) + 1. [Ternary Expression Parser](../ternary-expression-parser) (Medium) ### Hints
diff --git a/problems/remove-covered-intervals/README.md b/problems/remove-covered-intervals/README.md index 450bb30ee..9afd3c7cf 100644 --- a/problems/remove-covered-intervals/README.md +++ b/problems/remove-covered-intervals/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/element-appearing-more-than-25-in-sorted-array "Element Appearing More Than 25% In Sorted Array") +[< Previous](../element-appearing-more-than-25-in-sorted-array "Element Appearing More Than 25% In Sorted Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-falling-path-sum-ii "Minimum Falling Path Sum II") +[Next >](../minimum-falling-path-sum-ii "Minimum Falling Path Sum II") ## [1288. Remove Covered Intervals (Medium)](https://leetcode.com/problems/remove-covered-intervals "删除被覆盖区间") @@ -34,7 +34,7 @@ ### Related Topics - [[Line Sweep](https://github.com/openset/leetcode/tree/master/tag/line-sweep/README.md)] + [[Line Sweep](../../tag/line-sweep/README.md)] ### Hints
diff --git a/problems/remove-duplicate-letters/README.md b/problems/remove-duplicate-letters/README.md index f19bcb730..7de020501 100644 --- a/problems/remove-duplicate-letters/README.md +++ b/problems/remove-duplicate-letters/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/count-of-smaller-numbers-after-self "Count of Smaller Numbers After Self") +[< Previous](../count-of-smaller-numbers-after-self "Count of Smaller Numbers After Self") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-from-all-buildings "Shortest Distance from All Buildings") +[Next >](../shortest-distance-from-all-buildings "Shortest Distance from All Buildings") ## [316. Remove Duplicate Letters (Hard)](https://leetcode.com/problems/remove-duplicate-letters "去除重复字母") @@ -28,5 +28,5 @@ ### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] + [[Stack](../../tag/stack/README.md)] + [[Greedy](../../tag/greedy/README.md)] diff --git a/problems/remove-duplicates-from-sorted-array-ii/README.md b/problems/remove-duplicates-from-sorted-array-ii/README.md index 91362b9d8..e7bd74569 100644 --- a/problems/remove-duplicates-from-sorted-array-ii/README.md +++ b/problems/remove-duplicates-from-sorted-array-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/word-search "Word Search") +[< Previous](../word-search "Word Search") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/search-in-rotated-sorted-array-ii "Search in Rotated Sorted Array II") +[Next >](../search-in-rotated-sorted-array-ii "Search in Rotated Sorted Array II") ## [80. Remove Duplicates from Sorted Array II (Medium)](https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii "删除排序数组中的重复项 II") @@ -54,8 +54,8 @@ for (int i = 0; i < len; i++) { ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Array](../../tag/array/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] ### Similar Questions - 1. [Remove Duplicates from Sorted Array](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-array) (Easy) + 1. [Remove Duplicates from Sorted Array](../remove-duplicates-from-sorted-array) (Easy) diff --git a/problems/remove-duplicates-from-sorted-array/README.md b/problems/remove-duplicates-from-sorted-array/README.md index ea2a906a3..0dbb6aa76 100644 --- a/problems/remove-duplicates-from-sorted-array/README.md +++ b/problems/remove-duplicates-from-sorted-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/reverse-nodes-in-k-group "Reverse Nodes in k-Group") +[< Previous](../reverse-nodes-in-k-group "Reverse Nodes in k-Group") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/remove-element "Remove Element") +[Next >](../remove-element "Remove Element") ## [26. Remove Duplicates from Sorted Array (Easy)](https://leetcode.com/problems/remove-duplicates-from-sorted-array "删除排序数组中的重复项") @@ -53,9 +53,9 @@ for (int i = 0; i < len; i++) { } ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Array](../../tag/array/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] ### Similar Questions - 1. [Remove Element](https://github.com/openset/leetcode/tree/master/problems/remove-element) (Easy) - 1. [Remove Duplicates from Sorted Array II](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-array-ii) (Medium) + 1. [Remove Element](../remove-element) (Easy) + 1. [Remove Duplicates from Sorted Array II](../remove-duplicates-from-sorted-array-ii) (Medium) diff --git a/problems/remove-duplicates-from-sorted-list-ii/README.md b/problems/remove-duplicates-from-sorted-list-ii/README.md index 53a8da13c..ec0ae0b3f 100644 --- a/problems/remove-duplicates-from-sorted-list-ii/README.md +++ b/problems/remove-duplicates-from-sorted-list-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/search-in-rotated-sorted-array-ii "Search in Rotated Sorted Array II") +[< Previous](../search-in-rotated-sorted-array-ii "Search in Rotated Sorted Array II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-list "Remove Duplicates from Sorted List") +[Next >](../remove-duplicates-from-sorted-list "Remove Duplicates from Sorted List") ## [82. Remove Duplicates from Sorted List II (Medium)](https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii "删除排序链表中的重复元素 II") @@ -28,7 +28,7 @@ ### Related Topics - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] + [[Linked List](../../tag/linked-list/README.md)] ### Similar Questions - 1. [Remove Duplicates from Sorted List](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-list) (Easy) + 1. [Remove Duplicates from Sorted List](../remove-duplicates-from-sorted-list) (Easy) diff --git a/problems/remove-duplicates-from-sorted-list/README.md b/problems/remove-duplicates-from-sorted-list/README.md index 044ffdc16..bcf7db1ce 100644 --- a/problems/remove-duplicates-from-sorted-list/README.md +++ b/problems/remove-duplicates-from-sorted-list/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-list-ii "Remove Duplicates from Sorted List II") +[< Previous](../remove-duplicates-from-sorted-list-ii "Remove Duplicates from Sorted List II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/largest-rectangle-in-histogram "Largest Rectangle in Histogram") +[Next >](../largest-rectangle-in-histogram "Largest Rectangle in Histogram") ## [83. Remove Duplicates from Sorted List (Easy)](https://leetcode.com/problems/remove-duplicates-from-sorted-list "删除排序链表中的重复元素") @@ -28,7 +28,7 @@ ### Related Topics - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] + [[Linked List](../../tag/linked-list/README.md)] ### Similar Questions - 1. [Remove Duplicates from Sorted List II](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-list-ii) (Medium) + 1. [Remove Duplicates from Sorted List II](../remove-duplicates-from-sorted-list-ii) (Medium) diff --git a/problems/remove-element/README.md b/problems/remove-element/README.md index 974109275..b82b30128 100644 --- a/problems/remove-element/README.md +++ b/problems/remove-element/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-array "Remove Duplicates from Sorted Array") +[< Previous](../remove-duplicates-from-sorted-array "Remove Duplicates from Sorted Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/implement-strstr "Implement strStr()") +[Next >](../implement-strstr "Implement strStr()") ## [27. Remove Element (Easy)](https://leetcode.com/problems/remove-element "移除元素") @@ -57,13 +57,13 @@ for (int i = 0; i < len; i++) { } ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Array](../../tag/array/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] ### Similar Questions - 1. [Remove Duplicates from Sorted Array](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-array) (Easy) - 1. [Remove Linked List Elements](https://github.com/openset/leetcode/tree/master/problems/remove-linked-list-elements) (Easy) - 1. [Move Zeroes](https://github.com/openset/leetcode/tree/master/problems/move-zeroes) (Easy) + 1. [Remove Duplicates from Sorted Array](../remove-duplicates-from-sorted-array) (Easy) + 1. [Remove Linked List Elements](../remove-linked-list-elements) (Easy) + 1. [Move Zeroes](../move-zeroes) (Easy) ### Hints
diff --git a/problems/remove-interval/README.md b/problems/remove-interval/README.md index 693b9c100..437aef451 100644 --- a/problems/remove-interval/README.md +++ b/problems/remove-interval/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/hexspeak "Hexspeak") +[< Previous](../hexspeak "Hexspeak") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/delete-tree-nodes "Delete Tree Nodes") +[Next >](../delete-tree-nodes "Delete Tree Nodes") ## [1272. Remove Interval (Medium)](https://leetcode.com/problems/remove-interval "删除区间") @@ -34,8 +34,8 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Line Sweep](https://github.com/openset/leetcode/tree/master/tag/line-sweep/README.md)] + [[Math](../../tag/math/README.md)] + [[Line Sweep](../../tag/line-sweep/README.md)] ### Hints
diff --git a/problems/remove-invalid-parentheses/README.md b/problems/remove-invalid-parentheses/README.md index 5230d2179..afa3e89a4 100644 --- a/problems/remove-invalid-parentheses/README.md +++ b/problems/remove-invalid-parentheses/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/longest-increasing-subsequence "Longest Increasing Subsequence") +[< Previous](../longest-increasing-subsequence "Longest Increasing Subsequence") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/smallest-rectangle-enclosing-black-pixels "Smallest Rectangle Enclosing Black Pixels") +[Next >](../smallest-rectangle-enclosing-black-pixels "Smallest Rectangle Enclosing Black Pixels") ## [301. Remove Invalid Parentheses (Hard)](https://leetcode.com/problems/remove-invalid-parentheses "删除无效的括号") @@ -37,11 +37,11 @@ ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] ### Similar Questions - 1. [Valid Parentheses](https://github.com/openset/leetcode/tree/master/problems/valid-parentheses) (Easy) + 1. [Valid Parentheses](../valid-parentheses) (Easy) ### Hints
diff --git a/problems/remove-k-digits/README.md b/problems/remove-k-digits/README.md index c52c1a493..1444883ab 100644 --- a/problems/remove-k-digits/README.md +++ b/problems/remove-k-digits/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/binary-watch "Binary Watch") +[< Previous](../binary-watch "Binary Watch") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/frog-jump "Frog Jump") +[Next >](../frog-jump "Frog Jump") ## [402. Remove K Digits (Medium)](https://leetcode.com/problems/remove-k-digits "移掉K位数字") @@ -47,9 +47,9 @@ Explanation: Remove all the digits from the number and it is left with nothing w

### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] + [[Stack](../../tag/stack/README.md)] + [[Greedy](../../tag/greedy/README.md)] ### Similar Questions - 1. [Create Maximum Number](https://github.com/openset/leetcode/tree/master/problems/create-maximum-number) (Hard) - 1. [Monotone Increasing Digits](https://github.com/openset/leetcode/tree/master/problems/monotone-increasing-digits) (Medium) + 1. [Create Maximum Number](../create-maximum-number) (Hard) + 1. [Monotone Increasing Digits](../monotone-increasing-digits) (Medium) diff --git a/problems/remove-linked-list-elements/README.md b/problems/remove-linked-list-elements/README.md index 685fd493c..085bfd5c4 100644 --- a/problems/remove-linked-list-elements/README.md +++ b/problems/remove-linked-list-elements/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/happy-number "Happy Number") +[< Previous](../happy-number "Happy Number") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/count-primes "Count Primes") +[Next >](../count-primes "Count Primes") ## [203. Remove Linked List Elements (Easy)](https://leetcode.com/problems/remove-linked-list-elements "移除链表元素") @@ -21,8 +21,8 @@ ### Related Topics - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] + [[Linked List](../../tag/linked-list/README.md)] ### Similar Questions - 1. [Remove Element](https://github.com/openset/leetcode/tree/master/problems/remove-element) (Easy) - 1. [Delete Node in a Linked List](https://github.com/openset/leetcode/tree/master/problems/delete-node-in-a-linked-list) (Easy) + 1. [Remove Element](../remove-element) (Easy) + 1. [Delete Node in a Linked List](../delete-node-in-a-linked-list) (Easy) diff --git a/problems/remove-nth-node-from-end-of-list/README.md b/problems/remove-nth-node-from-end-of-list/README.md index 51ff61a63..9ee4efe81 100644 --- a/problems/remove-nth-node-from-end-of-list/README.md +++ b/problems/remove-nth-node-from-end-of-list/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/4sum "4Sum") +[< Previous](../4sum "4Sum") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/valid-parentheses "Valid Parentheses") +[Next >](../valid-parentheses "Valid Parentheses") ## [19. Remove Nth Node From End of List (Medium)](https://leetcode.com/problems/remove-nth-node-from-end-of-list "删除链表的倒数第N个节点") @@ -30,8 +30,8 @@ After removing the second node from the end, the linked list becomes 1-&

Could you do this in one pass?

### Related Topics - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Linked List](../../tag/linked-list/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] ### Hints
diff --git a/problems/remove-outermost-parentheses/README.md b/problems/remove-outermost-parentheses/README.md index 88c154ddb..c087df718 100644 --- a/problems/remove-outermost-parentheses/README.md +++ b/problems/remove-outermost-parentheses/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/number-of-enclaves "Number of Enclaves") +[< Previous](../number-of-enclaves "Number of Enclaves") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/sum-of-root-to-leaf-binary-numbers "Sum of Root To Leaf Binary Numbers") +[Next >](../sum-of-root-to-leaf-binary-numbers "Sum of Root To Leaf Binary Numbers") ## [1021. Remove Outermost Parentheses (Easy)](https://leetcode.com/problems/remove-outermost-parentheses "删除最外层的括号") @@ -72,7 +72,7 @@ After removing outer parentheses of each part, this is "" + "&quo ### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] + [[Stack](../../tag/stack/README.md)] ### Hints
diff --git a/problems/remove-sub-folders-from-the-filesystem/README.md b/problems/remove-sub-folders-from-the-filesystem/README.md index 77c766089..0a43455d8 100644 --- a/problems/remove-sub-folders-from-the-filesystem/README.md +++ b/problems/remove-sub-folders-from-the-filesystem/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/check-if-it-is-a-straight-line "Check If It Is a Straight Line") +[< Previous](../check-if-it-is-a-straight-line "Check If It Is a Straight Line") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/replace-the-substring-for-balanced-string "Replace the Substring for Balanced String") +[Next >](../replace-the-substring-for-balanced-string "Replace the Substring for Balanced String") ## [1233. Remove Sub-Folders from the Filesystem (Medium)](https://leetcode.com/problems/remove-sub-folders-from-the-filesystem "删除子文件夹") @@ -53,8 +53,8 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Array](../../tag/array/README.md)] + [[String](../../tag/string/README.md)] ### Hints
diff --git a/problems/remove-vowels-from-a-string/README.md b/problems/remove-vowels-from-a-string/README.md index a17b38422..ac8433ad8 100644 --- a/problems/remove-vowels-from-a-string/README.md +++ b/problems/remove-vowels-from-a-string/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/number-of-days-in-a-month "Number of Days in a Month") +[< Previous](../number-of-days-in-a-month "Number of Days in a Month") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-average-subtree "Maximum Average Subtree") +[Next >](../maximum-average-subtree "Maximum Average Subtree") ## [1119. Remove Vowels from a String (Easy)](https://leetcode.com/problems/remove-vowels-from-a-string "删去字符串中的元音") @@ -39,10 +39,10 @@ ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Reverse Vowels of a String](https://github.com/openset/leetcode/tree/master/problems/reverse-vowels-of-a-string) (Easy) + 1. [Reverse Vowels of a String](../reverse-vowels-of-a-string) (Easy) ### Hints
diff --git a/problems/remove-zero-sum-consecutive-nodes-from-linked-list/README.md b/problems/remove-zero-sum-consecutive-nodes-from-linked-list/README.md index b773d3eaf..dbab2e02f 100644 --- a/problems/remove-zero-sum-consecutive-nodes-from-linked-list/README.md +++ b/problems/remove-zero-sum-consecutive-nodes-from-linked-list/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/compare-strings-by-frequency-of-the-smallest-character "Compare Strings by Frequency of the Smallest Character") +[< Previous](../compare-strings-by-frequency-of-the-smallest-character "Compare Strings by Frequency of the Smallest Character") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/dinner-plate-stacks "Dinner Plate Stacks") +[Next >](../dinner-plate-stacks "Dinner Plate Stacks") ## [1171. Remove Zero Sum Consecutive Nodes from Linked List (Medium)](https://leetcode.com/problems/remove-zero-sum-consecutive-nodes-from-linked-list "从链表中删去总和值为零的连续节点") @@ -49,7 +49,7 @@ ### Related Topics - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] + [[Linked List](../../tag/linked-list/README.md)] ### Hints
diff --git a/problems/reorder-data-in-log-files/README.md b/problems/reorder-data-in-log-files/README.md index ca0522b02..6bfee801b 100644 --- a/problems/reorder-data-in-log-files/README.md +++ b/problems/reorder-data-in-log-files/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/stamping-the-sequence "Stamping The Sequence") +[< Previous](../stamping-the-sequence "Stamping The Sequence") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/range-sum-of-bst "Range Sum of BST") +[Next >](../range-sum-of-bst "Range Sum of BST") ## [937. Reorder Data in Log Files (Easy)](https://leetcode.com/problems/reorder-data-in-log-files "重新排列日志文件") @@ -41,4 +41,4 @@ ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/reorder-list/README.md b/problems/reorder-list/README.md index 300cd6bf9..a556af73d 100644 --- a/problems/reorder-list/README.md +++ b/problems/reorder-list/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/linked-list-cycle-ii "Linked List Cycle II") +[< Previous](../linked-list-cycle-ii "Linked List Cycle II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/binary-tree-preorder-traversal "Binary Tree Preorder Traversal") +[Next >](../binary-tree-preorder-traversal "Binary Tree Preorder Traversal") ## [143. Reorder List (Medium)](https://leetcode.com/problems/reorder-list "重排链表") @@ -28,4 +28,4 @@ Given 1->2->3->4->5, reorder it to 1->5->2->4->3. ### Related Topics - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] + [[Linked List](../../tag/linked-list/README.md)] diff --git a/problems/reordered-power-of-2/README.md b/problems/reordered-power-of-2/README.md index 09805a4c7..b3ff34da4 100644 --- a/problems/reordered-power-of-2/README.md +++ b/problems/reordered-power-of-2/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/binary-gap "Binary Gap") +[< Previous](../binary-gap "Binary Gap") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/advantage-shuffle "Advantage Shuffle") +[Next >](../advantage-shuffle "Advantage Shuffle") ## [869. Reordered Power of 2 (Medium)](https://leetcode.com/problems/reordered-power-of-2 "重新排序得到 2 的幂") @@ -74,4 +74,4 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/reorganize-string/README.md b/problems/reorganize-string/README.md index dfd251134..b5d3857ad 100644 --- a/problems/reorganize-string/README.md +++ b/problems/reorganize-string/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/toeplitz-matrix "Toeplitz Matrix") +[< Previous](../toeplitz-matrix "Toeplitz Matrix") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/max-chunks-to-make-sorted-ii "Max Chunks To Make Sorted II") +[Next >](../max-chunks-to-make-sorted-ii "Max Chunks To Make Sorted II") ## [767. Reorganize String (Medium)](https://leetcode.com/problems/reorganize-string "重构字符串") @@ -38,14 +38,14 @@

 

### Related Topics - [[Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Heap](../../tag/heap/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[Sort](../../tag/sort/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Rearrange String k Distance Apart](https://github.com/openset/leetcode/tree/master/problems/rearrange-string-k-distance-apart) (Hard) - 1. [Task Scheduler](https://github.com/openset/leetcode/tree/master/problems/task-scheduler) (Medium) + 1. [Rearrange String k Distance Apart](../rearrange-string-k-distance-apart) (Hard) + 1. [Task Scheduler](../task-scheduler) (Medium) ### Hints
diff --git a/problems/repeated-dna-sequences/README.md b/problems/repeated-dna-sequences/README.md index ede09e699..596247e54 100644 --- a/problems/repeated-dna-sequences/README.md +++ b/problems/repeated-dna-sequences/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/reverse-words-in-a-string-ii "Reverse Words in a String II") +[< Previous](../reverse-words-in-a-string-ii "Reverse Words in a String II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-iv "Best Time to Buy and Sell Stock IV") +[Next >](../best-time-to-buy-and-sell-stock-iv "Best Time to Buy and Sell Stock IV") ## [187. Repeated DNA Sequences (Medium)](https://leetcode.com/problems/repeated-dna-sequences "重复的DNA序列") @@ -24,5 +24,5 @@ ### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] diff --git a/problems/repeated-string-match/README.md b/problems/repeated-string-match/README.md index 5713cd4a0..3415e0f8b 100644 --- a/problems/repeated-string-match/README.md +++ b/problems/repeated-string-match/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/redundant-connection-ii "Redundant Connection II") +[< Previous](../redundant-connection-ii "Redundant Connection II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/longest-univalue-path "Longest Univalue Path") +[Next >](../longest-univalue-path "Longest Univalue Path") ## [686. Repeated String Match (Easy)](https://leetcode.com/problems/repeated-string-match "重复叠加字符串匹配") @@ -21,7 +21,7 @@ The length of A and B will be between 1 and 10000.

### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Repeated Substring Pattern](https://github.com/openset/leetcode/tree/master/problems/repeated-substring-pattern) (Easy) + 1. [Repeated Substring Pattern](../repeated-substring-pattern) (Easy) diff --git a/problems/repeated-substring-pattern/README.md b/problems/repeated-substring-pattern/README.md index 78acee6c6..2b436c0d0 100644 --- a/problems/repeated-substring-pattern/README.md +++ b/problems/repeated-substring-pattern/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/poor-pigs "Poor Pigs") +[< Previous](../poor-pigs "Poor Pigs") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/lfu-cache "LFU Cache") +[Next >](../lfu-cache "LFU Cache") ## [459. Repeated Substring Pattern (Easy)](https://leetcode.com/problems/repeated-substring-pattern "重复的子字符串") @@ -39,8 +39,8 @@ ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Implement strStr()](https://github.com/openset/leetcode/tree/master/problems/implement-strstr) (Easy) - 1. [Repeated String Match](https://github.com/openset/leetcode/tree/master/problems/repeated-string-match) (Easy) + 1. [Implement strStr()](../implement-strstr) (Easy) + 1. [Repeated String Match](../repeated-string-match) (Easy) diff --git a/problems/replace-the-substring-for-balanced-string/README.md b/problems/replace-the-substring-for-balanced-string/README.md index 49e1838fd..21ef59f4b 100644 --- a/problems/replace-the-substring-for-balanced-string/README.md +++ b/problems/replace-the-substring-for-balanced-string/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/remove-sub-folders-from-the-filesystem "Remove Sub-Folders from the Filesystem") +[< Previous](../remove-sub-folders-from-the-filesystem "Remove Sub-Folders from the Filesystem") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-profit-in-job-scheduling "Maximum Profit in Job Scheduling") +[Next >](../maximum-profit-in-job-scheduling "Maximum Profit in Job Scheduling") ## [1234. Replace the Substring for Balanced String (Medium)](https://leetcode.com/problems/replace-the-substring-for-balanced-string "替换子串得到平衡字符串") @@ -61,8 +61,8 @@ ### Related Topics - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] + [[String](../../tag/string/README.md)] ### Hints
diff --git a/problems/replace-words/README.md b/problems/replace-words/README.md index 437a54593..7a3419aff 100644 --- a/problems/replace-words/README.md +++ b/problems/replace-words/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/palindromic-substrings "Palindromic Substrings") +[< Previous](../palindromic-substrings "Palindromic Substrings") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/dota2-senate "Dota2 Senate") +[Next >](../dota2-senate "Dota2 Senate") ## [648. Replace Words (Medium)](https://leetcode.com/problems/replace-words "单词替换") @@ -40,8 +40,8 @@ sentence = "the cattle was rattled by the battery"

 

### Related Topics - [[Trie](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Trie](../../tag/trie/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Implement Trie (Prefix Tree)](https://github.com/openset/leetcode/tree/master/problems/implement-trie-prefix-tree) (Medium) + 1. [Implement Trie (Prefix Tree)](../implement-trie-prefix-tree) (Medium) diff --git a/problems/report-contiguous-dates/README.md b/problems/report-contiguous-dates/README.md index 2b96ebd67..11fe64ece 100644 --- a/problems/report-contiguous-dates/README.md +++ b/problems/report-contiguous-dates/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-equal-frequency "Maximum Equal Frequency") +[< Previous](../maximum-equal-frequency "Maximum Equal Frequency") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/the-dining-philosophers "The Dining Philosophers") +[Next >](../the-dining-philosophers "The Dining Philosophers") ## [1225. Report Contiguous Dates (Hard)](https://leetcode.com/problems/report-contiguous-dates "报告系统状态的连续日期") diff --git a/problems/reported-posts-ii/README.md b/problems/reported-posts-ii/README.md index 50c7bdbed..6c1b56bac 100644 --- a/problems/reported-posts-ii/README.md +++ b/problems/reported-posts-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-of-absolute-value-expression "Maximum of Absolute Value Expression") +[< Previous](../maximum-of-absolute-value-expression "Maximum of Absolute Value Expression") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/largest-unique-number "Largest Unique Number") +[Next >](../largest-unique-number "Largest Unique Number") ## [1132. Reported Posts II (Medium)](https://leetcode.com/problems/reported-posts-ii "") diff --git a/problems/reported-posts/README.md b/problems/reported-posts/README.md index ef60dbc00..28d60a6a0 100644 --- a/problems/reported-posts/README.md +++ b/problems/reported-posts/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/highest-grade-for-each-student "Highest Grade For Each Student") +[< Previous](../highest-grade-for-each-student "Highest Grade For Each Student") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/print-in-order "Print in Order") +[Next >](../print-in-order "Print in Order") ## [1113. Reported Posts (Easy)](https://leetcode.com/problems/reported-posts "") diff --git a/problems/reshape-the-matrix/README.md b/problems/reshape-the-matrix/README.md index 66969fde1..53b4b856d 100644 --- a/problems/reshape-the-matrix/README.md +++ b/problems/reshape-the-matrix/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/array-nesting "Array Nesting") +[< Previous](../array-nesting "Array Nesting") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/permutation-in-string "Permutation in String") +[Next >](../permutation-in-string "Permutation in String") ## [566. Reshape the Matrix (Easy)](https://leetcode.com/problems/reshape-the-matrix "重塑矩阵") @@ -59,7 +59,7 @@ r = 2, c = 4

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Hints
diff --git a/problems/restore-ip-addresses/README.md b/problems/restore-ip-addresses/README.md index d19d86b24..4c4d9ac8a 100644 --- a/problems/restore-ip-addresses/README.md +++ b/problems/restore-ip-addresses/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/reverse-linked-list-ii "Reverse Linked List II") +[< Previous](../reverse-linked-list-ii "Reverse Linked List II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/binary-tree-inorder-traversal "Binary Tree Inorder Traversal") +[Next >](../binary-tree-inorder-traversal "Binary Tree Inorder Traversal") ## [93. Restore IP Addresses (Medium)](https://leetcode.com/problems/restore-ip-addresses "复原IP地址") @@ -21,8 +21,8 @@ ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[String](../../tag/string/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [IP to CIDR](https://github.com/openset/leetcode/tree/master/problems/ip-to-cidr) (Easy) + 1. [IP to CIDR](../ip-to-cidr) (Easy) diff --git a/problems/reveal-cards-in-increasing-order/README.md b/problems/reveal-cards-in-increasing-order/README.md index 7d4c21d36..91b50b6a2 100644 --- a/problems/reveal-cards-in-increasing-order/README.md +++ b/problems/reveal-cards-in-increasing-order/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/largest-time-for-given-digits "Largest Time for Given Digits") +[< Previous](../largest-time-for-given-digits "Largest Time for Given Digits") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/flip-equivalent-binary-trees "Flip Equivalent Binary Trees") +[Next >](../flip-equivalent-binary-trees "Flip Equivalent Binary Trees") ## [950. Reveal Cards In Increasing Order (Medium)](https://leetcode.com/problems/reveal-cards-in-increasing-order "按递增顺序显示卡牌") @@ -62,4 +62,4 @@ Since all the cards revealed are in increasing order, the answer is correct. ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] diff --git a/problems/reverse-bits/README.md b/problems/reverse-bits/README.md index 3bc7fcb93..4dcbc9d08 100644 --- a/problems/reverse-bits/README.md +++ b/problems/reverse-bits/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/rotate-array "Rotate Array") +[< Previous](../rotate-array "Rotate Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-1-bits "Number of 1 Bits") +[Next >](../number-of-1-bits "Number of 1 Bits") ## [190. Reverse Bits (Easy)](https://leetcode.com/problems/reverse-bits "颠倒二进制位") @@ -46,8 +46,8 @@

If this function is called many times, how would you optimize it?

### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] ### Similar Questions - 1. [Reverse Integer](https://github.com/openset/leetcode/tree/master/problems/reverse-integer) (Easy) - 1. [Number of 1 Bits](https://github.com/openset/leetcode/tree/master/problems/number-of-1-bits) (Easy) + 1. [Reverse Integer](../reverse-integer) (Easy) + 1. [Number of 1 Bits](../number-of-1-bits) (Easy) diff --git a/problems/reverse-integer/README.md b/problems/reverse-integer/README.md index 354062cd9..610746349 100644 --- a/problems/reverse-integer/README.md +++ b/problems/reverse-integer/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/zigzag-conversion "ZigZag Conversion") +[< Previous](../zigzag-conversion "ZigZag Conversion") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/string-to-integer-atoi "String to Integer (atoi)") +[Next >](../string-to-integer-atoi "String to Integer (atoi)") ## [7. Reverse Integer (Easy)](https://leetcode.com/problems/reverse-integer "整数反转") @@ -38,8 +38,8 @@ Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [−231,  231 − 1]. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.

### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [String to Integer (atoi)](https://github.com/openset/leetcode/tree/master/problems/string-to-integer-atoi) (Medium) - 1. [Reverse Bits](https://github.com/openset/leetcode/tree/master/problems/reverse-bits) (Easy) + 1. [String to Integer (atoi)](../string-to-integer-atoi) (Medium) + 1. [Reverse Bits](../reverse-bits) (Easy) diff --git a/problems/reverse-linked-list-ii/README.md b/problems/reverse-linked-list-ii/README.md index 1fb6872ce..9e99a57a2 100644 --- a/problems/reverse-linked-list-ii/README.md +++ b/problems/reverse-linked-list-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/decode-ways "Decode Ways") +[< Previous](../decode-ways "Decode Ways") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/restore-ip-addresses "Restore IP Addresses") +[Next >](../restore-ip-addresses "Restore IP Addresses") ## [92. Reverse Linked List II (Medium)](https://leetcode.com/problems/reverse-linked-list-ii "反转链表 II") @@ -23,7 +23,7 @@ ### Related Topics - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] + [[Linked List](../../tag/linked-list/README.md)] ### Similar Questions - 1. [Reverse Linked List](https://github.com/openset/leetcode/tree/master/problems/reverse-linked-list) (Easy) + 1. [Reverse Linked List](../reverse-linked-list) (Easy) diff --git a/problems/reverse-linked-list/README.md b/problems/reverse-linked-list/README.md index 0ae9d3e1e..932df0fe5 100644 --- a/problems/reverse-linked-list/README.md +++ b/problems/reverse-linked-list/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/isomorphic-strings "Isomorphic Strings") +[< Previous](../isomorphic-strings "Isomorphic Strings") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/course-schedule "Course Schedule") +[Next >](../course-schedule "Course Schedule") ## [206. Reverse Linked List (Easy)](https://leetcode.com/problems/reverse-linked-list "反转链表") @@ -25,9 +25,9 @@

A linked list can be reversed either iteratively or recursively. Could you implement both?

### Related Topics - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] + [[Linked List](../../tag/linked-list/README.md)] ### Similar Questions - 1. [Reverse Linked List II](https://github.com/openset/leetcode/tree/master/problems/reverse-linked-list-ii) (Medium) - 1. [Binary Tree Upside Down](https://github.com/openset/leetcode/tree/master/problems/binary-tree-upside-down) (Medium) - 1. [Palindrome Linked List](https://github.com/openset/leetcode/tree/master/problems/palindrome-linked-list) (Easy) + 1. [Reverse Linked List II](../reverse-linked-list-ii) (Medium) + 1. [Binary Tree Upside Down](../binary-tree-upside-down) (Medium) + 1. [Palindrome Linked List](../palindrome-linked-list) (Easy) diff --git a/problems/reverse-nodes-in-k-group/README.md b/problems/reverse-nodes-in-k-group/README.md index 604789930..3bdf974b6 100644 --- a/problems/reverse-nodes-in-k-group/README.md +++ b/problems/reverse-nodes-in-k-group/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/swap-nodes-in-pairs "Swap Nodes in Pairs") +[< Previous](../swap-nodes-in-pairs "Swap Nodes in Pairs") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-array "Remove Duplicates from Sorted Array") +[Next >](../remove-duplicates-from-sorted-array "Remove Duplicates from Sorted Array") ## [25. Reverse Nodes in k-Group (Hard)](https://leetcode.com/problems/reverse-nodes-in-k-group "K 个一组翻转链表") @@ -34,7 +34,7 @@ ### Related Topics - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] + [[Linked List](../../tag/linked-list/README.md)] ### Similar Questions - 1. [Swap Nodes in Pairs](https://github.com/openset/leetcode/tree/master/problems/swap-nodes-in-pairs) (Medium) + 1. [Swap Nodes in Pairs](../swap-nodes-in-pairs) (Medium) diff --git a/problems/reverse-only-letters/README.md b/problems/reverse-only-letters/README.md index 4fd63bcdb..466e3b271 100644 --- a/problems/reverse-only-letters/README.md +++ b/problems/reverse-only-letters/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/word-subsets "Word Subsets") +[< Previous](../word-subsets "Word Subsets") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-sum-circular-subarray "Maximum Sum Circular Subarray") +[Next >](../maximum-sum-circular-subarray "Maximum Sum Circular Subarray") ## [917. Reverse Only Letters (Easy)](https://leetcode.com/problems/reverse-only-letters "仅仅反转字母") @@ -64,7 +64,7 @@ ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Hints
diff --git a/problems/reverse-pairs/README.md b/problems/reverse-pairs/README.md index b5695a66d..11f7dd8a4 100644 --- a/problems/reverse-pairs/README.md +++ b/problems/reverse-pairs/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/construct-the-rectangle "Construct the Rectangle") +[< Previous](../construct-the-rectangle "Construct the Rectangle") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/target-sum "Target Sum") +[Next >](../target-sum "Target Sum") ## [493. Reverse Pairs (Hard)](https://leetcode.com/problems/reverse-pairs "翻转对") @@ -35,12 +35,12 @@

### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] - [[Binary Indexed Tree](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] - [[Segment Tree](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] - [[Divide and Conquer](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] + [[Sort](../../tag/sort/README.md)] + [[Binary Indexed Tree](../../tag/binary-indexed-tree/README.md)] + [[Segment Tree](../../tag/segment-tree/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] + [[Divide and Conquer](../../tag/divide-and-conquer/README.md)] ### Similar Questions - 1. [Count of Smaller Numbers After Self](https://github.com/openset/leetcode/tree/master/problems/count-of-smaller-numbers-after-self) (Hard) - 1. [Count of Range Sum](https://github.com/openset/leetcode/tree/master/problems/count-of-range-sum) (Hard) + 1. [Count of Smaller Numbers After Self](../count-of-smaller-numbers-after-self) (Hard) + 1. [Count of Range Sum](../count-of-range-sum) (Hard) diff --git a/problems/reverse-string-ii/README.md b/problems/reverse-string-ii/README.md index fbbd396b6..b968e041c 100644 --- a/problems/reverse-string-ii/README.md +++ b/problems/reverse-string-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/single-element-in-a-sorted-array "Single Element in a Sorted Array") +[< Previous](../single-element-in-a-sorted-array "Single Element in a Sorted Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/01-matrix "01 Matrix") +[Next >](../01-matrix "01 Matrix") ## [541. Reverse String II (Easy)](https://leetcode.com/problems/reverse-string-ii "反转字符串 II") @@ -29,8 +29,8 @@ Given a string and an integer k, you need to reverse the first k characters for ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Reverse String](https://github.com/openset/leetcode/tree/master/problems/reverse-string) (Easy) - 1. [Reverse Words in a String III](https://github.com/openset/leetcode/tree/master/problems/reverse-words-in-a-string-iii) (Easy) + 1. [Reverse String](../reverse-string) (Easy) + 1. [Reverse Words in a String III](../reverse-words-in-a-string-iii) (Easy) diff --git a/problems/reverse-string/README.md b/problems/reverse-string/README.md index db6b908fb..94874454e 100644 --- a/problems/reverse-string/README.md +++ b/problems/reverse-string/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/integer-break "Integer Break") +[< Previous](../integer-break "Integer Break") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/reverse-vowels-of-a-string "Reverse Vowels of a String") +[Next >](../reverse-vowels-of-a-string "Reverse Vowels of a String") ## [344. Reverse String (Easy)](https://leetcode.com/problems/reverse-string "反转字符串") @@ -38,12 +38,12 @@ ### Related Topics - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Reverse Vowels of a String](https://github.com/openset/leetcode/tree/master/problems/reverse-vowels-of-a-string) (Easy) - 1. [Reverse String II](https://github.com/openset/leetcode/tree/master/problems/reverse-string-ii) (Easy) + 1. [Reverse Vowels of a String](../reverse-vowels-of-a-string) (Easy) + 1. [Reverse String II](../reverse-string-ii) (Easy) ### Hints
diff --git a/problems/reverse-substrings-between-each-pair-of-parentheses/README.md b/problems/reverse-substrings-between-each-pair-of-parentheses/README.md index 431d61983..d02500b91 100644 --- a/problems/reverse-substrings-between-each-pair-of-parentheses/README.md +++ b/problems/reverse-substrings-between-each-pair-of-parentheses/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-number-of-balloons "Maximum Number of Balloons") +[< Previous](../maximum-number-of-balloons "Maximum Number of Balloons") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/k-concatenation-maximum-sum "K-Concatenation Maximum Sum") +[Next >](../k-concatenation-maximum-sum "K-Concatenation Maximum Sum") ## [1190. Reverse Substrings Between Each Pair of Parentheses (Medium)](https://leetcode.com/problems/reverse-substrings-between-each-pair-of-parentheses "反转每对括号间的子串") @@ -58,7 +58,7 @@ ### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] + [[Stack](../../tag/stack/README.md)] ### Hints
diff --git a/problems/reverse-vowels-of-a-string/README.md b/problems/reverse-vowels-of-a-string/README.md index 3b1c05b08..0c017d48e 100644 --- a/problems/reverse-vowels-of-a-string/README.md +++ b/problems/reverse-vowels-of-a-string/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/reverse-string "Reverse String") +[< Previous](../reverse-string "Reverse String") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/moving-average-from-data-stream "Moving Average from Data Stream") +[Next >](../moving-average-from-data-stream "Moving Average from Data Stream") ## [345. Reverse Vowels of a String (Easy)](https://leetcode.com/problems/reverse-vowels-of-a-string "反转字符串中的元音字母") @@ -34,9 +34,9 @@ The vowels does not include the letter "y".

 

### Related Topics - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Reverse String](https://github.com/openset/leetcode/tree/master/problems/reverse-string) (Easy) - 1. [Remove Vowels from a String](https://github.com/openset/leetcode/tree/master/problems/remove-vowels-from-a-string) (Easy) + 1. [Reverse String](../reverse-string) (Easy) + 1. [Remove Vowels from a String](../remove-vowels-from-a-string) (Easy) diff --git a/problems/reverse-words-in-a-string-ii/README.md b/problems/reverse-words-in-a-string-ii/README.md index f8fdc0bb8..9ddda9082 100644 --- a/problems/reverse-words-in-a-string-ii/README.md +++ b/problems/reverse-words-in-a-string-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/department-top-three-salaries "Department Top Three Salaries") +[< Previous](../department-top-three-salaries "Department Top Three Salaries") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/repeated-dna-sequences "Repeated DNA Sequences") +[Next >](../repeated-dna-sequences "Repeated DNA Sequences") ## [186. Reverse Words in a String II (Medium)](https://leetcode.com/problems/reverse-words-in-a-string-ii "翻转字符串里的单词 II") @@ -30,8 +30,8 @@

Follow up: Could you do it in-place without allocating extra space?

### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Reverse Words in a String](https://github.com/openset/leetcode/tree/master/problems/reverse-words-in-a-string) (Medium) - 1. [Rotate Array](https://github.com/openset/leetcode/tree/master/problems/rotate-array) (Easy) + 1. [Reverse Words in a String](../reverse-words-in-a-string) (Medium) + 1. [Rotate Array](../rotate-array) (Easy) diff --git a/problems/reverse-words-in-a-string-iii/README.md b/problems/reverse-words-in-a-string-iii/README.md index 1186419ab..2060c20a6 100644 --- a/problems/reverse-words-in-a-string-iii/README.md +++ b/problems/reverse-words-in-a-string-iii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-iii "Next Greater Element III") +[< Previous](../next-greater-element-iii "Next Greater Element III") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/quad-tree-intersection "Quad Tree Intersection") +[Next >](../quad-tree-intersection "Quad Tree Intersection") ## [557. Reverse Words in a String III (Easy)](https://leetcode.com/problems/reverse-words-in-a-string-iii "反转字符串中的单词 III") @@ -25,7 +25,7 @@ In the string, each word is separated by single space and there will not be any

### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Reverse String II](https://github.com/openset/leetcode/tree/master/problems/reverse-string-ii) (Easy) + 1. [Reverse String II](../reverse-string-ii) (Easy) diff --git a/problems/reverse-words-in-a-string/README.md b/problems/reverse-words-in-a-string/README.md index 167067f44..a146c81f6 100644 --- a/problems/reverse-words-in-a-string/README.md +++ b/problems/reverse-words-in-a-string/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/evaluate-reverse-polish-notation "Evaluate Reverse Polish Notation") +[< Previous](../evaluate-reverse-polish-notation "Evaluate Reverse Polish Notation") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-product-subarray "Maximum Product Subarray") +[Next >](../maximum-product-subarray "Maximum Product Subarray") ## [151. Reverse Words in a String (Medium)](https://leetcode.com/problems/reverse-words-in-a-string "翻转字符串里的单词") @@ -55,7 +55,7 @@

For C programmers, try to solve it in-place in O(1) extra space.

### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Reverse Words in a String II](https://github.com/openset/leetcode/tree/master/problems/reverse-words-in-a-string-ii) (Medium) + 1. [Reverse Words in a String II](../reverse-words-in-a-string-ii) (Medium) diff --git a/problems/rising-temperature/README.md b/problems/rising-temperature/README.md index cc63c72db..64abfb622 100644 --- a/problems/rising-temperature/README.md +++ b/problems/rising-temperature/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/delete-duplicate-emails "Delete Duplicate Emails") +[< Previous](../delete-duplicate-emails "Delete Duplicate Emails") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/house-robber "House Robber") +[Next >](../house-robber "House Robber") ## [197. Rising Temperature (Easy)](https://leetcode.com/problems/rising-temperature "上升的温度") diff --git a/problems/rle-iterator/README.md b/problems/rle-iterator/README.md index 45275902a..a79cd7989 100644 --- a/problems/rle-iterator/README.md +++ b/problems/rle-iterator/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/orderly-queue "Orderly Queue") +[< Previous](../orderly-queue "Orderly Queue") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/online-stock-span "Online Stock Span") +[Next >](../online-stock-span "Online Stock Span") ## [900. RLE Iterator (Medium)](https://leetcode.com/problems/rle-iterator "RLE 迭代器") @@ -53,4 +53,4 @@ but the second term did not exist. Since the last term exhausted does not exist ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] diff --git a/problems/robot-bounded-in-circle/README.md b/problems/robot-bounded-in-circle/README.md index 4a95b7a8e..ead8a72f6 100644 --- a/problems/robot-bounded-in-circle/README.md +++ b/problems/robot-bounded-in-circle/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/moving-stones-until-consecutive-ii "Moving Stones Until Consecutive II") +[< Previous](../moving-stones-until-consecutive-ii "Moving Stones Until Consecutive II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/flower-planting-with-no-adjacent "Flower Planting With No Adjacent") +[Next >](../flower-planting-with-no-adjacent "Flower Planting With No Adjacent") ## [1041. Robot Bounded In Circle (Medium)](https://leetcode.com/problems/robot-bounded-in-circle "困于环中的机器人") @@ -63,7 +63,7 @@ The robot moves from (0, 0) -> (0, 1) -> (-1, 1) -> (-1, 0) -> (0, 0 ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Hints
diff --git a/problems/robot-return-to-origin/README.md b/problems/robot-return-to-origin/README.md index 53af872b3..136450cd1 100644 --- a/problems/robot-return-to-origin/README.md +++ b/problems/robot-return-to-origin/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/coin-path "Coin Path") +[< Previous](../coin-path "Coin Path") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-k-closest-elements "Find K Closest Elements") +[Next >](../find-k-closest-elements "Find K Closest Elements") ## [657. Robot Return to Origin (Easy)](https://leetcode.com/problems/robot-return-to-origin "机器人能否返回原点") @@ -36,7 +36,7 @@ ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Friend Circles](https://github.com/openset/leetcode/tree/master/problems/friend-circles) (Medium) + 1. [Friend Circles](../friend-circles) (Medium) diff --git a/problems/robot-room-cleaner/README.md b/problems/robot-room-cleaner/README.md index e08f5efd5..4f9fd0399 100644 --- a/problems/robot-room-cleaner/README.md +++ b/problems/robot-room-cleaner/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/zuma-game "Zuma Game") +[< Previous](../zuma-game "Zuma Game") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/the-maze "The Maze") +[Next >](../the-maze "The Maze") ## [489. Robot Room Cleaner (Hard)](https://leetcode.com/problems/robot-room-cleaner "扫地机器人") @@ -68,7 +68,7 @@ From the top left corner, its position is one row below and three columns right. ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] ### Similar Questions - 1. [Walls and Gates](https://github.com/openset/leetcode/tree/master/problems/walls-and-gates) (Medium) + 1. [Walls and Gates](../walls-and-gates) (Medium) diff --git a/problems/roman-to-integer/README.md b/problems/roman-to-integer/README.md index b9219902f..41b7c6519 100644 --- a/problems/roman-to-integer/README.md +++ b/problems/roman-to-integer/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/integer-to-roman "Integer to Roman") +[< Previous](../integer-to-roman "Integer to Roman") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/longest-common-prefix "Longest Common Prefix") +[Next >](../longest-common-prefix "Longest Common Prefix") ## [13. Roman to Integer (Easy)](https://leetcode.com/problems/roman-to-integer "罗马数字转整数") @@ -69,11 +69,11 @@ M 1000 Explanation: M = 1000, CM = 900, XC = 90 and IV = 4. ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Math](../../tag/math/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Integer to Roman](https://github.com/openset/leetcode/tree/master/problems/integer-to-roman) (Medium) + 1. [Integer to Roman](../integer-to-roman) (Medium) ### Hints
diff --git a/problems/rotate-array/README.md b/problems/rotate-array/README.md index 72994b14e..0492b89a0 100644 --- a/problems/rotate-array/README.md +++ b/problems/rotate-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-iv "Best Time to Buy and Sell Stock IV") +[< Previous](../best-time-to-buy-and-sell-stock-iv "Best Time to Buy and Sell Stock IV") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/reverse-bits "Reverse Bits") +[Next >](../reverse-bits "Reverse Bits") ## [189. Rotate Array (Easy)](https://leetcode.com/problems/rotate-array "旋转数组") @@ -42,11 +42,11 @@ rotate 2 steps to the right: [3,99,-1,-100] ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Rotate List](https://github.com/openset/leetcode/tree/master/problems/rotate-list) (Medium) - 1. [Reverse Words in a String II](https://github.com/openset/leetcode/tree/master/problems/reverse-words-in-a-string-ii) (Medium) + 1. [Rotate List](../rotate-list) (Medium) + 1. [Reverse Words in a String II](../reverse-words-in-a-string-ii) (Medium) ### Hints
diff --git a/problems/rotate-function/README.md b/problems/rotate-function/README.md index 849f8be48..e17bd15ca 100644 --- a/problems/rotate-function/README.md +++ b/problems/rotate-function/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-least-k-repeating-characters "Longest Substring with At Least K Repeating Characters") +[< Previous](../longest-substring-with-at-least-k-repeating-characters "Longest Substring with At Least K Repeating Characters") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/integer-replacement "Integer Replacement") +[Next >](../integer-replacement "Integer Replacement") ## [396. Rotate Function (Medium)](https://leetcode.com/problems/rotate-function "旋转函数") @@ -43,4 +43,4 @@ So the maximum value of F(0), F(1), F(2), F(3) is F(3) = 26.

### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/rotate-image/README.md b/problems/rotate-image/README.md index ce9dd0479..49da7441d 100644 --- a/problems/rotate-image/README.md +++ b/problems/rotate-image/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/permutations-ii "Permutations II") +[< Previous](../permutations-ii "Permutations II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/group-anagrams "Group Anagrams") +[Next >](../group-anagrams "Group Anagrams") ## [48. Rotate Image (Medium)](https://leetcode.com/problems/rotate-image "旋转图像") @@ -58,4 +58,4 @@ rotate the input matrix in-place such that it becomes: ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] diff --git a/problems/rotate-list/README.md b/problems/rotate-list/README.md index 0bd2abc1c..183cea056 100644 --- a/problems/rotate-list/README.md +++ b/problems/rotate-list/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/permutation-sequence "Permutation Sequence") +[< Previous](../permutation-sequence "Permutation Sequence") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/unique-paths "Unique Paths") +[Next >](../unique-paths "Unique Paths") ## [61. Rotate List (Medium)](https://leetcode.com/problems/rotate-list "旋转链表") @@ -35,9 +35,9 @@ rotate 3 steps to the right: 0->1->2->NULL rotate 4 steps to the right: 2->0->1->NULL ### Related Topics - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Linked List](../../tag/linked-list/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] ### Similar Questions - 1. [Rotate Array](https://github.com/openset/leetcode/tree/master/problems/rotate-array) (Easy) - 1. [Split Linked List in Parts](https://github.com/openset/leetcode/tree/master/problems/split-linked-list-in-parts) (Medium) + 1. [Rotate Array](../rotate-array) (Easy) + 1. [Split Linked List in Parts](../split-linked-list-in-parts) (Medium) diff --git a/problems/rotate-string/README.md b/problems/rotate-string/README.md index 65bdefc83..439e626a3 100644 --- a/problems/rotate-string/README.md +++ b/problems/rotate-string/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/number-of-subarrays-with-bounded-maximum "Number of Subarrays with Bounded Maximum") +[< Previous](../number-of-subarrays-with-bounded-maximum "Number of Subarrays with Bounded Maximum") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/all-paths-from-source-to-target "All Paths From Source to Target") +[Next >](../all-paths-from-source-to-target "All Paths From Source to Target") ## [796. Rotate String (Easy)](https://leetcode.com/problems/rotate-string "旋转字符串") diff --git a/problems/rotated-digits/README.md b/problems/rotated-digits/README.md index a7767e7e4..9795ec22c 100644 --- a/problems/rotated-digits/README.md +++ b/problems/rotated-digits/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/cheapest-flights-within-k-stops "Cheapest Flights Within K Stops") +[< Previous](../cheapest-flights-within-k-stops "Cheapest Flights Within K Stops") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/escape-the-ghosts "Escape The Ghosts") +[Next >](../escape-the-ghosts "Escape The Ghosts") ## [788. Rotated Digits (Easy)](https://leetcode.com/problems/rotated-digits "旋转数字") @@ -33,4 +33,4 @@ Note that 1 and 10 are not good numbers, since they remain unchanged after rotat ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/rotting-oranges/README.md b/problems/rotting-oranges/README.md index 80037e6f9..29d01483d 100644 --- a/problems/rotting-oranges/README.md +++ b/problems/rotting-oranges/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/cousins-in-binary-tree "Cousins in Binary Tree") +[< Previous](../cousins-in-binary-tree "Cousins in Binary Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-number-of-k-consecutive-bit-flips "Minimum Number of K Consecutive Bit Flips") +[Next >](../minimum-number-of-k-consecutive-bit-flips "Minimum Number of K Consecutive Bit Flips") ## [994. Rotting Oranges (Easy)](https://leetcode.com/problems/rotting-oranges "腐烂的橘子") @@ -67,7 +67,7 @@ ### Related Topics - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] ### Similar Questions - 1. [Walls and Gates](https://github.com/openset/leetcode/tree/master/problems/walls-and-gates) (Medium) + 1. [Walls and Gates](../walls-and-gates) (Medium) diff --git a/problems/russian-doll-envelopes/README.md b/problems/russian-doll-envelopes/README.md index 3c94eabcd..69574adf1 100644 --- a/problems/russian-doll-envelopes/README.md +++ b/problems/russian-doll-envelopes/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/design-snake-game "Design Snake Game") +[< Previous](../design-snake-game "Design Snake Game") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/design-twitter "Design Twitter") +[Next >](../design-twitter "Design Twitter") ## [354. Russian Doll Envelopes (Hard)](https://leetcode.com/problems/russian-doll-envelopes "俄罗斯套娃信封问题") @@ -29,8 +29,8 @@ Rotation is not allowed.

### Related Topics - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Longest Increasing Subsequence](https://github.com/openset/leetcode/tree/master/problems/longest-increasing-subsequence) (Medium) + 1. [Longest Increasing Subsequence](../longest-increasing-subsequence) (Medium) diff --git a/problems/sales-analysis-i/README.md b/problems/sales-analysis-i/README.md index 44575ec12..0a1194fca 100644 --- a/problems/sales-analysis-i/README.md +++ b/problems/sales-analysis-i/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/smallest-subsequence-of-distinct-characters "Smallest Subsequence of Distinct Characters") +[< Previous](../smallest-subsequence-of-distinct-characters "Smallest Subsequence of Distinct Characters") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/sales-analysis-ii "Sales Analysis II") +[Next >](../sales-analysis-ii "Sales Analysis II") ## [1082. Sales Analysis I (Easy)](https://leetcode.com/problems/sales-analysis-i "销售分析 I ") diff --git a/problems/sales-analysis-ii/README.md b/problems/sales-analysis-ii/README.md index 2727dcd65..fc8aa1986 100644 --- a/problems/sales-analysis-ii/README.md +++ b/problems/sales-analysis-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/sales-analysis-i "Sales Analysis I") +[< Previous](../sales-analysis-i "Sales Analysis I") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/sales-analysis-iii "Sales Analysis III") +[Next >](../sales-analysis-iii "Sales Analysis III") ## [1083. Sales Analysis II (Easy)](https://leetcode.com/problems/sales-analysis-ii "销售分析 II") diff --git a/problems/sales-analysis-iii/README.md b/problems/sales-analysis-iii/README.md index 62e9bde75..dd4265cf4 100644 --- a/problems/sales-analysis-iii/README.md +++ b/problems/sales-analysis-iii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/sales-analysis-ii "Sales Analysis II") +[< Previous](../sales-analysis-ii "Sales Analysis II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/sum-of-digits-in-the-minimum-number "Sum of Digits in the Minimum Number") +[Next >](../sum-of-digits-in-the-minimum-number "Sum of Digits in the Minimum Number") ## [1084. Sales Analysis III (Easy)](https://leetcode.com/problems/sales-analysis-iii "销售分析III") diff --git a/problems/sales-person/README.md b/problems/sales-person/README.md index d0908a262..3cdb5eca4 100644 --- a/problems/sales-person/README.md +++ b/problems/sales-person/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/construct-string-from-binary-tree "Construct String from Binary Tree") +[< Previous](../construct-string-from-binary-tree "Construct String from Binary Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/tree-node "Tree Node") +[Next >](../tree-node "Tree Node") ## [607. Sales Person (Easy)](https://leetcode.com/problems/sales-person "销售员") diff --git a/problems/same-tree/README.md b/problems/same-tree/README.md index d9a6e5cd2..162173b56 100644 --- a/problems/same-tree/README.md +++ b/problems/same-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/recover-binary-search-tree "Recover Binary Search Tree") +[< Previous](../recover-binary-search-tree "Recover Binary Search Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/symmetric-tree "Symmetric Tree") +[Next >](../symmetric-tree "Symmetric Tree") ## [100. Same Tree (Easy)](https://leetcode.com/problems/same-tree "相同的树") @@ -52,5 +52,5 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] diff --git a/problems/satisfiability-of-equality-equations/README.md b/problems/satisfiability-of-equality-equations/README.md index 703b43d29..254462d3e 100644 --- a/problems/satisfiability-of-equality-equations/README.md +++ b/problems/satisfiability-of-equality-equations/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/add-to-array-form-of-integer "Add to Array-Form of Integer") +[< Previous](../add-to-array-form-of-integer "Add to Array-Form of Integer") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/broken-calculator "Broken Calculator") +[Next >](../broken-calculator "Broken Calculator") ## [990. Satisfiability of Equality Equations (Medium)](https://leetcode.com/problems/satisfiability-of-equality-equations "等式方程的可满足性") @@ -80,5 +80,5 @@ ### Related Topics - [[Union Find](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] + [[Union Find](../../tag/union-find/README.md)] + [[Graph](../../tag/graph/README.md)] diff --git a/problems/score-after-flipping-matrix/README.md b/problems/score-after-flipping-matrix/README.md index 78058d317..12aa610f2 100644 --- a/problems/score-after-flipping-matrix/README.md +++ b/problems/score-after-flipping-matrix/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/lemonade-change "Lemonade Change") +[< Previous](../lemonade-change "Lemonade Change") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/shortest-subarray-with-sum-at-least-k "Shortest Subarray with Sum at Least K") +[Next >](../shortest-subarray-with-sum-at-least-k "Shortest Subarray with Sum at Least K") ## [861. Score After Flipping Matrix (Medium)](https://leetcode.com/problems/score-after-flipping-matrix "翻转矩阵后的得分") @@ -46,4 +46,4 @@ ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] + [[Greedy](../../tag/greedy/README.md)] diff --git a/problems/score-of-parentheses/README.md b/problems/score-of-parentheses/README.md index dc86153a3..eea7cdcf7 100644 --- a/problems/score-of-parentheses/README.md +++ b/problems/score-of-parentheses/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/exam-room "Exam Room") +[< Previous](../exam-room "Exam Room") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-cost-to-hire-k-workers "Minimum Cost to Hire K Workers") +[Next >](../minimum-cost-to-hire-k-workers "Minimum Cost to Hire K Workers") ## [856. Score of Parentheses (Medium)](https://leetcode.com/problems/score-of-parentheses "括号的分数") @@ -67,5 +67,5 @@ ### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Stack](../../tag/stack/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/scramble-string/README.md b/problems/scramble-string/README.md index fdfdfe68a..f28f7e09b 100644 --- a/problems/scramble-string/README.md +++ b/problems/scramble-string/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/partition-list "Partition List") +[< Previous](../partition-list "Partition List") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/merge-sorted-array "Merge Sorted Array") +[Next >](../merge-sorted-array "Merge Sorted Array") ## [87. Scramble String (Hard)](https://leetcode.com/problems/scramble-string "扰乱字符串") @@ -71,5 +71,5 @@ r g ta e Output: false ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[String](../../tag/string/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/search-a-2d-matrix-ii/README.md b/problems/search-a-2d-matrix-ii/README.md index 64030105e..af706d37e 100644 --- a/problems/search-a-2d-matrix-ii/README.md +++ b/problems/search-a-2d-matrix-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/sliding-window-maximum "Sliding Window Maximum") +[< Previous](../sliding-window-maximum "Sliding Window Maximum") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/different-ways-to-add-parentheses "Different Ways to Add Parentheses") +[Next >](../different-ways-to-add-parentheses "Different Ways to Add Parentheses") ## [240. Search a 2D Matrix II (Medium)](https://leetcode.com/problems/search-a-2d-matrix-ii "搜索二维矩阵 II") @@ -37,8 +37,8 @@

Given target = 20, return false.

### Related Topics - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] - [[Divide and Conquer](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] + [[Divide and Conquer](../../tag/divide-and-conquer/README.md)] ### Similar Questions - 1. [Search a 2D Matrix](https://github.com/openset/leetcode/tree/master/problems/search-a-2d-matrix) (Medium) + 1. [Search a 2D Matrix](../search-a-2d-matrix) (Medium) diff --git a/problems/search-a-2d-matrix/README.md b/problems/search-a-2d-matrix/README.md index 2d46926c8..de3448811 100644 --- a/problems/search-a-2d-matrix/README.md +++ b/problems/search-a-2d-matrix/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/set-matrix-zeroes "Set Matrix Zeroes") +[< Previous](../set-matrix-zeroes "Set Matrix Zeroes") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/sort-colors "Sort Colors") +[Next >](../sort-colors "Sort Colors") ## [74. Search a 2D Matrix (Medium)](https://leetcode.com/problems/search-a-2d-matrix "搜索二维矩阵") @@ -44,8 +44,8 @@ target = 13 Output: false ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Array](../../tag/array/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [Search a 2D Matrix II](https://github.com/openset/leetcode/tree/master/problems/search-a-2d-matrix-ii) (Medium) + 1. [Search a 2D Matrix II](../search-a-2d-matrix-ii) (Medium) diff --git a/problems/search-in-a-binary-search-tree/README.md b/problems/search-in-a-binary-search-tree/README.md index e20122d20..24a5e7f02 100644 --- a/problems/search-in-a-binary-search-tree/README.md +++ b/problems/search-in-a-binary-search-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/falling-squares "Falling Squares") +[< Previous](../falling-squares "Falling Squares") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/insert-into-a-binary-search-tree "Insert into a Binary Search Tree") +[Next >](../insert-into-a-binary-search-tree "Insert into a Binary Search Tree") ## [700. Search in a Binary Search Tree (Easy)](https://leetcode.com/problems/search-in-a-binary-search-tree "二叉搜索树中的搜索") @@ -39,8 +39,8 @@ And the value to search: 2

Note that an empty tree is represented by NULL, therefore you would see the expected output (serialized tree format) as [], not null.

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] ### Similar Questions - 1. [Closest Binary Search Tree Value](https://github.com/openset/leetcode/tree/master/problems/closest-binary-search-tree-value) (Easy) - 1. [Insert into a Binary Search Tree](https://github.com/openset/leetcode/tree/master/problems/insert-into-a-binary-search-tree) (Medium) + 1. [Closest Binary Search Tree Value](../closest-binary-search-tree-value) (Easy) + 1. [Insert into a Binary Search Tree](../insert-into-a-binary-search-tree) (Medium) diff --git a/problems/search-in-a-sorted-array-of-unknown-size/README.md b/problems/search-in-a-sorted-array-of-unknown-size/README.md index 776283071..ae427a39c 100644 --- a/problems/search-in-a-sorted-array-of-unknown-size/README.md +++ b/problems/search-in-a-sorted-array-of-unknown-size/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/insert-into-a-binary-search-tree "Insert into a Binary Search Tree") +[< Previous](../insert-into-a-binary-search-tree "Insert into a Binary Search Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/kth-largest-element-in-a-stream "Kth Largest Element in a Stream") +[Next >](../kth-largest-element-in-a-stream "Kth Largest Element in a Stream") ## [702. Search in a Sorted Array of Unknown Size (Medium)](https://leetcode.com/problems/search-in-a-sorted-array-of-unknown-size "搜索长度未知的有序数组") @@ -40,7 +40,7 @@ ### Related Topics - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [Binary Search](https://github.com/openset/leetcode/tree/master/problems/binary-search) (Easy) + 1. [Binary Search](../binary-search) (Easy) diff --git a/problems/search-in-rotated-sorted-array-ii/README.md b/problems/search-in-rotated-sorted-array-ii/README.md index 8cf3d2d0d..6930dbd99 100644 --- a/problems/search-in-rotated-sorted-array-ii/README.md +++ b/problems/search-in-rotated-sorted-array-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-array-ii "Remove Duplicates from Sorted Array II") +[< Previous](../remove-duplicates-from-sorted-array-ii "Remove Duplicates from Sorted Array II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-list-ii "Remove Duplicates from Sorted List II") +[Next >](../remove-duplicates-from-sorted-list-ii "Remove Duplicates from Sorted List II") ## [81. Search in Rotated Sorted Array II (Medium)](https://leetcode.com/problems/search-in-rotated-sorted-array-ii "搜索旋转排序数组 II") @@ -38,8 +38,8 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Array](../../tag/array/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [Search in Rotated Sorted Array](https://github.com/openset/leetcode/tree/master/problems/search-in-rotated-sorted-array) (Medium) + 1. [Search in Rotated Sorted Array](../search-in-rotated-sorted-array) (Medium) diff --git a/problems/search-in-rotated-sorted-array/README.md b/problems/search-in-rotated-sorted-array/README.md index 4068e77b2..84e319757 100644 --- a/problems/search-in-rotated-sorted-array/README.md +++ b/problems/search-in-rotated-sorted-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/longest-valid-parentheses "Longest Valid Parentheses") +[< Previous](../longest-valid-parentheses "Longest Valid Parentheses") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-first-and-last-position-of-element-in-sorted-array "Find First and Last Position of Element in Sorted Array") +[Next >](../find-first-and-last-position-of-element-in-sorted-array "Find First and Last Position of Element in Sorted Array") ## [33. Search in Rotated Sorted Array (Medium)](https://leetcode.com/problems/search-in-rotated-sorted-array "搜索旋转排序数组") @@ -35,9 +35,9 @@ Output: -1 ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Array](../../tag/array/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [Search in Rotated Sorted Array II](https://github.com/openset/leetcode/tree/master/problems/search-in-rotated-sorted-array-ii) (Medium) - 1. [Find Minimum in Rotated Sorted Array](https://github.com/openset/leetcode/tree/master/problems/find-minimum-in-rotated-sorted-array) (Medium) + 1. [Search in Rotated Sorted Array II](../search-in-rotated-sorted-array-ii) (Medium) + 1. [Find Minimum in Rotated Sorted Array](../find-minimum-in-rotated-sorted-array) (Medium) diff --git a/problems/search-insert-position/README.md b/problems/search-insert-position/README.md index 999e416f2..7526ec17d 100644 --- a/problems/search-insert-position/README.md +++ b/problems/search-insert-position/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-first-and-last-position-of-element-in-sorted-array "Find First and Last Position of Element in Sorted Array") +[< Previous](../find-first-and-last-position-of-element-in-sorted-array "Find First and Last Position of Element in Sorted Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/valid-sudoku "Valid Sudoku") +[Next >](../valid-sudoku "Valid Sudoku") ## [35. Search Insert Position (Easy)](https://leetcode.com/problems/search-insert-position "搜索插入位置") @@ -44,8 +44,8 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Array](../../tag/array/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [First Bad Version](https://github.com/openset/leetcode/tree/master/problems/first-bad-version) (Easy) + 1. [First Bad Version](../first-bad-version) (Easy) diff --git a/problems/search-suggestions-system/README.md b/problems/search-suggestions-system/README.md index 75f7f25a8..649512134 100644 --- a/problems/search-suggestions-system/README.md +++ b/problems/search-suggestions-system/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/count-servers-that-communicate "Count Servers that Communicate") +[< Previous](../count-servers-that-communicate "Count Servers that Communicate") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps "Number of Ways to Stay in the Same Place After Some Steps") +[Next >](../number-of-ways-to-stay-in-the-same-place-after-some-steps "Number of Ways to Stay in the Same Place After Some Steps") ## [1268. Search Suggestions System (Medium)](https://leetcode.com/problems/search-suggestions-system "搜索推荐系统") @@ -66,7 +66,7 @@ After typing mou, mous and mouse the system suggests ["mouse","mo ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Hints
diff --git a/problems/second-degree-follower/README.md b/problems/second-degree-follower/README.md index 70e0547c4..f8169a52a 100644 --- a/problems/second-degree-follower/README.md +++ b/problems/second-degree-follower/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-in-a-line "Shortest Distance in a Line") +[< Previous](../shortest-distance-in-a-line "Shortest Distance in a Line") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/average-salary-departments-vs-company "Average Salary: Departments VS Company") +[Next >](../average-salary-departments-vs-company "Average Salary: Departments VS Company") ## [614. Second Degree Follower (Medium)](https://leetcode.com/problems/second-degree-follower "二级关注者") diff --git a/problems/second-highest-salary/README.md b/problems/second-highest-salary/README.md index 392232b96..110115975 100644 --- a/problems/second-highest-salary/README.md +++ b/problems/second-highest-salary/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/combine-two-tables "Combine Two Tables") +[< Previous](../combine-two-tables "Combine Two Tables") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/nth-highest-salary "Nth Highest Salary") +[Next >](../nth-highest-salary "Nth Highest Salary") ## [176. Second Highest Salary (Easy)](https://leetcode.com/problems/second-highest-salary "第二高的薪水") diff --git a/problems/second-minimum-node-in-a-binary-tree/README.md b/problems/second-minimum-node-in-a-binary-tree/README.md index a2fb836a5..0affbf89b 100644 --- a/problems/second-minimum-node-in-a-binary-tree/README.md +++ b/problems/second-minimum-node-in-a-binary-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-swap "Maximum Swap") +[< Previous](../maximum-swap "Maximum Swap") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/bulb-switcher-ii "Bulb Switcher II") +[Next >](../bulb-switcher-ii "Bulb Switcher II") ## [671. Second Minimum Node In a Binary Tree (Easy)](https://leetcode.com/problems/second-minimum-node-in-a-binary-tree "二叉树中第二小的节点") @@ -48,7 +48,7 @@

 

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] ### Similar Questions - 1. [Kth Smallest Element in a BST](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-element-in-a-bst) (Medium) + 1. [Kth Smallest Element in a BST](../kth-smallest-element-in-a-bst) (Medium) diff --git a/problems/self-crossing/README.md b/problems/self-crossing/README.md index cea72f512..5f302c012 100644 --- a/problems/self-crossing/README.md +++ b/problems/self-crossing/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/increasing-triplet-subsequence "Increasing Triplet Subsequence") +[< Previous](../increasing-triplet-subsequence "Increasing Triplet Subsequence") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/palindrome-pairs "Palindrome Pairs") +[Next >](../palindrome-pairs "Palindrome Pairs") ## [335. Self Crossing (Hard)](https://leetcode.com/problems/self-crossing "路径交叉") @@ -54,4 +54,4 @@ Input: [1,1,1,1] ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/self-dividing-numbers/README.md b/problems/self-dividing-numbers/README.md index 7b1e8948c..06a6d454a 100644 --- a/problems/self-dividing-numbers/README.md +++ b/problems/self-dividing-numbers/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-window-subsequence "Minimum Window Subsequence") +[< Previous](../minimum-window-subsequence "Minimum Window Subsequence") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/my-calendar-i "My Calendar I") +[Next >](../my-calendar-i "My Calendar I") ## [728. Self Dividing Numbers (Easy)](https://leetcode.com/problems/self-dividing-numbers "自除数") @@ -33,10 +33,10 @@ left = 1, right = 22

### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Perfect Number](https://github.com/openset/leetcode/tree/master/problems/perfect-number) (Easy) + 1. [Perfect Number](../perfect-number) (Easy) ### Hints
diff --git a/problems/sentence-screen-fitting/README.md b/problems/sentence-screen-fitting/README.md index 24d014d3e..e1f7c07d7 100644 --- a/problems/sentence-screen-fitting/README.md +++ b/problems/sentence-screen-fitting/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/pacific-atlantic-water-flow "Pacific Atlantic Water Flow") +[< Previous](../pacific-atlantic-water-flow "Pacific Atlantic Water Flow") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/battleships-in-a-board "Battleships in a Board") +[Next >](../battleships-in-a-board "Battleships in a Board") ## [418. Sentence Screen Fitting (Medium)](https://leetcode.com/problems/sentence-screen-fitting "屏幕可显示句子的数量") @@ -80,4 +80,4 @@ The character '-' signifies an empty space on the screen.

### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/sentence-similarity-ii/README.md b/problems/sentence-similarity-ii/README.md index 402d0a3c5..d94e4d940 100644 --- a/problems/sentence-similarity-ii/README.md +++ b/problems/sentence-similarity-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/parse-lisp-expression "Parse Lisp Expression") +[< Previous](../parse-lisp-expression "Parse Lisp Expression") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/monotone-increasing-digits "Monotone Increasing Digits") +[Next >](../monotone-increasing-digits "Monotone Increasing Digits") ## [737. Sentence Similarity II (Medium)](https://leetcode.com/problems/sentence-similarity-ii "句子相似性 II") @@ -35,13 +35,13 @@

 

### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Union Find](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Union Find](../../tag/union-find/README.md)] ### Similar Questions - 1. [Friend Circles](https://github.com/openset/leetcode/tree/master/problems/friend-circles) (Medium) - 1. [Accounts Merge](https://github.com/openset/leetcode/tree/master/problems/accounts-merge) (Medium) - 1. [Sentence Similarity](https://github.com/openset/leetcode/tree/master/problems/sentence-similarity) (Easy) + 1. [Friend Circles](../friend-circles) (Medium) + 1. [Accounts Merge](../accounts-merge) (Medium) + 1. [Sentence Similarity](../sentence-similarity) (Easy) ### Hints
diff --git a/problems/sentence-similarity/README.md b/problems/sentence-similarity/README.md index 63a6d8373..97d6a6713 100644 --- a/problems/sentence-similarity/README.md +++ b/problems/sentence-similarity/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/flood-fill "Flood Fill") +[< Previous](../flood-fill "Flood Fill") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/asteroid-collision "Asteroid Collision") +[Next >](../asteroid-collision "Asteroid Collision") ## [734. Sentence Similarity (Easy)](https://leetcode.com/problems/sentence-similarity "句子相似性") @@ -35,12 +35,12 @@

 

### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Friend Circles](https://github.com/openset/leetcode/tree/master/problems/friend-circles) (Medium) - 1. [Accounts Merge](https://github.com/openset/leetcode/tree/master/problems/accounts-merge) (Medium) - 1. [Sentence Similarity II](https://github.com/openset/leetcode/tree/master/problems/sentence-similarity-ii) (Medium) + 1. [Friend Circles](../friend-circles) (Medium) + 1. [Accounts Merge](../accounts-merge) (Medium) + 1. [Sentence Similarity II](../sentence-similarity-ii) (Medium) ### Hints
diff --git a/problems/sequence-reconstruction/README.md b/problems/sequence-reconstruction/README.md index a457b302e..e7af72214 100644 --- a/problems/sequence-reconstruction/README.md +++ b/problems/sequence-reconstruction/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/string-compression "String Compression") +[< Previous](../string-compression "String Compression") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/add-two-numbers-ii "Add Two Numbers II") +[Next >](../add-two-numbers-ii "Add Two Numbers II") ## [444. Sequence Reconstruction (Medium)](https://leetcode.com/problems/sequence-reconstruction "序列重建") @@ -68,8 +68,8 @@ The seqs parameter had been changed to a list of list of strings (instead

### Related Topics - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] - [[Topological Sort](https://github.com/openset/leetcode/tree/master/tag/topological-sort/README.md)] + [[Graph](../../tag/graph/README.md)] + [[Topological Sort](../../tag/topological-sort/README.md)] ### Similar Questions - 1. [Course Schedule II](https://github.com/openset/leetcode/tree/master/problems/course-schedule-ii) (Medium) + 1. [Course Schedule II](../course-schedule-ii) (Medium) diff --git a/problems/sequential-digits/README.md b/problems/sequential-digits/README.md index 4f355d37a..e3d92686a 100644 --- a/problems/sequential-digits/README.md +++ b/problems/sequential-digits/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/convert-binary-number-in-a-linked-list-to-integer "Convert Binary Number in a Linked List to Integer") +[< Previous](../convert-binary-number-in-a-linked-list-to-integer "Convert Binary Number in a Linked List to Integer") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold "Maximum Side Length of a Square with Sum Less than or Equal to Threshold") +[Next >](../maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold "Maximum Side Length of a Square with Sum Less than or Equal to Threshold") ## [1291. Sequential Digits (Medium)](https://leetcode.com/problems/sequential-digits "顺次数") @@ -31,7 +31,7 @@ ### Related Topics - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Hints
diff --git a/problems/serialize-and-deserialize-binary-tree/README.md b/problems/serialize-and-deserialize-binary-tree/README.md index 839b482f4..8a9db3e25 100644 --- a/problems/serialize-and-deserialize-binary-tree/README.md +++ b/problems/serialize-and-deserialize-binary-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/best-meeting-point "Best Meeting Point") +[< Previous](../best-meeting-point "Best Meeting Point") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/binary-tree-longest-consecutive-sequence "Binary Tree Longest Consecutive Sequence") +[Next >](../binary-tree-longest-consecutive-sequence "Binary Tree Longest Consecutive Sequence") ## [297. Serialize and Deserialize Binary Tree (Hard)](https://leetcode.com/problems/serialize-and-deserialize-binary-tree "二叉树的序列化与反序列化") @@ -34,11 +34,11 @@ as "[1,2,3,null,null,4,5]"

Note: Do not use class member/global/static variables to store states. Your serialize and deserialize algorithms should be stateless.

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Design](../../tag/design/README.md)] ### Similar Questions - 1. [Encode and Decode Strings](https://github.com/openset/leetcode/tree/master/problems/encode-and-decode-strings) (Medium) - 1. [Serialize and Deserialize BST](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-bst) (Medium) - 1. [Find Duplicate Subtrees](https://github.com/openset/leetcode/tree/master/problems/find-duplicate-subtrees) (Medium) - 1. [Serialize and Deserialize N-ary Tree](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-n-ary-tree) (Hard) + 1. [Encode and Decode Strings](../encode-and-decode-strings) (Medium) + 1. [Serialize and Deserialize BST](../serialize-and-deserialize-bst) (Medium) + 1. [Find Duplicate Subtrees](../find-duplicate-subtrees) (Medium) + 1. [Serialize and Deserialize N-ary Tree](../serialize-and-deserialize-n-ary-tree) (Hard) diff --git a/problems/serialize-and-deserialize-bst/README.md b/problems/serialize-and-deserialize-bst/README.md index 774273e13..254f98ab9 100644 --- a/problems/serialize-and-deserialize-bst/README.md +++ b/problems/serialize-and-deserialize-bst/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-all-numbers-disappeared-in-an-array "Find All Numbers Disappeared in an Array") +[< Previous](../find-all-numbers-disappeared-in-an-array "Find All Numbers Disappeared in an Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/delete-node-in-a-bst "Delete Node in a BST") +[Next >](../delete-node-in-a-bst "Delete Node in a BST") ## [449. Serialize and Deserialize BST (Medium)](https://leetcode.com/problems/serialize-and-deserialize-bst "序列化和反序列化二叉搜索树") @@ -20,9 +20,9 @@

Note: Do not use class member/global/static variables to store states. Your serialize and deserialize algorithms should be stateless.

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] ### Similar Questions - 1. [Serialize and Deserialize Binary Tree](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-binary-tree) (Hard) - 1. [Find Duplicate Subtrees](https://github.com/openset/leetcode/tree/master/problems/find-duplicate-subtrees) (Medium) - 1. [Serialize and Deserialize N-ary Tree](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-n-ary-tree) (Hard) + 1. [Serialize and Deserialize Binary Tree](../serialize-and-deserialize-binary-tree) (Hard) + 1. [Find Duplicate Subtrees](../find-duplicate-subtrees) (Medium) + 1. [Serialize and Deserialize N-ary Tree](../serialize-and-deserialize-n-ary-tree) (Hard) diff --git a/problems/serialize-and-deserialize-n-ary-tree/README.md b/problems/serialize-and-deserialize-n-ary-tree/README.md index 6fe49b453..cb66a80a8 100644 --- a/problems/serialize-and-deserialize-n-ary-tree/README.md +++ b/problems/serialize-and-deserialize-n-ary-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/construct-quad-tree "Construct Quad Tree") +[< Previous](../construct-quad-tree "Construct Quad Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-level-order-traversal "N-ary Tree Level Order Traversal") +[Next >](../n-ary-tree-level-order-traversal "N-ary Tree Level Order Traversal") ## [428. Serialize and Deserialize N-ary Tree (Hard)](https://leetcode.com/problems/serialize-and-deserialize-n-ary-tree "序列化和反序列化 N 叉树") @@ -35,9 +35,9 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] ### Similar Questions - 1. [Serialize and Deserialize Binary Tree](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-binary-tree) (Hard) - 1. [Serialize and Deserialize BST](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-bst) (Medium) - 1. [Encode N-ary Tree to Binary Tree](https://github.com/openset/leetcode/tree/master/problems/encode-n-ary-tree-to-binary-tree) (Hard) + 1. [Serialize and Deserialize Binary Tree](../serialize-and-deserialize-binary-tree) (Hard) + 1. [Serialize and Deserialize BST](../serialize-and-deserialize-bst) (Medium) + 1. [Encode N-ary Tree to Binary Tree](../encode-n-ary-tree-to-binary-tree) (Hard) diff --git a/problems/set-intersection-size-at-least-two/README.md b/problems/set-intersection-size-at-least-two/README.md index 5e31e5660..1e96a4568 100644 --- a/problems/set-intersection-size-at-least-two/README.md +++ b/problems/set-intersection-size-at-least-two/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/pyramid-transition-matrix "Pyramid Transition Matrix") +[< Previous](../pyramid-transition-matrix "Pyramid Transition Matrix") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/bold-words-in-string "Bold Words in String") +[Next >](../bold-words-in-string "Bold Words in String") ## [757. Set Intersection Size At Least Two (Hard)](https://leetcode.com/problems/set-intersection-size-at-least-two " 设置交集大小至少为2") @@ -44,4 +44,4 @@ An example of a minimum sized set is {1, 2, 3, 4, 5}.

### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] + [[Greedy](../../tag/greedy/README.md)] diff --git a/problems/set-matrix-zeroes/README.md b/problems/set-matrix-zeroes/README.md index 1b09a82e9..3ea8fd55c 100644 --- a/problems/set-matrix-zeroes/README.md +++ b/problems/set-matrix-zeroes/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/edit-distance "Edit Distance") +[< Previous](../edit-distance "Edit Distance") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/search-a-2d-matrix "Search a 2D Matrix") +[Next >](../search-a-2d-matrix "Search a 2D Matrix") ## [73. Set Matrix Zeroes (Medium)](https://leetcode.com/problems/set-matrix-zeroes "矩阵置零") @@ -56,10 +56,10 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Game of Life](https://github.com/openset/leetcode/tree/master/problems/game-of-life) (Medium) + 1. [Game of Life](../game-of-life) (Medium) ### Hints
diff --git a/problems/set-mismatch/README.md b/problems/set-mismatch/README.md index 6b7304a8f..49bb9d549 100644 --- a/problems/set-mismatch/README.md +++ b/problems/set-mismatch/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-average-subarray-ii "Maximum Average Subarray II") +[< Previous](../maximum-average-subarray-ii "Maximum Average Subarray II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-length-of-pair-chain "Maximum Length of Pair Chain") +[Next >](../maximum-length-of-pair-chain "Maximum Length of Pair Chain") ## [645. Set Mismatch (Easy)](https://leetcode.com/problems/set-mismatch "错误的集合") @@ -35,8 +35,8 @@ Given an array nums representing the data status of this set after

### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Find the Duplicate Number](https://github.com/openset/leetcode/tree/master/problems/find-the-duplicate-number) (Medium) + 1. [Find the Duplicate Number](../find-the-duplicate-number) (Medium) diff --git a/problems/shift-2d-grid/README.md b/problems/shift-2d-grid/README.md index 94bc194bc..e211a7e43 100644 --- a/problems/shift-2d-grid/README.md +++ b/problems/shift-2d-grid/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/handshakes-that-dont-cross "Handshakes That Don't Cross") +[< Previous](../handshakes-that-dont-cross "Handshakes That Don't Cross") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-elements-in-a-contaminated-binary-tree "Find Elements in a Contaminated Binary Tree") +[Next >](../find-elements-in-a-contaminated-binary-tree "Find Elements in a Contaminated Binary Tree") ## [1260. Shift 2D Grid (Easy)](https://leetcode.com/problems/shift-2d-grid "二维网格迁移") @@ -58,7 +58,7 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Hints
diff --git a/problems/shifting-letters/README.md b/problems/shifting-letters/README.md index ad1ce0a73..e33117192 100644 --- a/problems/shifting-letters/README.md +++ b/problems/shifting-letters/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/shortest-path-visiting-all-nodes "Shortest Path Visiting All Nodes") +[< Previous](../shortest-path-visiting-all-nodes "Shortest Path Visiting All Nodes") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximize-distance-to-closest-person "Maximize Distance to Closest Person") +[Next >](../maximize-distance-to-closest-person "Maximize Distance to Closest Person") ## [848. Shifting Letters (Medium)](https://leetcode.com/problems/shifting-letters "字母移位") @@ -41,4 +41,4 @@ After shifting the first 3 letters of S by 9, we have "rpl", the answe ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/shopping-offers/README.md b/problems/shopping-offers/README.md index cc17dff08..029e7fe4e 100644 --- a/problems/shopping-offers/README.md +++ b/problems/shopping-offers/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/average-of-levels-in-binary-tree "Average of Levels in Binary Tree") +[< Previous](../average-of-levels-in-binary-tree "Average of Levels in Binary Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/decode-ways-ii "Decode Ways II") +[Next >](../decode-ways-ii "Decode Ways II") ## [638. Shopping Offers (Medium)](https://leetcode.com/problems/shopping-offers "大礼包") @@ -63,5 +63,5 @@ You cannot add more items, though only $9 for 2A ,2B and 1C.

### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/short-encoding-of-words/README.md b/problems/short-encoding-of-words/README.md index ee2d7e0a5..a3c915941 100644 --- a/problems/short-encoding-of-words/README.md +++ b/problems/short-encoding-of-words/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/most-common-word "Most Common Word") +[< Previous](../most-common-word "Most Common Word") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-to-a-character "Shortest Distance to a Character") +[Next >](../shortest-distance-to-a-character "Shortest Distance to a Character") ## [820. Short Encoding of Words (Medium)](https://leetcode.com/problems/short-encoding-of-words "单词的压缩编码") diff --git a/problems/shortest-bridge/README.md b/problems/shortest-bridge/README.md index 260f0a91a..48adaccaa 100644 --- a/problems/shortest-bridge/README.md +++ b/problems/shortest-bridge/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/number-of-recent-calls "Number of Recent Calls") +[< Previous](../number-of-recent-calls "Number of Recent Calls") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/knight-dialer "Knight Dialer") +[Next >](../knight-dialer "Knight Dialer") ## [934. Shortest Bridge (Medium)](https://leetcode.com/problems/shortest-bridge "最短的桥") @@ -59,5 +59,5 @@ ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] diff --git a/problems/shortest-common-supersequence/README.md b/problems/shortest-common-supersequence/README.md index 39c7ff71a..21f17617a 100644 --- a/problems/shortest-common-supersequence/README.md +++ b/problems/shortest-common-supersequence/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/shortest-path-in-binary-matrix "Shortest Path in Binary Matrix") +[< Previous](../shortest-path-in-binary-matrix "Shortest Path in Binary Matrix") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/statistics-from-a-large-sample "Statistics from a Large Sample") +[Next >](../statistics-from-a-large-sample "Statistics from a Large Sample") ## [1092. Shortest Common Supersequence (Hard)](https://leetcode.com/problems/shortest-common-supersequence "最短公共超序列") @@ -38,7 +38,7 @@ The answer provided is the shortest such string that satisfies these properties. ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/shortest-completing-word/README.md b/problems/shortest-completing-word/README.md index c77c4c671..045d2ae78 100644 --- a/problems/shortest-completing-word/README.md +++ b/problems/shortest-completing-word/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/largest-number-at-least-twice-of-others "Largest Number At Least Twice of Others") +[< Previous](../largest-number-at-least-twice-of-others "Largest Number At Least Twice of Others") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/contain-virus "Contain Virus") +[Next >](../contain-virus "Contain Virus") ## [748. Shortest Completing Word (Easy)](https://leetcode.com/problems/shortest-completing-word "最短完整词") @@ -50,7 +50,7 @@ We return the one that occurred first.

### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Hints
diff --git a/problems/shortest-distance-from-all-buildings/README.md b/problems/shortest-distance-from-all-buildings/README.md index 187eb8d10..fc39bd92a 100644 --- a/problems/shortest-distance-from-all-buildings/README.md +++ b/problems/shortest-distance-from-all-buildings/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/remove-duplicate-letters "Remove Duplicate Letters") +[< Previous](../remove-duplicate-letters "Remove Duplicate Letters") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-product-of-word-lengths "Maximum Product of Word Lengths") +[Next >](../maximum-product-of-word-lengths "Maximum Product of Word Lengths") ## [317. Shortest Distance from All Buildings (Hard)](https://leetcode.com/problems/shortest-distance-from-all-buildings "离建筑物最近的距离") @@ -40,9 +40,9 @@ There will be at least one building. If it is not possible to build such house according to the above rules, return -1.

### Related Topics - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] ### Similar Questions - 1. [Walls and Gates](https://github.com/openset/leetcode/tree/master/problems/walls-and-gates) (Medium) - 1. [Best Meeting Point](https://github.com/openset/leetcode/tree/master/problems/best-meeting-point) (Hard) - 1. [As Far from Land as Possible](https://github.com/openset/leetcode/tree/master/problems/as-far-from-land-as-possible) (Medium) + 1. [Walls and Gates](../walls-and-gates) (Medium) + 1. [Best Meeting Point](../best-meeting-point) (Hard) + 1. [As Far from Land as Possible](../as-far-from-land-as-possible) (Medium) diff --git a/problems/shortest-distance-in-a-line/README.md b/problems/shortest-distance-in-a-line/README.md index ce7c1d9d7..e81181f78 100644 --- a/problems/shortest-distance-in-a-line/README.md +++ b/problems/shortest-distance-in-a-line/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-in-a-plane "Shortest Distance in a Plane") +[< Previous](../shortest-distance-in-a-plane "Shortest Distance in a Plane") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/second-degree-follower "Second Degree Follower") +[Next >](../second-degree-follower "Second Degree Follower") ## [613. Shortest Distance in a Line (Easy)](https://leetcode.com/problems/shortest-distance-in-a-line "直线上的最近距离") diff --git a/problems/shortest-distance-in-a-plane/README.md b/problems/shortest-distance-in-a-plane/README.md index 46d62568c..aabfdb2ba 100644 --- a/problems/shortest-distance-in-a-plane/README.md +++ b/problems/shortest-distance-in-a-plane/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/valid-triangle-number "Valid Triangle Number") +[< Previous](../valid-triangle-number "Valid Triangle Number") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-in-a-line "Shortest Distance in a Line") +[Next >](../shortest-distance-in-a-line "Shortest Distance in a Line") ## [612. Shortest Distance in a Plane (Medium)](https://leetcode.com/problems/shortest-distance-in-a-plane "平面上的最近距离") diff --git a/problems/shortest-distance-to-a-character/README.md b/problems/shortest-distance-to-a-character/README.md index 1c714fc50..c9fb378ac 100644 --- a/problems/shortest-distance-to-a-character/README.md +++ b/problems/shortest-distance-to-a-character/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/short-encoding-of-words "Short Encoding of Words") +[< Previous](../short-encoding-of-words "Short Encoding of Words") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/card-flipping-game "Card Flipping Game") +[Next >](../card-flipping-game "Card Flipping Game") ## [821. Shortest Distance to a Character (Easy)](https://leetcode.com/problems/shortest-distance-to-a-character "字符的最短距离") diff --git a/problems/shortest-distance-to-target-color/README.md b/problems/shortest-distance-to-target-color/README.md index 1c10cc5f0..dc9d88932 100644 --- a/problems/shortest-distance-to-target-color/README.md +++ b/problems/shortest-distance-to-target-color/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/before-and-after-puzzle "Before and After Puzzle") +[< Previous](../before-and-after-puzzle "Before and After Puzzle") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-number-of-ones "Maximum Number of Ones") +[Next >](../maximum-number-of-ones "Maximum Number of Ones") ## [1182. Shortest Distance to Target Color (Medium)](https://leetcode.com/problems/shortest-distance-to-target-color "与目标颜色间的最短距离") @@ -48,7 +48,7 @@ The nearest 1 from index 6 is at index 3 (3 steps away). ### Related Topics - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Hints
diff --git a/problems/shortest-palindrome/README.md b/problems/shortest-palindrome/README.md index 4c169b39f..fc6cd92fc 100644 --- a/problems/shortest-palindrome/README.md +++ b/problems/shortest-palindrome/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/house-robber-ii "House Robber II") +[< Previous](../house-robber-ii "House Robber II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/kth-largest-element-in-an-array "Kth Largest Element in an Array") +[Next >](../kth-largest-element-in-an-array "Kth Largest Element in an Array") ## [214. Shortest Palindrome (Hard)](https://leetcode.com/problems/shortest-palindrome "最短回文串") @@ -27,9 +27,9 @@ Output: "dcbabcd" ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Longest Palindromic Substring](https://github.com/openset/leetcode/tree/master/problems/longest-palindromic-substring) (Medium) - 1. [Implement strStr()](https://github.com/openset/leetcode/tree/master/problems/implement-strstr) (Easy) - 1. [Palindrome Pairs](https://github.com/openset/leetcode/tree/master/problems/palindrome-pairs) (Hard) + 1. [Longest Palindromic Substring](../longest-palindromic-substring) (Medium) + 1. [Implement strStr()](../implement-strstr) (Easy) + 1. [Palindrome Pairs](../palindrome-pairs) (Hard) diff --git a/problems/shortest-path-in-a-grid-with-obstacles-elimination/README.md b/problems/shortest-path-in-a-grid-with-obstacles-elimination/README.md index 81daf94db..59f261ac0 100644 --- a/problems/shortest-path-in-a-grid-with-obstacles-elimination/README.md +++ b/problems/shortest-path-in-a-grid-with-obstacles-elimination/README.md @@ -5,7 +5,7 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold "Maximum Side Length of a Square with Sum Less than or Equal to Threshold") +[< Previous](../maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold "Maximum Side Length of a Square with Sum Less than or Equal to Threshold") 　　　　　　　　　　　　　　　　 Next > @@ -62,7 +62,7 @@ k = 1 ### Related Topics - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] ### Hints
diff --git a/problems/shortest-path-in-binary-matrix/README.md b/problems/shortest-path-in-binary-matrix/README.md index 3e805ecb2..aa9ac7b98 100644 --- a/problems/shortest-path-in-binary-matrix/README.md +++ b/problems/shortest-path-in-binary-matrix/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/largest-values-from-labels "Largest Values From Labels") +[< Previous](../largest-values-from-labels "Largest Values From Labels") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/shortest-common-supersequence "Shortest Common Supersequence ") +[Next >](../shortest-common-supersequence "Shortest Common Supersequence ") ## [1091. Shortest Path in Binary Matrix (Medium)](https://leetcode.com/problems/shortest-path-in-binary-matrix "二进制矩阵中的最短路径") @@ -58,7 +58,7 @@ ### Related Topics - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] ### Hints
diff --git a/problems/shortest-path-to-get-all-keys/README.md b/problems/shortest-path-to-get-all-keys/README.md index 5c3934946..cd6411533 100644 --- a/problems/shortest-path-to-get-all-keys/README.md +++ b/problems/shortest-path-to-get-all-keys/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/all-nodes-distance-k-in-binary-tree "All Nodes Distance K in Binary Tree") +[< Previous](../all-nodes-distance-k-in-binary-tree "All Nodes Distance K in Binary Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/smallest-subtree-with-all-the-deepest-nodes "Smallest Subtree with all the Deepest Nodes") +[Next >](../smallest-subtree-with-all-the-deepest-nodes "Smallest Subtree with all the Deepest Nodes") ## [864. Shortest Path to Get All Keys (Hard)](https://leetcode.com/problems/shortest-path-to-get-all-keys "获取所有钥匙的最短路径") @@ -51,5 +51,5 @@ ### Related Topics - [[Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Heap](../../tag/heap/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] diff --git a/problems/shortest-path-visiting-all-nodes/README.md b/problems/shortest-path-visiting-all-nodes/README.md index 6bc36d4f8..9cbcc6800 100644 --- a/problems/shortest-path-visiting-all-nodes/README.md +++ b/problems/shortest-path-visiting-all-nodes/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/hand-of-straights "Hand of Straights") +[< Previous](../hand-of-straights "Hand of Straights") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/shifting-letters "Shifting Letters") +[Next >](../shifting-letters "Shifting Letters") ## [847. Shortest Path Visiting All Nodes (Hard)](https://leetcode.com/problems/shortest-path-visiting-all-nodes "访问所有节点的最短路径") @@ -47,5 +47,5 @@ ### Related Topics - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/shortest-path-with-alternating-colors/README.md b/problems/shortest-path-with-alternating-colors/README.md index 3c5da4d1a..1d43b3d73 100644 --- a/problems/shortest-path-with-alternating-colors/README.md +++ b/problems/shortest-path-with-alternating-colors/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/number-of-equivalent-domino-pairs "Number of Equivalent Domino Pairs") +[< Previous](../number-of-equivalent-domino-pairs "Number of Equivalent Domino Pairs") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-cost-tree-from-leaf-values "Minimum Cost Tree From Leaf Values") +[Next >](../minimum-cost-tree-from-leaf-values "Minimum Cost Tree From Leaf Values") ## [1129. Shortest Path with Alternating Colors (Medium)](https://leetcode.com/problems/shortest-path-with-alternating-colors "颜色交替的最短路径") @@ -46,8 +46,8 @@ ### Related Topics - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] + [[Graph](../../tag/graph/README.md)] ### Hints
diff --git a/problems/shortest-subarray-with-sum-at-least-k/README.md b/problems/shortest-subarray-with-sum-at-least-k/README.md index 0f38bdfa5..8864d9c5d 100644 --- a/problems/shortest-subarray-with-sum-at-least-k/README.md +++ b/problems/shortest-subarray-with-sum-at-least-k/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/score-after-flipping-matrix "Score After Flipping Matrix") +[< Previous](../score-after-flipping-matrix "Score After Flipping Matrix") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/all-nodes-distance-k-in-binary-tree "All Nodes Distance K in Binary Tree") +[Next >](../all-nodes-distance-k-in-binary-tree "All Nodes Distance K in Binary Tree") ## [862. Shortest Subarray with Sum at Least K (Hard)](https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k "和至少为 K 的最短子数组") @@ -58,5 +58,5 @@ ### Related Topics - [[Queue](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Queue](../../tag/queue/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] diff --git a/problems/shortest-unsorted-continuous-subarray/README.md b/problems/shortest-unsorted-continuous-subarray/README.md index a29f202eb..fcdd6de27 100644 --- a/problems/shortest-unsorted-continuous-subarray/README.md +++ b/problems/shortest-unsorted-continuous-subarray/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/count-student-number-in-departments "Count Student Number in Departments") +[< Previous](../count-student-number-in-departments "Count Student Number in Departments") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/kill-process "Kill Process") +[Next >](../kill-process "Kill Process") ## [581. Shortest Unsorted Continuous Subarray (Easy)](https://leetcode.com/problems/shortest-unsorted-continuous-subarray "最短无序连续子数组") @@ -31,4 +31,4 @@

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] diff --git a/problems/shortest-way-to-form-string/README.md b/problems/shortest-way-to-form-string/README.md index def04c26d..592d2ca7e 100644 --- a/problems/shortest-way-to-form-string/README.md +++ b/problems/shortest-way-to-form-string/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/distant-barcodes "Distant Barcodes") +[< Previous](../distant-barcodes "Distant Barcodes") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/confusing-number "Confusing Number") +[Next >](../confusing-number "Confusing Number") ## [1055. Shortest Way to Form String (Medium)](https://leetcode.com/problems/shortest-way-to-form-string "形成字符串的最短路径") @@ -51,11 +51,11 @@ ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Is Subsequence](https://github.com/openset/leetcode/tree/master/problems/is-subsequence) (Easy) + 1. [Is Subsequence](../is-subsequence) (Easy) ### Hints
diff --git a/problems/shortest-word-distance-ii/README.md b/problems/shortest-word-distance-ii/README.md index 5394c03f5..ece760c67 100644 --- a/problems/shortest-word-distance-ii/README.md +++ b/problems/shortest-word-distance-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance "Shortest Word Distance") +[< Previous](../shortest-word-distance "Shortest Word Distance") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance-iii "Shortest Word Distance III") +[Next >](../shortest-word-distance-iii "Shortest Word Distance III") ## [244. Shortest Word Distance II (Medium)](https://leetcode.com/problems/shortest-word-distance-ii "最短单词距离 II") @@ -27,10 +27,10 @@ Assume that words = ["practice", "makes", "perfec You may assume that word1 does not equal to word2, and word1 and word2 are both in the list.

### Related Topics - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Design](../../tag/design/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Merge Two Sorted Lists](https://github.com/openset/leetcode/tree/master/problems/merge-two-sorted-lists) (Easy) - 1. [Shortest Word Distance](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance) (Easy) - 1. [Shortest Word Distance III](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance-iii) (Medium) + 1. [Merge Two Sorted Lists](../merge-two-sorted-lists) (Easy) + 1. [Shortest Word Distance](../shortest-word-distance) (Easy) + 1. [Shortest Word Distance III](../shortest-word-distance-iii) (Medium) diff --git a/problems/shortest-word-distance-iii/README.md b/problems/shortest-word-distance-iii/README.md index 5516a4a63..de413094c 100644 --- a/problems/shortest-word-distance-iii/README.md +++ b/problems/shortest-word-distance-iii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance-ii "Shortest Word Distance II") +[< Previous](../shortest-word-distance-ii "Shortest Word Distance II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number "Strobogrammatic Number") +[Next >](../strobogrammatic-number "Strobogrammatic Number") ## [245. Shortest Word Distance III (Medium)](https://leetcode.com/problems/shortest-word-distance-iii "最短单词距离 III") @@ -32,8 +32,8 @@ Assume that words = ["practice", "makes", "perfec You may assume word1 and word2 are both in the list.

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Shortest Word Distance](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance) (Easy) - 1. [Shortest Word Distance II](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance-ii) (Medium) + 1. [Shortest Word Distance](../shortest-word-distance) (Easy) + 1. [Shortest Word Distance II](../shortest-word-distance-ii) (Medium) diff --git a/problems/shortest-word-distance/README.md b/problems/shortest-word-distance/README.md index a66b4ee8e..5523931ee 100644 --- a/problems/shortest-word-distance/README.md +++ b/problems/shortest-word-distance/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/valid-anagram "Valid Anagram") +[< Previous](../valid-anagram "Valid Anagram") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance-ii "Shortest Word Distance II") +[Next >](../shortest-word-distance-ii "Shortest Word Distance II") ## [243. Shortest Word Distance (Easy)](https://leetcode.com/problems/shortest-word-distance "最短单词距离") @@ -30,8 +30,8 @@ Assume that words = ["practice", "makes", "perfec You may assume that word1 does not equal to word2, and word1 and word2 are both in the list.

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Shortest Word Distance II](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance-ii) (Medium) - 1. [Shortest Word Distance III](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance-iii) (Medium) + 1. [Shortest Word Distance II](../shortest-word-distance-ii) (Medium) + 1. [Shortest Word Distance III](../shortest-word-distance-iii) (Medium) diff --git a/problems/shuffle-an-array/README.md b/problems/shuffle-an-array/README.md index 4967f053e..0600b6030 100644 --- a/problems/shuffle-an-array/README.md +++ b/problems/shuffle-an-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/ransom-note "Ransom Note") +[< Previous](../ransom-note "Ransom Note") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/mini-parser "Mini Parser") +[Next >](../mini-parser "Mini Parser") ## [384. Shuffle an Array (Medium)](https://leetcode.com/problems/shuffle-an-array "打乱数组") diff --git a/problems/similar-rgb-color/README.md b/problems/similar-rgb-color/README.md index b5de81000..a70381508 100644 --- a/problems/similar-rgb-color/README.md +++ b/problems/similar-rgb-color/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/champagne-tower "Champagne Tower") +[< Previous](../champagne-tower "Champagne Tower") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-swaps-to-make-sequences-increasing "Minimum Swaps To Make Sequences Increasing") +[Next >](../minimum-swaps-to-make-sequences-increasing "Minimum Swaps To Make Sequences Increasing") ## [800. Similar RGB Color (Easy)](https://leetcode.com/problems/similar-rgb-color "相似 RGB 颜色") @@ -38,5 +38,5 @@ This is the highest among any shorthand color. ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Math](../../tag/math/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/similar-string-groups/README.md b/problems/similar-string-groups/README.md index 485e93fcd..2823d4505 100644 --- a/problems/similar-string-groups/README.md +++ b/problems/similar-string-groups/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/push-dominoes "Push Dominoes") +[< Previous](../push-dominoes "Push Dominoes") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/magic-squares-in-grid "Magic Squares In Grid") +[Next >](../magic-squares-in-grid "Magic Squares In Grid") ## [839. Similar String Groups (Hard)](https://leetcode.com/problems/similar-string-groups "相似字符串组") @@ -37,6 +37,6 @@ ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Union Find](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Union Find](../../tag/union-find/README.md)] + [[Graph](../../tag/graph/README.md)] diff --git a/problems/simplify-path/README.md b/problems/simplify-path/README.md index d2f043c69..d321a7840 100644 --- a/problems/simplify-path/README.md +++ b/problems/simplify-path/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/climbing-stairs "Climbing Stairs") +[< Previous](../climbing-stairs "Climbing Stairs") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/edit-distance "Edit Distance") +[Next >](../edit-distance "Edit Distance") ## [71. Simplify Path (Medium)](https://leetcode.com/problems/simplify-path "简化路径") @@ -65,5 +65,5 @@ ### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Stack](../../tag/stack/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/single-element-in-a-sorted-array/README.md b/problems/single-element-in-a-sorted-array/README.md index 4fb75deb3..72e0941e2 100644 --- a/problems/single-element-in-a-sorted-array/README.md +++ b/problems/single-element-in-a-sorted-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-time-difference "Minimum Time Difference") +[< Previous](../minimum-time-difference "Minimum Time Difference") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/reverse-string-ii "Reverse String II") +[Next >](../reverse-string-ii "Reverse String II") ## [540. Single Element in a Sorted Array (Medium)](https://leetcode.com/problems/single-element-in-a-sorted-array "有序数组中的单一元素") diff --git a/problems/single-number-ii/README.md b/problems/single-number-ii/README.md index 02aad374a..cd578e54b 100644 --- a/problems/single-number-ii/README.md +++ b/problems/single-number-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/single-number "Single Number") +[< Previous](../single-number "Single Number") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/copy-list-with-random-pointer "Copy List with Random Pointer") +[Next >](../copy-list-with-random-pointer "Copy List with Random Pointer") ## [137. Single Number II (Medium)](https://leetcode.com/problems/single-number-ii "只出现一次的数字 II") @@ -31,8 +31,8 @@ Output: 99 ### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] ### Similar Questions - 1. [Single Number](https://github.com/openset/leetcode/tree/master/problems/single-number) (Easy) - 1. [Single Number III](https://github.com/openset/leetcode/tree/master/problems/single-number-iii) (Medium) + 1. [Single Number](../single-number) (Easy) + 1. [Single Number III](../single-number-iii) (Medium) diff --git a/problems/single-number-iii/README.md b/problems/single-number-iii/README.md index e2e795866..005a7c376 100644 --- a/problems/single-number-iii/README.md +++ b/problems/single-number-iii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/3sum-smaller "3Sum Smaller") +[< Previous](../3sum-smaller "3Sum Smaller") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/graph-valid-tree "Graph Valid Tree") +[Next >](../graph-valid-tree "Graph Valid Tree") ## [260. Single Number III (Medium)](https://leetcode.com/problems/single-number-iii "只出现一次的数字 III") @@ -27,8 +27,8 @@ ### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] ### Similar Questions - 1. [Single Number](https://github.com/openset/leetcode/tree/master/problems/single-number) (Easy) - 1. [Single Number II](https://github.com/openset/leetcode/tree/master/problems/single-number-ii) (Medium) + 1. [Single Number](../single-number) (Easy) + 1. [Single Number II](../single-number-ii) (Medium) diff --git a/problems/single-number/README.md b/problems/single-number/README.md index d9eaa60a0..b9e4ca162 100644 --- a/problems/single-number/README.md +++ b/problems/single-number/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/candy "Candy") +[< Previous](../candy "Candy") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/single-number-ii "Single Number II") +[Next >](../single-number-ii "Single Number II") ## [136. Single Number (Easy)](https://leetcode.com/problems/single-number "只出现一次的数字") @@ -32,12 +32,12 @@ ### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Single Number II](https://github.com/openset/leetcode/tree/master/problems/single-number-ii) (Medium) - 1. [Single Number III](https://github.com/openset/leetcode/tree/master/problems/single-number-iii) (Medium) - 1. [Missing Number](https://github.com/openset/leetcode/tree/master/problems/missing-number) (Easy) - 1. [Find the Duplicate Number](https://github.com/openset/leetcode/tree/master/problems/find-the-duplicate-number) (Medium) - 1. [Find the Difference](https://github.com/openset/leetcode/tree/master/problems/find-the-difference) (Easy) + 1. [Single Number II](../single-number-ii) (Medium) + 1. [Single Number III](../single-number-iii) (Medium) + 1. [Missing Number](../missing-number) (Easy) + 1. [Find the Duplicate Number](../find-the-duplicate-number) (Medium) + 1. [Find the Difference](../find-the-difference) (Easy) diff --git a/problems/single-row-keyboard/README.md b/problems/single-row-keyboard/README.md index ff0e3c1f5..d54f02d4d 100644 --- a/problems/single-row-keyboard/README.md +++ b/problems/single-row-keyboard/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/product-price-at-a-given-date "Product Price at a Given Date") +[< Previous](../product-price-at-a-given-date "Product Price at a Given Date") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/design-file-system "Design File System") +[Next >](../design-file-system "Design File System") ## [1165. Single-Row Keyboard (Easy)](https://leetcode.com/problems/single-row-keyboard "单行键盘") @@ -45,7 +45,7 @@ Total time = 2 + 1 + 1 = 4. ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Hints
diff --git a/problems/sliding-puzzle/README.md b/problems/sliding-puzzle/README.md index b90bf71d6..f27971d81 100644 --- a/problems/sliding-puzzle/README.md +++ b/problems/sliding-puzzle/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-iii "Basic Calculator III") +[< Previous](../basic-calculator-iii "Basic Calculator III") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimize-max-distance-to-gas-station "Minimize Max Distance to Gas Station") +[Next >](../minimize-max-distance-to-gas-station "Minimize Max Distance to Gas Station") ## [773. Sliding Puzzle (Hard)](https://leetcode.com/problems/sliding-puzzle "滑动谜题") @@ -59,7 +59,7 @@ After move 5: [[1,2,3],[4,5,0]] ### Related Topics - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] ### Hints
diff --git a/problems/sliding-window-maximum/README.md b/problems/sliding-window-maximum/README.md index 0976d4e33..442c5496a 100644 --- a/problems/sliding-window-maximum/README.md +++ b/problems/sliding-window-maximum/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/product-of-array-except-self "Product of Array Except Self") +[< Previous](../product-of-array-except-self "Product of Array Except Self") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/search-a-2d-matrix-ii "Search a 2D Matrix II") +[Next >](../search-a-2d-matrix-ii "Search a 2D Matrix II") ## [239. Sliding Window Maximum (Hard)](https://leetcode.com/problems/sliding-window-maximum "滑动窗口最大值") @@ -37,14 +37,14 @@ You may assume k is always valid, 1 ≤ k ≤ input array's size Could you solve it in linear time?

### Related Topics - [[Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] - [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] + [[Heap](../../tag/heap/README.md)] + [[Sliding Window](../../tag/sliding-window/README.md)] ### Similar Questions - 1. [Minimum Window Substring](https://github.com/openset/leetcode/tree/master/problems/minimum-window-substring) (Hard) - 1. [Min Stack](https://github.com/openset/leetcode/tree/master/problems/min-stack) (Easy) - 1. [Longest Substring with At Most Two Distinct Characters](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-two-distinct-characters) (Medium) - 1. [Paint House II](https://github.com/openset/leetcode/tree/master/problems/paint-house-ii) (Hard) + 1. [Minimum Window Substring](../minimum-window-substring) (Hard) + 1. [Min Stack](../min-stack) (Easy) + 1. [Longest Substring with At Most Two Distinct Characters](../longest-substring-with-at-most-two-distinct-characters) (Medium) + 1. [Paint House II](../paint-house-ii) (Hard) ### Hints
diff --git a/problems/sliding-window-median/README.md b/problems/sliding-window-median/README.md index b8223a8d9..6f6b6e780 100644 --- a/problems/sliding-window-median/README.md +++ b/problems/sliding-window-median/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/largest-palindrome-product "Largest Palindrome Product") +[< Previous](../largest-palindrome-product "Largest Palindrome Product") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/magical-string "Magical String") +[Next >](../magical-string "Magical String") ## [480. Sliding Window Median (Hard)](https://leetcode.com/problems/sliding-window-median "滑动窗口中位数") @@ -38,10 +38,10 @@ Window position Median You may assume k is always valid, ie: k is always smaller than input array's size for non-empty array.

### Related Topics - [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] + [[Sliding Window](../../tag/sliding-window/README.md)] ### Similar Questions - 1. [Find Median from Data Stream](https://github.com/openset/leetcode/tree/master/problems/find-median-from-data-stream) (Hard) + 1. [Find Median from Data Stream](../find-median-from-data-stream) (Hard) ### Hints
diff --git a/problems/smallest-common-region/README.md b/problems/smallest-common-region/README.md index 282e69cbc..065a79db2 100644 --- a/problems/smallest-common-region/README.md +++ b/problems/smallest-common-region/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/encode-number "Encode Number") +[< Previous](../encode-number "Encode Number") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/synonymous-sentences "Synonymous Sentences") +[Next >](../synonymous-sentences "Synonymous Sentences") ## [1257. Smallest Common Region (Medium)](https://leetcode.com/problems/smallest-common-region "最小公共区域") @@ -46,11 +46,11 @@ region2 = "New York" ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] ### Similar Questions - 1. [Lowest Common Ancestor of a Binary Search Tree](https://github.com/openset/leetcode/tree/master/problems/lowest-common-ancestor-of-a-binary-search-tree) (Easy) - 1. [Lowest Common Ancestor of a Binary Tree](https://github.com/openset/leetcode/tree/master/problems/lowest-common-ancestor-of-a-binary-tree) (Medium) + 1. [Lowest Common Ancestor of a Binary Search Tree](../lowest-common-ancestor-of-a-binary-search-tree) (Easy) + 1. [Lowest Common Ancestor of a Binary Tree](../lowest-common-ancestor-of-a-binary-tree) (Medium) ### Hints
diff --git a/problems/smallest-good-base/README.md b/problems/smallest-good-base/README.md index 8cb829d8d..57031804d 100644 --- a/problems/smallest-good-base/README.md +++ b/problems/smallest-good-base/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/license-key-formatting "License Key Formatting") +[< Previous](../license-key-formatting "License Key Formatting") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-permutation "Find Permutation") +[Next >](../find-permutation "Find Permutation") ## [483. Smallest Good Base (Hard)](https://leetcode.com/problems/smallest-good-base "最小好进制") @@ -55,5 +55,5 @@

 

### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Math](../../tag/math/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] diff --git a/problems/smallest-integer-divisible-by-k/README.md b/problems/smallest-integer-divisible-by-k/README.md index 4b56149a4..92ccb4cba 100644 --- a/problems/smallest-integer-divisible-by-k/README.md +++ b/problems/smallest-integer-divisible-by-k/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/best-sightseeing-pair "Best Sightseeing Pair") +[< Previous](../best-sightseeing-pair "Best Sightseeing Pair") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/binary-string-with-substrings-representing-1-to-n "Binary String With Substrings Representing 1 To N") +[Next >](../binary-string-with-substrings-representing-1-to-n "Binary String With Substrings Representing 1 To N") ## [1015. Smallest Integer Divisible by K (Medium)](https://leetcode.com/problems/smallest-integer-divisible-by-k "可被 K 整除的最小整数") @@ -47,7 +47,7 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Hints
diff --git a/problems/smallest-range-covering-elements-from-k-lists/README.md b/problems/smallest-range-covering-elements-from-k-lists/README.md index b620a8a3f..ff1d523e8 100644 --- a/problems/smallest-range-covering-elements-from-k-lists/README.md +++ b/problems/smallest-range-covering-elements-from-k-lists/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/design-excel-sum-formula "Design Excel Sum Formula") +[< Previous](../design-excel-sum-formula "Design Excel Sum Formula") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/sum-of-square-numbers "Sum of Square Numbers") +[Next >](../sum-of-square-numbers "Sum of Square Numbers") ## [632. Smallest Range Covering Elements from K Lists (Hard)](https://leetcode.com/problems/smallest-range-covering-elements-from-k-lists "最小区间") @@ -39,6 +39,6 @@ List 3: [5, 18, 22, 30], 22 is in range [20,24]. ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/smallest-range-i/README.md b/problems/smallest-range-i/README.md index e9786f635..410fbc31f 100644 --- a/problems/smallest-range-i/README.md +++ b/problems/smallest-range-i/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/sum-of-subarray-minimums "Sum of Subarray Minimums") +[< Previous](../sum-of-subarray-minimums "Sum of Subarray Minimums") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/snakes-and-ladders "Snakes and Ladders") +[Next >](../snakes-and-ladders "Snakes and Ladders") ## [908. Smallest Range I (Easy)](https://leetcode.com/problems/smallest-range-i "最小差值 I") @@ -63,4 +63,4 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/smallest-range-ii/README.md b/problems/smallest-range-ii/README.md index feca0a126..cae7abe56 100644 --- a/problems/smallest-range-ii/README.md +++ b/problems/smallest-range-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/snakes-and-ladders "Snakes and Ladders") +[< Previous](../snakes-and-ladders "Snakes and Ladders") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/online-election "Online Election") +[Next >](../online-election "Online Election") ## [910. Smallest Range II (Medium)](https://leetcode.com/problems/smallest-range-ii "最小差值 II") @@ -63,5 +63,5 @@ ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/smallest-rectangle-enclosing-black-pixels/README.md b/problems/smallest-rectangle-enclosing-black-pixels/README.md index 52b347da5..14d52bda0 100644 --- a/problems/smallest-rectangle-enclosing-black-pixels/README.md +++ b/problems/smallest-rectangle-enclosing-black-pixels/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/remove-invalid-parentheses "Remove Invalid Parentheses") +[< Previous](../remove-invalid-parentheses "Remove Invalid Parentheses") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-immutable "Range Sum Query - Immutable") +[Next >](../range-sum-query-immutable "Range Sum Query - Immutable") ## [302. Smallest Rectangle Enclosing Black Pixels (Hard)](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels "包含全部黑色像素的最小矩形") @@ -28,4 +28,4 @@ and x = 0, ### Related Topics - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] diff --git a/problems/smallest-rotation-with-highest-score/README.md b/problems/smallest-rotation-with-highest-score/README.md index b60d07f95..618c5dff0 100644 --- a/problems/smallest-rotation-with-highest-score/README.md +++ b/problems/smallest-rotation-with-highest-score/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/all-paths-from-source-to-target "All Paths From Source to Target") +[< Previous](../all-paths-from-source-to-target "All Paths From Source to Target") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/champagne-tower "Champagne Tower") +[Next >](../champagne-tower "Champagne Tower") ## [798. Smallest Rotation with Highest Score (Hard)](https://leetcode.com/problems/smallest-rotation-with-highest-score "得分最高的最小轮调") diff --git a/problems/smallest-string-starting-from-leaf/README.md b/problems/smallest-string-starting-from-leaf/README.md index 6298f709c..f50c6dcc5 100644 --- a/problems/smallest-string-starting-from-leaf/README.md +++ b/problems/smallest-string-starting-from-leaf/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/vertical-order-traversal-of-a-binary-tree "Vertical Order Traversal of a Binary Tree") +[< Previous](../vertical-order-traversal-of-a-binary-tree "Vertical Order Traversal of a Binary Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/add-to-array-form-of-integer "Add to Array-Form of Integer") +[Next >](../add-to-array-form-of-integer "Add to Array-Form of Integer") ## [988. Smallest String Starting From Leaf (Medium)](https://leetcode.com/problems/smallest-string-starting-from-leaf "从叶结点开始的最小字符串") @@ -69,9 +69,9 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] ### Similar Questions - 1. [Sum Root to Leaf Numbers](https://github.com/openset/leetcode/tree/master/problems/sum-root-to-leaf-numbers) (Medium) - 1. [Binary Tree Paths](https://github.com/openset/leetcode/tree/master/problems/binary-tree-paths) (Easy) + 1. [Sum Root to Leaf Numbers](../sum-root-to-leaf-numbers) (Medium) + 1. [Binary Tree Paths](../binary-tree-paths) (Easy) diff --git a/problems/smallest-string-with-swaps/README.md b/problems/smallest-string-with-swaps/README.md index 70c035d95..b71a874f4 100644 --- a/problems/smallest-string-with-swaps/README.md +++ b/problems/smallest-string-with-swaps/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/ugly-number-iii "Ugly Number III") +[< Previous](../ugly-number-iii "Ugly Number III") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/sort-items-by-groups-respecting-dependencies "Sort Items by Groups Respecting Dependencies") +[Next >](../sort-items-by-groups-respecting-dependencies "Sort Items by Groups Respecting Dependencies") ## [1202. Smallest String With Swaps (Medium)](https://leetcode.com/problems/smallest-string-with-swaps "交换字符串中的元素") @@ -60,8 +60,8 @@ Swap s[0] and s[1], s = "abc" ### Related Topics - [[Union Find](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Union Find](../../tag/union-find/README.md)] + [[Array](../../tag/array/README.md)] ### Hints
diff --git a/problems/smallest-subsequence-of-distinct-characters/README.md b/problems/smallest-subsequence-of-distinct-characters/README.md index fa07b481b..c0a2b13e1 100644 --- a/problems/smallest-subsequence-of-distinct-characters/README.md +++ b/problems/smallest-subsequence-of-distinct-characters/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/insufficient-nodes-in-root-to-leaf-paths "Insufficient Nodes in Root to Leaf Paths") +[< Previous](../insufficient-nodes-in-root-to-leaf-paths "Insufficient Nodes in Root to Leaf Paths") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/sales-analysis-i "Sales Analysis I") +[Next >](../sales-analysis-i "Sales Analysis I") ## [1081. Smallest Subsequence of Distinct Characters (Medium)](https://leetcode.com/problems/smallest-subsequence-of-distinct-characters "不同字符的最小子序列") @@ -61,7 +61,7 @@ ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Hints
diff --git a/problems/smallest-subtree-with-all-the-deepest-nodes/README.md b/problems/smallest-subtree-with-all-the-deepest-nodes/README.md index f209498eb..3de6937a8 100644 --- a/problems/smallest-subtree-with-all-the-deepest-nodes/README.md +++ b/problems/smallest-subtree-with-all-the-deepest-nodes/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/shortest-path-to-get-all-keys "Shortest Path to Get All Keys") +[< Previous](../shortest-path-to-get-all-keys "Shortest Path to Get All Keys") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/prime-palindrome "Prime Palindrome") +[Next >](../prime-palindrome "Prime Palindrome") ## [865. Smallest Subtree with all the Deepest Nodes (Medium)](https://leetcode.com/problems/smallest-subtree-with-all-the-deepest-nodes "具有所有最深结点的最小子树") @@ -47,4 +47,4 @@ Both the input and output have TreeNode type. ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] diff --git a/problems/smallest-sufficient-team/README.md b/problems/smallest-sufficient-team/README.md index 3b640da43..651b91afb 100644 --- a/problems/smallest-sufficient-team/README.md +++ b/problems/smallest-sufficient-team/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/longest-well-performing-interval "Longest Well-Performing Interval") +[< Previous](../longest-well-performing-interval "Longest Well-Performing Interval") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/active-businesses "Active Businesses") +[Next >](../active-businesses "Active Businesses") ## [1125. Smallest Sufficient Team (Hard)](https://leetcode.com/problems/smallest-sufficient-team "最小的必要团队") @@ -41,8 +41,8 @@ ### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/snakes-and-ladders/README.md b/problems/snakes-and-ladders/README.md index 5d1a70d9b..29051ae1d 100644 --- a/problems/snakes-and-ladders/README.md +++ b/problems/snakes-and-ladders/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/smallest-range-i "Smallest Range I") +[< Previous](../smallest-range-i "Smallest Range I") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/smallest-range-ii "Smallest Range II") +[Next >](../smallest-range-ii "Smallest Range II") ## [909. Snakes and Ladders (Medium)](https://leetcode.com/problems/snakes-and-ladders "蛇梯棋") @@ -64,4 +64,4 @@ It can be shown that you need at least 4 moves to reach the N*N-th square, so th ### Related Topics - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] diff --git a/problems/snapshot-array/README.md b/problems/snapshot-array/README.md index bde5c8649..1dce59d35 100644 --- a/problems/snapshot-array/README.md +++ b/problems/snapshot-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/binary-tree-coloring-game "Binary Tree Coloring Game") +[< Previous](../binary-tree-coloring-game "Binary Tree Coloring Game") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/longest-chunked-palindrome-decomposition "Longest Chunked Palindrome Decomposition") +[Next >](../longest-chunked-palindrome-decomposition "Longest Chunked Palindrome Decomposition") ## [1146. Snapshot Array (Medium)](https://leetcode.com/problems/snapshot-array "快照数组") @@ -46,7 +46,7 @@ snapshotArr.get(0,0); // Get the value of array[0] with snap_id = 0, return 5 ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Hints
diff --git a/problems/solve-the-equation/README.md b/problems/solve-the-equation/README.md index f4a02f8a6..e825bc691 100644 --- a/problems/solve-the-equation/README.md +++ b/problems/solve-the-equation/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/decode-ways-ii "Decode Ways II") +[< Previous](../decode-ways-ii "Decode Ways II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/design-circular-deque "Design Circular Deque") +[Next >](../design-circular-deque "Design Circular Deque") ## [640. Solve the Equation (Medium)](https://leetcode.com/problems/solve-the-equation "求解方程") @@ -61,7 +61,7 @@ If there is exactly one solution for the equation, we ensure that the value of <

### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Fraction Addition and Subtraction](https://github.com/openset/leetcode/tree/master/problems/fraction-addition-and-subtraction) (Medium) + 1. [Fraction Addition and Subtraction](../fraction-addition-and-subtraction) (Medium) diff --git a/problems/sort-an-array/README.md b/problems/sort-an-array/README.md index be77076e8..fb632ec4e 100644 --- a/problems/sort-an-array/README.md +++ b/problems/sort-an-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/online-election "Online Election") +[< Previous](../online-election "Online Election") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/cat-and-mouse "Cat and Mouse") +[Next >](../cat-and-mouse "Cat and Mouse") ## [912. Sort an Array (Medium)](https://leetcode.com/problems/sort-an-array "排序数组") diff --git a/problems/sort-array-by-parity-ii/README.md b/problems/sort-array-by-parity-ii/README.md index 199ffd2e9..6da52d820 100644 --- a/problems/sort-array-by-parity-ii/README.md +++ b/problems/sort-array-by-parity-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-add-to-make-parentheses-valid "Minimum Add to Make Parentheses Valid") +[< Previous](../minimum-add-to-make-parentheses-valid "Minimum Add to Make Parentheses Valid") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/3sum-with-multiplicity "3Sum With Multiplicity") +[Next >](../3sum-with-multiplicity "3Sum With Multiplicity") ## [922. Sort Array By Parity II (Easy)](https://leetcode.com/problems/sort-array-by-parity-ii "按奇偶排序数组 II") @@ -42,5 +42,5 @@ ### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Sort](../../tag/sort/README.md)] + [[Array](../../tag/array/README.md)] diff --git a/problems/sort-array-by-parity/README.md b/problems/sort-array-by-parity/README.md index 9956ea559..81a47709a 100644 --- a/problems/sort-array-by-parity/README.md +++ b/problems/sort-array-by-parity/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/fruit-into-baskets "Fruit Into Baskets") +[< Previous](../fruit-into-baskets "Fruit Into Baskets") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/super-palindromes "Super Palindromes") +[Next >](../super-palindromes "Super Palindromes") ## [905. Sort Array By Parity (Easy)](https://leetcode.com/problems/sort-array-by-parity "按奇偶排序数组") @@ -37,4 +37,4 @@ The outputs [4,2,3,1], [2,4,1,3], and [4,2,1,3] would also be accepted. ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] diff --git a/problems/sort-characters-by-frequency/README.md b/problems/sort-characters-by-frequency/README.md index 15636da50..41923ed44 100644 --- a/problems/sort-characters-by-frequency/README.md +++ b/problems/sort-characters-by-frequency/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/delete-node-in-a-bst "Delete Node in a BST") +[< Previous](../delete-node-in-a-bst "Delete Node in a BST") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-number-of-arrows-to-burst-balloons "Minimum Number of Arrows to Burst Balloons") +[Next >](../minimum-number-of-arrows-to-burst-balloons "Minimum Number of Arrows to Burst Balloons") ## [451. Sort Characters By Frequency (Medium)](https://leetcode.com/problems/sort-characters-by-frequency "根据字符出现频率排序") @@ -56,9 +56,9 @@ Note that 'A' and 'a' are treated as two different characters.

### Related Topics - [[Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Heap](../../tag/heap/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Top K Frequent Elements](https://github.com/openset/leetcode/tree/master/problems/top-k-frequent-elements) (Medium) - 1. [First Unique Character in a String](https://github.com/openset/leetcode/tree/master/problems/first-unique-character-in-a-string) (Easy) + 1. [Top K Frequent Elements](../top-k-frequent-elements) (Medium) + 1. [First Unique Character in a String](../first-unique-character-in-a-string) (Easy) diff --git a/problems/sort-colors/README.md b/problems/sort-colors/README.md index 19bdefc03..d68e399a4 100644 --- a/problems/sort-colors/README.md +++ b/problems/sort-colors/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/search-a-2d-matrix "Search a 2D Matrix") +[< Previous](../search-a-2d-matrix "Search a 2D Matrix") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-window-substring "Minimum Window Substring") +[Next >](../minimum-window-substring "Minimum Window Substring") ## [75. Sort Colors (Medium)](https://leetcode.com/problems/sort-colors "颜色分类") @@ -32,11 +32,11 @@ ### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Sort](../../tag/sort/README.md)] + [[Array](../../tag/array/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] ### Similar Questions - 1. [Sort List](https://github.com/openset/leetcode/tree/master/problems/sort-list) (Medium) - 1. [Wiggle Sort](https://github.com/openset/leetcode/tree/master/problems/wiggle-sort) (Medium) - 1. [Wiggle Sort II](https://github.com/openset/leetcode/tree/master/problems/wiggle-sort-ii) (Medium) + 1. [Sort List](../sort-list) (Medium) + 1. [Wiggle Sort](../wiggle-sort) (Medium) + 1. [Wiggle Sort II](../wiggle-sort-ii) (Medium) diff --git a/problems/sort-items-by-groups-respecting-dependencies/README.md b/problems/sort-items-by-groups-respecting-dependencies/README.md index 77143ac3d..ec7c51434 100644 --- a/problems/sort-items-by-groups-respecting-dependencies/README.md +++ b/problems/sort-items-by-groups-respecting-dependencies/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/smallest-string-with-swaps "Smallest String With Swaps") +[< Previous](../smallest-string-with-swaps "Smallest String With Swaps") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/last-person-to-fit-in-the-elevator "Last Person to Fit in the Elevator") +[Next >](../last-person-to-fit-in-the-elevator "Last Person to Fit in the Elevator") ## [1203. Sort Items by Groups Respecting Dependencies (Hard)](https://leetcode.com/problems/sort-items-by-groups-respecting-dependencies "项目管理") @@ -54,9 +54,9 @@ ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] - [[Topological Sort](https://github.com/openset/leetcode/tree/master/tag/topological-sort/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Graph](../../tag/graph/README.md)] + [[Topological Sort](../../tag/topological-sort/README.md)] ### Hints
diff --git a/problems/sort-list/README.md b/problems/sort-list/README.md index 1d555210d..9b662c369 100644 --- a/problems/sort-list/README.md +++ b/problems/sort-list/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/insertion-sort-list "Insertion Sort List") +[< Previous](../insertion-sort-list "Insertion Sort List") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/max-points-on-a-line "Max Points on a Line") +[Next >](../max-points-on-a-line "Max Points on a Line") ## [148. Sort List (Medium)](https://leetcode.com/problems/sort-list "排序链表") @@ -27,10 +27,10 @@ Output: -1->0->3->4->5 ### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] + [[Sort](../../tag/sort/README.md)] + [[Linked List](../../tag/linked-list/README.md)] ### Similar Questions - 1. [Merge Two Sorted Lists](https://github.com/openset/leetcode/tree/master/problems/merge-two-sorted-lists) (Easy) - 1. [Sort Colors](https://github.com/openset/leetcode/tree/master/problems/sort-colors) (Medium) - 1. [Insertion Sort List](https://github.com/openset/leetcode/tree/master/problems/insertion-sort-list) (Medium) + 1. [Merge Two Sorted Lists](../merge-two-sorted-lists) (Easy) + 1. [Sort Colors](../sort-colors) (Medium) + 1. [Insertion Sort List](../insertion-sort-list) (Medium) diff --git a/problems/sort-transformed-array/README.md b/problems/sort-transformed-array/README.md index 546edf9f5..1d70cd120 100644 --- a/problems/sort-transformed-array/README.md +++ b/problems/sort-transformed-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/logger-rate-limiter "Logger Rate Limiter") +[< Previous](../logger-rate-limiter "Logger Rate Limiter") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/bomb-enemy "Bomb Enemy") +[Next >](../bomb-enemy "Bomb Enemy") ## [360. Sort Transformed Array (Medium)](https://leetcode.com/problems/sort-transformed-array "有序转化数组") @@ -34,11 +34,11 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Math](../../tag/math/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] ### Similar Questions - 1. [Squares of a Sorted Array](https://github.com/openset/leetcode/tree/master/problems/squares-of-a-sorted-array) (Easy) + 1. [Squares of a Sorted Array](../squares-of-a-sorted-array) (Easy) ### Hints
diff --git a/problems/soup-servings/README.md b/problems/soup-servings/README.md index 9dfdf605e..7a5dbb405 100644 --- a/problems/soup-servings/README.md +++ b/problems/soup-servings/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/max-increase-to-keep-city-skyline "Max Increase to Keep City Skyline") +[< Previous](../max-increase-to-keep-city-skyline "Max Increase to Keep City Skyline") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/expressive-words "Expressive Words") +[Next >](../expressive-words "Expressive Words") ## [808. Soup Servings (Medium)](https://leetcode.com/problems/soup-servings "分汤") @@ -45,4 +45,4 @@ If we choose the first two operations, A will become empty first. For the third ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/sparse-matrix-multiplication/README.md b/problems/sparse-matrix-multiplication/README.md index b957bb1ce..1cb5568f1 100644 --- a/problems/sparse-matrix-multiplication/README.md +++ b/problems/sparse-matrix-multiplication/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-height-trees "Minimum Height Trees") +[< Previous](../minimum-height-trees "Minimum Height Trees") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/burst-balloons "Burst Balloons") +[Next >](../burst-balloons "Burst Balloons") ## [311. Sparse Matrix Multiplication (Medium)](https://leetcode.com/problems/sparse-matrix-multiplication "稀疏矩阵的乘法") @@ -39,4 +39,4 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] diff --git a/problems/special-binary-string/README.md b/problems/special-binary-string/README.md index 5ab8b46ea..da6f20953 100644 --- a/problems/special-binary-string/README.md +++ b/problems/special-binary-string/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-anagram-mappings "Find Anagram Mappings") +[< Previous](../find-anagram-mappings "Find Anagram Mappings") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/prime-number-of-set-bits-in-binary-representation "Prime Number of Set Bits in Binary Representation") +[Next >](../prime-number-of-set-bits-in-binary-representation "Prime Number of Set Bits in Binary Representation") ## [761. Special Binary String (Hard)](https://leetcode.com/problems/special-binary-string "特殊的二进制序列") @@ -38,11 +38,11 @@ This is the lexicographically largest string possible after some number of swaps

### Related Topics - [[Recursion](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Recursion](../../tag/recursion/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Valid Parenthesis String](https://github.com/openset/leetcode/tree/master/problems/valid-parenthesis-string) (Medium) + 1. [Valid Parenthesis String](../valid-parenthesis-string) (Medium) ### Hints
diff --git a/problems/spiral-matrix-ii/README.md b/problems/spiral-matrix-ii/README.md index 29527da56..bddfb831a 100644 --- a/problems/spiral-matrix-ii/README.md +++ b/problems/spiral-matrix-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/length-of-last-word "Length of Last Word") +[< Previous](../length-of-last-word "Length of Last Word") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/permutation-sequence "Permutation Sequence") +[Next >](../permutation-sequence "Permutation Sequence") ## [59. Spiral Matrix II (Medium)](https://leetcode.com/problems/spiral-matrix-ii "螺旋矩阵 II") @@ -26,7 +26,7 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Spiral Matrix](https://github.com/openset/leetcode/tree/master/problems/spiral-matrix) (Medium) + 1. [Spiral Matrix](../spiral-matrix) (Medium) diff --git a/problems/spiral-matrix-iii/README.md b/problems/spiral-matrix-iii/README.md index d3abbd192..640c62380 100644 --- a/problems/spiral-matrix-iii/README.md +++ b/problems/spiral-matrix-iii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/uncommon-words-from-two-sentences "Uncommon Words from Two Sentences") +[< Previous](../uncommon-words-from-two-sentences "Uncommon Words from Two Sentences") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/possible-bipartition "Possible Bipartition") +[Next >](../possible-bipartition "Possible Bipartition") ## [885. Spiral Matrix III (Medium)](https://leetcode.com/problems/spiral-matrix-iii "螺旋矩阵 III") @@ -61,4 +61,4 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/spiral-matrix/README.md b/problems/spiral-matrix/README.md index 656c51760..f0139fd00 100644 --- a/problems/spiral-matrix/README.md +++ b/problems/spiral-matrix/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-subarray "Maximum Subarray") +[< Previous](../maximum-subarray "Maximum Subarray") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/jump-game "Jump Game") +[Next >](../jump-game "Jump Game") ## [54. Spiral Matrix (Medium)](https://leetcode.com/problems/spiral-matrix "螺旋矩阵") @@ -37,7 +37,7 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Spiral Matrix II](https://github.com/openset/leetcode/tree/master/problems/spiral-matrix-ii) (Medium) + 1. [Spiral Matrix II](../spiral-matrix-ii) (Medium) diff --git a/problems/split-a-string-in-balanced-strings/README.md b/problems/split-a-string-in-balanced-strings/README.md index b5db57d38..8d97a4325 100644 --- a/problems/split-a-string-in-balanced-strings/README.md +++ b/problems/split-a-string-in-balanced-strings/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/count-vowels-permutation "Count Vowels Permutation") +[< Previous](../count-vowels-permutation "Count Vowels Permutation") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/queens-that-can-attack-the-king "Queens That Can Attack the King") +[Next >](../queens-that-can-attack-the-king "Queens That Can Attack the King") ## [1221. Split a String in Balanced Strings (Easy)](https://leetcode.com/problems/split-a-string-in-balanced-strings "分割平衡字符串") @@ -59,8 +59,8 @@ ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[String](../../tag/string/README.md)] ### Hints
diff --git a/problems/split-array-into-consecutive-subsequences/README.md b/problems/split-array-into-consecutive-subsequences/README.md index 2289bdc9e..9f60d7348 100644 --- a/problems/split-array-into-consecutive-subsequences/README.md +++ b/problems/split-array-into-consecutive-subsequences/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-k-closest-elements "Find K Closest Elements") +[< Previous](../find-k-closest-elements "Find K Closest Elements") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/remove-9 "Remove 9") +[Next >](../remove-9 "Remove 9") ## [659. Split Array into Consecutive Subsequences (Medium)](https://leetcode.com/problems/split-array-into-consecutive-subsequences "分割数组为连续子序列") @@ -57,8 +57,8 @@ You can split them into two consecutive subsequences :

 

### Related Topics - [[Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] + [[Heap](../../tag/heap/README.md)] + [[Greedy](../../tag/greedy/README.md)] ### Similar Questions - 1. [Top K Frequent Elements](https://github.com/openset/leetcode/tree/master/problems/top-k-frequent-elements) (Medium) + 1. [Top K Frequent Elements](../top-k-frequent-elements) (Medium) diff --git a/problems/split-array-into-fibonacci-sequence/README.md b/problems/split-array-into-fibonacci-sequence/README.md index f8894b2a4..81a7dc0f8 100644 --- a/problems/split-array-into-fibonacci-sequence/README.md +++ b/problems/split-array-into-fibonacci-sequence/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/keys-and-rooms "Keys and Rooms") +[< Previous](../keys-and-rooms "Keys and Rooms") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/guess-the-word "Guess the Word") +[Next >](../guess-the-word "Guess the Word") ## [842. Split Array into Fibonacci Sequence (Medium)](https://leetcode.com/problems/split-array-into-fibonacci-sequence "将数组拆分成斐波那契序列") @@ -71,10 +71,10 @@ ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[String](../../tag/string/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Additive Number](https://github.com/openset/leetcode/tree/master/problems/additive-number) (Medium) - 1. [Fibonacci Number](https://github.com/openset/leetcode/tree/master/problems/fibonacci-number) (Easy) + 1. [Additive Number](../additive-number) (Medium) + 1. [Fibonacci Number](../fibonacci-number) (Easy) diff --git a/problems/split-array-largest-sum/README.md b/problems/split-array-largest-sum/README.md index 2eca5d0e9..923fd0683 100644 --- a/problems/split-array-largest-sum/README.md +++ b/problems/split-array-largest-sum/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/longest-palindrome "Longest Palindrome") +[< Previous](../longest-palindrome "Longest Palindrome") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-unique-word-abbreviation "Minimum Unique Word Abbreviation") +[Next >](../minimum-unique-word-abbreviation "Minimum Unique Word Abbreviation") ## [410. Split Array Largest Sum (Hard)](https://leetcode.com/problems/split-array-largest-sum "分割数组的最大值") @@ -39,5 +39,5 @@ where the largest sum among the two subarrays is only 18.

### Related Topics - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/split-array-with-equal-sum/README.md b/problems/split-array-with-equal-sum/README.md index 8c4afadbd..fac6e7e7d 100644 --- a/problems/split-array-with-equal-sum/README.md +++ b/problems/split-array-with-equal-sum/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/friend-circles "Friend Circles") +[< Previous](../friend-circles "Friend Circles") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/binary-tree-longest-consecutive-sequence-ii "Binary Tree Longest Consecutive Sequence II") +[Next >](../binary-tree-longest-consecutive-sequence-ii "Binary Tree Longest Consecutive Sequence II") ## [548. Split Array with Equal Sum (Medium)](https://leetcode.com/problems/split-array-with-equal-sum "将数组分割成和相等的子数组") @@ -40,4 +40,4 @@ sum(k + 1, n - 1) = sum(6, 6) = 1 ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] diff --git a/problems/split-array-with-same-average/README.md b/problems/split-array-with-same-average/README.md index 14aa922d2..7a479df48 100644 --- a/problems/split-array-with-same-average/README.md +++ b/problems/split-array-with-same-average/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/unique-morse-code-words "Unique Morse Code Words") +[< Previous](../unique-morse-code-words "Unique Morse Code Words") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-lines-to-write-string "Number of Lines To Write String") +[Next >](../number-of-lines-to-write-string "Number of Lines To Write String") ## [805. Split Array With Same Average (Hard)](https://leetcode.com/problems/split-array-with-same-average "数组的均值分割") @@ -33,4 +33,4 @@

 

### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/split-bst/README.md b/problems/split-bst/README.md index 7fb09710e..49e6a9ae1 100644 --- a/problems/split-bst/README.md +++ b/problems/split-bst/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/global-and-local-inversions "Global and Local Inversions") +[< Previous](../global-and-local-inversions "Global and Local Inversions") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/swap-adjacent-in-lr-string "Swap Adjacent in LR String") +[Next >](../swap-adjacent-in-lr-string "Swap Adjacent in LR String") ## [776. Split BST (Medium)](https://leetcode.com/problems/split-bst "拆分二叉搜索树") @@ -50,11 +50,11 @@ while the diagrams for the outputs are: ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Recursion](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Recursion](../../tag/recursion/README.md)] ### Similar Questions - 1. [Delete Node in a BST](https://github.com/openset/leetcode/tree/master/problems/delete-node-in-a-bst) (Medium) + 1. [Delete Node in a BST](../delete-node-in-a-bst) (Medium) ### Hints
diff --git a/problems/split-concatenated-strings/README.md b/problems/split-concatenated-strings/README.md index 7d4000e03..3121c5af8 100644 --- a/problems/split-concatenated-strings/README.md +++ b/problems/split-concatenated-strings/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/brick-wall "Brick Wall") +[< Previous](../brick-wall "Brick Wall") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-iii "Next Greater Element III") +[Next >](../next-greater-element-iii "Next Greater Element III") ## [555. Split Concatenated Strings (Medium)](https://leetcode.com/problems/split-concatenated-strings "分割连接字符串") @@ -39,4 +39,4 @@

### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/split-linked-list-in-parts/README.md b/problems/split-linked-list-in-parts/README.md index f068af239..350cb53d9 100644 --- a/problems/split-linked-list-in-parts/README.md +++ b/problems/split-linked-list-in-parts/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-pivot-index "Find Pivot Index") +[< Previous](../find-pivot-index "Find Pivot Index") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-atoms "Number of Atoms") +[Next >](../number-of-atoms "Number of Atoms") ## [725. Split Linked List in Parts (Medium)](https://leetcode.com/problems/split-linked-list-in-parts "分隔链表") @@ -58,11 +58,11 @@ The input has been split into consecutive parts with size difference at most 1,

### Related Topics - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] + [[Linked List](../../tag/linked-list/README.md)] ### Similar Questions - 1. [Rotate List](https://github.com/openset/leetcode/tree/master/problems/rotate-list) (Medium) - 1. [Odd Even Linked List](https://github.com/openset/leetcode/tree/master/problems/odd-even-linked-list) (Medium) + 1. [Rotate List](../rotate-list) (Medium) + 1. [Odd Even Linked List](../odd-even-linked-list) (Medium) ### Hints
diff --git a/problems/sqrtx/README.md b/problems/sqrtx/README.md index 678ff80fb..1462371e4 100644 --- a/problems/sqrtx/README.md +++ b/problems/sqrtx/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/text-justification "Text Justification") +[< Previous](../text-justification "Text Justification") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/climbing-stairs "Climbing Stairs") +[Next >](../climbing-stairs "Climbing Stairs") ## [69. Sqrt(x) (Easy)](https://leetcode.com/problems/sqrtx "x 的平方根") @@ -34,12 +34,12 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Math](../../tag/math/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [Pow(x, n)](https://github.com/openset/leetcode/tree/master/problems/powx-n) (Medium) - 1. [Valid Perfect Square](https://github.com/openset/leetcode/tree/master/problems/valid-perfect-square) (Easy) + 1. [Pow(x, n)](../powx-n) (Medium) + 1. [Valid Perfect Square](../valid-perfect-square) (Easy) ### Hints
diff --git a/problems/squares-of-a-sorted-array/README.md b/problems/squares-of-a-sorted-array/README.md index 2e3829a19..479f1d0ec 100644 --- a/problems/squares-of-a-sorted-array/README.md +++ b/problems/squares-of-a-sorted-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/largest-perimeter-triangle "Largest Perimeter Triangle") +[< Previous](../largest-perimeter-triangle "Largest Perimeter Triangle") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/longest-turbulent-subarray "Longest Turbulent Subarray") +[Next >](../longest-turbulent-subarray "Longest Turbulent Subarray") ## [977. Squares of a Sorted Array (Easy)](https://leetcode.com/problems/squares-of-a-sorted-array "有序数组的平方") @@ -44,9 +44,9 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Array](../../tag/array/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] ### Similar Questions - 1. [Merge Sorted Array](https://github.com/openset/leetcode/tree/master/problems/merge-sorted-array) (Easy) - 1. [Sort Transformed Array](https://github.com/openset/leetcode/tree/master/problems/sort-transformed-array) (Medium) + 1. [Merge Sorted Array](../merge-sorted-array) (Easy) + 1. [Sort Transformed Array](../sort-transformed-array) (Medium) diff --git a/problems/squirrel-simulation/README.md b/problems/squirrel-simulation/README.md index a42755dc8..5060c8f49 100644 --- a/problems/squirrel-simulation/README.md +++ b/problems/squirrel-simulation/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/subtree-of-another-tree "Subtree of Another Tree") +[< Previous](../subtree-of-another-tree "Subtree of Another Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/winning-candidate "Winning Candidate") +[Next >](../winning-candidate "Winning Candidate") ## [573. Squirrel Simulation (Medium)](https://leetcode.com/problems/squirrel-simulation "松鼠模拟") @@ -36,7 +36,7 @@ Nuts : [[3,0], [2,5]] ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Hints
diff --git a/problems/stamping-the-sequence/README.md b/problems/stamping-the-sequence/README.md index 028e2a4ba..3217f2fab 100644 --- a/problems/stamping-the-sequence/README.md +++ b/problems/stamping-the-sequence/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/knight-dialer "Knight Dialer") +[< Previous](../knight-dialer "Knight Dialer") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/reorder-data-in-log-files "Reorder Data in Log Files") +[Next >](../reorder-data-in-log-files "Reorder Data in Log Files") ## [936. Stamping The Sequence (Hard)](https://leetcode.com/problems/stamping-the-sequence "戳印序列") @@ -56,5 +56,5 @@ ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/statistics-from-a-large-sample/README.md b/problems/statistics-from-a-large-sample/README.md index 0b66d0a37..b59d03b09 100644 --- a/problems/statistics-from-a-large-sample/README.md +++ b/problems/statistics-from-a-large-sample/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/shortest-common-supersequence "Shortest Common Supersequence ") +[< Previous](../shortest-common-supersequence "Shortest Common Supersequence ") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/car-pooling "Car Pooling") +[Next >](../car-pooling "Car Pooling") ## [1093. Statistics from a Large Sample (Medium)](https://leetcode.com/problems/statistics-from-a-large-sample "大样本统计") @@ -41,8 +41,8 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Math](../../tag/math/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] ### Hints
diff --git a/problems/stepping-numbers/README.md b/problems/stepping-numbers/README.md index e8bdd8bd6..c2b338c34 100644 --- a/problems/stepping-numbers/README.md +++ b/problems/stepping-numbers/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/two-sum-bsts "Two Sum BSTs") +[< Previous](../two-sum-bsts "Two Sum BSTs") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/valid-palindrome-iii "Valid Palindrome III") +[Next >](../valid-palindrome-iii "Valid Palindrome III") ## [1215. Stepping Numbers (Medium)](https://leetcode.com/problems/stepping-numbers "步进数") @@ -28,7 +28,7 @@ ### Related Topics - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Hints
diff --git a/problems/stickers-to-spell-word/README.md b/problems/stickers-to-spell-word/README.md index fd0239b72..70c307e12 100644 --- a/problems/stickers-to-spell-word/README.md +++ b/problems/stickers-to-spell-word/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/employee-importance "Employee Importance") +[< Previous](../employee-importance "Employee Importance") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/top-k-frequent-words "Top K Frequent Words") +[Next >](../top-k-frequent-words "Top K Frequent Words") ## [691. Stickers to Spell Word (Hard)](https://leetcode.com/problems/stickers-to-spell-word "贴纸拼词") @@ -58,11 +58,11 @@ We can't form the target "basicbasic" from cutting letters from the given sticke

### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Ransom Note](https://github.com/openset/leetcode/tree/master/problems/ransom-note) (Easy) + 1. [Ransom Note](../ransom-note) (Easy) ### Hints
diff --git a/problems/stone-game-ii/README.md b/problems/stone-game-ii/README.md index 248756506..f609cb77c 100644 --- a/problems/stone-game-ii/README.md +++ b/problems/stone-game-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/largest-1-bordered-square "Largest 1-Bordered Square") +[< Previous](../largest-1-bordered-square "Largest 1-Bordered Square") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/user-activity-for-the-past-30-days-i "User Activity for the Past 30 Days I") +[Next >](../user-activity-for-the-past-30-days-i "User Activity for the Past 30 Days I") ## [1140. Stone Game II (Medium)](https://leetcode.com/problems/stone-game-ii "石子游戏 II") @@ -39,7 +39,7 @@ ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/stone-game/README.md b/problems/stone-game/README.md index 352076f20..b0760bc1b 100644 --- a/problems/stone-game/README.md +++ b/problems/stone-game/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/middle-of-the-linked-list "Middle of the Linked List") +[< Previous](../middle-of-the-linked-list "Middle of the Linked List") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/nth-magical-number "Nth Magical Number") +[Next >](../nth-magical-number "Nth Magical Number") ## [877. Stone Game (Medium)](https://leetcode.com/problems/stone-game "石子游戏") @@ -46,6 +46,6 @@ This demonstrated that taking the first 5 was a winning move for Alex, so we ret ### Related Topics - [[Minimax](https://github.com/openset/leetcode/tree/master/tag/minimax/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Minimax](../../tag/minimax/README.md)] + [[Math](../../tag/math/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/strange-printer/README.md b/problems/strange-printer/README.md index e9a0aba61..06520e782 100644 --- a/problems/strange-printer/README.md +++ b/problems/strange-printer/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/equal-tree-partition "Equal Tree Partition") +[< Previous](../equal-tree-partition "Equal Tree Partition") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/non-decreasing-array "Non-decreasing Array") +[Next >](../non-decreasing-array "Non-decreasing Array") ## [664. Strange Printer (Hard)](https://leetcode.com/problems/strange-printer "奇怪的打印机") @@ -44,8 +44,8 @@ Given a string consists of lower English letters only, your job is to count the

Hint: Length of the given string will not exceed 100.

### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Remove Boxes](https://github.com/openset/leetcode/tree/master/problems/remove-boxes) (Hard) + 1. [Remove Boxes](../remove-boxes) (Hard) diff --git a/problems/stream-of-characters/README.md b/problems/stream-of-characters/README.md index 6660187fc..bdc0b8a07 100644 --- a/problems/stream-of-characters/README.md +++ b/problems/stream-of-characters/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-sum-of-two-non-overlapping-subarrays "Maximum Sum of Two Non-Overlapping Subarrays") +[< Previous](../maximum-sum-of-two-non-overlapping-subarrays "Maximum Sum of Two Non-Overlapping Subarrays") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/moving-stones-until-consecutive "Moving Stones Until Consecutive") +[Next >](../moving-stones-until-consecutive "Moving Stones Until Consecutive") ## [1032. Stream of Characters (Hard)](https://leetcode.com/problems/stream-of-characters "字符流") @@ -51,7 +51,7 @@ streamChecker.query('l'); // return true, because 'kl' ### Related Topics - [[Trie](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] + [[Trie](../../tag/trie/README.md)] ### Hints
diff --git a/problems/string-compression/README.md b/problems/string-compression/README.md index 3d56b5420..6196df087 100644 --- a/problems/string-compression/README.md +++ b/problems/string-compression/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-all-duplicates-in-an-array "Find All Duplicates in an Array") +[< Previous](../find-all-duplicates-in-an-array "Find All Duplicates in an Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/sequence-reconstruction "Sequence Reconstruction") +[Next >](../sequence-reconstruction "Sequence Reconstruction") ## [443. String Compression (Easy)](https://leetcode.com/problems/string-compression "压缩字符串") @@ -78,12 +78,12 @@ Notice each digit has it's own entry in the array. ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Count and Say](https://github.com/openset/leetcode/tree/master/problems/count-and-say) (Easy) - 1. [Encode and Decode Strings](https://github.com/openset/leetcode/tree/master/problems/encode-and-decode-strings) (Medium) - 1. [Design Compressed String Iterator](https://github.com/openset/leetcode/tree/master/problems/design-compressed-string-iterator) (Easy) + 1. [Count and Say](../count-and-say) (Easy) + 1. [Encode and Decode Strings](../encode-and-decode-strings) (Medium) + 1. [Design Compressed String Iterator](../design-compressed-string-iterator) (Easy) ### Hints
diff --git a/problems/string-to-integer-atoi/README.md b/problems/string-to-integer-atoi/README.md index 1da386664..767154ac4 100644 --- a/problems/string-to-integer-atoi/README.md +++ b/problems/string-to-integer-atoi/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/reverse-integer "Reverse Integer") +[< Previous](../reverse-integer "Reverse Integer") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/palindrome-number "Palindrome Number") +[Next >](../palindrome-number "Palindrome Number") ## [8. String to Integer (atoi) (Medium)](https://leetcode.com/problems/string-to-integer-atoi "字符串转换整数 (atoi)") @@ -69,9 +69,9 @@   Thefore INT_MIN (−231) is returned. ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Math](../../tag/math/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Reverse Integer](https://github.com/openset/leetcode/tree/master/problems/reverse-integer) (Easy) - 1. [Valid Number](https://github.com/openset/leetcode/tree/master/problems/valid-number) (Hard) + 1. [Reverse Integer](../reverse-integer) (Easy) + 1. [Valid Number](../valid-number) (Hard) diff --git a/problems/string-transforms-into-another-string/README.md b/problems/string-transforms-into-another-string/README.md index 28ed4674b..dd1510145 100644 --- a/problems/string-transforms-into-another-string/README.md +++ b/problems/string-transforms-into-another-string/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/analyze-user-website-visit-pattern "Analyze User Website Visit Pattern") +[< Previous](../analyze-user-website-visit-pattern "Analyze User Website Visit Pattern") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/day-of-the-year "Day of the Year") +[Next >](../day-of-the-year "Day of the Year") ## [1153. String Transforms Into Another String (Hard)](https://leetcode.com/problems/string-transforms-into-another-string "字符串转化") @@ -45,7 +45,7 @@ ### Related Topics - [[Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] + [[Graph](../../tag/graph/README.md)] ### Hints
diff --git a/problems/string-without-aaa-or-bbb/README.md b/problems/string-without-aaa-or-bbb/README.md index dd3f88892..a252e92b6 100644 --- a/problems/string-without-aaa-or-bbb/README.md +++ b/problems/string-without-aaa-or-bbb/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-cost-for-tickets "Minimum Cost For Tickets") +[< Previous](../minimum-cost-for-tickets "Minimum Cost For Tickets") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/sum-of-even-numbers-after-queries "Sum of Even Numbers After Queries") +[Next >](../sum-of-even-numbers-after-queries "Sum of Even Numbers After Queries") ## [984. String Without AAA or BBB (Medium)](https://leetcode.com/problems/string-without-aaa-or-bbb "不含 AAA 或 BBB 的字符串") @@ -48,4 +48,4 @@ ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] + [[Greedy](../../tag/greedy/README.md)] diff --git a/problems/strobogrammatic-number-ii/README.md b/problems/strobogrammatic-number-ii/README.md index da4bc8a7d..0cda2663c 100644 --- a/problems/strobogrammatic-number-ii/README.md +++ b/problems/strobogrammatic-number-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number "Strobogrammatic Number") +[< Previous](../strobogrammatic-number "Strobogrammatic Number") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number-iii "Strobogrammatic Number III") +[Next >](../strobogrammatic-number-iii "Strobogrammatic Number III") ## [247. Strobogrammatic Number II (Medium)](https://leetcode.com/problems/strobogrammatic-number-ii "中心对称数 II") @@ -23,12 +23,12 @@ ### Related Topics - [[Recursion](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Recursion](../../tag/recursion/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Strobogrammatic Number](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number) (Easy) - 1. [Strobogrammatic Number III](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number-iii) (Hard) + 1. [Strobogrammatic Number](../strobogrammatic-number) (Easy) + 1. [Strobogrammatic Number III](../strobogrammatic-number-iii) (Hard) ### Hints
diff --git a/problems/strobogrammatic-number-iii/README.md b/problems/strobogrammatic-number-iii/README.md index daa31f714..2372b682c 100644 --- a/problems/strobogrammatic-number-iii/README.md +++ b/problems/strobogrammatic-number-iii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number-ii "Strobogrammatic Number II") +[< Previous](../strobogrammatic-number-ii "Strobogrammatic Number II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/group-shifted-strings "Group Shifted Strings") +[Next >](../group-shifted-strings "Group Shifted Strings") ## [248. Strobogrammatic Number III (Hard)](https://leetcode.com/problems/strobogrammatic-number-iii "中心对称数 III") @@ -26,9 +26,9 @@ Because the range might be a large number, the low and high numbers are represented as string.

### Related Topics - [[Recursion](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Recursion](../../tag/recursion/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Strobogrammatic Number](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number) (Easy) - 1. [Strobogrammatic Number II](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number-ii) (Medium) + 1. [Strobogrammatic Number](../strobogrammatic-number) (Easy) + 1. [Strobogrammatic Number II](../strobogrammatic-number-ii) (Medium) diff --git a/problems/strobogrammatic-number/README.md b/problems/strobogrammatic-number/README.md index 907b40977..4784cec6a 100644 --- a/problems/strobogrammatic-number/README.md +++ b/problems/strobogrammatic-number/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance-iii "Shortest Word Distance III") +[< Previous](../shortest-word-distance-iii "Shortest Word Distance III") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number-ii "Strobogrammatic Number II") +[Next >](../strobogrammatic-number-ii "Strobogrammatic Number II") ## [246. Strobogrammatic Number (Easy)](https://leetcode.com/problems/strobogrammatic-number "中心对称数") @@ -35,10 +35,10 @@ Output: false ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Strobogrammatic Number II](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number-ii) (Medium) - 1. [Strobogrammatic Number III](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number-iii) (Hard) - 1. [Confusing Number](https://github.com/openset/leetcode/tree/master/problems/confusing-number) (Easy) + 1. [Strobogrammatic Number II](../strobogrammatic-number-ii) (Medium) + 1. [Strobogrammatic Number III](../strobogrammatic-number-iii) (Hard) + 1. [Confusing Number](../confusing-number) (Easy) diff --git a/problems/strong-password-checker/README.md b/problems/strong-password-checker/README.md index 39223af92..ec53406d3 100644 --- a/problems/strong-password-checker/README.md +++ b/problems/strong-password-checker/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/battleships-in-a-board "Battleships in a Board") +[< Previous](../battleships-in-a-board "Battleships in a Board") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-xor-of-two-numbers-in-an-array "Maximum XOR of Two Numbers in an Array") +[Next >](../maximum-xor-of-two-numbers-in-an-array "Maximum XOR of Two Numbers in an Array") ## [420. Strong Password Checker (Hard)](https://leetcode.com/problems/strong-password-checker "强密码检验器") diff --git a/problems/student-attendance-record-i/README.md b/problems/student-attendance-record-i/README.md index 2f73371f1..4cc3b0c62 100644 --- a/problems/student-attendance-record-i/README.md +++ b/problems/student-attendance-record-i/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/game-play-analysis-iv "Game Play Analysis IV") +[< Previous](../game-play-analysis-iv "Game Play Analysis IV") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/student-attendance-record-ii "Student Attendance Record II") +[Next >](../student-attendance-record-ii "Student Attendance Record II") ## [551. Student Attendance Record I (Easy)](https://leetcode.com/problems/student-attendance-record-i "学生出勤记录 I") @@ -41,7 +41,7 @@ A student could be rewarded if his attendance record doesn't contain more tha

### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Student Attendance Record II](https://github.com/openset/leetcode/tree/master/problems/student-attendance-record-ii) (Hard) + 1. [Student Attendance Record II](../student-attendance-record-ii) (Hard) diff --git a/problems/student-attendance-record-ii/README.md b/problems/student-attendance-record-ii/README.md index 648fcf229..10ad57c82 100644 --- a/problems/student-attendance-record-ii/README.md +++ b/problems/student-attendance-record-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/student-attendance-record-i "Student Attendance Record I") +[< Previous](../student-attendance-record-i "Student Attendance Record I") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/optimal-division "Optimal Division") +[Next >](../optimal-division "Optimal Division") ## [552. Student Attendance Record II (Hard)](https://leetcode.com/problems/student-attendance-record-ii "学生出勤记录 II") @@ -42,7 +42,7 @@ The value of n won't exceed 100,000.

### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Student Attendance Record I](https://github.com/openset/leetcode/tree/master/problems/student-attendance-record-i) (Easy) + 1. [Student Attendance Record I](../student-attendance-record-i) (Easy) diff --git a/problems/students-and-examinations/README.md b/problems/students-and-examinations/README.md index 9e8f218e8..06b103b4d 100644 --- a/problems/students-and-examinations/README.md +++ b/problems/students-and-examinations/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/traffic-light-controlled-intersection "Traffic Light Controlled Intersection") +[< Previous](../traffic-light-controlled-intersection "Traffic Light Controlled Intersection") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/subtract-the-product-and-sum-of-digits-of-an-integer "Subtract the Product and Sum of Digits of an Integer") +[Next >](../subtract-the-product-and-sum-of-digits-of-an-integer "Subtract the Product and Sum of Digits of an Integer") ## [1280. Students and Examinations (Easy)](https://leetcode.com/problems/students-and-examinations "") diff --git a/problems/students-report-by-geography/README.md b/problems/students-report-by-geography/README.md index 43ca274d5..c7562dcd4 100644 --- a/problems/students-report-by-geography/README.md +++ b/problems/students-report-by-geography/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/merge-two-binary-trees "Merge Two Binary Trees") +[< Previous](../merge-two-binary-trees "Merge Two Binary Trees") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/biggest-single-number "Biggest Single Number") +[Next >](../biggest-single-number "Biggest Single Number") ## [618. Students Report By Geography (Hard)](https://leetcode.com/problems/students-report-by-geography "学生地理信息报告") diff --git a/problems/subarray-product-less-than-k/README.md b/problems/subarray-product-less-than-k/README.md index 08f96ac07..8c3cb96a0 100644 --- a/problems/subarray-product-less-than-k/README.md +++ b/problems/subarray-product-less-than-k/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-ascii-delete-sum-for-two-strings "Minimum ASCII Delete Sum for Two Strings") +[< Previous](../minimum-ascii-delete-sum-for-two-strings "Minimum ASCII Delete Sum for Two Strings") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-with-transaction-fee "Best Time to Buy and Sell Stock with Transaction Fee") +[Next >](../best-time-to-buy-and-sell-stock-with-transaction-fee "Best Time to Buy and Sell Stock with Transaction Fee") ## [713. Subarray Product Less Than K (Medium)](https://leetcode.com/problems/subarray-product-less-than-k "乘积小于K的子数组") @@ -30,14 +30,14 @@ Note that [10, 5, 2] is not included as the product of 100 is not strictly less

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Array](../../tag/array/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] ### Similar Questions - 1. [Maximum Product Subarray](https://github.com/openset/leetcode/tree/master/problems/maximum-product-subarray) (Medium) - 1. [Maximum Size Subarray Sum Equals k](https://github.com/openset/leetcode/tree/master/problems/maximum-size-subarray-sum-equals-k) (Medium) - 1. [Subarray Sum Equals K](https://github.com/openset/leetcode/tree/master/problems/subarray-sum-equals-k) (Medium) - 1. [Two Sum Less Than K](https://github.com/openset/leetcode/tree/master/problems/two-sum-less-than-k) (Easy) + 1. [Maximum Product Subarray](../maximum-product-subarray) (Medium) + 1. [Maximum Size Subarray Sum Equals k](../maximum-size-subarray-sum-equals-k) (Medium) + 1. [Subarray Sum Equals K](../subarray-sum-equals-k) (Medium) + 1. [Two Sum Less Than K](../two-sum-less-than-k) (Easy) ### Hints
diff --git a/problems/subarray-sum-equals-k/README.md b/problems/subarray-sum-equals-k/README.md index 230ad8813..ca30d116a 100644 --- a/problems/subarray-sum-equals-k/README.md +++ b/problems/subarray-sum-equals-k/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-depth-of-n-ary-tree "Maximum Depth of N-ary Tree") +[< Previous](../maximum-depth-of-n-ary-tree "Maximum Depth of N-ary Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/array-partition-i "Array Partition I") +[Next >](../array-partition-i "Array Partition I") ## [560. Subarray Sum Equals K (Medium)](https://leetcode.com/problems/subarray-sum-equals-k "和为K的子数组") @@ -28,15 +28,15 @@

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Array](../../tag/array/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Two Sum](https://github.com/openset/leetcode/tree/master/problems/two-sum) (Easy) - 1. [Continuous Subarray Sum](https://github.com/openset/leetcode/tree/master/problems/continuous-subarray-sum) (Medium) - 1. [Subarray Product Less Than K](https://github.com/openset/leetcode/tree/master/problems/subarray-product-less-than-k) (Medium) - 1. [Find Pivot Index](https://github.com/openset/leetcode/tree/master/problems/find-pivot-index) (Easy) - 1. [Subarray Sums Divisible by K](https://github.com/openset/leetcode/tree/master/problems/subarray-sums-divisible-by-k) (Medium) + 1. [Two Sum](../two-sum) (Easy) + 1. [Continuous Subarray Sum](../continuous-subarray-sum) (Medium) + 1. [Subarray Product Less Than K](../subarray-product-less-than-k) (Medium) + 1. [Find Pivot Index](../find-pivot-index) (Easy) + 1. [Subarray Sums Divisible by K](../subarray-sums-divisible-by-k) (Medium) ### Hints
diff --git a/problems/subarray-sums-divisible-by-k/README.md b/problems/subarray-sums-divisible-by-k/README.md index 52b1a9ca5..3e42f6a1c 100644 --- a/problems/subarray-sums-divisible-by-k/README.md +++ b/problems/subarray-sums-divisible-by-k/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/k-closest-points-to-origin "K Closest Points to Origin") +[< Previous](../k-closest-points-to-origin "K Closest Points to Origin") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/odd-even-jump "Odd Even Jump") +[Next >](../odd-even-jump "Odd Even Jump") ## [974. Subarray Sums Divisible by K (Medium)](https://leetcode.com/problems/subarray-sums-divisible-by-k "和可被 K 整除的子数组") @@ -37,8 +37,8 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Array](../../tag/array/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Subarray Sum Equals K](https://github.com/openset/leetcode/tree/master/problems/subarray-sum-equals-k) (Medium) + 1. [Subarray Sum Equals K](../subarray-sum-equals-k) (Medium) diff --git a/problems/subarrays-with-k-different-integers/README.md b/problems/subarrays-with-k-different-integers/README.md index 1314603bd..0ca5646b9 100644 --- a/problems/subarrays-with-k-different-integers/README.md +++ b/problems/subarrays-with-k-different-integers/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/broken-calculator "Broken Calculator") +[< Previous](../broken-calculator "Broken Calculator") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/cousins-in-binary-tree "Cousins in Binary Tree") +[Next >](../cousins-in-binary-tree "Cousins in Binary Tree") ## [992. Subarrays with K Different Integers (Hard)](https://leetcode.com/problems/subarrays-with-k-different-integers "K 个不同整数的子数组") @@ -46,11 +46,11 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] - [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] + [[Sliding Window](../../tag/sliding-window/README.md)] ### Similar Questions - 1. [Longest Substring Without Repeating Characters](https://github.com/openset/leetcode/tree/master/problems/longest-substring-without-repeating-characters) (Medium) - 1. [Longest Substring with At Most Two Distinct Characters](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-two-distinct-characters) (Medium) - 1. [Longest Substring with At Most K Distinct Characters](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-k-distinct-characters) (Hard) + 1. [Longest Substring Without Repeating Characters](../longest-substring-without-repeating-characters) (Medium) + 1. [Longest Substring with At Most Two Distinct Characters](../longest-substring-with-at-most-two-distinct-characters) (Medium) + 1. [Longest Substring with At Most K Distinct Characters](../longest-substring-with-at-most-k-distinct-characters) (Hard) diff --git a/problems/subdomain-visit-count/README.md b/problems/subdomain-visit-count/README.md index 57737d611..171f9bd4f 100644 --- a/problems/subdomain-visit-count/README.md +++ b/problems/subdomain-visit-count/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/chalkboard-xor-game "Chalkboard XOR Game") +[< Previous](../chalkboard-xor-game "Chalkboard XOR Game") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/largest-triangle-area "Largest Triangle Area") +[Next >](../largest-triangle-area "Largest Triangle Area") ## [811. Subdomain Visit Count (Easy)](https://leetcode.com/problems/subdomain-visit-count "子域名访问计数") @@ -50,4 +50,4 @@ We will visit "google.mail.com" 900 times, "yahoo.com" 50 ti ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] diff --git a/problems/subsets-ii/README.md b/problems/subsets-ii/README.md index c3618f956..42c17dd50 100644 --- a/problems/subsets-ii/README.md +++ b/problems/subsets-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/gray-code "Gray Code") +[< Previous](../gray-code "Gray Code") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/decode-ways "Decode Ways") +[Next >](../decode-ways "Decode Ways") ## [90. Subsets II (Medium)](https://leetcode.com/problems/subsets-ii "子集 II") @@ -31,8 +31,8 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Array](../../tag/array/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Subsets](https://github.com/openset/leetcode/tree/master/problems/subsets) (Medium) + 1. [Subsets](../subsets) (Medium) diff --git a/problems/subsets/README.md b/problems/subsets/README.md index ca45e5c79..de74d43be 100644 --- a/problems/subsets/README.md +++ b/problems/subsets/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/combinations "Combinations") +[< Previous](../combinations "Combinations") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/word-search "Word Search") +[Next >](../word-search "Word Search") ## [78. Subsets (Medium)](https://leetcode.com/problems/subsets "子集") @@ -32,11 +32,11 @@ ] ### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] + [[Array](../../tag/array/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Subsets II](https://github.com/openset/leetcode/tree/master/problems/subsets-ii) (Medium) - 1. [Generalized Abbreviation](https://github.com/openset/leetcode/tree/master/problems/generalized-abbreviation) (Medium) - 1. [Letter Case Permutation](https://github.com/openset/leetcode/tree/master/problems/letter-case-permutation) (Easy) + 1. [Subsets II](../subsets-ii) (Medium) + 1. [Generalized Abbreviation](../generalized-abbreviation) (Medium) + 1. [Letter Case Permutation](../letter-case-permutation) (Easy) diff --git a/problems/substring-with-concatenation-of-all-words/README.md b/problems/substring-with-concatenation-of-all-words/README.md index ecbe77f62..960c8ec8c 100644 --- a/problems/substring-with-concatenation-of-all-words/README.md +++ b/problems/substring-with-concatenation-of-all-words/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/divide-two-integers "Divide Two Integers") +[< Previous](../divide-two-integers "Divide Two Integers") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/next-permutation "Next Permutation") +[Next >](../next-permutation "Next Permutation") ## [30. Substring with Concatenation of All Words (Hard)](https://leetcode.com/problems/substring-with-concatenation-of-all-words "串联所有单词的子串") @@ -34,9 +34,9 @@ The output order does not matter, returning [9,0] is fine too. ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Minimum Window Substring](https://github.com/openset/leetcode/tree/master/problems/minimum-window-substring) (Hard) + 1. [Minimum Window Substring](../minimum-window-substring) (Hard) diff --git a/problems/subtract-the-product-and-sum-of-digits-of-an-integer/README.md b/problems/subtract-the-product-and-sum-of-digits-of-an-integer/README.md index d39edd388..e4546b616 100644 --- a/problems/subtract-the-product-and-sum-of-digits-of-an-integer/README.md +++ b/problems/subtract-the-product-and-sum-of-digits-of-an-integer/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/students-and-examinations "Students and Examinations") +[< Previous](../students-and-examinations "Students and Examinations") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/group-the-people-given-the-group-size-they-belong-to "Group the People Given the Group Size They Belong To") +[Next >](../group-the-people-given-the-group-size-they-belong-to "Group the People Given the Group Size They Belong To") ## [1281. Subtract the Product and Sum of Digits of an Integer (Easy)](https://leetcode.com/problems/subtract-the-product-and-sum-of-digits-of-an-integer "整数的各位积和之差") @@ -43,7 +43,7 @@ Result = 32 - 11 = 21 ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Hints
diff --git a/problems/subtree-of-another-tree/README.md b/problems/subtree-of-another-tree/README.md index 7132dfd0e..6135f27a0 100644 --- a/problems/subtree-of-another-tree/README.md +++ b/problems/subtree-of-another-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-median-given-frequency-of-numbers "Find Median Given Frequency of Numbers") +[< Previous](../find-median-given-frequency-of-numbers "Find Median Given Frequency of Numbers") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/squirrel-simulation "Squirrel Simulation") +[Next >](../squirrel-simulation "Squirrel Simulation") ## [572. Subtree of Another Tree (Easy)](https://leetcode.com/problems/subtree-of-another-tree "另一个树的子树") @@ -56,11 +56,11 @@ Return false.

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] ### Similar Questions - 1. [Count Univalue Subtrees](https://github.com/openset/leetcode/tree/master/problems/count-univalue-subtrees) (Medium) - 1. [Most Frequent Subtree Sum](https://github.com/openset/leetcode/tree/master/problems/most-frequent-subtree-sum) (Medium) + 1. [Count Univalue Subtrees](../count-univalue-subtrees) (Medium) + 1. [Most Frequent Subtree Sum](../most-frequent-subtree-sum) (Medium) ### Hints
diff --git a/problems/sudoku-solver/README.md b/problems/sudoku-solver/README.md index 1f9f36c27..a1e6c8ae4 100644 --- a/problems/sudoku-solver/README.md +++ b/problems/sudoku-solver/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/valid-sudoku "Valid Sudoku") +[< Previous](../valid-sudoku "Valid Sudoku") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/count-and-say "Count and Say") +[Next >](../count-and-say "Count and Say") ## [37. Sudoku Solver (Hard)](https://leetcode.com/problems/sudoku-solver "解数独") @@ -38,9 +38,9 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Valid Sudoku](https://github.com/openset/leetcode/tree/master/problems/valid-sudoku) (Medium) - 1. [Unique Paths III](https://github.com/openset/leetcode/tree/master/problems/unique-paths-iii) (Hard) + 1. [Valid Sudoku](../valid-sudoku) (Medium) + 1. [Unique Paths III](../unique-paths-iii) (Hard) diff --git a/problems/sum-of-digits-in-the-minimum-number/README.md b/problems/sum-of-digits-in-the-minimum-number/README.md index ea5acf8e3..3fd20a926 100644 --- a/problems/sum-of-digits-in-the-minimum-number/README.md +++ b/problems/sum-of-digits-in-the-minimum-number/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/sales-analysis-iii "Sales Analysis III") +[< Previous](../sales-analysis-iii "Sales Analysis III") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/high-five "High Five") +[Next >](../high-five "High Five") ## [1085. Sum of Digits in the Minimum Number (Easy)](https://leetcode.com/problems/sum-of-digits-in-the-minimum-number "最小元素各数位之和") @@ -45,10 +45,10 @@ The minimal element is 33, and the sum of those digits is S = 3 + 3 = 6 which is ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Add Digits](https://github.com/openset/leetcode/tree/master/problems/add-digits) (Easy) + 1. [Add Digits](../add-digits) (Easy) ### Hints
diff --git a/problems/sum-of-distances-in-tree/README.md b/problems/sum-of-distances-in-tree/README.md index 24003e64d..9798110da 100644 --- a/problems/sum-of-distances-in-tree/README.md +++ b/problems/sum-of-distances-in-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-and-replace-in-string "Find And Replace in String") +[< Previous](../find-and-replace-in-string "Find And Replace in String") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/image-overlap "Image Overlap") +[Next >](../image-overlap "Image Overlap") ## [834. Sum of Distances in Tree (Hard)](https://leetcode.com/problems/sum-of-distances-in-tree "树中距离之和") @@ -36,8 +36,8 @@ equals 1 + 1 + 2 + 2 + 2 = 8. Hence, answer[0] = 8, and so on.

Note: 1 <= N <= 10000

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] ### Similar Questions - 1. [Distribute Coins in Binary Tree](https://github.com/openset/leetcode/tree/master/problems/distribute-coins-in-binary-tree) (Medium) + 1. [Distribute Coins in Binary Tree](../distribute-coins-in-binary-tree) (Medium) diff --git a/problems/sum-of-even-numbers-after-queries/README.md b/problems/sum-of-even-numbers-after-queries/README.md index 7928f30ff..ba86d4305 100644 --- a/problems/sum-of-even-numbers-after-queries/README.md +++ b/problems/sum-of-even-numbers-after-queries/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/string-without-aaa-or-bbb "String Without AAA or BBB") +[< Previous](../string-without-aaa-or-bbb "String Without AAA or BBB") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/interval-list-intersections "Interval List Intersections") +[Next >](../interval-list-intersections "Interval List Intersections") ## [985. Sum of Even Numbers After Queries (Easy)](https://leetcode.com/problems/sum-of-even-numbers-after-queries "查询后的偶数和") @@ -47,4 +47,4 @@ After adding 2 to A[3], the array is [-2,-1,3,6], and the sum of even values is ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] diff --git a/problems/sum-of-left-leaves/README.md b/problems/sum-of-left-leaves/README.md index b9e08cc10..350540eef 100644 --- a/problems/sum-of-left-leaves/README.md +++ b/problems/sum-of-left-leaves/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/frog-jump "Frog Jump") +[< Previous](../frog-jump "Frog Jump") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/convert-a-number-to-hexadecimal "Convert a Number to Hexadecimal") +[Next >](../convert-a-number-to-hexadecimal "Convert a Number to Hexadecimal") ## [404. Sum of Left Leaves (Easy)](https://leetcode.com/problems/sum-of-left-leaves "左叶子之和") @@ -26,4 +26,4 @@ There are two left leaves in the binary tree, with values 9 and 15

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] diff --git a/problems/sum-of-root-to-leaf-binary-numbers/README.md b/problems/sum-of-root-to-leaf-binary-numbers/README.md index 5973095af..acca3d117 100644 --- a/problems/sum-of-root-to-leaf-binary-numbers/README.md +++ b/problems/sum-of-root-to-leaf-binary-numbers/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/remove-outermost-parentheses "Remove Outermost Parentheses") +[< Previous](../remove-outermost-parentheses "Remove Outermost Parentheses") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/camelcase-matching "Camelcase Matching") +[Next >](../camelcase-matching "Camelcase Matching") ## [1022. Sum of Root To Leaf Binary Numbers (Easy)](https://leetcode.com/problems/sum-of-root-to-leaf-binary-numbers "从根到叶的二进制数之和") @@ -40,7 +40,7 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] ### Hints
diff --git a/problems/sum-of-square-numbers/README.md b/problems/sum-of-square-numbers/README.md index b15e6487f..92227ec87 100644 --- a/problems/sum-of-square-numbers/README.md +++ b/problems/sum-of-square-numbers/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/smallest-range-covering-elements-from-k-lists "Smallest Range Covering Elements from K Lists") +[< Previous](../smallest-range-covering-elements-from-k-lists "Smallest Range Covering Elements from K Lists") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-the-derangement-of-an-array "Find the Derangement of An Array") +[Next >](../find-the-derangement-of-an-array "Find the Derangement of An Array") ## [633. Sum of Square Numbers (Easy)](https://leetcode.com/problems/sum-of-square-numbers "平方数之和") @@ -33,7 +33,7 @@

 

### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Valid Perfect Square](https://github.com/openset/leetcode/tree/master/problems/valid-perfect-square) (Easy) + 1. [Valid Perfect Square](../valid-perfect-square) (Easy) diff --git a/problems/sum-of-subarray-minimums/README.md b/problems/sum-of-subarray-minimums/README.md index bd334bc5b..0809c6df5 100644 --- a/problems/sum-of-subarray-minimums/README.md +++ b/problems/sum-of-subarray-minimums/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/super-palindromes "Super Palindromes") +[< Previous](../super-palindromes "Super Palindromes") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/smallest-range-i "Smallest Range I") +[Next >](../smallest-range-i "Smallest Range I") ## [907. Sum of Subarray Minimums (Medium)](https://leetcode.com/problems/sum-of-subarray-minimums "子数组的最小值之和") @@ -39,5 +39,5 @@ Minimums are 3, 1, 2, 4, 1, 1, 2, 1, 1, 1.  Sum is 17. ### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Stack](../../tag/stack/README.md)] + [[Array](../../tag/array/README.md)] diff --git a/problems/sum-of-subsequence-widths/README.md b/problems/sum-of-subsequence-widths/README.md index c09756beb..84cb22159 100644 --- a/problems/sum-of-subsequence-widths/README.md +++ b/problems/sum-of-subsequence-widths/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-and-replace-pattern "Find and Replace Pattern") +[< Previous](../find-and-replace-pattern "Find and Replace Pattern") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/surface-area-of-3d-shapes "Surface Area of 3D Shapes") +[Next >](../surface-area-of-3d-shapes "Surface Area of 3D Shapes") ## [891. Sum of Subsequence Widths (Hard)](https://leetcode.com/problems/sum-of-subsequence-widths "子序列宽度之和") @@ -44,5 +44,5 @@ The sum of these widths is 6. ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Array](../../tag/array/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/sum-of-two-integers/README.md b/problems/sum-of-two-integers/README.md index fb6f1af46..2246f3da4 100644 --- a/problems/sum-of-two-integers/README.md +++ b/problems/sum-of-two-integers/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/range-addition "Range Addition") +[< Previous](../range-addition "Range Addition") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/super-pow "Super Pow") +[Next >](../super-pow "Super Pow") ## [371. Sum of Two Integers (Easy)](https://leetcode.com/problems/sum-of-two-integers "两整数之和") @@ -32,7 +32,7 @@ ### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] ### Similar Questions - 1. [Add Two Numbers](https://github.com/openset/leetcode/tree/master/problems/add-two-numbers) (Medium) + 1. [Add Two Numbers](../add-two-numbers) (Medium) diff --git a/problems/sum-root-to-leaf-numbers/README.md b/problems/sum-root-to-leaf-numbers/README.md index df87bd7a2..b6da1efa5 100644 --- a/problems/sum-root-to-leaf-numbers/README.md +++ b/problems/sum-root-to-leaf-numbers/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/longest-consecutive-sequence "Longest Consecutive Sequence") +[< Previous](../longest-consecutive-sequence "Longest Consecutive Sequence") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/surrounded-regions "Surrounded Regions") +[Next >](../surrounded-regions "Surrounded Regions") ## [129. Sum Root to Leaf Numbers (Medium)](https://leetcode.com/problems/sum-root-to-leaf-numbers "求根到叶子节点数字之和") @@ -49,10 +49,10 @@ The root-to-leaf path 4->0 represents the number 40. Therefore, sum = 495 + 491 + 40 = 1026. ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] ### Similar Questions - 1. [Path Sum](https://github.com/openset/leetcode/tree/master/problems/path-sum) (Easy) - 1. [Binary Tree Maximum Path Sum](https://github.com/openset/leetcode/tree/master/problems/binary-tree-maximum-path-sum) (Hard) - 1. [Smallest String Starting From Leaf](https://github.com/openset/leetcode/tree/master/problems/smallest-string-starting-from-leaf) (Medium) + 1. [Path Sum](../path-sum) (Easy) + 1. [Binary Tree Maximum Path Sum](../binary-tree-maximum-path-sum) (Hard) + 1. [Smallest String Starting From Leaf](../smallest-string-starting-from-leaf) (Medium) diff --git a/problems/summary-ranges/README.md b/problems/summary-ranges/README.md index df0940a9d..89f7fc379 100644 --- a/problems/summary-ranges/README.md +++ b/problems/summary-ranges/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-ii "Basic Calculator II") +[< Previous](../basic-calculator-ii "Basic Calculator II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/majority-element-ii "Majority Element II") +[Next >](../majority-element-ii "Majority Element II") ## [228. Summary Ranges (Medium)](https://leetcode.com/problems/summary-ranges "汇总区间") @@ -30,8 +30,8 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Missing Ranges](https://github.com/openset/leetcode/tree/master/problems/missing-ranges) (Medium) - 1. [Data Stream as Disjoint Intervals](https://github.com/openset/leetcode/tree/master/problems/data-stream-as-disjoint-intervals) (Hard) + 1. [Missing Ranges](../missing-ranges) (Medium) + 1. [Data Stream as Disjoint Intervals](../data-stream-as-disjoint-intervals) (Hard) diff --git a/problems/super-egg-drop/README.md b/problems/super-egg-drop/README.md index ba940f3ab..469a1468f 100644 --- a/problems/super-egg-drop/README.md +++ b/problems/super-egg-drop/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/possible-bipartition "Possible Bipartition") +[< Previous](../possible-bipartition "Possible Bipartition") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/fair-candy-swap "Fair Candy Swap") +[Next >](../fair-candy-swap "Fair Candy Swap") ## [887. Super Egg Drop (Hard)](https://leetcode.com/problems/super-egg-drop "鸡蛋掉落") @@ -70,6 +70,6 @@ Hence, we needed 2 moves in the worst case to know what F is with certainty. ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Math](../../tag/math/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/super-palindromes/README.md b/problems/super-palindromes/README.md index 7c1955310..e472475a6 100644 --- a/problems/super-palindromes/README.md +++ b/problems/super-palindromes/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/sort-array-by-parity "Sort Array By Parity") +[< Previous](../sort-array-by-parity "Sort Array By Parity") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/sum-of-subarray-minimums "Sum of Subarray Minimums") +[Next >](../sum-of-subarray-minimums "Sum of Subarray Minimums") ## [906. Super Palindromes (Hard)](https://leetcode.com/problems/super-palindromes "超级回文数") @@ -41,4 +41,4 @@ Note that 676 is not a superpalindrome: 26 * 26 = 676, but 26 is not a palindrom ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/super-pow/README.md b/problems/super-pow/README.md index dc1f69a72..1002c7117 100644 --- a/problems/super-pow/README.md +++ b/problems/super-pow/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/sum-of-two-integers "Sum of Two Integers") +[< Previous](../sum-of-two-integers "Sum of Two Integers") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-k-pairs-with-smallest-sums "Find K Pairs with Smallest Sums") +[Next >](../find-k-pairs-with-smallest-sums "Find K Pairs with Smallest Sums") ## [372. Super Pow (Medium)](https://leetcode.com/problems/super-pow "超级次方") @@ -32,7 +32,7 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Pow(x, n)](https://github.com/openset/leetcode/tree/master/problems/powx-n) (Medium) + 1. [Pow(x, n)](../powx-n) (Medium) diff --git a/problems/super-ugly-number/README.md b/problems/super-ugly-number/README.md index 2c926a6ea..df2add319 100644 --- a/problems/super-ugly-number/README.md +++ b/problems/super-ugly-number/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/burst-balloons "Burst Balloons") +[< Previous](../burst-balloons "Burst Balloons") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/binary-tree-vertical-order-traversal "Binary Tree Vertical Order Traversal") +[Next >](../binary-tree-vertical-order-traversal "Binary Tree Vertical Order Traversal") ## [313. Super Ugly Number (Medium)](https://leetcode.com/problems/super-ugly-number "超级丑数") @@ -33,8 +33,8 @@ ### Related Topics - [[Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Heap](../../tag/heap/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Ugly Number II](https://github.com/openset/leetcode/tree/master/problems/ugly-number-ii) (Medium) + 1. [Ugly Number II](../ugly-number-ii) (Medium) diff --git a/problems/super-washing-machines/README.md b/problems/super-washing-machines/README.md index 92179b0b7..c0a6b288b 100644 --- a/problems/super-washing-machines/README.md +++ b/problems/super-washing-machines/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/longest-palindromic-subsequence "Longest Palindromic Subsequence") +[< Previous](../longest-palindromic-subsequence "Longest Palindromic Subsequence") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/coin-change-2 "Coin Change 2") +[Next >](../coin-change-2 "Coin Change 2") ## [517. Super Washing Machines (Hard)](https://leetcode.com/problems/super-washing-machines "超级洗衣机") @@ -61,5 +61,5 @@ It's impossible to make all the three washing machines have the same number of d

### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Math](../../tag/math/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/surface-area-of-3d-shapes/README.md b/problems/surface-area-of-3d-shapes/README.md index 333b38b12..ee4fe1698 100644 --- a/problems/surface-area-of-3d-shapes/README.md +++ b/problems/surface-area-of-3d-shapes/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/sum-of-subsequence-widths "Sum of Subsequence Widths") +[< Previous](../sum-of-subsequence-widths "Sum of Subsequence Widths") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/groups-of-special-equivalent-strings "Groups of Special-Equivalent Strings") +[Next >](../groups-of-special-equivalent-strings "Groups of Special-Equivalent Strings") ## [892. Surface Area of 3D Shapes (Easy)](https://leetcode.com/problems/surface-area-of-3d-shapes "三维形体的表面积") @@ -83,5 +83,5 @@ ### Related Topics - [[Geometry](https://github.com/openset/leetcode/tree/master/tag/geometry/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Geometry](../../tag/geometry/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/surrounded-regions/README.md b/problems/surrounded-regions/README.md index 34c2a83d0..0a565a22b 100644 --- a/problems/surrounded-regions/README.md +++ b/problems/surrounded-regions/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/sum-root-to-leaf-numbers "Sum Root to Leaf Numbers") +[< Previous](../sum-root-to-leaf-numbers "Sum Root to Leaf Numbers") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/palindrome-partitioning "Palindrome Partitioning") +[Next >](../palindrome-partitioning "Palindrome Partitioning") ## [130. Surrounded Regions (Medium)](https://leetcode.com/problems/surrounded-regions "被围绕的区域") @@ -38,10 +38,10 @@ X O X X

Surrounded regions shouldn’t be on the border, which means that any 'O' on the border of the board are not flipped to 'X'. Any 'O' that is not on the border and it is not connected to an 'O' on the border will be flipped to 'X'. Two cells are connected if they are adjacent cells connected horizontally or vertically.

### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] - [[Union Find](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] + [[Union Find](../../tag/union-find/README.md)] ### Similar Questions - 1. [Number of Islands](https://github.com/openset/leetcode/tree/master/problems/number-of-islands) (Medium) - 1. [Walls and Gates](https://github.com/openset/leetcode/tree/master/problems/walls-and-gates) (Medium) + 1. [Number of Islands](../number-of-islands) (Medium) + 1. [Walls and Gates](../walls-and-gates) (Medium) diff --git a/problems/swap-adjacent-in-lr-string/README.md b/problems/swap-adjacent-in-lr-string/README.md index 1768b653c..4294ce3c1 100644 --- a/problems/swap-adjacent-in-lr-string/README.md +++ b/problems/swap-adjacent-in-lr-string/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/split-bst "Split BST") +[< Previous](../split-bst "Split BST") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/swim-in-rising-water "Swim in Rising Water") +[Next >](../swim-in-rising-water "Swim in Rising Water") ## [777. Swap Adjacent in LR String (Medium)](https://leetcode.com/problems/swap-adjacent-in-lr-string "在LR字符串中交换相邻字符") @@ -35,7 +35,7 @@ XRLXXRRLX ### Related Topics - [[Brainteaser](https://github.com/openset/leetcode/tree/master/tag/brainteaser/README.md)] + [[Brainteaser](../../tag/brainteaser/README.md)] ### Hints
diff --git a/problems/swap-for-longest-repeated-character-substring/README.md b/problems/swap-for-longest-repeated-character-substring/README.md index f128f05f7..45c14c636 100644 --- a/problems/swap-for-longest-repeated-character-substring/README.md +++ b/problems/swap-for-longest-repeated-character-substring/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/number-of-dice-rolls-with-target-sum "Number of Dice Rolls With Target Sum") +[< Previous](../number-of-dice-rolls-with-target-sum "Number of Dice Rolls With Target Sum") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/online-majority-element-in-subarray "Online Majority Element In Subarray") +[Next >](../online-majority-element-in-subarray "Online Majority Element In Subarray") ## [1156. Swap For Longest Repeated Character Substring (Medium)](https://leetcode.com/problems/swap-for-longest-repeated-character-substring "单字符重复子串的最大长度") @@ -61,7 +61,7 @@ ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Hints
diff --git a/problems/swap-nodes-in-pairs/README.md b/problems/swap-nodes-in-pairs/README.md index b578a5885..096ab636b 100644 --- a/problems/swap-nodes-in-pairs/README.md +++ b/problems/swap-nodes-in-pairs/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/merge-k-sorted-lists "Merge k Sorted Lists") +[< Previous](../merge-k-sorted-lists "Merge k Sorted Lists") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/reverse-nodes-in-k-group "Reverse Nodes in k-Group") +[Next >](../reverse-nodes-in-k-group "Reverse Nodes in k-Group") ## [24. Swap Nodes in Pairs (Medium)](https://leetcode.com/problems/swap-nodes-in-pairs "两两交换链表中的节点") @@ -24,7 +24,7 @@ Given 1->2->3->4, you should return the list as 2-&g ### Related Topics - [[Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] + [[Linked List](../../tag/linked-list/README.md)] ### Similar Questions - 1. [Reverse Nodes in k-Group](https://github.com/openset/leetcode/tree/master/problems/reverse-nodes-in-k-group) (Hard) + 1. [Reverse Nodes in k-Group](../reverse-nodes-in-k-group) (Hard) diff --git a/problems/swap-salary/README.md b/problems/swap-salary/README.md index 9d3220c92..7b1d08c64 100644 --- a/problems/swap-salary/README.md +++ b/problems/swap-salary/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/exchange-seats "Exchange Seats") +[< Previous](../exchange-seats "Exchange Seats") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-product-of-three-numbers "Maximum Product of Three Numbers") +[Next >](../maximum-product-of-three-numbers "Maximum Product of Three Numbers") ## [627. Swap Salary (Easy)](https://leetcode.com/problems/swap-salary "交换工资") diff --git a/problems/swim-in-rising-water/README.md b/problems/swim-in-rising-water/README.md index 583325f02..cb0e65a99 100644 --- a/problems/swim-in-rising-water/README.md +++ b/problems/swim-in-rising-water/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/swap-adjacent-in-lr-string "Swap Adjacent in LR String") +[< Previous](../swap-adjacent-in-lr-string "Swap Adjacent in LR String") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/k-th-symbol-in-grammar "K-th Symbol in Grammar") +[Next >](../k-th-symbol-in-grammar "K-th Symbol in Grammar") ## [778. Swim in Rising Water (Hard)](https://leetcode.com/problems/swim-in-rising-water "水位上升的泳池中游泳") @@ -54,10 +54,10 @@ We need to wait until time 16 so that (0, 0) and (4, 4) are connected. ### Related Topics - [[Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Union Find](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Heap](../../tag/heap/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Union Find](../../tag/union-find/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Hints
diff --git a/problems/symmetric-tree/README.md b/problems/symmetric-tree/README.md index 98c856b9d..f3ddf815e 100644 --- a/problems/symmetric-tree/README.md +++ b/problems/symmetric-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/same-tree "Same Tree") +[< Previous](../same-tree "Same Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/binary-tree-level-order-traversal "Binary Tree Level Order Traversal") +[Next >](../binary-tree-level-order-traversal "Binary Tree Level Order Traversal") ## [101. Symmetric Tree (Easy)](https://leetcode.com/problems/symmetric-tree "对称二叉树") @@ -41,6 +41,6 @@ Bonus points if you could solve it both recursively and iteratively.

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] diff --git a/problems/synonymous-sentences/README.md b/problems/synonymous-sentences/README.md index 4c160667c..43d71fe59 100644 --- a/problems/synonymous-sentences/README.md +++ b/problems/synonymous-sentences/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/smallest-common-region "Smallest Common Region") +[< Previous](../smallest-common-region "Smallest Common Region") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/handshakes-that-dont-cross "Handshakes That Don't Cross") +[Next >](../handshakes-that-dont-cross "Handshakes That Don't Cross") ## [1258. Synonymous Sentences (Medium)](https://leetcode.com/problems/synonymous-sentences "近义词句子") @@ -40,7 +40,7 @@ text = "I am happy today but was sad yesterday" ### Related Topics - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Hints
diff --git a/problems/tag-validator/README.md b/problems/tag-validator/README.md index da97f1dd4..fba46fb64 100644 --- a/problems/tag-validator/README.md +++ b/problems/tag-validator/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-postorder-traversal "N-ary Tree Postorder Traversal") +[< Previous](../n-ary-tree-postorder-traversal "N-ary Tree Postorder Traversal") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/fraction-addition-and-subtraction "Fraction Addition and Subtraction") +[Next >](../fraction-addition-and-subtraction "Fraction Addition and Subtraction") ## [591. Tag Validator (Hard)](https://leetcode.com/problems/tag-validator "标签验证器") @@ -79,8 +79,8 @@ The reason why cdata is NOT "<![CDATA[<div>]>]]>]]>" is because of

### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Stack](../../tag/stack/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Add Bold Tag in String](https://github.com/openset/leetcode/tree/master/problems/add-bold-tag-in-string) (Medium) + 1. [Add Bold Tag in String](../add-bold-tag-in-string) (Medium) diff --git a/problems/tallest-billboard/README.md b/problems/tallest-billboard/README.md index e2fe5b01b..b679a03ce 100644 --- a/problems/tallest-billboard/README.md +++ b/problems/tallest-billboard/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/delete-columns-to-make-sorted-ii "Delete Columns to Make Sorted II") +[< Previous](../delete-columns-to-make-sorted-ii "Delete Columns to Make Sorted II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/prison-cells-after-n-days "Prison Cells After N Days") +[Next >](../prison-cells-after-n-days "Prison Cells After N Days") ## [956. Tallest Billboard (Hard)](https://leetcode.com/problems/tallest-billboard "最高的广告牌") @@ -58,4 +58,4 @@ ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/target-sum/README.md b/problems/target-sum/README.md index 79e033662..05d61081c 100644 --- a/problems/target-sum/README.md +++ b/problems/target-sum/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/reverse-pairs "Reverse Pairs") +[< Previous](../reverse-pairs "Reverse Pairs") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/teemo-attacking "Teemo Attacking") +[Next >](../teemo-attacking "Teemo Attacking") ## [494. Target Sum (Medium)](https://leetcode.com/problems/target-sum "目标和") @@ -43,8 +43,8 @@ There are 5 ways to assign symbols to make the sum of nums be target 3.

### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Expression Add Operators](https://github.com/openset/leetcode/tree/master/problems/expression-add-operators) (Hard) + 1. [Expression Add Operators](../expression-add-operators) (Hard) diff --git a/problems/task-scheduler/README.md b/problems/task-scheduler/README.md index 52f985e36..850176dde 100644 --- a/problems/task-scheduler/README.md +++ b/problems/task-scheduler/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/not-boring-movies "Not Boring Movies") +[< Previous](../not-boring-movies "Not Boring Movies") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/design-circular-queue "Design Circular Queue") +[Next >](../design-circular-queue "Design Circular Queue") ## [621. Task Scheduler (Medium)](https://leetcode.com/problems/task-scheduler "任务调度器") @@ -37,10 +37,10 @@ ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[Queue](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[Queue](../../tag/queue/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Rearrange String k Distance Apart](https://github.com/openset/leetcode/tree/master/problems/rearrange-string-k-distance-apart) (Hard) - 1. [Reorganize String](https://github.com/openset/leetcode/tree/master/problems/reorganize-string) (Medium) + 1. [Rearrange String k Distance Apart](../rearrange-string-k-distance-apart) (Hard) + 1. [Reorganize String](../reorganize-string) (Medium) diff --git a/problems/team-scores-in-football-tournament/README.md b/problems/team-scores-in-football-tournament/README.md index d4152785d..b2540c4ef 100644 --- a/problems/team-scores-in-football-tournament/README.md +++ b/problems/team-scores-in-football-tournament/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/queries-quality-and-percentage "Queries Quality and Percentage") +[< Previous](../queries-quality-and-percentage "Queries Quality and Percentage") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/intersection-of-three-sorted-arrays "Intersection of Three Sorted Arrays") +[Next >](../intersection-of-three-sorted-arrays "Intersection of Three Sorted Arrays") ## [1212. Team Scores in Football Tournament (Medium)](https://leetcode.com/problems/team-scores-in-football-tournament "") diff --git a/problems/teemo-attacking/README.md b/problems/teemo-attacking/README.md index 2d69fc305..fbbd70e3e 100644 --- a/problems/teemo-attacking/README.md +++ b/problems/teemo-attacking/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/target-sum "Target Sum") +[< Previous](../target-sum "Target Sum") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-i "Next Greater Element I") +[Next >](../next-greater-element-i "Next Greater Element I") ## [495. Teemo Attacking (Medium)](https://leetcode.com/problems/teemo-attacking "提莫攻击") @@ -52,9 +52,9 @@ So you finally need to output 3.

 

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Merge Intervals](https://github.com/openset/leetcode/tree/master/problems/merge-intervals) (Medium) - 1. [Can Place Flowers](https://github.com/openset/leetcode/tree/master/problems/can-place-flowers) (Easy) - 1. [Dota2 Senate](https://github.com/openset/leetcode/tree/master/problems/dota2-senate) (Medium) + 1. [Merge Intervals](../merge-intervals) (Medium) + 1. [Can Place Flowers](../can-place-flowers) (Easy) + 1. [Dota2 Senate](../dota2-senate) (Medium) diff --git a/problems/tenth-line/README.md b/problems/tenth-line/README.md index 8ead6d1f4..3b07a0e65 100644 --- a/problems/tenth-line/README.md +++ b/problems/tenth-line/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/transpose-file "Transpose File") +[< Previous](../transpose-file "Transpose File") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/delete-duplicate-emails "Delete Duplicate Emails") +[Next >](../delete-duplicate-emails "Delete Duplicate Emails") ## [195. Tenth Line (Easy)](https://leetcode.com/problems/tenth-line "第十行") diff --git a/problems/ternary-expression-parser/README.md b/problems/ternary-expression-parser/README.md index 6bb2facb1..2a4a1a0fd 100644 --- a/problems/ternary-expression-parser/README.md +++ b/problems/ternary-expression-parser/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-all-anagrams-in-a-string "Find All Anagrams in a String") +[< Previous](../find-all-anagrams-in-a-string "Find All Anagrams in a String") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/k-th-smallest-in-lexicographical-order "K-th Smallest in Lexicographical Order") +[Next >](../k-th-smallest-in-lexicographical-order "K-th Smallest in Lexicographical Order") ## [439. Ternary Expression Parser (Medium)](https://leetcode.com/problems/ternary-expression-parser "三元表达式解析器") @@ -65,10 +65,10 @@

### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Stack](../../tag/stack/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] ### Similar Questions - 1. [Mini Parser](https://github.com/openset/leetcode/tree/master/problems/mini-parser) (Medium) - 1. [Remove Comments](https://github.com/openset/leetcode/tree/master/problems/remove-comments) (Medium) - 1. [Parse Lisp Expression](https://github.com/openset/leetcode/tree/master/problems/parse-lisp-expression) (Hard) + 1. [Mini Parser](../mini-parser) (Medium) + 1. [Remove Comments](../remove-comments) (Medium) + 1. [Parse Lisp Expression](../parse-lisp-expression) (Hard) diff --git a/problems/text-justification/README.md b/problems/text-justification/README.md index d767346df..d86a652d8 100644 --- a/problems/text-justification/README.md +++ b/problems/text-justification/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/add-binary "Add Binary") +[< Previous](../add-binary "Add Binary") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/sqrtx "Sqrt(x)") +[Next >](../sqrtx "Sqrt(x)") ## [68. Text Justification (Hard)](https://leetcode.com/problems/text-justification "文本左右对齐") @@ -77,4 +77,4 @@ maxWidth = 20 ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/the-dining-philosophers/README.md b/problems/the-dining-philosophers/README.md index 69093ccf2..c3718c5ca 100644 --- a/problems/the-dining-philosophers/README.md +++ b/problems/the-dining-philosophers/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/report-contiguous-dates "Report Contiguous Dates") +[< Previous](../report-contiguous-dates "Report Contiguous Dates") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/airplane-seat-assignment-probability "Airplane Seat Assignment Probability") +[Next >](../airplane-seat-assignment-probability "Airplane Seat Assignment Probability") ## [1226. The Dining Philosophers (Medium)](https://leetcode.com/problems/the-dining-philosophers "哲学家进餐") diff --git a/problems/the-earliest-moment-when-everyone-become-friends/README.md b/problems/the-earliest-moment-when-everyone-become-friends/README.md index ad6fc9f2f..555bde857 100644 --- a/problems/the-earliest-moment-when-everyone-become-friends/README.md +++ b/problems/the-earliest-moment-when-everyone-become-friends/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-k-length-substrings-with-no-repeated-characters "Find K-Length Substrings With No Repeated Characters") +[< Previous](../find-k-length-substrings-with-no-repeated-characters "Find K-Length Substrings With No Repeated Characters") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/path-with-maximum-minimum-value "Path With Maximum Minimum Value") +[Next >](../path-with-maximum-minimum-value "Path With Maximum Minimum Value") ## [1101. The Earliest Moment When Everyone Become Friends (Medium)](https://leetcode.com/problems/the-earliest-moment-when-everyone-become-friends "彼此熟识的最早时间") @@ -52,10 +52,10 @@ The sixth event occurs at timestamp = 20190301 and after 0 and 3 become friends ### Related Topics - [[Union Find](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] + [[Union Find](../../tag/union-find/README.md)] ### Similar Questions - 1. [Friend Circles](https://github.com/openset/leetcode/tree/master/problems/friend-circles) (Medium) + 1. [Friend Circles](../friend-circles) (Medium) ### Hints
diff --git a/problems/the-maze-ii/README.md b/problems/the-maze-ii/README.md index 51e8d2bd0..9f26c256a 100644 --- a/problems/the-maze-ii/README.md +++ b/problems/the-maze-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/base-7 "Base 7") +[< Previous](../base-7 "Base 7") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/relative-ranks "Relative Ranks") +[Next >](../relative-ranks "Relative Ranks") ## [505. The Maze II (Medium)](https://leetcode.com/problems/the-maze-ii "迷宫 II") @@ -70,9 +70,9 @@ ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] ### Similar Questions - 1. [The Maze](https://github.com/openset/leetcode/tree/master/problems/the-maze) (Medium) - 1. [The Maze III](https://github.com/openset/leetcode/tree/master/problems/the-maze-iii) (Hard) + 1. [The Maze](../the-maze) (Medium) + 1. [The Maze III](../the-maze-iii) (Hard) diff --git a/problems/the-maze-iii/README.md b/problems/the-maze-iii/README.md index 85c7c3cf1..7be1d3db1 100644 --- a/problems/the-maze-iii/README.md +++ b/problems/the-maze-iii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/diagonal-traverse "Diagonal Traverse") +[< Previous](../diagonal-traverse "Diagonal Traverse") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/keyboard-row "Keyboard Row") +[Next >](../keyboard-row "Keyboard Row") ## [499. The Maze III (Hard)](https://leetcode.com/problems/the-maze-iii "迷宫 III") @@ -74,9 +74,9 @@ Both ways have shortest distance 6, but the first way is lexicographically small ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] ### Similar Questions - 1. [The Maze](https://github.com/openset/leetcode/tree/master/problems/the-maze) (Medium) - 1. [The Maze II](https://github.com/openset/leetcode/tree/master/problems/the-maze-ii) (Medium) + 1. [The Maze](../the-maze) (Medium) + 1. [The Maze II](../the-maze-ii) (Medium) diff --git a/problems/the-maze/README.md b/problems/the-maze/README.md index 354fea1be..2086ae8c2 100644 --- a/problems/the-maze/README.md +++ b/problems/the-maze/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/robot-room-cleaner "Robot Room Cleaner") +[< Previous](../robot-room-cleaner "Robot Room Cleaner") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/increasing-subsequences "Increasing Subsequences") +[Next >](../increasing-subsequences "Increasing Subsequences") ## [490. The Maze (Medium)](https://leetcode.com/problems/the-maze "迷宫") @@ -69,9 +69,9 @@ ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] ### Similar Questions - 1. [The Maze III](https://github.com/openset/leetcode/tree/master/problems/the-maze-iii) (Hard) - 1. [The Maze II](https://github.com/openset/leetcode/tree/master/problems/the-maze-ii) (Medium) + 1. [The Maze III](../the-maze-iii) (Hard) + 1. [The Maze II](../the-maze-ii) (Medium) diff --git a/problems/the-skyline-problem/README.md b/problems/the-skyline-problem/README.md index 04395608d..93add4fcd 100644 --- a/problems/the-skyline-problem/README.md +++ b/problems/the-skyline-problem/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate "Contains Duplicate") +[< Previous](../contains-duplicate "Contains Duplicate") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate-ii "Contains Duplicate II") +[Next >](../contains-duplicate-ii "Contains Duplicate II") ## [218. The Skyline Problem (Hard)](https://leetcode.com/problems/the-skyline-problem "天际线问题") @@ -32,11 +32,11 @@ ### Related Topics - [[Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] - [[Binary Indexed Tree](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] - [[Segment Tree](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] - [[Divide and Conquer](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] - [[Line Sweep](https://github.com/openset/leetcode/tree/master/tag/line-sweep/README.md)] + [[Heap](../../tag/heap/README.md)] + [[Binary Indexed Tree](../../tag/binary-indexed-tree/README.md)] + [[Segment Tree](../../tag/segment-tree/README.md)] + [[Divide and Conquer](../../tag/divide-and-conquer/README.md)] + [[Line Sweep](../../tag/line-sweep/README.md)] ### Similar Questions - 1. [Falling Squares](https://github.com/openset/leetcode/tree/master/problems/falling-squares) (Hard) + 1. [Falling Squares](../falling-squares) (Hard) diff --git a/problems/third-maximum-number/README.md b/problems/third-maximum-number/README.md index 356f94be2..e9f44de98 100644 --- a/problems/third-maximum-number/README.md +++ b/problems/third-maximum-number/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/arithmetic-slices "Arithmetic Slices") +[< Previous](../arithmetic-slices "Arithmetic Slices") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/add-strings "Add Strings") +[Next >](../add-strings "Add Strings") ## [414. Third Maximum Number (Easy)](https://leetcode.com/problems/third-maximum-number "第三大的数") @@ -45,7 +45,7 @@ Both numbers with value 2 are both considered as second maximum.

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Kth Largest Element in an Array](https://github.com/openset/leetcode/tree/master/problems/kth-largest-element-in-an-array) (Medium) + 1. [Kth Largest Element in an Array](../kth-largest-element-in-an-array) (Medium) diff --git a/problems/three-equal-parts/README.md b/problems/three-equal-parts/README.md index 318af4cb7..1996c733e 100644 --- a/problems/three-equal-parts/README.md +++ b/problems/three-equal-parts/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/flip-string-to-monotone-increasing "Flip String to Monotone Increasing") +[< Previous](../flip-string-to-monotone-increasing "Flip String to Monotone Increasing") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimize-malware-spread-ii "Minimize Malware Spread II") +[Next >](../minimize-malware-spread-ii "Minimize Malware Spread II") ## [927. Three Equal Parts (Hard)](https://leetcode.com/problems/three-equal-parts "三等分") @@ -57,6 +57,6 @@ ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[Math](../../tag/math/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] diff --git a/problems/tiling-a-rectangle-with-the-fewest-squares/README.md b/problems/tiling-a-rectangle-with-the-fewest-squares/README.md index bd4b0ae3b..2491a536b 100644 --- a/problems/tiling-a-rectangle-with-the-fewest-squares/README.md +++ b/problems/tiling-a-rectangle-with-the-fewest-squares/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-length-of-a-concatenated-string-with-unique-characters "Maximum Length of a Concatenated String with Unique Characters") +[< Previous](../maximum-length-of-a-concatenated-string-with-unique-characters "Maximum Length of a Concatenated String with Unique Characters") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-comments-per-post "Number of Comments per Post") +[Next >](../number-of-comments-per-post "Number of Comments per Post") ## [1240. Tiling a Rectangle with the Fewest Squares (Hard)](https://leetcode.com/problems/tiling-a-rectangle-with-the-fewest-squares "铺瓷砖") @@ -52,8 +52,8 @@ ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Hints
diff --git a/problems/time-based-key-value-store/README.md b/problems/time-based-key-value-store/README.md index fd44094a2..bb0d03f42 100644 --- a/problems/time-based-key-value-store/README.md +++ b/problems/time-based-key-value-store/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/unique-paths-iii "Unique Paths III") +[< Previous](../unique-paths-iii "Unique Paths III") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/triples-with-bitwise-and-equal-to-zero "Triples with Bitwise AND Equal To Zero") +[Next >](../triples-with-bitwise-and-equal-to-zero "Triples with Bitwise AND Equal To Zero") ## [981. Time Based Key-Value Store (Medium)](https://leetcode.com/problems/time-based-key-value-store "基于时间的键值存储") @@ -69,5 +69,5 @@ kv.get("foo", 5); //output "bar2"   ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] diff --git a/problems/to-lower-case/README.md b/problems/to-lower-case/README.md index 0cd4e359e..de7ab7125 100644 --- a/problems/to-lower-case/README.md +++ b/problems/to-lower-case/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/insert-into-a-sorted-circular-linked-list "Insert into a Sorted Circular Linked List") +[< Previous](../insert-into-a-sorted-circular-linked-list "Insert into a Sorted Circular Linked List") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/random-pick-with-blacklist "Random Pick with Blacklist") +[Next >](../random-pick-with-blacklist "Random Pick with Blacklist") ## [709. To Lower Case (Easy)](https://leetcode.com/problems/to-lower-case "转换成小写字母") @@ -43,7 +43,7 @@ ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Hints
diff --git a/problems/toeplitz-matrix/README.md b/problems/toeplitz-matrix/README.md index 1d3efbdc2..a3f337771 100644 --- a/problems/toeplitz-matrix/README.md +++ b/problems/toeplitz-matrix/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/couples-holding-hands "Couples Holding Hands") +[< Previous](../couples-holding-hands "Couples Holding Hands") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/reorganize-string "Reorganize String") +[Next >](../reorganize-string "Reorganize String") ## [766. Toeplitz Matrix (Easy)](https://leetcode.com/problems/toeplitz-matrix "托普利茨矩阵") @@ -63,10 +63,10 @@ The diagonal "[1, 2]" has different elements. ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Valid Word Square](https://github.com/openset/leetcode/tree/master/problems/valid-word-square) (Easy) + 1. [Valid Word Square](../valid-word-square) (Easy) ### Hints
diff --git a/problems/top-k-frequent-elements/README.md b/problems/top-k-frequent-elements/README.md index c764fd708..50a0ec65b 100644 --- a/problems/top-k-frequent-elements/README.md +++ b/problems/top-k-frequent-elements/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/moving-average-from-data-stream "Moving Average from Data Stream") +[< Previous](../moving-average-from-data-stream "Moving Average from Data Stream") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/design-tic-tac-toe "Design Tic-Tac-Toe") +[Next >](../design-tic-tac-toe "Design Tic-Tac-Toe") ## [347. Top K Frequent Elements (Medium)](https://leetcode.com/problems/top-k-frequent-elements "前 K 个高频元素") @@ -36,13 +36,13 @@ ### Related Topics - [[Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Heap](../../tag/heap/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Word Frequency](https://github.com/openset/leetcode/tree/master/problems/word-frequency) (Medium) - 1. [Kth Largest Element in an Array](https://github.com/openset/leetcode/tree/master/problems/kth-largest-element-in-an-array) (Medium) - 1. [Sort Characters By Frequency](https://github.com/openset/leetcode/tree/master/problems/sort-characters-by-frequency) (Medium) - 1. [Split Array into Consecutive Subsequences](https://github.com/openset/leetcode/tree/master/problems/split-array-into-consecutive-subsequences) (Medium) - 1. [Top K Frequent Words](https://github.com/openset/leetcode/tree/master/problems/top-k-frequent-words) (Medium) - 1. [K Closest Points to Origin](https://github.com/openset/leetcode/tree/master/problems/k-closest-points-to-origin) (Medium) + 1. [Word Frequency](../word-frequency) (Medium) + 1. [Kth Largest Element in an Array](../kth-largest-element-in-an-array) (Medium) + 1. [Sort Characters By Frequency](../sort-characters-by-frequency) (Medium) + 1. [Split Array into Consecutive Subsequences](../split-array-into-consecutive-subsequences) (Medium) + 1. [Top K Frequent Words](../top-k-frequent-words) (Medium) + 1. [K Closest Points to Origin](../k-closest-points-to-origin) (Medium) diff --git a/problems/top-k-frequent-words/README.md b/problems/top-k-frequent-words/README.md index 80d9e4b73..6cf53e341 100644 --- a/problems/top-k-frequent-words/README.md +++ b/problems/top-k-frequent-words/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/stickers-to-spell-word "Stickers to Spell Word") +[< Previous](../stickers-to-spell-word "Stickers to Spell Word") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/binary-number-with-alternating-bits "Binary Number with Alternating Bits") +[Next >](../binary-number-with-alternating-bits "Binary Number with Alternating Bits") ## [692. Top K Frequent Words (Medium)](https://leetcode.com/problems/top-k-frequent-words "前K个高频单词") @@ -46,10 +46,10 @@

### Related Topics - [[Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] - [[Trie](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Heap](../../tag/heap/README.md)] + [[Trie](../../tag/trie/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Top K Frequent Elements](https://github.com/openset/leetcode/tree/master/problems/top-k-frequent-elements) (Medium) - 1. [K Closest Points to Origin](https://github.com/openset/leetcode/tree/master/problems/k-closest-points-to-origin) (Medium) + 1. [Top K Frequent Elements](../top-k-frequent-elements) (Medium) + 1. [K Closest Points to Origin](../k-closest-points-to-origin) (Medium) diff --git a/problems/toss-strange-coins/README.md b/problems/toss-strange-coins/README.md index 1c1792940..2960a6347 100644 --- a/problems/toss-strange-coins/README.md +++ b/problems/toss-strange-coins/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/meeting-scheduler "Meeting Scheduler") +[< Previous](../meeting-scheduler "Meeting Scheduler") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/divide-chocolate "Divide Chocolate") +[Next >](../divide-chocolate "Divide Chocolate") ## [1230. Toss Strange Coins (Medium)](https://leetcode.com/problems/toss-strange-coins "抛掷硬币") @@ -34,8 +34,8 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Math](../../tag/math/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/total-hamming-distance/README.md b/problems/total-hamming-distance/README.md index e7185bd0b..b233c8d30 100644 --- a/problems/total-hamming-distance/README.md +++ b/problems/total-hamming-distance/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/number-complement "Number Complement") +[< Previous](../number-complement "Number Complement") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/generate-random-point-in-a-circle "Generate Random Point in a Circle") +[Next >](../generate-random-point-in-a-circle "Generate Random Point in a Circle") ## [477. Total Hamming Distance (Medium)](https://leetcode.com/problems/total-hamming-distance "汉明距离总和") @@ -36,7 +36,7 @@ HammingDistance(4, 14) + HammingDistance(4, 2) + HammingDistance(14, 2) = 2 + 2

### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] ### Similar Questions - 1. [Hamming Distance](https://github.com/openset/leetcode/tree/master/problems/hamming-distance) (Easy) + 1. [Hamming Distance](../hamming-distance) (Easy) diff --git a/problems/tournament-winners/README.md b/problems/tournament-winners/README.md index b86a6b650..d7c5485cd 100644 --- a/problems/tournament-winners/README.md +++ b/problems/tournament-winners/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/monthly-transactions-i "Monthly Transactions I") +[< Previous](../monthly-transactions-i "Monthly Transactions I") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/fizz-buzz-multithreaded "Fizz Buzz Multithreaded") +[Next >](../fizz-buzz-multithreaded "Fizz Buzz Multithreaded") ## [1194. Tournament Winners (Hard)](https://leetcode.com/problems/tournament-winners "锦标赛优胜者") diff --git a/problems/traffic-light-controlled-intersection/README.md b/problems/traffic-light-controlled-intersection/README.md index 582b9ae3e..66e92e498 100644 --- a/problems/traffic-light-controlled-intersection/README.md +++ b/problems/traffic-light-controlled-intersection/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/palindrome-partitioning-iii "Palindrome Partitioning III") +[< Previous](../palindrome-partitioning-iii "Palindrome Partitioning III") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/students-and-examinations "Students and Examinations") +[Next >](../students-and-examinations "Students and Examinations") ## [1279. Traffic Light Controlled Intersection (Easy)](https://leetcode.com/problems/traffic-light-controlled-intersection "") diff --git a/problems/transform-to-chessboard/README.md b/problems/transform-to-chessboard/README.md index 933b175da..2b0a8f71b 100644 --- a/problems/transform-to-chessboard/README.md +++ b/problems/transform-to-chessboard/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/rabbits-in-forest "Rabbits in Forest") +[< Previous](../rabbits-in-forest "Rabbits in Forest") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-distance-between-bst-nodes "Minimum Distance Between BST Nodes") +[Next >](../minimum-distance-between-bst-nodes "Minimum Distance Between BST Nodes") ## [782. Transform to Chessboard (Hard)](https://leetcode.com/problems/transform-to-chessboard "变为棋盘") @@ -54,5 +54,5 @@ No matter what sequence of moves you make, you cannot end with a valid chessboar ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Array](../../tag/array/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/transpose-file/README.md b/problems/transpose-file/README.md index 16a82b77f..ec2f0ca36 100644 --- a/problems/transpose-file/README.md +++ b/problems/transpose-file/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/valid-phone-numbers "Valid Phone Numbers") +[< Previous](../valid-phone-numbers "Valid Phone Numbers") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/tenth-line "Tenth Line") +[Next >](../tenth-line "Tenth Line") ## [194. Transpose File (Medium)](https://leetcode.com/problems/transpose-file "转置文件") diff --git a/problems/transpose-matrix/README.md b/problems/transpose-matrix/README.md index aec274fb9..aaf46fee7 100644 --- a/problems/transpose-matrix/README.md +++ b/problems/transpose-matrix/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/prime-palindrome "Prime Palindrome") +[< Previous](../prime-palindrome "Prime Palindrome") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/binary-gap "Binary Gap") +[Next >](../binary-gap "Binary Gap") ## [867. Transpose Matrix (Easy)](https://leetcode.com/problems/transpose-matrix "转置矩阵") @@ -48,7 +48,7 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Hints
diff --git a/problems/trapping-rain-water-ii/README.md b/problems/trapping-rain-water-ii/README.md index e5c39c6c9..93c96ec7b 100644 --- a/problems/trapping-rain-water-ii/README.md +++ b/problems/trapping-rain-water-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/queue-reconstruction-by-height "Queue Reconstruction by Height") +[< Previous](../queue-reconstruction-by-height "Queue Reconstruction by Height") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/valid-word-abbreviation "Valid Word Abbreviation") +[Next >](../valid-word-abbreviation "Valid Word Abbreviation") ## [407. Trapping Rain Water II (Hard)](https://leetcode.com/problems/trapping-rain-water-ii "接雨水 II") @@ -45,8 +45,8 @@ Return 4.

After the rain, water is trapped between the blocks. The total volume of water trapped is 4.

### Related Topics - [[Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Heap](../../tag/heap/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] ### Similar Questions - 1. [Trapping Rain Water](https://github.com/openset/leetcode/tree/master/problems/trapping-rain-water) (Hard) + 1. [Trapping Rain Water](../trapping-rain-water) (Hard) diff --git a/problems/trapping-rain-water/README.md b/problems/trapping-rain-water/README.md index d455b3852..b84d3a3d9 100644 --- a/problems/trapping-rain-water/README.md +++ b/problems/trapping-rain-water/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/first-missing-positive "First Missing Positive") +[< Previous](../first-missing-positive "First Missing Positive") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/multiply-strings "Multiply Strings") +[Next >](../multiply-strings "Multiply Strings") ## [42. Trapping Rain Water (Hard)](https://leetcode.com/problems/trapping-rain-water "接雨水") @@ -23,12 +23,12 @@ Output: 6 ### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Stack](../../tag/stack/README.md)] + [[Array](../../tag/array/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] ### Similar Questions - 1. [Container With Most Water](https://github.com/openset/leetcode/tree/master/problems/container-with-most-water) (Medium) - 1. [Product of Array Except Self](https://github.com/openset/leetcode/tree/master/problems/product-of-array-except-self) (Medium) - 1. [Trapping Rain Water II](https://github.com/openset/leetcode/tree/master/problems/trapping-rain-water-ii) (Hard) - 1. [Pour Water](https://github.com/openset/leetcode/tree/master/problems/pour-water) (Medium) + 1. [Container With Most Water](../container-with-most-water) (Medium) + 1. [Product of Array Except Self](../product-of-array-except-self) (Medium) + 1. [Trapping Rain Water II](../trapping-rain-water-ii) (Hard) + 1. [Pour Water](../pour-water) (Medium) diff --git a/problems/tree-diameter/README.md b/problems/tree-diameter/README.md index 8cacba3e3..d3956a758 100644 --- a/problems/tree-diameter/README.md +++ b/problems/tree-diameter/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/design-a-leaderboard "Design A Leaderboard") +[< Previous](../design-a-leaderboard "Design A Leaderboard") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/palindrome-removal "Palindrome Removal") +[Next >](../palindrome-removal "Palindrome Removal") ## [1245. Tree Diameter (Medium)](https://leetcode.com/problems/tree-diameter "树的直径") @@ -49,9 +49,9 @@ A longest path of the tree is the path 3 - 2 - 1 - 4 - 5. ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] ### Hints
diff --git a/problems/tree-node/README.md b/problems/tree-node/README.md index 2558720cc..287a26c57 100644 --- a/problems/tree-node/README.md +++ b/problems/tree-node/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/sales-person "Sales Person") +[< Previous](../sales-person "Sales Person") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-duplicate-file-in-system "Find Duplicate File in System") +[Next >](../find-duplicate-file-in-system "Find Duplicate File in System") ## [608. Tree Node (Medium)](https://leetcode.com/problems/tree-node "树节点") diff --git a/problems/triangle-judgement/README.md b/problems/triangle-judgement/README.md index 3cf8df017..481277048 100644 --- a/problems/triangle-judgement/README.md +++ b/problems/triangle-judgement/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-duplicate-file-in-system "Find Duplicate File in System") +[< Previous](../find-duplicate-file-in-system "Find Duplicate File in System") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/valid-triangle-number "Valid Triangle Number") +[Next >](../valid-triangle-number "Valid Triangle Number") ## [610. Triangle Judgement (Easy)](https://leetcode.com/problems/triangle-judgement "判断三角形") diff --git a/problems/triangle/README.md b/problems/triangle/README.md index d006de92d..eaf8a2655 100644 --- a/problems/triangle/README.md +++ b/problems/triangle/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/pascals-triangle-ii "Pascal's Triangle II") +[< Previous](../pascals-triangle-ii "Pascal's Triangle II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock "Best Time to Buy and Sell Stock") +[Next >](../best-time-to-buy-and-sell-stock "Best Time to Buy and Sell Stock") ## [120. Triangle (Medium)](https://leetcode.com/problems/triangle "三角形最小路径和") @@ -31,5 +31,5 @@

Bonus point if you are able to do this using only O(n) extra space, where n is the total number of rows in the triangle.

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Array](../../tag/array/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/trim-a-binary-search-tree/README.md b/problems/trim-a-binary-search-tree/README.md index e460820ca..0e8890185 100644 --- a/problems/trim-a-binary-search-tree/README.md +++ b/problems/trim-a-binary-search-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-number-in-multiplication-table "Kth Smallest Number in Multiplication Table") +[< Previous](../kth-smallest-number-in-multiplication-table "Kth Smallest Number in Multiplication Table") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-swap "Maximum Swap") +[Next >](../maximum-swap "Maximum Swap") ## [669. Trim a Binary Search Tree (Easy)](https://leetcode.com/problems/trim-a-binary-search-tree "修剪二叉搜索树") @@ -56,4 +56,4 @@ Given a binary search tree and the lowest and highest boundaries as L ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] diff --git a/problems/triples-with-bitwise-and-equal-to-zero/README.md b/problems/triples-with-bitwise-and-equal-to-zero/README.md index baa0b75a8..062d98753 100644 --- a/problems/triples-with-bitwise-and-equal-to-zero/README.md +++ b/problems/triples-with-bitwise-and-equal-to-zero/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/time-based-key-value-store "Time Based Key-Value Store") +[< Previous](../time-based-key-value-store "Time Based Key-Value Store") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-cost-for-tickets "Minimum Cost For Tickets") +[Next >](../minimum-cost-for-tickets "Minimum Cost For Tickets") ## [982. Triples with Bitwise AND Equal To Zero (Hard)](https://leetcode.com/problems/triples-with-bitwise-and-equal-to-zero "按位与为零的三元组") @@ -52,4 +52,4 @@ ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/trips-and-users/README.md b/problems/trips-and-users/README.md index e55410540..fba9141a1 100644 --- a/problems/trips-and-users/README.md +++ b/problems/trips-and-users/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/graph-valid-tree "Graph Valid Tree") +[< Previous](../graph-valid-tree "Graph Valid Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/ugly-number "Ugly Number") +[Next >](../ugly-number "Ugly Number") ## [262. Trips and Users (Hard)](https://leetcode.com/problems/trips-and-users "行程和用户") diff --git a/problems/two-city-scheduling/README.md b/problems/two-city-scheduling/README.md index 7f5e6c27d..91dab595a 100644 --- a/problems/two-city-scheduling/README.md +++ b/problems/two-city-scheduling/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/recover-a-tree-from-preorder-traversal "Recover a Tree From Preorder Traversal") +[< Previous](../recover-a-tree-from-preorder-traversal "Recover a Tree From Preorder Traversal") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/matrix-cells-in-distance-order "Matrix Cells in Distance Order") +[Next >](../matrix-cells-in-distance-order "Matrix Cells in Distance Order") ## [1029. Two City Scheduling (Easy)](https://leetcode.com/problems/two-city-scheduling "两地调度") @@ -42,4 +42,4 @@ The total minimum cost is 10 + 30 + 50 + 20 = 110 to have half the people interv ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] + [[Greedy](../../tag/greedy/README.md)] diff --git a/problems/two-sum-bsts/README.md b/problems/two-sum-bsts/README.md index 293ac5d8c..85389f582 100644 --- a/problems/two-sum-bsts/README.md +++ b/problems/two-sum-bsts/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/intersection-of-three-sorted-arrays "Intersection of Three Sorted Arrays") +[< Previous](../intersection-of-three-sorted-arrays "Intersection of Three Sorted Arrays") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/stepping-numbers "Stepping Numbers") +[Next >](../stepping-numbers "Stepping Numbers") ## [1214. Two Sum BSTs (Medium)](https://leetcode.com/problems/two-sum-bsts "查找两棵二叉搜索树之和") @@ -45,10 +45,10 @@ ### Related Topics - [[Binary Search Tree](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)] + [[Binary Search Tree](../../tag/binary-search-tree/README.md)] ### Similar Questions - 1. [Two Sum IV - Input is a BST](https://github.com/openset/leetcode/tree/master/problems/two-sum-iv-input-is-a-bst) (Easy) + 1. [Two Sum IV - Input is a BST](../two-sum-iv-input-is-a-bst) (Easy) ### Hints
diff --git a/problems/two-sum-ii-input-array-is-sorted/README.md b/problems/two-sum-ii-input-array-is-sorted/README.md index f1bf17098..89af39b78 100644 --- a/problems/two-sum-ii-input-array-is-sorted/README.md +++ b/problems/two-sum-ii-input-array-is-sorted/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/fraction-to-recurring-decimal "Fraction to Recurring Decimal") +[< Previous](../fraction-to-recurring-decimal "Fraction to Recurring Decimal") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/excel-sheet-column-title "Excel Sheet Column Title") +[Next >](../excel-sheet-column-title "Excel Sheet Column Title") ## [167. Two Sum II - Input array is sorted (Easy)](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted "两数之和 II - 输入有序数组") @@ -30,11 +30,11 @@ Explanation: The sum of 2 and 7 is 9. Therefore index1 = 1, index2 = 2. ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Array](../../tag/array/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [Two Sum](https://github.com/openset/leetcode/tree/master/problems/two-sum) (Easy) - 1. [Two Sum IV - Input is a BST](https://github.com/openset/leetcode/tree/master/problems/two-sum-iv-input-is-a-bst) (Easy) - 1. [Two Sum Less Than K](https://github.com/openset/leetcode/tree/master/problems/two-sum-less-than-k) (Easy) + 1. [Two Sum](../two-sum) (Easy) + 1. [Two Sum IV - Input is a BST](../two-sum-iv-input-is-a-bst) (Easy) + 1. [Two Sum Less Than K](../two-sum-less-than-k) (Easy) diff --git a/problems/two-sum-iii-data-structure-design/README.md b/problems/two-sum-iii-data-structure-design/README.md index bcd04eaed..6f9ad83c8 100644 --- a/problems/two-sum-iii-data-structure-design/README.md +++ b/problems/two-sum-iii-data-structure-design/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/majority-element "Majority Element") +[< Previous](../majority-element "Majority Element") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/excel-sheet-column-number "Excel Sheet Column Number") +[Next >](../excel-sheet-column-number "Excel Sheet Column Number") ## [170. Two Sum III - Data structure design (Easy)](https://leetcode.com/problems/two-sum-iii-data-structure-design "两数之和 III - 数据结构设计") @@ -32,10 +32,10 @@ find(3) -> true find(6) -> false ### Related Topics - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Design](../../tag/design/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Two Sum](https://github.com/openset/leetcode/tree/master/problems/two-sum) (Easy) - 1. [Unique Word Abbreviation](https://github.com/openset/leetcode/tree/master/problems/unique-word-abbreviation) (Medium) - 1. [Two Sum IV - Input is a BST](https://github.com/openset/leetcode/tree/master/problems/two-sum-iv-input-is-a-bst) (Easy) + 1. [Two Sum](../two-sum) (Easy) + 1. [Unique Word Abbreviation](../unique-word-abbreviation) (Medium) + 1. [Two Sum IV - Input is a BST](../two-sum-iv-input-is-a-bst) (Easy) diff --git a/problems/two-sum-iv-input-is-a-bst/README.md b/problems/two-sum-iv-input-is-a-bst/README.md index 081dd6153..17ca798cf 100644 --- a/problems/two-sum-iv-input-is-a-bst/README.md +++ b/problems/two-sum-iv-input-is-a-bst/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-duplicate-subtrees "Find Duplicate Subtrees") +[< Previous](../find-duplicate-subtrees "Find Duplicate Subtrees") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-binary-tree "Maximum Binary Tree") +[Next >](../maximum-binary-tree "Maximum Binary Tree") ## [653. Two Sum IV - Input is a BST (Easy)](https://leetcode.com/problems/two-sum-iv-input-is-a-bst "两数之和 IV - 输入 BST") @@ -48,10 +48,10 @@ Target = 28

 

### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] ### Similar Questions - 1. [Two Sum](https://github.com/openset/leetcode/tree/master/problems/two-sum) (Easy) - 1. [Two Sum II - Input array is sorted](https://github.com/openset/leetcode/tree/master/problems/two-sum-ii-input-array-is-sorted) (Easy) - 1. [Two Sum III - Data structure design](https://github.com/openset/leetcode/tree/master/problems/two-sum-iii-data-structure-design) (Easy) - 1. [Two Sum BSTs](https://github.com/openset/leetcode/tree/master/problems/two-sum-bsts) (Medium) + 1. [Two Sum](../two-sum) (Easy) + 1. [Two Sum II - Input array is sorted](../two-sum-ii-input-array-is-sorted) (Easy) + 1. [Two Sum III - Data structure design](../two-sum-iii-data-structure-design) (Easy) + 1. [Two Sum BSTs](../two-sum-bsts) (Medium) diff --git a/problems/two-sum-less-than-k/README.md b/problems/two-sum-less-than-k/README.md index 2dd7562ab..a45c44a84 100644 --- a/problems/two-sum-less-than-k/README.md +++ b/problems/two-sum-less-than-k/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/unpopular-books "Unpopular Books") +[< Previous](../unpopular-books "Unpopular Books") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-k-length-substrings-with-no-repeated-characters "Find K-Length Substrings With No Repeated Characters") +[Next >](../find-k-length-substrings-with-no-repeated-characters "Find K-Length Substrings With No Repeated Characters") ## [1099. Two Sum Less Than K (Easy)](https://leetcode.com/problems/two-sum-less-than-k "小于 K 的两数之和") @@ -44,13 +44,13 @@ In this case it's not possible to get a pair sum less that 15. ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Two Sum](https://github.com/openset/leetcode/tree/master/problems/two-sum) (Easy) - 1. [Two Sum II - Input array is sorted](https://github.com/openset/leetcode/tree/master/problems/two-sum-ii-input-array-is-sorted) (Easy) - 1. [3Sum Smaller](https://github.com/openset/leetcode/tree/master/problems/3sum-smaller) (Medium) - 1. [Subarray Product Less Than K](https://github.com/openset/leetcode/tree/master/problems/subarray-product-less-than-k) (Medium) + 1. [Two Sum](../two-sum) (Easy) + 1. [Two Sum II - Input array is sorted](../two-sum-ii-input-array-is-sorted) (Easy) + 1. [3Sum Smaller](../3sum-smaller) (Medium) + 1. [Subarray Product Less Than K](../subarray-product-less-than-k) (Medium) ### Hints
diff --git a/problems/two-sum/README.md b/problems/two-sum/README.md index 3e2f47d42..3cf03d834 100644 --- a/problems/two-sum/README.md +++ b/problems/two-sum/README.md @@ -7,7 +7,7 @@ < Previous 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/add-two-numbers "Add Two Numbers") +[Next >](../add-two-numbers "Add Two Numbers") ## [1. Two Sum (Easy)](https://leetcode.com/problems/two-sum "两数之和") @@ -25,17 +25,17 @@ return [0, 1]. ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Array](../../tag/array/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [3Sum](https://github.com/openset/leetcode/tree/master/problems/3sum) (Medium) - 1. [4Sum](https://github.com/openset/leetcode/tree/master/problems/4sum) (Medium) - 1. [Two Sum II - Input array is sorted](https://github.com/openset/leetcode/tree/master/problems/two-sum-ii-input-array-is-sorted) (Easy) - 1. [Two Sum III - Data structure design](https://github.com/openset/leetcode/tree/master/problems/two-sum-iii-data-structure-design) (Easy) - 1. [Subarray Sum Equals K](https://github.com/openset/leetcode/tree/master/problems/subarray-sum-equals-k) (Medium) - 1. [Two Sum IV - Input is a BST](https://github.com/openset/leetcode/tree/master/problems/two-sum-iv-input-is-a-bst) (Easy) - 1. [Two Sum Less Than K](https://github.com/openset/leetcode/tree/master/problems/two-sum-less-than-k) (Easy) + 1. [3Sum](../3sum) (Medium) + 1. [4Sum](../4sum) (Medium) + 1. [Two Sum II - Input array is sorted](../two-sum-ii-input-array-is-sorted) (Easy) + 1. [Two Sum III - Data structure design](../two-sum-iii-data-structure-design) (Easy) + 1. [Subarray Sum Equals K](../subarray-sum-equals-k) (Medium) + 1. [Two Sum IV - Input is a BST](../two-sum-iv-input-is-a-bst) (Easy) + 1. [Two Sum Less Than K](../two-sum-less-than-k) (Easy) ### Hints
diff --git a/problems/ugly-number-ii/README.md b/problems/ugly-number-ii/README.md index 537291cb6..12bc00022 100644 --- a/problems/ugly-number-ii/README.md +++ b/problems/ugly-number-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/ugly-number "Ugly Number") +[< Previous](../ugly-number "Ugly Number") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/paint-house-ii "Paint House II") +[Next >](../paint-house-ii "Paint House II") ## [264. Ugly Number II (Medium)](https://leetcode.com/problems/ugly-number-ii "丑数 II") @@ -30,16 +30,16 @@ ### Related Topics - [[Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Heap](../../tag/heap/README.md)] + [[Math](../../tag/math/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Merge k Sorted Lists](https://github.com/openset/leetcode/tree/master/problems/merge-k-sorted-lists) (Hard) - 1. [Count Primes](https://github.com/openset/leetcode/tree/master/problems/count-primes) (Easy) - 1. [Ugly Number](https://github.com/openset/leetcode/tree/master/problems/ugly-number) (Easy) - 1. [Perfect Squares](https://github.com/openset/leetcode/tree/master/problems/perfect-squares) (Medium) - 1. [Super Ugly Number](https://github.com/openset/leetcode/tree/master/problems/super-ugly-number) (Medium) + 1. [Merge k Sorted Lists](../merge-k-sorted-lists) (Hard) + 1. [Count Primes](../count-primes) (Easy) + 1. [Ugly Number](../ugly-number) (Easy) + 1. [Perfect Squares](../perfect-squares) (Medium) + 1. [Super Ugly Number](../super-ugly-number) (Medium) ### Hints
diff --git a/problems/ugly-number-iii/README.md b/problems/ugly-number-iii/README.md index fe85cdc98..5cd9b128f 100644 --- a/problems/ugly-number-iii/README.md +++ b/problems/ugly-number-iii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-absolute-difference "Minimum Absolute Difference") +[< Previous](../minimum-absolute-difference "Minimum Absolute Difference") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/smallest-string-with-swaps "Smallest String With Swaps") +[Next >](../smallest-string-with-swaps "Smallest String With Swaps") ## [1201. Ugly Number III (Medium)](https://leetcode.com/problems/ugly-number-iii "丑数 III") @@ -56,8 +56,8 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Math](../../tag/math/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Hints
diff --git a/problems/ugly-number/README.md b/problems/ugly-number/README.md index e252db0f6..47f61475e 100644 --- a/problems/ugly-number/README.md +++ b/problems/ugly-number/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/trips-and-users "Trips and Users") +[< Previous](../trips-and-users "Trips and Users") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/ugly-number-ii "Ugly Number II") +[Next >](../ugly-number-ii "Ugly Number II") ## [263. Ugly Number (Easy)](https://leetcode.com/problems/ugly-number "丑数") @@ -46,9 +46,9 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Happy Number](https://github.com/openset/leetcode/tree/master/problems/happy-number) (Easy) - 1. [Count Primes](https://github.com/openset/leetcode/tree/master/problems/count-primes) (Easy) - 1. [Ugly Number II](https://github.com/openset/leetcode/tree/master/problems/ugly-number-ii) (Medium) + 1. [Happy Number](../happy-number) (Easy) + 1. [Count Primes](../count-primes) (Easy) + 1. [Ugly Number II](../ugly-number-ii) (Medium) diff --git a/problems/uncommon-words-from-two-sentences/README.md b/problems/uncommon-words-from-two-sentences/README.md index edbf4e6c2..bfa063930 100644 --- a/problems/uncommon-words-from-two-sentences/README.md +++ b/problems/uncommon-words-from-two-sentences/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/projection-area-of-3d-shapes "Projection Area of 3D Shapes") +[< Previous](../projection-area-of-3d-shapes "Projection Area of 3D Shapes") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/spiral-matrix-iii "Spiral Matrix III") +[Next >](../spiral-matrix-iii "Spiral Matrix III") ## [884. Uncommon Words from Two Sentences (Easy)](https://leetcode.com/problems/uncommon-words-from-two-sentences "两句话中的不常见单词") @@ -53,4 +53,4 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] diff --git a/problems/uncrossed-lines/README.md b/problems/uncrossed-lines/README.md index 89b39e475..8d9366fb0 100644 --- a/problems/uncrossed-lines/README.md +++ b/problems/uncrossed-lines/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/coloring-a-border "Coloring A Border") +[< Previous](../coloring-a-border "Coloring A Border") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/escape-a-large-maze "Escape a Large Maze") +[Next >](../escape-a-large-maze "Escape a Large Maze") ## [1035. Uncrossed Lines (Medium)](https://leetcode.com/problems/uncrossed-lines "不相交的线") @@ -63,10 +63,10 @@ We cannot draw 3 uncrossed lines, because the line from A[1]=4 to B[2]=4 will in ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Edit Distance](https://github.com/openset/leetcode/tree/master/problems/edit-distance) (Hard) + 1. [Edit Distance](../edit-distance) (Hard) ### Hints
diff --git a/problems/unique-binary-search-trees-ii/README.md b/problems/unique-binary-search-trees-ii/README.md index d652caec3..9fc43863d 100644 --- a/problems/unique-binary-search-trees-ii/README.md +++ b/problems/unique-binary-search-trees-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/binary-tree-inorder-traversal "Binary Tree Inorder Traversal") +[< Previous](../binary-tree-inorder-traversal "Binary Tree Inorder Traversal") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/unique-binary-search-trees "Unique Binary Search Trees") +[Next >](../unique-binary-search-trees "Unique Binary Search Trees") ## [95. Unique Binary Search Trees II (Medium)](https://leetcode.com/problems/unique-binary-search-trees-ii "不同的二叉搜索树 II") @@ -36,9 +36,9 @@ The above output corresponds to the 5 unique BST's shown below: ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Unique Binary Search Trees](https://github.com/openset/leetcode/tree/master/problems/unique-binary-search-trees) (Medium) - 1. [Different Ways to Add Parentheses](https://github.com/openset/leetcode/tree/master/problems/different-ways-to-add-parentheses) (Medium) + 1. [Unique Binary Search Trees](../unique-binary-search-trees) (Medium) + 1. [Different Ways to Add Parentheses](../different-ways-to-add-parentheses) (Medium) diff --git a/problems/unique-binary-search-trees/README.md b/problems/unique-binary-search-trees/README.md index 421d50c20..18fe7f087 100644 --- a/problems/unique-binary-search-trees/README.md +++ b/problems/unique-binary-search-trees/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/unique-binary-search-trees-ii "Unique Binary Search Trees II") +[< Previous](../unique-binary-search-trees-ii "Unique Binary Search Trees II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/interleaving-string "Interleaving String") +[Next >](../interleaving-string "Interleaving String") ## [96. Unique Binary Search Trees (Medium)](https://leetcode.com/problems/unique-binary-search-trees "不同的二叉搜索树") @@ -29,8 +29,8 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Unique Binary Search Trees II](https://github.com/openset/leetcode/tree/master/problems/unique-binary-search-trees-ii) (Medium) + 1. [Unique Binary Search Trees II](../unique-binary-search-trees-ii) (Medium) diff --git a/problems/unique-email-addresses/README.md b/problems/unique-email-addresses/README.md index e4a5776ca..bd66b8fc8 100644 --- a/problems/unique-email-addresses/README.md +++ b/problems/unique-email-addresses/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimize-malware-spread-ii "Minimize Malware Spread II") +[< Previous](../minimize-malware-spread-ii "Minimize Malware Spread II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/binary-subarrays-with-sum "Binary Subarrays With Sum") +[Next >](../binary-subarrays-with-sum "Binary Subarrays With Sum") ## [929. Unique Email Addresses (Easy)](https://leetcode.com/problems/unique-email-addresses "独特的电子邮件地址") @@ -50,4 +50,4 @@ ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/unique-letter-string/README.md b/problems/unique-letter-string/README.md index e58fefe9c..a6de633cd 100644 --- a/problems/unique-letter-string/README.md +++ b/problems/unique-letter-string/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/making-a-large-island "Making A Large Island") +[< Previous](../making-a-large-island "Making A Large Island") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/consecutive-numbers-sum "Consecutive Numbers Sum") +[Next >](../consecutive-numbers-sum "Consecutive Numbers Sum") ## [828. Unique Letter String (Hard)](https://leetcode.com/problems/unique-letter-string "独特字符串") @@ -49,4 +49,4 @@ Sum of lengths of all substring is 1 + 1 + 1 + 2 + 2 + 3 = 10

Note: 0 <= S.length <= 10000.

### Related Topics - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] diff --git a/problems/unique-morse-code-words/README.md b/problems/unique-morse-code-words/README.md index d50ad65e8..7397e0522 100644 --- a/problems/unique-morse-code-words/README.md +++ b/problems/unique-morse-code-words/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/bricks-falling-when-hit "Bricks Falling When Hit") +[< Previous](../bricks-falling-when-hit "Bricks Falling When Hit") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/split-array-with-same-average "Split Array With Same Average") +[Next >](../split-array-with-same-average "Split Array With Same Average") ## [804. Unique Morse Code Words (Easy)](https://leetcode.com/problems/unique-morse-code-words "唯一摩尔斯密码词") @@ -45,4 +45,4 @@ There are 2 different transformations, "--...-." and "--...--.&qu ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/unique-number-of-occurrences/README.md b/problems/unique-number-of-occurrences/README.md index 0483c827b..76f5b3b37 100644 --- a/problems/unique-number-of-occurrences/README.md +++ b/problems/unique-number-of-occurrences/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/design-skiplist "Design Skiplist") +[< Previous](../design-skiplist "Design Skiplist") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/get-equal-substrings-within-budget "Get Equal Substrings Within Budget") +[Next >](../get-equal-substrings-within-budget "Get Equal Substrings Within Budget") ## [1207. Unique Number of Occurrences (Easy)](https://leetcode.com/problems/unique-number-of-occurrences "独一无二的出现次数") @@ -44,7 +44,7 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Hints
diff --git a/problems/unique-paths-ii/README.md b/problems/unique-paths-ii/README.md index b5925b551..222f9a960 100644 --- a/problems/unique-paths-ii/README.md +++ b/problems/unique-paths-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/unique-paths "Unique Paths") +[< Previous](../unique-paths "Unique Paths") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/minimum-path-sum "Minimum Path Sum") +[Next >](../minimum-path-sum "Minimum Path Sum") ## [63. Unique Paths II (Medium)](https://leetcode.com/problems/unique-paths-ii "不同路径 II") @@ -41,12 +41,12 @@ There are two ways to reach the bottom-right corner: ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Array](../../tag/array/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Unique Paths](https://github.com/openset/leetcode/tree/master/problems/unique-paths) (Medium) - 1. [Unique Paths III](https://github.com/openset/leetcode/tree/master/problems/unique-paths-iii) (Hard) + 1. [Unique Paths](../unique-paths) (Medium) + 1. [Unique Paths III](../unique-paths-iii) (Hard) ### Hints
diff --git a/problems/unique-paths-iii/README.md b/problems/unique-paths-iii/README.md index 7528df3a4..8b7cb2be0 100644 --- a/problems/unique-paths-iii/README.md +++ b/problems/unique-paths-iii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/distribute-coins-in-binary-tree "Distribute Coins in Binary Tree") +[< Previous](../distribute-coins-in-binary-tree "Distribute Coins in Binary Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/time-based-key-value-store "Time Based Key-Value Store") +[Next >](../time-based-key-value-store "Time Based Key-Value Store") ## [980. Unique Paths III (Hard)](https://leetcode.com/problems/unique-paths-iii "不同路径 III") @@ -69,10 +69,10 @@ Note that the starting and ending square can be anywhere in the grid. ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Sudoku Solver](https://github.com/openset/leetcode/tree/master/problems/sudoku-solver) (Hard) - 1. [Unique Paths II](https://github.com/openset/leetcode/tree/master/problems/unique-paths-ii) (Medium) - 1. [Word Search II](https://github.com/openset/leetcode/tree/master/problems/word-search-ii) (Hard) + 1. [Sudoku Solver](../sudoku-solver) (Hard) + 1. [Unique Paths II](../unique-paths-ii) (Medium) + 1. [Word Search II](../word-search-ii) (Hard) diff --git a/problems/unique-paths/README.md b/problems/unique-paths/README.md index c5798d9e3..f9dbe3db5 100644 --- a/problems/unique-paths/README.md +++ b/problems/unique-paths/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/rotate-list "Rotate List") +[< Previous](../rotate-list "Rotate List") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/unique-paths-ii "Unique Paths II") +[Next >](../unique-paths-ii "Unique Paths II") ## [62. Unique Paths (Medium)](https://leetcode.com/problems/unique-paths "不同路径") @@ -41,10 +41,10 @@ From the top-left corner, there are a total of 3 ways to reach the bottom-right Output: 28 ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Array](../../tag/array/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Unique Paths II](https://github.com/openset/leetcode/tree/master/problems/unique-paths-ii) (Medium) - 1. [Minimum Path Sum](https://github.com/openset/leetcode/tree/master/problems/minimum-path-sum) (Medium) - 1. [Dungeon Game](https://github.com/openset/leetcode/tree/master/problems/dungeon-game) (Hard) + 1. [Unique Paths II](../unique-paths-ii) (Medium) + 1. [Minimum Path Sum](../minimum-path-sum) (Medium) + 1. [Dungeon Game](../dungeon-game) (Hard) diff --git a/problems/unique-substrings-in-wraparound-string/README.md b/problems/unique-substrings-in-wraparound-string/README.md index 094bfdb8e..2436acd6e 100644 --- a/problems/unique-substrings-in-wraparound-string/README.md +++ b/problems/unique-substrings-in-wraparound-string/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/count-the-repetitions "Count The Repetitions") +[< Previous](../count-the-repetitions "Count The Repetitions") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/validate-ip-address "Validate IP Address") +[Next >](../validate-ip-address "Validate IP Address") ## [467. Unique Substrings in Wraparound String (Medium)](https://leetcode.com/problems/unique-substrings-in-wraparound-string "环绕字符串中唯一的子字符串") @@ -43,7 +43,7 @@

### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/unique-word-abbreviation/README.md b/problems/unique-word-abbreviation/README.md index 4e693af61..1320ace22 100644 --- a/problems/unique-word-abbreviation/README.md +++ b/problems/unique-word-abbreviation/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-the-duplicate-number "Find the Duplicate Number") +[< Previous](../find-the-duplicate-number "Find the Duplicate Number") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/game-of-life "Game of Life") +[Next >](../game-of-life "Game of Life") ## [288. Unique Word Abbreviation (Medium)](https://leetcode.com/problems/unique-word-abbreviation "单词的唯一缩写") @@ -45,9 +45,9 @@ isUnique("make") -> true ### Related Topics - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Design](../../tag/design/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Two Sum III - Data structure design](https://github.com/openset/leetcode/tree/master/problems/two-sum-iii-data-structure-design) (Easy) - 1. [Generalized Abbreviation](https://github.com/openset/leetcode/tree/master/problems/generalized-abbreviation) (Medium) + 1. [Two Sum III - Data structure design](../two-sum-iii-data-structure-design) (Easy) + 1. [Generalized Abbreviation](../generalized-abbreviation) (Medium) diff --git a/problems/univalued-binary-tree/README.md b/problems/univalued-binary-tree/README.md index 2c40bdf11..4a371806e 100644 --- a/problems/univalued-binary-tree/README.md +++ b/problems/univalued-binary-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/least-operators-to-express-number "Least Operators to Express Number") +[< Previous](../least-operators-to-express-number "Least Operators to Express Number") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/vowel-spellchecker "Vowel Spellchecker") +[Next >](../vowel-spellchecker "Vowel Spellchecker") ## [965. Univalued Binary Tree (Easy)](https://leetcode.com/problems/univalued-binary-tree "单值二叉树") @@ -43,4 +43,4 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Tree](../../tag/tree/README.md)] diff --git a/problems/unpopular-books/README.md b/problems/unpopular-books/README.md index e5243f362..afc51d30b 100644 --- a/problems/unpopular-books/README.md +++ b/problems/unpopular-books/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/game-play-analysis-v "Game Play Analysis V") +[< Previous](../game-play-analysis-v "Game Play Analysis V") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/two-sum-less-than-k "Two Sum Less Than K") +[Next >](../two-sum-less-than-k "Two Sum Less Than K") ## [1098. Unpopular Books (Medium)](https://leetcode.com/problems/unpopular-books "小众书籍") diff --git a/problems/user-activity-for-the-past-30-days-i/README.md b/problems/user-activity-for-the-past-30-days-i/README.md index d2f59c1fa..45bc8ab07 100644 --- a/problems/user-activity-for-the-past-30-days-i/README.md +++ b/problems/user-activity-for-the-past-30-days-i/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/stone-game-ii "Stone Game II") +[< Previous](../stone-game-ii "Stone Game II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/user-activity-for-the-past-30-days-ii "User Activity for the Past 30 Days II") +[Next >](../user-activity-for-the-past-30-days-ii "User Activity for the Past 30 Days II") ## [1141. User Activity for the Past 30 Days I (Easy)](https://leetcode.com/problems/user-activity-for-the-past-30-days-i "") diff --git a/problems/user-activity-for-the-past-30-days-ii/README.md b/problems/user-activity-for-the-past-30-days-ii/README.md index 0db1994a5..c24c48957 100644 --- a/problems/user-activity-for-the-past-30-days-ii/README.md +++ b/problems/user-activity-for-the-past-30-days-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/user-activity-for-the-past-30-days-i "User Activity for the Past 30 Days I") +[< Previous](../user-activity-for-the-past-30-days-i "User Activity for the Past 30 Days I") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/longest-common-subsequence "Longest Common Subsequence") +[Next >](../longest-common-subsequence "Longest Common Subsequence") ## [1142. User Activity for the Past 30 Days II (Easy)](https://leetcode.com/problems/user-activity-for-the-past-30-days-ii "过去30天的用户活动 II") diff --git a/problems/user-purchase-platform/README.md b/problems/user-purchase-platform/README.md index df9bd2ac8..181aefec5 100644 --- a/problems/user-purchase-platform/README.md +++ b/problems/user-purchase-platform/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/active-businesses "Active Businesses") +[< Previous](../active-businesses "Active Businesses") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-equivalent-domino-pairs "Number of Equivalent Domino Pairs") +[Next >](../number-of-equivalent-domino-pairs "Number of Equivalent Domino Pairs") ## [1127. User Purchase Platform (Hard)](https://leetcode.com/problems/user-purchase-platform "") diff --git a/problems/utf-8-validation/README.md b/problems/utf-8-validation/README.md index 78e3f6165..d02dcde1e 100644 --- a/problems/utf-8-validation/README.md +++ b/problems/utf-8-validation/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/is-subsequence "Is Subsequence") +[< Previous](../is-subsequence "Is Subsequence") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/decode-string "Decode String") +[Next >](../decode-string "Decode String") ## [393. UTF-8 Validation (Medium)](https://leetcode.com/problems/utf-8-validation "UTF-8 编码验证") @@ -57,7 +57,7 @@ But the second continuation byte does not start with 10, so it is invalid.

### Related Topics - [[Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] + [[Bit Manipulation](../../tag/bit-manipulation/README.md)] ### Hints
diff --git a/problems/valid-anagram/README.md b/problems/valid-anagram/README.md index a2f9e68c3..2c97538c5 100644 --- a/problems/valid-anagram/README.md +++ b/problems/valid-anagram/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/different-ways-to-add-parentheses "Different Ways to Add Parentheses") +[< Previous](../different-ways-to-add-parentheses "Different Ways to Add Parentheses") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance "Shortest Word Distance") +[Next >](../shortest-word-distance "Shortest Word Distance") ## [242. Valid Anagram (Easy)](https://leetcode.com/problems/valid-anagram "有效的字母异位词") @@ -34,10 +34,10 @@ You may assume the string contains only lowercase alphabets.

What if the inputs contain unicode characters? How would you adapt your solution to such case?

### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Sort](../../tag/sort/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Group Anagrams](https://github.com/openset/leetcode/tree/master/problems/group-anagrams) (Medium) - 1. [Palindrome Permutation](https://github.com/openset/leetcode/tree/master/problems/palindrome-permutation) (Easy) - 1. [Find All Anagrams in a String](https://github.com/openset/leetcode/tree/master/problems/find-all-anagrams-in-a-string) (Medium) + 1. [Group Anagrams](../group-anagrams) (Medium) + 1. [Palindrome Permutation](../palindrome-permutation) (Easy) + 1. [Find All Anagrams in a String](../find-all-anagrams-in-a-string) (Medium) diff --git a/problems/valid-boomerang/README.md b/problems/valid-boomerang/README.md index e789f8a8a..4ae5826c4 100644 --- a/problems/valid-boomerang/README.md +++ b/problems/valid-boomerang/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/escape-a-large-maze "Escape a Large Maze") +[< Previous](../escape-a-large-maze "Escape a Large Maze") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/binary-search-tree-to-greater-sum-tree "Binary Search Tree to Greater Sum Tree") +[Next >](../binary-search-tree-to-greater-sum-tree "Binary Search Tree to Greater Sum Tree") ## [1037. Valid Boomerang (Easy)](https://leetcode.com/problems/valid-boomerang "有效的回旋镖") @@ -47,7 +47,7 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] ### Hints
diff --git a/problems/valid-mountain-array/README.md b/problems/valid-mountain-array/README.md index db0606664..de6e3a005 100644 --- a/problems/valid-mountain-array/README.md +++ b/problems/valid-mountain-array/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/distinct-subsequences-ii "Distinct Subsequences II") +[< Previous](../distinct-subsequences-ii "Distinct Subsequences II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/di-string-match "DI String Match") +[Next >](../di-string-match "DI String Match") ## [941. Valid Mountain Array (Easy)](https://leetcode.com/problems/valid-mountain-array "有效的山脉数组") @@ -72,7 +72,7 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Hints
diff --git a/problems/valid-number/README.md b/problems/valid-number/README.md index dfe197c93..ddee7b6ab 100644 --- a/problems/valid-number/README.md +++ b/problems/valid-number/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-path-sum "Minimum Path Sum") +[< Previous](../minimum-path-sum "Minimum Path Sum") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/plus-one "Plus One") +[Next >](../plus-one "Plus One") ## [65. Valid Number (Hard)](https://leetcode.com/problems/valid-number "有效数字") @@ -44,8 +44,8 @@ The signature of the C++ function had been updated. If you still see your function signature accepts a const char * argument, please click the reload button to reset your code definition.

### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Math](../../tag/math/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [String to Integer (atoi)](https://github.com/openset/leetcode/tree/master/problems/string-to-integer-atoi) (Medium) + 1. [String to Integer (atoi)](../string-to-integer-atoi) (Medium) diff --git a/problems/valid-palindrome-ii/README.md b/problems/valid-palindrome-ii/README.md index db77d8cd9..2ec0816d3 100644 --- a/problems/valid-palindrome-ii/README.md +++ b/problems/valid-palindrome-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/24-game "24 Game") +[< Previous](../24-game "24 Game") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/next-closest-time "Next Closest Time") +[Next >](../next-closest-time "Next Closest Time") ## [680. Valid Palindrome II (Easy)](https://leetcode.com/problems/valid-palindrome-ii "验证回文字符串 Ⅱ") @@ -38,7 +38,7 @@ The maximum length of the string is 50000.

### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Valid Palindrome](https://github.com/openset/leetcode/tree/master/problems/valid-palindrome) (Easy) + 1. [Valid Palindrome](../valid-palindrome) (Easy) diff --git a/problems/valid-palindrome-iii/README.md b/problems/valid-palindrome-iii/README.md index 179cb388f..d6521343f 100644 --- a/problems/valid-palindrome-iii/README.md +++ b/problems/valid-palindrome-iii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/stepping-numbers "Stepping Numbers") +[< Previous](../stepping-numbers "Stepping Numbers") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/play-with-chips "Play with Chips") +[Next >](../play-with-chips "Play with Chips") ## [1216. Valid Palindrome III (Hard)](https://leetcode.com/problems/valid-palindrome-iii "验证回文字符串 III") @@ -34,8 +34,8 @@ ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[String](../../tag/string/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/valid-palindrome/README.md b/problems/valid-palindrome/README.md index 88ffb9a5f..c8e45097b 100644 --- a/problems/valid-palindrome/README.md +++ b/problems/valid-palindrome/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/binary-tree-maximum-path-sum "Binary Tree Maximum Path Sum") +[< Previous](../binary-tree-maximum-path-sum "Binary Tree Maximum Path Sum") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/word-ladder-ii "Word Ladder II") +[Next >](../word-ladder-ii "Word Ladder II") ## [125. Valid Palindrome (Easy)](https://leetcode.com/problems/valid-palindrome "验证回文串") @@ -30,9 +30,9 @@ ### Related Topics - [[Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Two Pointers](../../tag/two-pointers/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Palindrome Linked List](https://github.com/openset/leetcode/tree/master/problems/palindrome-linked-list) (Easy) - 1. [Valid Palindrome II](https://github.com/openset/leetcode/tree/master/problems/valid-palindrome-ii) (Easy) + 1. [Palindrome Linked List](../palindrome-linked-list) (Easy) + 1. [Valid Palindrome II](../valid-palindrome-ii) (Easy) diff --git a/problems/valid-parentheses/README.md b/problems/valid-parentheses/README.md index 7ad6dabb1..62a8bab5f 100644 --- a/problems/valid-parentheses/README.md +++ b/problems/valid-parentheses/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/remove-nth-node-from-end-of-list "Remove Nth Node From End of List") +[< Previous](../remove-nth-node-from-end-of-list "Remove Nth Node From End of List") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/merge-two-sorted-lists "Merge Two Sorted Lists") +[Next >](../merge-two-sorted-lists "Merge Two Sorted Lists") ## [20. Valid Parentheses (Easy)](https://leetcode.com/problems/valid-parentheses "有效的括号") @@ -58,14 +58,14 @@ ### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Stack](../../tag/stack/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Generate Parentheses](https://github.com/openset/leetcode/tree/master/problems/generate-parentheses) (Medium) - 1. [Longest Valid Parentheses](https://github.com/openset/leetcode/tree/master/problems/longest-valid-parentheses) (Hard) - 1. [Remove Invalid Parentheses](https://github.com/openset/leetcode/tree/master/problems/remove-invalid-parentheses) (Hard) - 1. [Check If Word Is Valid After Substitutions](https://github.com/openset/leetcode/tree/master/problems/check-if-word-is-valid-after-substitutions) (Medium) + 1. [Generate Parentheses](../generate-parentheses) (Medium) + 1. [Longest Valid Parentheses](../longest-valid-parentheses) (Hard) + 1. [Remove Invalid Parentheses](../remove-invalid-parentheses) (Hard) + 1. [Check If Word Is Valid After Substitutions](../check-if-word-is-valid-after-substitutions) (Medium) ### Hints
diff --git a/problems/valid-parenthesis-string/README.md b/problems/valid-parenthesis-string/README.md index 3ee494ec1..86f71797c 100644 --- a/problems/valid-parenthesis-string/README.md +++ b/problems/valid-parenthesis-string/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/map-sum-pairs "Map Sum Pairs") +[< Previous](../map-sum-pairs "Map Sum Pairs") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/24-game "24 Game") +[Next >](../24-game "24 Game") ## [678. Valid Parenthesis String (Medium)](https://leetcode.com/problems/valid-parenthesis-string "有效的括号字符串") @@ -50,7 +50,7 @@ Given a string containing only three types of characters: '(', ')' and '*', writ

### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Special Binary String](https://github.com/openset/leetcode/tree/master/problems/special-binary-string) (Hard) + 1. [Special Binary String](../special-binary-string) (Hard) diff --git a/problems/valid-perfect-square/README.md b/problems/valid-perfect-square/README.md index 3f6ec1c3f..599552df1 100644 --- a/problems/valid-perfect-square/README.md +++ b/problems/valid-perfect-square/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/find-leaves-of-binary-tree "Find Leaves of Binary Tree") +[< Previous](../find-leaves-of-binary-tree "Find Leaves of Binary Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/largest-divisible-subset "Largest Divisible Subset") +[Next >](../largest-divisible-subset "Largest Divisible Subset") ## [367. Valid Perfect Square (Easy)](https://leetcode.com/problems/valid-perfect-square "有效的完全平方数") @@ -34,9 +34,9 @@ ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] - [[Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] + [[Math](../../tag/math/README.md)] + [[Binary Search](../../tag/binary-search/README.md)] ### Similar Questions - 1. [Sqrt(x)](https://github.com/openset/leetcode/tree/master/problems/sqrtx) (Easy) - 1. [Sum of Square Numbers](https://github.com/openset/leetcode/tree/master/problems/sum-of-square-numbers) (Easy) + 1. [Sqrt(x)](../sqrtx) (Easy) + 1. [Sum of Square Numbers](../sum-of-square-numbers) (Easy) diff --git a/problems/valid-permutations-for-di-sequence/README.md b/problems/valid-permutations-for-di-sequence/README.md index 19a96c7b1..60b5b26a1 100644 --- a/problems/valid-permutations-for-di-sequence/README.md +++ b/problems/valid-permutations-for-di-sequence/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/numbers-at-most-n-given-digit-set "Numbers At Most N Given Digit Set") +[< Previous](../numbers-at-most-n-given-digit-set "Numbers At Most N Given Digit Set") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/fruit-into-baskets "Fruit Into Baskets") +[Next >](../fruit-into-baskets "Fruit Into Baskets") ## [903. Valid Permutations for DI Sequence (Hard)](https://leetcode.com/problems/valid-permutations-for-di-sequence "DI 序列的有效排列") @@ -52,5 +52,5 @@ The 5 valid permutations of (0, 1, 2, 3) are: ### Related Topics - [[Divide and Conquer](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Divide and Conquer](../../tag/divide-and-conquer/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/valid-phone-numbers/README.md b/problems/valid-phone-numbers/README.md index b3416caec..ff3a84800 100644 --- a/problems/valid-phone-numbers/README.md +++ b/problems/valid-phone-numbers/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/word-frequency "Word Frequency") +[< Previous](../word-frequency "Word Frequency") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/transpose-file "Transpose File") +[Next >](../transpose-file "Transpose File") ## [193. Valid Phone Numbers (Easy)](https://leetcode.com/problems/valid-phone-numbers "有效电话号码") diff --git a/problems/valid-square/README.md b/problems/valid-square/README.md index 77fddbde7..f10ffd466 100644 --- a/problems/valid-square/README.md +++ b/problems/valid-square/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/fraction-addition-and-subtraction "Fraction Addition and Subtraction") +[< Previous](../fraction-addition-and-subtraction "Fraction Addition and Subtraction") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/longest-harmonious-subsequence "Longest Harmonious Subsequence") +[Next >](../longest-harmonious-subsequence "Longest Harmonious Subsequence") ## [593. Valid Square (Medium)](https://leetcode.com/problems/valid-square "有效的正方形") @@ -35,4 +35,4 @@

 

### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/valid-sudoku/README.md b/problems/valid-sudoku/README.md index b06125aca..653c6f0cd 100644 --- a/problems/valid-sudoku/README.md +++ b/problems/valid-sudoku/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/search-insert-position "Search Insert Position") +[< Previous](../search-insert-position "Search Insert Position") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/sudoku-solver "Sudoku Solver") +[Next >](../sudoku-solver "Sudoku Solver") ## [36. Valid Sudoku (Medium)](https://leetcode.com/problems/valid-sudoku "有效的数独") @@ -72,7 +72,7 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Sudoku Solver](https://github.com/openset/leetcode/tree/master/problems/sudoku-solver) (Hard) + 1. [Sudoku Solver](../sudoku-solver) (Hard) diff --git a/problems/valid-tic-tac-toe-state/README.md b/problems/valid-tic-tac-toe-state/README.md index 25541e46b..2a2676003 100644 --- a/problems/valid-tic-tac-toe-state/README.md +++ b/problems/valid-tic-tac-toe-state/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/preimage-size-of-factorial-zeroes-function "Preimage Size of Factorial Zeroes Function") +[< Previous](../preimage-size-of-factorial-zeroes-function "Preimage Size of Factorial Zeroes Function") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/number-of-subarrays-with-bounded-maximum "Number of Subarrays with Bounded Maximum") +[Next >](../number-of-subarrays-with-bounded-maximum "Number of Subarrays with Bounded Maximum") ## [794. Valid Tic-Tac-Toe State (Medium)](https://leetcode.com/problems/valid-tic-tac-toe-state "有效的井字游戏") @@ -54,8 +54,8 @@ ### Related Topics - [[Recursion](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Recursion](../../tag/recursion/README.md)] + [[Math](../../tag/math/README.md)] ### Similar Questions - 1. [Design Tic-Tac-Toe](https://github.com/openset/leetcode/tree/master/problems/design-tic-tac-toe) (Medium) + 1. [Design Tic-Tac-Toe](../design-tic-tac-toe) (Medium) diff --git a/problems/valid-triangle-number/README.md b/problems/valid-triangle-number/README.md index 3f83cd969..67ba0dc61 100644 --- a/problems/valid-triangle-number/README.md +++ b/problems/valid-triangle-number/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/triangle-judgement "Triangle Judgement") +[< Previous](../triangle-judgement "Triangle Judgement") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-in-a-plane "Shortest Distance in a Plane") +[Next >](../shortest-distance-in-a-plane "Shortest Distance in a Plane") ## [611. Valid Triangle Number (Medium)](https://leetcode.com/problems/valid-triangle-number "有效三角形的个数") @@ -33,7 +33,7 @@ Valid combinations are:

### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [3Sum Smaller](https://github.com/openset/leetcode/tree/master/problems/3sum-smaller) (Medium) + 1. [3Sum Smaller](../3sum-smaller) (Medium) diff --git a/problems/valid-word-abbreviation/README.md b/problems/valid-word-abbreviation/README.md index 5d704a6c1..b617cabb4 100644 --- a/problems/valid-word-abbreviation/README.md +++ b/problems/valid-word-abbreviation/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/trapping-rain-water-ii "Trapping Rain Water II") +[< Previous](../trapping-rain-water-ii "Trapping Rain Water II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/longest-palindrome "Longest Palindrome") +[Next >](../longest-palindrome "Longest Palindrome") ## [408. Valid Word Abbreviation (Easy)](https://leetcode.com/problems/valid-word-abbreviation "有效单词缩写") @@ -43,8 +43,8 @@ Return false.

### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Minimum Unique Word Abbreviation](https://github.com/openset/leetcode/tree/master/problems/minimum-unique-word-abbreviation) (Hard) - 1. [Word Abbreviation](https://github.com/openset/leetcode/tree/master/problems/word-abbreviation) (Hard) + 1. [Minimum Unique Word Abbreviation](../minimum-unique-word-abbreviation) (Hard) + 1. [Word Abbreviation](../word-abbreviation) (Hard) diff --git a/problems/valid-word-square/README.md b/problems/valid-word-square/README.md index 016ac8cd2..66fd21971 100644 --- a/problems/valid-word-square/README.md +++ b/problems/valid-word-square/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-xor-of-two-numbers-in-an-array "Maximum XOR of Two Numbers in an Array") +[< Previous](../maximum-xor-of-two-numbers-in-an-array "Maximum XOR of Two Numbers in an Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/reconstruct-original-digits-from-english "Reconstruct Original Digits from English") +[Next >](../reconstruct-original-digits-from-english "Reconstruct Original Digits from English") ## [422. Valid Word Square (Easy)](https://leetcode.com/problems/valid-word-square "有效的单词方块") @@ -90,5 +90,5 @@ Therefore, it is NOT a valid word square.

### Similar Questions - 1. [Word Squares](https://github.com/openset/leetcode/tree/master/problems/word-squares) (Hard) - 1. [Toeplitz Matrix](https://github.com/openset/leetcode/tree/master/problems/toeplitz-matrix) (Easy) + 1. [Word Squares](../word-squares) (Hard) + 1. [Toeplitz Matrix](../toeplitz-matrix) (Easy) diff --git a/problems/validate-binary-search-tree/README.md b/problems/validate-binary-search-tree/README.md index eb9852d93..87c7158ef 100644 --- a/problems/validate-binary-search-tree/README.md +++ b/problems/validate-binary-search-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/interleaving-string "Interleaving String") +[< Previous](../interleaving-string "Interleaving String") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/recover-binary-search-tree "Recover Binary Search Tree") +[Next >](../recover-binary-search-tree "Recover Binary Search Tree") ## [98. Validate Binary Search Tree (Medium)](https://leetcode.com/problems/validate-binary-search-tree "验证二叉搜索树") @@ -49,9 +49,9 @@ ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] ### Similar Questions - 1. [Binary Tree Inorder Traversal](https://github.com/openset/leetcode/tree/master/problems/binary-tree-inorder-traversal) (Medium) - 1. [Find Mode in Binary Search Tree](https://github.com/openset/leetcode/tree/master/problems/find-mode-in-binary-search-tree) (Easy) + 1. [Binary Tree Inorder Traversal](../binary-tree-inorder-traversal) (Medium) + 1. [Find Mode in Binary Search Tree](../find-mode-in-binary-search-tree) (Easy) diff --git a/problems/validate-ip-address/README.md b/problems/validate-ip-address/README.md index 5fa41af63..2018673ba 100644 --- a/problems/validate-ip-address/README.md +++ b/problems/validate-ip-address/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/unique-substrings-in-wraparound-string "Unique Substrings in Wraparound String") +[< Previous](../unique-substrings-in-wraparound-string "Unique Substrings in Wraparound String") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/convex-polygon "Convex Polygon") +[Next >](../convex-polygon "Convex Polygon") ## [468. Validate IP Address (Medium)](https://leetcode.com/problems/validate-ip-address "验证IP地址") @@ -73,7 +73,7 @@ You may assume there is no extra space or special characters in the input string

### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [IP to CIDR](https://github.com/openset/leetcode/tree/master/problems/ip-to-cidr) (Easy) + 1. [IP to CIDR](../ip-to-cidr) (Easy) diff --git a/problems/validate-stack-sequences/README.md b/problems/validate-stack-sequences/README.md index 702601231..33acc1474 100644 --- a/problems/validate-stack-sequences/README.md +++ b/problems/validate-stack-sequences/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/minimum-increment-to-make-array-unique "Minimum Increment to Make Array Unique") +[< Previous](../minimum-increment-to-make-array-unique "Minimum Increment to Make Array Unique") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/most-stones-removed-with-same-row-or-column "Most Stones Removed with Same Row or Column") +[Next >](../most-stones-removed-with-same-row-or-column "Most Stones Removed with Same Row or Column") ## [946. Validate Stack Sequences (Medium)](https://leetcode.com/problems/validate-stack-sequences "验证栈序列") @@ -49,4 +49,4 @@ push(5), pop() -> 5, pop() -> 3, pop() -> 2, pop() -> 1 ### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] + [[Stack](../../tag/stack/README.md)] diff --git a/problems/verify-preorder-sequence-in-binary-search-tree/README.md b/problems/verify-preorder-sequence-in-binary-search-tree/README.md index 51ea3d09d..d9506fe3c 100644 --- a/problems/verify-preorder-sequence-in-binary-search-tree/README.md +++ b/problems/verify-preorder-sequence-in-binary-search-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/factor-combinations "Factor Combinations") +[< Previous](../factor-combinations "Factor Combinations") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/paint-house "Paint House") +[Next >](../paint-house "Paint House") ## [255. Verify Preorder Sequence in Binary Search Tree (Medium)](https://leetcode.com/problems/verify-preorder-sequence-in-binary-search-tree "验证前序遍历序列二叉搜索树") @@ -40,8 +40,8 @@ Could you do it using only constant space complexity?

### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] + [[Stack](../../tag/stack/README.md)] + [[Tree](../../tag/tree/README.md)] ### Similar Questions - 1. [Binary Tree Preorder Traversal](https://github.com/openset/leetcode/tree/master/problems/binary-tree-preorder-traversal) (Medium) + 1. [Binary Tree Preorder Traversal](../binary-tree-preorder-traversal) (Medium) diff --git a/problems/verify-preorder-serialization-of-a-binary-tree/README.md b/problems/verify-preorder-serialization-of-a-binary-tree/README.md index 673798d68..a8a6b2c3b 100644 --- a/problems/verify-preorder-serialization-of-a-binary-tree/README.md +++ b/problems/verify-preorder-serialization-of-a-binary-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/patching-array "Patching Array") +[< Previous](../patching-array "Patching Array") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/reconstruct-itinerary "Reconstruct Itinerary") +[Next >](../reconstruct-itinerary "Reconstruct Itinerary") ## [331. Verify Preorder Serialization of a Binary Tree (Medium)](https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree "验证二叉树的前序序列化") @@ -51,4 +51,4 @@ Output: false ### Related Topics - [[Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] + [[Stack](../../tag/stack/README.md)] diff --git a/problems/verifying-an-alien-dictionary/README.md b/problems/verifying-an-alien-dictionary/README.md index 235591033..34c022512 100644 --- a/problems/verifying-an-alien-dictionary/README.md +++ b/problems/verifying-an-alien-dictionary/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/largest-component-size-by-common-factor "Largest Component Size by Common Factor") +[< Previous](../largest-component-size-by-common-factor "Largest Component Size by Common Factor") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/array-of-doubled-pairs "Array of Doubled Pairs") +[Next >](../array-of-doubled-pairs "Array of Doubled Pairs") ## [953. Verifying an Alien Dictionary (Easy)](https://leetcode.com/problems/verifying-an-alien-dictionary "验证外星语词典") @@ -50,4 +50,4 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] diff --git a/problems/vertical-order-traversal-of-a-binary-tree/README.md b/problems/vertical-order-traversal-of-a-binary-tree/README.md index 6cbcefeae..ed7f0aecd 100644 --- a/problems/vertical-order-traversal-of-a-binary-tree/README.md +++ b/problems/vertical-order-traversal-of-a-binary-tree/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/interval-list-intersections "Interval List Intersections") +[< Previous](../interval-list-intersections "Interval List Intersections") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/smallest-string-starting-from-leaf "Smallest String Starting From Leaf") +[Next >](../smallest-string-starting-from-leaf "Smallest String Starting From Leaf") ## [987. Vertical Order Traversal of a Binary Tree (Medium)](https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree "二叉树的垂序遍历") @@ -68,5 +68,5 @@ However, in the report "[1,5,6]", the node value of 5 comes first sinc ### Related Topics - [[Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Tree](../../tag/tree/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] diff --git a/problems/video-stitching/README.md b/problems/video-stitching/README.md index 826732ee8..e50de6a2e 100644 --- a/problems/video-stitching/README.md +++ b/problems/video-stitching/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/camelcase-matching "Camelcase Matching") +[< Previous](../camelcase-matching "Camelcase Matching") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/divisor-game "Divisor Game") +[Next >](../divisor-game "Divisor Game") ## [1024. Video Stitching (Medium)](https://leetcode.com/problems/video-stitching "视频拼接") @@ -69,7 +69,7 @@ Notice you can have extra video after the event ends. ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Hints
diff --git a/problems/vowel-spellchecker/README.md b/problems/vowel-spellchecker/README.md index 99f363713..fd93b6fab 100644 --- a/problems/vowel-spellchecker/README.md +++ b/problems/vowel-spellchecker/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/univalued-binary-tree "Univalued Binary Tree") +[< Previous](../univalued-binary-tree "Univalued Binary Tree") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/numbers-with-same-consecutive-differences "Numbers With Same Consecutive Differences") +[Next >](../numbers-with-same-consecutive-differences "Numbers With Same Consecutive Differences") ## [966. Vowel Spellchecker (Medium)](https://leetcode.com/problems/vowel-spellchecker "元音拼写检查器") @@ -64,5 +64,5 @@ ### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/walking-robot-simulation/README.md b/problems/walking-robot-simulation/README.md index ae61d58be..94341741b 100644 --- a/problems/walking-robot-simulation/README.md +++ b/problems/walking-robot-simulation/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/length-of-longest-fibonacci-subsequence "Length of Longest Fibonacci Subsequence") +[< Previous](../length-of-longest-fibonacci-subsequence "Length of Longest Fibonacci Subsequence") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/koko-eating-bananas "Koko Eating Bananas") +[Next >](../koko-eating-bananas "Koko Eating Bananas") ## [874. Walking Robot Simulation (Easy)](https://leetcode.com/problems/walking-robot-simulation "模拟行走机器人") @@ -60,4 +60,4 @@ ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] + [[Greedy](../../tag/greedy/README.md)] diff --git a/problems/walls-and-gates/README.md b/problems/walls-and-gates/README.md index 643d71ae1..4afb430d3 100644 --- a/problems/walls-and-gates/README.md +++ b/problems/walls-and-gates/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/inorder-successor-in-bst "Inorder Successor in BST") +[< Previous](../inorder-successor-in-bst "Inorder Successor in BST") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-the-duplicate-number "Find the Duplicate Number") +[Next >](../find-the-duplicate-number "Find the Duplicate Number") ## [286. Walls and Gates (Medium)](https://leetcode.com/problems/walls-and-gates "墙与门") @@ -42,11 +42,11 @@ INF -1 INF -1 ### Related Topics - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] ### Similar Questions - 1. [Surrounded Regions](https://github.com/openset/leetcode/tree/master/problems/surrounded-regions) (Medium) - 1. [Number of Islands](https://github.com/openset/leetcode/tree/master/problems/number-of-islands) (Medium) - 1. [Shortest Distance from All Buildings](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-from-all-buildings) (Hard) - 1. [Robot Room Cleaner](https://github.com/openset/leetcode/tree/master/problems/robot-room-cleaner) (Hard) - 1. [Rotting Oranges](https://github.com/openset/leetcode/tree/master/problems/rotting-oranges) (Easy) + 1. [Surrounded Regions](../surrounded-regions) (Medium) + 1. [Number of Islands](../number-of-islands) (Medium) + 1. [Shortest Distance from All Buildings](../shortest-distance-from-all-buildings) (Hard) + 1. [Robot Room Cleaner](../robot-room-cleaner) (Hard) + 1. [Rotting Oranges](../rotting-oranges) (Easy) diff --git a/problems/water-and-jug-problem/README.md b/problems/water-and-jug-problem/README.md index d8401d059..d073d0ba4 100644 --- a/problems/water-and-jug-problem/README.md +++ b/problems/water-and-jug-problem/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/nested-list-weight-sum-ii "Nested List Weight Sum II") +[< Previous](../nested-list-weight-sum-ii "Nested List Weight Sum II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-leaves-of-binary-tree "Find Leaves of Binary Tree") +[Next >](../find-leaves-of-binary-tree "Find Leaves of Binary Tree") ## [365. Water and Jug Problem (Medium)](https://leetcode.com/problems/water-and-jug-problem "水壶问题") @@ -38,4 +38,4 @@ Output: False ### Related Topics - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/web-crawler-multithreaded/README.md b/problems/web-crawler-multithreaded/README.md index a46795287..a0cf51d9b 100644 --- a/problems/web-crawler-multithreaded/README.md +++ b/problems/web-crawler-multithreaded/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/number-of-comments-per-post "Number of Comments per Post") +[< Previous](../number-of-comments-per-post "Number of Comments per Post") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/array-transformation "Array Transformation") +[Next >](../array-transformation "Array Transformation") ## [1242. Web Crawler Multithreaded (Medium)](https://leetcode.com/problems/web-crawler-multithreaded "多线程网页爬虫") @@ -106,5 +106,5 @@ startUrl = "http://news.google.com" ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] diff --git a/problems/web-crawler/README.md b/problems/web-crawler/README.md index 537be0591..f242a7b83 100644 --- a/problems/web-crawler/README.md +++ b/problems/web-crawler/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/maximum-profit-in-job-scheduling "Maximum Profit in Job Scheduling") +[< Previous](../maximum-profit-in-job-scheduling "Maximum Profit in Job Scheduling") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/find-positive-integer-solution-for-a-given-equation "Find Positive Integer Solution for a Given Equation") +[Next >](../find-positive-integer-solution-for-a-given-equation "Find Positive Integer Solution for a Given Equation") ## [1236. Web Crawler (Medium)](https://leetcode.com/problems/web-crawler "") @@ -93,8 +93,8 @@ startUrl = "http://news.google.com" ### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] ### Hints
diff --git a/problems/wiggle-sort-ii/README.md b/problems/wiggle-sort-ii/README.md index 31c8a3915..7843a9470 100644 --- a/problems/wiggle-sort-ii/README.md +++ b/problems/wiggle-sort-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/number-of-connected-components-in-an-undirected-graph "Number of Connected Components in an Undirected Graph") +[< Previous](../number-of-connected-components-in-an-undirected-graph "Number of Connected Components in an Undirected Graph") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/maximum-size-subarray-sum-equals-k "Maximum Size Subarray Sum Equals k") +[Next >](../maximum-size-subarray-sum-equals-k "Maximum Size Subarray Sum Equals k") ## [324. Wiggle Sort II (Medium)](https://leetcode.com/problems/wiggle-sort-ii "摆动排序 II") @@ -32,9 +32,9 @@ You may assume all input has valid answer.

Can you do it in O(n) time and/or in-place with O(1) extra space?

### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] + [[Sort](../../tag/sort/README.md)] ### Similar Questions - 1. [Sort Colors](https://github.com/openset/leetcode/tree/master/problems/sort-colors) (Medium) - 1. [Kth Largest Element in an Array](https://github.com/openset/leetcode/tree/master/problems/kth-largest-element-in-an-array) (Medium) - 1. [Wiggle Sort](https://github.com/openset/leetcode/tree/master/problems/wiggle-sort) (Medium) + 1. [Sort Colors](../sort-colors) (Medium) + 1. [Kth Largest Element in an Array](../kth-largest-element-in-an-array) (Medium) + 1. [Wiggle Sort](../wiggle-sort) (Medium) diff --git a/problems/wiggle-sort/README.md b/problems/wiggle-sort/README.md index 0d842d02e..847a6c2c5 100644 --- a/problems/wiggle-sort/README.md +++ b/problems/wiggle-sort/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/perfect-squares "Perfect Squares") +[< Previous](../perfect-squares "Perfect Squares") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/zigzag-iterator "Zigzag Iterator") +[Next >](../zigzag-iterator "Zigzag Iterator") ## [280. Wiggle Sort (Medium)](https://leetcode.com/problems/wiggle-sort "摆动排序") @@ -20,9 +20,9 @@ Output: One possible answer is [3,5,1,6,2,4] ### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] + [[Sort](../../tag/sort/README.md)] + [[Array](../../tag/array/README.md)] ### Similar Questions - 1. [Sort Colors](https://github.com/openset/leetcode/tree/master/problems/sort-colors) (Medium) - 1. [Wiggle Sort II](https://github.com/openset/leetcode/tree/master/problems/wiggle-sort-ii) (Medium) + 1. [Sort Colors](../sort-colors) (Medium) + 1. [Wiggle Sort II](../wiggle-sort-ii) (Medium) diff --git a/problems/wiggle-subsequence/README.md b/problems/wiggle-subsequence/README.md index 4678c4ee4..546c59697 100644 --- a/problems/wiggle-subsequence/README.md +++ b/problems/wiggle-subsequence/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/guess-number-higher-or-lower-ii "Guess Number Higher or Lower II") +[< Previous](../guess-number-higher-or-lower-ii "Guess Number Higher or Lower II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/combination-sum-iv "Combination Sum IV") +[Next >](../combination-sum-iv "Combination Sum IV") ## [376. Wiggle Subsequence (Medium)](https://leetcode.com/problems/wiggle-subsequence "摆动序列") @@ -45,5 +45,5 @@ Can you do it in O(n) time?

### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] diff --git a/problems/wildcard-matching/README.md b/problems/wildcard-matching/README.md index 850c1aaed..c4054c560 100644 --- a/problems/wildcard-matching/README.md +++ b/problems/wildcard-matching/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/multiply-strings "Multiply Strings") +[< Previous](../multiply-strings "Multiply Strings") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/jump-game-ii "Jump Game II") +[Next >](../jump-game-ii "Jump Game II") ## [44. Wildcard Matching (Hard)](https://leetcode.com/problems/wildcard-matching "通配符匹配") @@ -77,10 +77,10 @@ p = "a*c?b" ### Related Topics - [[Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Greedy](../../tag/greedy/README.md)] + [[String](../../tag/string/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Regular Expression Matching](https://github.com/openset/leetcode/tree/master/problems/regular-expression-matching) (Hard) + 1. [Regular Expression Matching](../regular-expression-matching) (Hard) diff --git a/problems/winning-candidate/README.md b/problems/winning-candidate/README.md index a6077e393..ccdb959c5 100644 --- a/problems/winning-candidate/README.md +++ b/problems/winning-candidate/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/squirrel-simulation "Squirrel Simulation") +[< Previous](../squirrel-simulation "Squirrel Simulation") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/distribute-candies "Distribute Candies") +[Next >](../distribute-candies "Distribute Candies") ## [574. Winning Candidate (Medium)](https://leetcode.com/problems/winning-candidate "当选者") diff --git a/problems/word-abbreviation/README.md b/problems/word-abbreviation/README.md index af9f1356a..c6ee708e0 100644 --- a/problems/word-abbreviation/README.md +++ b/problems/word-abbreviation/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/beautiful-arrangement "Beautiful Arrangement") +[< Previous](../beautiful-arrangement "Beautiful Arrangement") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/random-pick-with-weight "Random Pick with Weight") +[Next >](../random-pick-with-weight "Random Pick with Weight") ## [527. Word Abbreviation (Hard)](https://leetcode.com/problems/word-abbreviation "单词缩写") @@ -36,9 +36,9 @@ ### Related Topics - [[Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[Sort](../../tag/sort/README.md)] + [[String](../../tag/string/README.md)] ### Similar Questions - 1. [Valid Word Abbreviation](https://github.com/openset/leetcode/tree/master/problems/valid-word-abbreviation) (Easy) - 1. [Minimum Unique Word Abbreviation](https://github.com/openset/leetcode/tree/master/problems/minimum-unique-word-abbreviation) (Hard) + 1. [Valid Word Abbreviation](../valid-word-abbreviation) (Easy) + 1. [Minimum Unique Word Abbreviation](../minimum-unique-word-abbreviation) (Hard) diff --git a/problems/word-break-ii/README.md b/problems/word-break-ii/README.md index 5f7c9ba21..5bfaa2a84 100644 --- a/problems/word-break-ii/README.md +++ b/problems/word-break-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/word-break "Word Break") +[< Previous](../word-break "Word Break") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/linked-list-cycle "Linked List Cycle") +[Next >](../linked-list-cycle "Linked List Cycle") ## [140. Word Break II (Hard)](https://leetcode.com/problems/word-break-ii "单词拆分 II") @@ -58,9 +58,9 @@ wordDict = ["cats", "dog", "sand", "and" [] ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Word Break](https://github.com/openset/leetcode/tree/master/problems/word-break) (Medium) - 1. [Concatenated Words](https://github.com/openset/leetcode/tree/master/problems/concatenated-words) (Hard) + 1. [Word Break](../word-break) (Medium) + 1. [Concatenated Words](../concatenated-words) (Hard) diff --git a/problems/word-break/README.md b/problems/word-break/README.md index 350da232d..b33b0291e 100644 --- a/problems/word-break/README.md +++ b/problems/word-break/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/copy-list-with-random-pointer "Copy List with Random Pointer") +[< Previous](../copy-list-with-random-pointer "Copy List with Random Pointer") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/word-break-ii "Word Break II") +[Next >](../word-break-ii "Word Break II") ## [139. Word Break (Medium)](https://leetcode.com/problems/word-break "单词拆分") @@ -45,7 +45,7 @@ ### Related Topics - [[Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] + [[Dynamic Programming](../../tag/dynamic-programming/README.md)] ### Similar Questions - 1. [Word Break II](https://github.com/openset/leetcode/tree/master/problems/word-break-ii) (Hard) + 1. [Word Break II](../word-break-ii) (Hard) diff --git a/problems/word-frequency/README.md b/problems/word-frequency/README.md index 01de1d3bd..a8b0447ab 100644 --- a/problems/word-frequency/README.md +++ b/problems/word-frequency/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/number-of-1-bits "Number of 1 Bits") +[< Previous](../number-of-1-bits "Number of 1 Bits") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/valid-phone-numbers "Valid Phone Numbers") +[Next >](../valid-phone-numbers "Valid Phone Numbers") ## [192. Word Frequency (Medium)](https://leetcode.com/problems/word-frequency "统计词频") @@ -47,4 +47,4 @@ day 1 ### Similar Questions - 1. [Top K Frequent Elements](https://github.com/openset/leetcode/tree/master/problems/top-k-frequent-elements) (Medium) + 1. [Top K Frequent Elements](../top-k-frequent-elements) (Medium) diff --git a/problems/word-ladder-ii/README.md b/problems/word-ladder-ii/README.md index e1f44be7e..89166942d 100644 --- a/problems/word-ladder-ii/README.md +++ b/problems/word-ladder-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/valid-palindrome "Valid Palindrome") +[< Previous](../valid-palindrome "Valid Palindrome") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/word-ladder "Word Ladder") +[Next >](../word-ladder "Word Ladder") ## [126. Word Ladder II (Hard)](https://leetcode.com/problems/word-ladder-ii "单词接龙 II") @@ -60,10 +60,10 @@ wordList = ["hot","dot","dog","lot",&quo ### Related Topics - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] + [[Array](../../tag/array/README.md)] + [[String](../../tag/string/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Word Ladder](https://github.com/openset/leetcode/tree/master/problems/word-ladder) (Medium) + 1. [Word Ladder](../word-ladder) (Medium) diff --git a/problems/word-ladder/README.md b/problems/word-ladder/README.md index 84a7f94f2..6e83286d9 100644 --- a/problems/word-ladder/README.md +++ b/problems/word-ladder/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/word-ladder-ii "Word Ladder II") +[< Previous](../word-ladder-ii "Word Ladder II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/longest-consecutive-sequence "Longest Consecutive Sequence") +[Next >](../longest-consecutive-sequence "Longest Consecutive Sequence") ## [127. Word Ladder (Medium)](https://leetcode.com/problems/word-ladder "单词接龙") @@ -59,8 +59,8 @@ wordList = ["hot","dot","dog","lot",&quo ### Related Topics - [[Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] + [[Breadth-first Search](../../tag/breadth-first-search/README.md)] ### Similar Questions - 1. [Word Ladder II](https://github.com/openset/leetcode/tree/master/problems/word-ladder-ii) (Hard) - 1. [Minimum Genetic Mutation](https://github.com/openset/leetcode/tree/master/problems/minimum-genetic-mutation) (Medium) + 1. [Word Ladder II](../word-ladder-ii) (Hard) + 1. [Minimum Genetic Mutation](../minimum-genetic-mutation) (Medium) diff --git a/problems/word-pattern-ii/README.md b/problems/word-pattern-ii/README.md index 9033c3830..4bb45671f 100644 --- a/problems/word-pattern-ii/README.md +++ b/problems/word-pattern-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/word-pattern "Word Pattern") +[< Previous](../word-pattern "Word Pattern") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/nim-game "Nim Game") +[Next >](../nim-game "Nim Game") ## [291. Word Pattern II (Hard)](https://leetcode.com/problems/word-pattern-ii "单词规律 II") @@ -38,7 +38,7 @@ You may assume both pattern and str contains only lowercase letters.

### Related Topics - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Word Pattern](https://github.com/openset/leetcode/tree/master/problems/word-pattern) (Easy) + 1. [Word Pattern](../word-pattern) (Easy) diff --git a/problems/word-pattern/README.md b/problems/word-pattern/README.md index 9fff9caf9..afa958726 100644 --- a/problems/word-pattern/README.md +++ b/problems/word-pattern/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/game-of-life "Game of Life") +[< Previous](../game-of-life "Game of Life") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/word-pattern-ii "Word Pattern II") +[Next >](../word-pattern-ii "Word Pattern II") ## [290. Word Pattern (Easy)](https://leetcode.com/problems/word-pattern "单词规律") @@ -43,8 +43,8 @@ You may assume pattern contains only lowercase letters, and str contains lowercase letters that may be separated by a single space.

### Related Topics - [[Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] + [[Hash Table](../../tag/hash-table/README.md)] ### Similar Questions - 1. [Isomorphic Strings](https://github.com/openset/leetcode/tree/master/problems/isomorphic-strings) (Easy) - 1. [Word Pattern II](https://github.com/openset/leetcode/tree/master/problems/word-pattern-ii) (Hard) + 1. [Isomorphic Strings](../isomorphic-strings) (Easy) + 1. [Word Pattern II](../word-pattern-ii) (Hard) diff --git a/problems/word-search-ii/README.md b/problems/word-search-ii/README.md index 73dabb714..0a51d3e59 100644 --- a/problems/word-search-ii/README.md +++ b/problems/word-search-ii/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/add-and-search-word-data-structure-design "Add and Search Word - Data structure design") +[< Previous](../add-and-search-word-data-structure-design "Add and Search Word - Data structure design") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/house-robber-ii "House Robber II") +[Next >](../house-robber-ii "House Robber II") ## [212. Word Search II (Hard)](https://leetcode.com/problems/word-search-ii "单词搜索 II") @@ -42,12 +42,12 @@ ### Related Topics - [[Trie](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Trie](../../tag/trie/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Word Search](https://github.com/openset/leetcode/tree/master/problems/word-search) (Medium) - 1. [Unique Paths III](https://github.com/openset/leetcode/tree/master/problems/unique-paths-iii) (Hard) + 1. [Word Search](../word-search) (Medium) + 1. [Unique Paths III](../unique-paths-iii) (Hard) ### Hints
diff --git a/problems/word-search/README.md b/problems/word-search/README.md index 5f5b4bb13..a6c9d25c5 100644 --- a/problems/word-search/README.md +++ b/problems/word-search/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/subsets "Subsets") +[< Previous](../subsets "Subsets") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-array-ii "Remove Duplicates from Sorted Array II") +[Next >](../remove-duplicates-from-sorted-array-ii "Remove Duplicates from Sorted Array II") ## [79. Word Search (Medium)](https://leetcode.com/problems/word-search "单词搜索") @@ -31,8 +31,8 @@ Given word = "ABCB", return false. ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Array](../../tag/array/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Word Search II](https://github.com/openset/leetcode/tree/master/problems/word-search-ii) (Hard) + 1. [Word Search II](../word-search-ii) (Hard) diff --git a/problems/word-squares/README.md b/problems/word-squares/README.md index e8f2a7639..c5a53380b 100644 --- a/problems/word-squares/README.md +++ b/problems/word-squares/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/longest-repeating-character-replacement "Longest Repeating Character Replacement") +[< Previous](../longest-repeating-character-replacement "Longest Repeating Character Replacement") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/convert-binary-search-tree-to-sorted-doubly-linked-list "Convert Binary Search Tree to Sorted Doubly Linked List") +[Next >](../convert-binary-search-tree-to-sorted-doubly-linked-list "Convert Binary Search Tree to Sorted Doubly Linked List") ## [425. Word Squares (Hard)](https://leetcode.com/problems/word-squares "单词方块") @@ -82,8 +82,8 @@ The output consists of two word squares. The order of output does not matter (ju

### Related Topics - [[Trie](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] - [[Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] + [[Trie](../../tag/trie/README.md)] + [[Backtracking](../../tag/backtracking/README.md)] ### Similar Questions - 1. [Valid Word Square](https://github.com/openset/leetcode/tree/master/problems/valid-word-square) (Easy) + 1. [Valid Word Square](../valid-word-square) (Easy) diff --git a/problems/word-subsets/README.md b/problems/word-subsets/README.md index e3b35bbf2..9a557652d 100644 --- a/problems/word-subsets/README.md +++ b/problems/word-subsets/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/partition-array-into-disjoint-intervals "Partition Array into Disjoint Intervals") +[< Previous](../partition-array-into-disjoint-intervals "Partition Array into Disjoint Intervals") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/reverse-only-letters "Reverse Only Letters") +[Next >](../reverse-only-letters "Reverse Only Letters") ## [916. Word Subsets (Medium)](https://leetcode.com/problems/word-subsets "单词子集") @@ -81,4 +81,4 @@ ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/x-of-a-kind-in-a-deck-of-cards/README.md b/problems/x-of-a-kind-in-a-deck-of-cards/README.md index 1a4c97be7..5ae7dfdea 100644 --- a/problems/x-of-a-kind-in-a-deck-of-cards/README.md +++ b/problems/x-of-a-kind-in-a-deck-of-cards/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/cat-and-mouse "Cat and Mouse") +[< Previous](../cat-and-mouse "Cat and Mouse") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/partition-array-into-disjoint-intervals "Partition Array into Disjoint Intervals") +[Next >](../partition-array-into-disjoint-intervals "Partition Array into Disjoint Intervals") ## [914. X of a Kind in a Deck of Cards (Easy)](https://leetcode.com/problems/x-of-a-kind-in-a-deck-of-cards "卡牌分组") @@ -89,5 +89,5 @@ ### Related Topics - [[Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] - [[Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] + [[Array](../../tag/array/README.md)] + [[Math](../../tag/math/README.md)] diff --git a/problems/zigzag-conversion/README.md b/problems/zigzag-conversion/README.md index be8e65df8..e0b4c7f6a 100644 --- a/problems/zigzag-conversion/README.md +++ b/problems/zigzag-conversion/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/longest-palindromic-substring "Longest Palindromic Substring") +[< Previous](../longest-palindromic-substring "Longest Palindromic Substring") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/reverse-integer "Reverse Integer") +[Next >](../reverse-integer "Reverse Integer") ## [6. ZigZag Conversion (Medium)](https://leetcode.com/problems/zigzag-conversion "Z 字形变换") @@ -46,4 +46,4 @@ Y A H R P I ### Related Topics - [[String](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] + [[String](../../tag/string/README.md)] diff --git a/problems/zigzag-iterator/README.md b/problems/zigzag-iterator/README.md index e73a2dd42..7c86e928a 100644 --- a/problems/zigzag-iterator/README.md +++ b/problems/zigzag-iterator/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/wiggle-sort "Wiggle Sort") +[< Previous](../wiggle-sort "Wiggle Sort") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/expression-add-operators "Expression Add Operators") +[Next >](../expression-add-operators "Expression Add Operators") ## [281. Zigzag Iterator (Medium)](https://leetcode.com/problems/zigzag-iterator "锯齿迭代器") @@ -40,10 +40,10 @@ The "Zigzag" order is not clearly defined and is ambiguous for k ### Related Topics - [[Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] + [[Design](../../tag/design/README.md)] ### Similar Questions - 1. [Binary Search Tree Iterator](https://github.com/openset/leetcode/tree/master/problems/binary-search-tree-iterator) (Medium) - 1. [Flatten 2D Vector](https://github.com/openset/leetcode/tree/master/problems/flatten-2d-vector) (Medium) - 1. [Peeking Iterator](https://github.com/openset/leetcode/tree/master/problems/peeking-iterator) (Medium) - 1. [Flatten Nested List Iterator](https://github.com/openset/leetcode/tree/master/problems/flatten-nested-list-iterator) (Medium) + 1. [Binary Search Tree Iterator](../binary-search-tree-iterator) (Medium) + 1. [Flatten 2D Vector](../flatten-2d-vector) (Medium) + 1. [Peeking Iterator](../peeking-iterator) (Medium) + 1. [Flatten Nested List Iterator](../flatten-nested-list-iterator) (Medium) diff --git a/problems/zuma-game/README.md b/problems/zuma-game/README.md index 37123e60d..a8d9b5b65 100644 --- a/problems/zuma-game/README.md +++ b/problems/zuma-game/README.md @@ -5,9 +5,9 @@ -[< Previous](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones-ii "Max Consecutive Ones II") +[< Previous](../max-consecutive-ones-ii "Max Consecutive Ones II") 　　　　　　　　　　　　　　　　 -[Next >](https://github.com/openset/leetcode/tree/master/problems/robot-room-cleaner "Robot Room Cleaner") +[Next >](../robot-room-cleaner "Robot Room Cleaner") ## [488. Zuma Game (Hard)](https://leetcode.com/problems/zuma-game "祖玛游戏") @@ -47,4 +47,4 @@ Find the minimal balls you have to insert to remove all the balls on the table.

### Related Topics - [[Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] + [[Depth-first Search](../../tag/depth-first-search/README.md)] diff --git a/readme/1-300.md b/readme/1-300.md index 347bc028a..15fc094b0 100644 --- a/readme/1-300.md +++ b/readme/1-300.md @@ -19,44 +19,44 @@ LeetCode Problems' Solutions - - - - - - + + + + + + - - - - - - + + + + + + - - - - - - + + + + + + - - - - - - + + + + + + - - - - - - + + + + + +
[1-50][51-100][101-150][151-200][201-250][251-300][1-50][51-100][101-150][151-200][201-250][251-300]
[301-350][351-400][401-450][451-500][501-550][551-600][301-350][351-400][401-450][451-500][501-550][551-600]
[601-650][651-700][701-750][751-800][801-850][851-900][601-650][651-700][701-750][751-800][801-850][851-900]
[901-950][951-1000][1001-1050][1051-1100][1101-1150][1151-1200][901-950][951-1000][1001-1050][1051-1100][1101-1150][1151-1200]
[1201-1250][1251-1300][1301-1350][1351-1400][1401-1450][1451-1500][1201-1250][1251-1300][1301-1350][1351-1400][1401-1450][1451-1500]
diff --git a/readme/301-600.md b/readme/301-600.md index d85378bac..0baddcda9 100644 --- a/readme/301-600.md +++ b/readme/301-600.md @@ -19,44 +19,44 @@ LeetCode Problems' Solutions - - - - - - + + + + + + - - - - - - + + + + + + - - - - - - + + + + + + - - - - - - + + + + + + - - - - - - + + + + + +
[1-50][51-100][101-150][151-200][201-250][251-300][1-50][51-100][101-150][151-200][201-250][251-300]
[301-350][351-400][401-450][451-500][501-550][551-600][301-350][351-400][401-450][451-500][501-550][551-600]
[601-650][651-700][701-750][751-800][801-850][851-900][601-650][651-700][701-750][751-800][801-850][851-900]
[901-950][951-1000][1001-1050][1051-1100][1101-1150][1151-1200][901-950][951-1000][1001-1050][1051-1100][1101-1150][1151-1200]
[1201-1250][1251-1300][1301-1350][1351-1400][1401-1450][1451-1500][1201-1250][1251-1300][1301-1350][1351-1400][1401-1450][1451-1500]
diff --git a/readme/601-900.md b/readme/601-900.md index a80a422d9..b9e0660fa 100644 --- a/readme/601-900.md +++ b/readme/601-900.md @@ -19,44 +19,44 @@ LeetCode Problems' Solutions - - - - - - + + + + + + - - - - - - + + + + + + - - - - - - + + + + + + - - - - - - + + + + + + - - - - - - + + + + + +
[1-50][51-100][101-150][151-200][201-250][251-300][1-50][51-100][101-150][151-200][201-250][251-300]
[301-350][351-400][401-450][451-500][501-550][551-600][301-350][351-400][401-450][451-500][501-550][551-600]
[601-650][651-700][701-750][751-800][801-850][851-900][601-650][651-700][701-750][751-800][801-850][851-900]
[901-950][951-1000][1001-1050][1051-1100][1101-1150][1151-1200][901-950][951-1000][1001-1050][1051-1100][1101-1150][1151-1200]
[1201-1250][1251-1300][1301-1350][1351-1400][1401-1450][1451-1500][1201-1250][1251-1300][1301-1350][1351-1400][1401-1450][1451-1500]
diff --git a/tag/README.md b/tag/README.md index e45f223ef..ce49fdea5 100644 --- a/tag/README.md +++ b/tag/README.md @@ -9,23 +9,23 @@ | # | Title | 话题 | | # | Title | 话题 | | :-: | - | :-: | - | :-: | - | :-: | -| 1 | [Array](https://github.com/openset/leetcode/tree/master/tag/array/README.md) | [数组](https://openset.github.io/tags/array/) | | 2 | [Dynamic Programming](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md) | [动态规划](https://openset.github.io/tags/dynamic-programming/) | -| 3 | [Math](https://github.com/openset/leetcode/tree/master/tag/math/README.md) | [数学](https://openset.github.io/tags/math/) | | 4 | [String](https://github.com/openset/leetcode/tree/master/tag/string/README.md) | [字符串](https://openset.github.io/tags/string/) | -| 5 | [Tree](https://github.com/openset/leetcode/tree/master/tag/tree/README.md) | [树](https://openset.github.io/tags/tree/) | | 6 | [Hash Table](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md) | [哈希表](https://openset.github.io/tags/hash-table/) | -| 7 | [Depth-first Search](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md) | [深度优先搜索](https://openset.github.io/tags/depth-first-search/) | | 8 | [Binary Search](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md) | [二分查找](https://openset.github.io/tags/binary-search/) | -| 9 | [Greedy](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md) | [贪心算法](https://openset.github.io/tags/greedy/) | | 10 | [Breadth-first Search](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md) | [广度优先搜索](https://openset.github.io/tags/breadth-first-search/) | -| 11 | [Two Pointers](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md) | [双指针](https://openset.github.io/tags/two-pointers/) | | 12 | [Stack](https://github.com/openset/leetcode/tree/master/tag/stack/README.md) | [栈](https://openset.github.io/tags/stack/) | -| 13 | [Backtracking](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md) | [回溯算法](https://openset.github.io/tags/backtracking/) | | 14 | [Design](https://github.com/openset/leetcode/tree/master/tag/design/README.md) | [设计](https://openset.github.io/tags/design/) | -| 15 | [Bit Manipulation](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md) | [位运算](https://openset.github.io/tags/bit-manipulation/) | | 16 | [Sort](https://github.com/openset/leetcode/tree/master/tag/sort/README.md) | [排序](https://openset.github.io/tags/sort/) | -| 17 | [Graph](https://github.com/openset/leetcode/tree/master/tag/graph/README.md) | [图](https://openset.github.io/tags/graph/) | | 18 | [Linked List](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md) | [链表](https://openset.github.io/tags/linked-list/) | -| 19 | [Heap](https://github.com/openset/leetcode/tree/master/tag/heap/README.md) | [堆](https://openset.github.io/tags/heap/) | | 20 | [Union Find](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md) | [并查集](https://openset.github.io/tags/union-find/) | -| 21 | [Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md) | [Sliding Window](https://openset.github.io/tags/sliding-window/) | | 22 | [Divide and Conquer](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md) | [分治算法](https://openset.github.io/tags/divide-and-conquer/) | -| 23 | [Trie](https://github.com/openset/leetcode/tree/master/tag/trie/README.md) | [字典树](https://openset.github.io/tags/trie/) | | 24 | [Recursion](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md) | [递归](https://openset.github.io/tags/recursion/) | -| 25 | [Segment Tree](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md) | [线段树](https://openset.github.io/tags/segment-tree/) | | 26 | [Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md) | [Ordered Map](https://openset.github.io/tags/ordered-map/) | -| 27 | [Queue](https://github.com/openset/leetcode/tree/master/tag/queue/README.md) | [队列](https://openset.github.io/tags/queue/) | | 28 | [Minimax](https://github.com/openset/leetcode/tree/master/tag/minimax/README.md) | [极小化极大](https://openset.github.io/tags/minimax/) | -| 29 | [Binary Indexed Tree](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md) | [树状数组](https://openset.github.io/tags/binary-indexed-tree/) | | 30 | [Line Sweep](https://github.com/openset/leetcode/tree/master/tag/line-sweep/README.md) | [Line Sweep](https://openset.github.io/tags/line-sweep/) | -| 31 | [Random](https://github.com/openset/leetcode/tree/master/tag/random/README.md) | [Random](https://openset.github.io/tags/random/) | | 32 | [Topological Sort](https://github.com/openset/leetcode/tree/master/tag/topological-sort/README.md) | [拓扑排序](https://openset.github.io/tags/topological-sort/) | -| 33 | [Brainteaser](https://github.com/openset/leetcode/tree/master/tag/brainteaser/README.md) | [脑筋急转弯](https://openset.github.io/tags/brainteaser/) | | 34 | [Geometry](https://github.com/openset/leetcode/tree/master/tag/geometry/README.md) | [几何](https://openset.github.io/tags/geometry/) | -| 35 | [Binary Search Tree](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md) | [二叉搜索树](https://openset.github.io/tags/binary-search-tree/) | | 36 | [Rejection Sampling](https://github.com/openset/leetcode/tree/master/tag/rejection-sampling/README.md) | [Rejection Sampling](https://openset.github.io/tags/rejection-sampling/) | -| 37 | [Reservoir Sampling](https://github.com/openset/leetcode/tree/master/tag/reservoir-sampling/README.md) | [蓄水池抽样](https://openset.github.io/tags/reservoir-sampling/) | | 38 | [Memoization](https://github.com/openset/leetcode/tree/master/tag/memoization/README.md) | [记忆化](https://openset.github.io/tags/memoization/) | -| 39 | [Rolling Hash](https://github.com/openset/leetcode/tree/master/tag/rolling-hash/README.md) | [Rolling Hash](https://openset.github.io/tags/rolling-hash/) | | 40 | [Suffix Array](https://github.com/openset/leetcode/tree/master/tag/suffix-array/README.md) | [Suffix Array](https://openset.github.io/tags/suffix-array/) | +| 1 | [Array](array/README.md) | [数组](https://openset.github.io/tags/array/) | | 2 | [Dynamic Programming](dynamic-programming/README.md) | [动态规划](https://openset.github.io/tags/dynamic-programming/) | +| 3 | [Math](math/README.md) | [数学](https://openset.github.io/tags/math/) | | 4 | [String](string/README.md) | [字符串](https://openset.github.io/tags/string/) | +| 5 | [Tree](tree/README.md) | [树](https://openset.github.io/tags/tree/) | | 6 | [Hash Table](hash-table/README.md) | [哈希表](https://openset.github.io/tags/hash-table/) | +| 7 | [Depth-first Search](depth-first-search/README.md) | [深度优先搜索](https://openset.github.io/tags/depth-first-search/) | | 8 | [Binary Search](binary-search/README.md) | [二分查找](https://openset.github.io/tags/binary-search/) | +| 9 | [Greedy](greedy/README.md) | [贪心算法](https://openset.github.io/tags/greedy/) | | 10 | [Breadth-first Search](breadth-first-search/README.md) | [广度优先搜索](https://openset.github.io/tags/breadth-first-search/) | +| 11 | [Two Pointers](two-pointers/README.md) | [双指针](https://openset.github.io/tags/two-pointers/) | | 12 | [Stack](stack/README.md) | [栈](https://openset.github.io/tags/stack/) | +| 13 | [Backtracking](backtracking/README.md) | [回溯算法](https://openset.github.io/tags/backtracking/) | | 14 | [Design](design/README.md) | [设计](https://openset.github.io/tags/design/) | +| 15 | [Bit Manipulation](bit-manipulation/README.md) | [位运算](https://openset.github.io/tags/bit-manipulation/) | | 16 | [Sort](sort/README.md) | [排序](https://openset.github.io/tags/sort/) | +| 17 | [Graph](graph/README.md) | [图](https://openset.github.io/tags/graph/) | | 18 | [Linked List](linked-list/README.md) | [链表](https://openset.github.io/tags/linked-list/) | +| 19 | [Heap](heap/README.md) | [堆](https://openset.github.io/tags/heap/) | | 20 | [Union Find](union-find/README.md) | [并查集](https://openset.github.io/tags/union-find/) | +| 21 | [Sliding Window](sliding-window/README.md) | [Sliding Window](https://openset.github.io/tags/sliding-window/) | | 22 | [Divide and Conquer](divide-and-conquer/README.md) | [分治算法](https://openset.github.io/tags/divide-and-conquer/) | +| 23 | [Trie](trie/README.md) | [字典树](https://openset.github.io/tags/trie/) | | 24 | [Recursion](recursion/README.md) | [递归](https://openset.github.io/tags/recursion/) | +| 25 | [Segment Tree](segment-tree/README.md) | [线段树](https://openset.github.io/tags/segment-tree/) | | 26 | [Ordered Map](ordered-map/README.md) | [Ordered Map](https://openset.github.io/tags/ordered-map/) | +| 27 | [Queue](queue/README.md) | [队列](https://openset.github.io/tags/queue/) | | 28 | [Minimax](minimax/README.md) | [极小化极大](https://openset.github.io/tags/minimax/) | +| 29 | [Binary Indexed Tree](binary-indexed-tree/README.md) | [树状数组](https://openset.github.io/tags/binary-indexed-tree/) | | 30 | [Line Sweep](line-sweep/README.md) | [Line Sweep](https://openset.github.io/tags/line-sweep/) | +| 31 | [Random](random/README.md) | [Random](https://openset.github.io/tags/random/) | | 32 | [Topological Sort](topological-sort/README.md) | [拓扑排序](https://openset.github.io/tags/topological-sort/) | +| 33 | [Brainteaser](brainteaser/README.md) | [脑筋急转弯](https://openset.github.io/tags/brainteaser/) | | 34 | [Geometry](geometry/README.md) | [几何](https://openset.github.io/tags/geometry/) | +| 35 | [Binary Search Tree](binary-search-tree/README.md) | [二叉搜索树](https://openset.github.io/tags/binary-search-tree/) | | 36 | [Rejection Sampling](rejection-sampling/README.md) | [Rejection Sampling](https://openset.github.io/tags/rejection-sampling/) | +| 37 | [Reservoir Sampling](reservoir-sampling/README.md) | [蓄水池抽样](https://openset.github.io/tags/reservoir-sampling/) | | 38 | [Memoization](memoization/README.md) | [记忆化](https://openset.github.io/tags/memoization/) | +| 39 | [Rolling Hash](rolling-hash/README.md) | [Rolling Hash](https://openset.github.io/tags/rolling-hash/) | | 40 | [Suffix Array](suffix-array/README.md) | [Suffix Array](https://openset.github.io/tags/suffix-array/) | diff --git a/tag/array/README.md b/tag/array/README.md index 353bfe55d..65b453837 100644 --- a/tag/array/README.md +++ b/tag/array/README.md @@ -5,217 +5,217 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > 数组 +## [话题分类](../README.md) > 数组 | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 1292 | [元素和小于等于阈值的正方形的最大边长](https://github.com/openset/leetcode/tree/master/problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 1287 | [有序数组中出现次数超过25%的元素](https://github.com/openset/leetcode/tree/master/problems/element-appearing-more-than-25-in-sorted-array) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 1277 | [统计全为 1 的正方形子矩阵](https://github.com/openset/leetcode/tree/master/problems/count-square-submatrices-with-all-ones) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 1275 | [找出井字棋的获胜者](https://github.com/openset/leetcode/tree/master/problems/find-winner-on-a-tic-tac-toe-game) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 1267 | [统计参与通信的服务器](https://github.com/openset/leetcode/tree/master/problems/count-servers-that-communicate) | [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 1266 | [访问所有点的最小时间](https://github.com/openset/leetcode/tree/master/problems/minimum-time-visiting-all-points) | [[几何](https://github.com/openset/leetcode/tree/master/tag/geometry/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 1260 | [二维网格迁移](https://github.com/openset/leetcode/tree/master/problems/shift-2d-grid) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 1252 | [奇数值单元格的数目](https://github.com/openset/leetcode/tree/master/problems/cells-with-odd-values-in-a-matrix) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 1243 | [数组变换](https://github.com/openset/leetcode/tree/master/problems/array-transformation) 🔒 | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 1233 | [删除子文件夹](https://github.com/openset/leetcode/tree/master/problems/remove-sub-folders-from-the-filesystem) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 1232 | [缀点成线](https://github.com/openset/leetcode/tree/master/problems/check-if-it-is-a-straight-line) | [[几何](https://github.com/openset/leetcode/tree/master/tag/geometry/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 1222 | [可以攻击国王的皇后](https://github.com/openset/leetcode/tree/master/problems/queens-that-can-attack-the-king) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 1217 | [玩筹码](https://github.com/openset/leetcode/tree/master/problems/play-with-chips) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 1208 | [尽可能使字符串相等](https://github.com/openset/leetcode/tree/master/problems/get-equal-substrings-within-budget) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Medium | -| 1202 | [交换字符串中的元素](https://github.com/openset/leetcode/tree/master/problems/smallest-string-with-swaps) | [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 1200 | [最小绝对差](https://github.com/openset/leetcode/tree/master/problems/minimum-absolute-difference) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 1185 | [一周中的第几天](https://github.com/openset/leetcode/tree/master/problems/day-of-the-week) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 1184 | [公交站间的距离](https://github.com/openset/leetcode/tree/master/problems/distance-between-bus-stops) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 1177 | [构建回文串检测](https://github.com/openset/leetcode/tree/master/problems/can-make-palindrome-from-substring) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 1176 | [健身计划评估](https://github.com/openset/leetcode/tree/master/problems/diet-plan-performance) 🔒 | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Easy | -| 1170 | [比较字符串最小字母出现频次](https://github.com/openset/leetcode/tree/master/problems/compare-strings-by-frequency-of-the-smallest-character) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 1169 | [查询无效交易](https://github.com/openset/leetcode/tree/master/problems/invalid-transactions) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 1160 | [拼写单词](https://github.com/openset/leetcode/tree/master/problems/find-words-that-can-be-formed-by-characters) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 1157 | [子数组中占绝大多数的元素](https://github.com/openset/leetcode/tree/master/problems/online-majority-element-in-subarray) | [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Hard | -| 1152 | [用户网站访问行为分析](https://github.com/openset/leetcode/tree/master/problems/analyze-user-website-visit-pattern) 🔒 | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 1151 | [最少交换次数来组合所有的 1](https://github.com/openset/leetcode/tree/master/problems/minimum-swaps-to-group-all-1s-together) 🔒 | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Medium | -| 1150 | [检查一个数是否在数组中占绝大多数](https://github.com/openset/leetcode/tree/master/problems/check-if-a-number-is-majority-element-in-a-sorted-array) 🔒 | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Easy | -| 1146 | [快照数组](https://github.com/openset/leetcode/tree/master/problems/snapshot-array) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 1144 | [递减元素使数组呈锯齿状](https://github.com/openset/leetcode/tree/master/problems/decrease-elements-to-make-array-zigzag) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 1133 | [最大唯一数](https://github.com/openset/leetcode/tree/master/problems/largest-unique-number) 🔒 | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 1128 | [等价多米诺骨牌对的数量](https://github.com/openset/leetcode/tree/master/problems/number-of-equivalent-domino-pairs) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 1122 | [数组的相对排序](https://github.com/openset/leetcode/tree/master/problems/relative-sort-array) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 1109 | [航班预订统计](https://github.com/openset/leetcode/tree/master/problems/corporate-flight-bookings) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 1099 | [小于 K 的两数之和](https://github.com/openset/leetcode/tree/master/problems/two-sum-less-than-k) 🔒 | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 1089 | [复写零](https://github.com/openset/leetcode/tree/master/problems/duplicate-zeros) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 1086 | [前五科的均分](https://github.com/openset/leetcode/tree/master/problems/high-five) 🔒 | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 1085 | [最小元素各数位之和](https://github.com/openset/leetcode/tree/master/problems/sum-of-digits-in-the-minimum-number) 🔒 | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 1074 | [元素和为目标值的子矩阵数量](https://github.com/openset/leetcode/tree/master/problems/number-of-submatrices-that-sum-to-target) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Hard | -| 1064 | [不动点](https://github.com/openset/leetcode/tree/master/problems/fixed-point) 🔒 | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Easy | -| 1053 | [交换一次的先前排列](https://github.com/openset/leetcode/tree/master/problems/previous-permutation-with-one-swap) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 1052 | [爱生气的书店老板](https://github.com/openset/leetcode/tree/master/problems/grumpy-bookstore-owner) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Medium | -| 1051 | [高度检查器](https://github.com/openset/leetcode/tree/master/problems/height-checker) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 1040 | [移动石子直到连续 II](https://github.com/openset/leetcode/tree/master/problems/moving-stones-until-consecutive-ii) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Medium | -| 1035 | [不相交的线](https://github.com/openset/leetcode/tree/master/problems/uncrossed-lines) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 1031 | [两个非重叠子数组的最大和](https://github.com/openset/leetcode/tree/master/problems/maximum-sum-of-two-non-overlapping-subarrays) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 1018 | [可被 5 整除的二进制前缀](https://github.com/openset/leetcode/tree/master/problems/binary-prefix-divisible-by-5) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 1014 | [最佳观光组合](https://github.com/openset/leetcode/tree/master/problems/best-sightseeing-pair) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 1013 | [将数组分成和相等的三个部分](https://github.com/openset/leetcode/tree/master/problems/partition-array-into-three-parts-with-equal-sum) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 1011 | [在 D 天内送达包裹的能力](https://github.com/openset/leetcode/tree/master/problems/capacity-to-ship-packages-within-d-days) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 1010 | [总持续时间可被 60 整除的歌曲](https://github.com/openset/leetcode/tree/master/problems/pairs-of-songs-with-total-durations-divisible-by-60) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 1007 | [行相等的最少多米诺旋转](https://github.com/openset/leetcode/tree/master/problems/minimum-domino-rotations-for-equal-row) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 1002 | [查找常用字符](https://github.com/openset/leetcode/tree/master/problems/find-common-characters) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 999 | [车的可用捕获量](https://github.com/openset/leetcode/tree/master/problems/available-captures-for-rook) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 989 | [数组形式的整数加法](https://github.com/openset/leetcode/tree/master/problems/add-to-array-form-of-integer) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 985 | [查询后的偶数和](https://github.com/openset/leetcode/tree/master/problems/sum-of-even-numbers-after-queries) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 978 | [最长湍流子数组](https://github.com/openset/leetcode/tree/master/problems/longest-turbulent-subarray) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Medium | -| 977 | [有序数组的平方](https://github.com/openset/leetcode/tree/master/problems/squares-of-a-sorted-array) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Easy | -| 974 | [和可被 K 整除的子数组](https://github.com/openset/leetcode/tree/master/problems/subarray-sums-divisible-by-k) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 969 | [煎饼排序](https://github.com/openset/leetcode/tree/master/problems/pancake-sorting) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 962 | [最大宽度坡](https://github.com/openset/leetcode/tree/master/problems/maximum-width-ramp) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 954 | [二倍数对数组](https://github.com/openset/leetcode/tree/master/problems/array-of-doubled-pairs) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 950 | [按递增顺序显示卡牌](https://github.com/openset/leetcode/tree/master/problems/reveal-cards-in-increasing-order) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 945 | [使数组唯一的最小增量](https://github.com/openset/leetcode/tree/master/problems/minimum-increment-to-make-array-unique) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 941 | [有效的山脉数组](https://github.com/openset/leetcode/tree/master/problems/valid-mountain-array) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 926 | [将字符串翻转到单调递增](https://github.com/openset/leetcode/tree/master/problems/flip-string-to-monotone-increasing) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 922 | [按奇偶排序数组 II](https://github.com/openset/leetcode/tree/master/problems/sort-array-by-parity-ii) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 918 | [环形子数组的最大和](https://github.com/openset/leetcode/tree/master/problems/maximum-sum-circular-subarray) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 915 | [分割数组](https://github.com/openset/leetcode/tree/master/problems/partition-array-into-disjoint-intervals) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 914 | [卡牌分组](https://github.com/openset/leetcode/tree/master/problems/x-of-a-kind-in-a-deck-of-cards) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 907 | [子数组的最小值之和](https://github.com/openset/leetcode/tree/master/problems/sum-of-subarray-minimums) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 905 | [按奇偶排序数组](https://github.com/openset/leetcode/tree/master/problems/sort-array-by-parity) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 900 | [RLE 迭代器](https://github.com/openset/leetcode/tree/master/problems/rle-iterator) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 896 | [单调数列](https://github.com/openset/leetcode/tree/master/problems/monotonic-array) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 891 | [子序列宽度之和](https://github.com/openset/leetcode/tree/master/problems/sum-of-subsequence-widths) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Hard | -| 888 | [公平的糖果交换](https://github.com/openset/leetcode/tree/master/problems/fair-candy-swap) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 873 | [最长的斐波那契子序列的长度](https://github.com/openset/leetcode/tree/master/problems/length-of-longest-fibonacci-subsequence) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 870 | [优势洗牌](https://github.com/openset/leetcode/tree/master/problems/advantage-shuffle) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 867 | [转置矩阵](https://github.com/openset/leetcode/tree/master/problems/transpose-matrix) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 849 | [到最近的人的最大距离](https://github.com/openset/leetcode/tree/master/problems/maximize-distance-to-closest-person) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 840 | [矩阵中的幻方](https://github.com/openset/leetcode/tree/master/problems/magic-squares-in-grid) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 835 | [图像重叠](https://github.com/openset/leetcode/tree/master/problems/image-overlap) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 832 | [翻转图像](https://github.com/openset/leetcode/tree/master/problems/flipping-an-image) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 830 | [较大分组的位置](https://github.com/openset/leetcode/tree/master/problems/positions-of-large-groups) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 825 | [适龄的朋友](https://github.com/openset/leetcode/tree/master/problems/friends-of-appropriate-ages) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 795 | [区间子数组个数](https://github.com/openset/leetcode/tree/master/problems/number-of-subarrays-with-bounded-maximum) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 792 | [匹配子序列的单词数](https://github.com/openset/leetcode/tree/master/problems/number-of-matching-subsequences) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 782 | [变为棋盘](https://github.com/openset/leetcode/tree/master/problems/transform-to-chessboard) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Hard | -| 775 | [全局倒置与局部倒置](https://github.com/openset/leetcode/tree/master/problems/global-and-local-inversions) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 769 | [最多能完成排序的块](https://github.com/openset/leetcode/tree/master/problems/max-chunks-to-make-sorted) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 768 | [最多能完成排序的块 II](https://github.com/openset/leetcode/tree/master/problems/max-chunks-to-make-sorted-ii) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Hard | -| 766 | [托普利茨矩阵](https://github.com/openset/leetcode/tree/master/problems/toeplitz-matrix) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 755 | [倒水](https://github.com/openset/leetcode/tree/master/problems/pour-water) 🔒 | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 747 | [至少是其他数字两倍的最大数](https://github.com/openset/leetcode/tree/master/problems/largest-number-at-least-twice-of-others) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 746 | [使用最小花费爬楼梯](https://github.com/openset/leetcode/tree/master/problems/min-cost-climbing-stairs) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Easy | -| 729 | [我的日程安排表 I](https://github.com/openset/leetcode/tree/master/problems/my-calendar-i) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 724 | [寻找数组的中心索引](https://github.com/openset/leetcode/tree/master/problems/find-pivot-index) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 723 | [粉碎糖果](https://github.com/openset/leetcode/tree/master/problems/candy-crush) 🔒 | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 719 | [找出第 k 小的距离对](https://github.com/openset/leetcode/tree/master/problems/find-k-th-smallest-pair-distance) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Hard | -| 718 | [最长重复子数组](https://github.com/openset/leetcode/tree/master/problems/maximum-length-of-repeated-subarray) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 717 | [1比特与2比特字符](https://github.com/openset/leetcode/tree/master/problems/1-bit-and-2-bit-characters) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 714 | [买卖股票的最佳时机含手续费](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-with-transaction-fee) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 713 | [乘积小于K的子数组](https://github.com/openset/leetcode/tree/master/problems/subarray-product-less-than-k) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 697 | [数组的度](https://github.com/openset/leetcode/tree/master/problems/degree-of-an-array) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 695 | [岛屿的最大面积](https://github.com/openset/leetcode/tree/master/problems/max-area-of-island) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 689 | [三个无重叠子数组的最大和](https://github.com/openset/leetcode/tree/master/problems/maximum-sum-of-3-non-overlapping-subarrays) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 674 | [最长连续递增序列](https://github.com/openset/leetcode/tree/master/problems/longest-continuous-increasing-subsequence) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 670 | [最大交换](https://github.com/openset/leetcode/tree/master/problems/maximum-swap) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 667 | [优美的排列 II](https://github.com/openset/leetcode/tree/master/problems/beautiful-arrangement-ii) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 665 | [非递减数列](https://github.com/openset/leetcode/tree/master/problems/non-decreasing-array) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 661 | [图片平滑器](https://github.com/openset/leetcode/tree/master/problems/image-smoother) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 644 | [最大平均子段和 II](https://github.com/openset/leetcode/tree/master/problems/maximum-average-subarray-ii) 🔒 | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Hard | -| 643 | [子数组最大平均数 I](https://github.com/openset/leetcode/tree/master/problems/maximum-average-subarray-i) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 628 | [三个数的最大乘积](https://github.com/openset/leetcode/tree/master/problems/maximum-product-of-three-numbers) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 624 | [数组列表中的最大距离](https://github.com/openset/leetcode/tree/master/problems/maximum-distance-in-arrays) 🔒 | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 621 | [任务调度器](https://github.com/openset/leetcode/tree/master/problems/task-scheduler) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[队列](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 611 | [有效三角形的个数](https://github.com/openset/leetcode/tree/master/problems/valid-triangle-number) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 605 | [种花问题](https://github.com/openset/leetcode/tree/master/problems/can-place-flowers) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 581 | [最短无序连续子数组](https://github.com/openset/leetcode/tree/master/problems/shortest-unsorted-continuous-subarray) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 566 | [重塑矩阵](https://github.com/openset/leetcode/tree/master/problems/reshape-the-matrix) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 565 | [数组嵌套](https://github.com/openset/leetcode/tree/master/problems/array-nesting) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 562 | [矩阵中最长的连续1线段](https://github.com/openset/leetcode/tree/master/problems/longest-line-of-consecutive-one-in-matrix) 🔒 | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 561 | [数组拆分 I](https://github.com/openset/leetcode/tree/master/problems/array-partition-i) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 560 | [和为K的子数组](https://github.com/openset/leetcode/tree/master/problems/subarray-sum-equals-k) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 548 | [将数组分割成和相等的子数组](https://github.com/openset/leetcode/tree/master/problems/split-array-with-equal-sum) 🔒 | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 533 | [孤独像素 II](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-ii) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 532 | [数组中的K-diff数对](https://github.com/openset/leetcode/tree/master/problems/k-diff-pairs-in-an-array) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Easy | -| 531 | [孤独像素 I](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-i) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 509 | [斐波那契数](https://github.com/openset/leetcode/tree/master/problems/fibonacci-number) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 495 | [提莫攻击](https://github.com/openset/leetcode/tree/master/problems/teemo-attacking) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 485 | [最大连续1的个数](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 457 | [环形数组循环](https://github.com/openset/leetcode/tree/master/problems/circular-array-loop) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 448 | [找到所有数组中消失的数字](https://github.com/openset/leetcode/tree/master/problems/find-all-numbers-disappeared-in-an-array) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 442 | [数组中重复的数据](https://github.com/openset/leetcode/tree/master/problems/find-all-duplicates-in-an-array) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 414 | [第三大的数](https://github.com/openset/leetcode/tree/master/problems/third-maximum-number) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 381 | [O(1) 时间插入、删除和获取随机元素 - 允许重复](https://github.com/openset/leetcode/tree/master/problems/insert-delete-getrandom-o1-duplicates-allowed) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Hard | -| 380 | [常数时间插入、删除和获取随机元素](https://github.com/openset/leetcode/tree/master/problems/insert-delete-getrandom-o1) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 370 | [区间加法](https://github.com/openset/leetcode/tree/master/problems/range-addition) 🔒 | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 289 | [生命游戏](https://github.com/openset/leetcode/tree/master/problems/game-of-life) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 287 | [寻找重复数](https://github.com/openset/leetcode/tree/master/problems/find-the-duplicate-number) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 283 | [移动零](https://github.com/openset/leetcode/tree/master/problems/move-zeroes) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Easy | -| 280 | [摆动排序](https://github.com/openset/leetcode/tree/master/problems/wiggle-sort) 🔒 | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 277 | [搜寻名人](https://github.com/openset/leetcode/tree/master/problems/find-the-celebrity) 🔒 | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 268 | [缺失数字](https://github.com/openset/leetcode/tree/master/problems/missing-number) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 259 | [较小的三数之和](https://github.com/openset/leetcode/tree/master/problems/3sum-smaller) 🔒 | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 245 | [最短单词距离 III](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance-iii) 🔒 | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 243 | [最短单词距离](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance) 🔒 | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 238 | [除自身以外数组的乘积](https://github.com/openset/leetcode/tree/master/problems/product-of-array-except-self) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 229 | [求众数 II](https://github.com/openset/leetcode/tree/master/problems/majority-element-ii) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 228 | [汇总区间](https://github.com/openset/leetcode/tree/master/problems/summary-ranges) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 219 | [存在重复元素 II](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate-ii) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 217 | [存在重复元素](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 216 | [组合总和 III](https://github.com/openset/leetcode/tree/master/problems/combination-sum-iii) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 209 | [长度最小的子数组](https://github.com/openset/leetcode/tree/master/problems/minimum-size-subarray-sum) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 189 | [旋转数组](https://github.com/openset/leetcode/tree/master/problems/rotate-array) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 169 | [多数元素](https://github.com/openset/leetcode/tree/master/problems/majority-element) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Easy | -| 167 | [两数之和 II - 输入有序数组](https://github.com/openset/leetcode/tree/master/problems/two-sum-ii-input-array-is-sorted) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Easy | -| 163 | [缺失的区间](https://github.com/openset/leetcode/tree/master/problems/missing-ranges) 🔒 | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 162 | [寻找峰值](https://github.com/openset/leetcode/tree/master/problems/find-peak-element) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 154 | [寻找旋转排序数组中的最小值 II](https://github.com/openset/leetcode/tree/master/problems/find-minimum-in-rotated-sorted-array-ii) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Hard | -| 153 | [寻找旋转排序数组中的最小值](https://github.com/openset/leetcode/tree/master/problems/find-minimum-in-rotated-sorted-array) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 152 | [乘积最大子序列](https://github.com/openset/leetcode/tree/master/problems/maximum-product-subarray) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 128 | [最长连续序列](https://github.com/openset/leetcode/tree/master/problems/longest-consecutive-sequence) | [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Hard | -| 126 | [单词接龙 II](https://github.com/openset/leetcode/tree/master/problems/word-ladder-ii) | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | -| 123 | [买卖股票的最佳时机 III](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-iii) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 122 | [买卖股票的最佳时机 II](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-ii) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 121 | [买卖股票的最佳时机](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Easy | -| 120 | [三角形最小路径和](https://github.com/openset/leetcode/tree/master/problems/triangle) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 119 | [杨辉三角 II](https://github.com/openset/leetcode/tree/master/problems/pascals-triangle-ii) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 118 | [杨辉三角](https://github.com/openset/leetcode/tree/master/problems/pascals-triangle) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 106 | [从中序与后序遍历序列构造二叉树](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-inorder-and-postorder-traversal) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 105 | [从前序与中序遍历序列构造二叉树](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-preorder-and-inorder-traversal) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 90 | [子集 II](https://github.com/openset/leetcode/tree/master/problems/subsets-ii) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 88 | [合并两个有序数组](https://github.com/openset/leetcode/tree/master/problems/merge-sorted-array) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Easy | -| 85 | [最大矩形](https://github.com/openset/leetcode/tree/master/problems/maximal-rectangle) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 84 | [柱状图中最大的矩形](https://github.com/openset/leetcode/tree/master/problems/largest-rectangle-in-histogram) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Hard | -| 81 | [搜索旋转排序数组 II](https://github.com/openset/leetcode/tree/master/problems/search-in-rotated-sorted-array-ii) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 80 | [删除排序数组中的重复项 II](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-array-ii) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 79 | [单词搜索](https://github.com/openset/leetcode/tree/master/problems/word-search) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 78 | [子集](https://github.com/openset/leetcode/tree/master/problems/subsets) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 75 | [颜色分类](https://github.com/openset/leetcode/tree/master/problems/sort-colors) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 74 | [搜索二维矩阵](https://github.com/openset/leetcode/tree/master/problems/search-a-2d-matrix) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 73 | [矩阵置零](https://github.com/openset/leetcode/tree/master/problems/set-matrix-zeroes) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 66 | [加一](https://github.com/openset/leetcode/tree/master/problems/plus-one) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 64 | [最小路径和](https://github.com/openset/leetcode/tree/master/problems/minimum-path-sum) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 63 | [不同路径 II](https://github.com/openset/leetcode/tree/master/problems/unique-paths-ii) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 62 | [不同路径](https://github.com/openset/leetcode/tree/master/problems/unique-paths) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 59 | [螺旋矩阵 II](https://github.com/openset/leetcode/tree/master/problems/spiral-matrix-ii) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 57 | [插入区间](https://github.com/openset/leetcode/tree/master/problems/insert-interval) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Hard | -| 56 | [合并区间](https://github.com/openset/leetcode/tree/master/problems/merge-intervals) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 55 | [跳跃游戏](https://github.com/openset/leetcode/tree/master/problems/jump-game) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 54 | [螺旋矩阵](https://github.com/openset/leetcode/tree/master/problems/spiral-matrix) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 53 | [最大子序和](https://github.com/openset/leetcode/tree/master/problems/maximum-subarray) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Easy | -| 48 | [旋转图像](https://github.com/openset/leetcode/tree/master/problems/rotate-image) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 45 | [跳跃游戏 II](https://github.com/openset/leetcode/tree/master/problems/jump-game-ii) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Hard | -| 42 | [接雨水](https://github.com/openset/leetcode/tree/master/problems/trapping-rain-water) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Hard | -| 41 | [缺失的第一个正数](https://github.com/openset/leetcode/tree/master/problems/first-missing-positive) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Hard | -| 40 | [组合总和 II](https://github.com/openset/leetcode/tree/master/problems/combination-sum-ii) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 39 | [组合总和](https://github.com/openset/leetcode/tree/master/problems/combination-sum) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 35 | [搜索插入位置](https://github.com/openset/leetcode/tree/master/problems/search-insert-position) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Easy | -| 34 | [在排序数组中查找元素的第一个和最后一个位置](https://github.com/openset/leetcode/tree/master/problems/find-first-and-last-position-of-element-in-sorted-array) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 33 | [搜索旋转排序数组](https://github.com/openset/leetcode/tree/master/problems/search-in-rotated-sorted-array) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 31 | [下一个排列](https://github.com/openset/leetcode/tree/master/problems/next-permutation) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 27 | [移除元素](https://github.com/openset/leetcode/tree/master/problems/remove-element) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Easy | -| 26 | [删除排序数组中的重复项](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-array) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Easy | -| 18 | [四数之和](https://github.com/openset/leetcode/tree/master/problems/4sum) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 16 | [最接近的三数之和](https://github.com/openset/leetcode/tree/master/problems/3sum-closest) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 15 | [三数之和](https://github.com/openset/leetcode/tree/master/problems/3sum) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 11 | [盛最多水的容器](https://github.com/openset/leetcode/tree/master/problems/container-with-most-water) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 4 | [寻找两个有序数组的中位数](https://github.com/openset/leetcode/tree/master/problems/median-of-two-sorted-arrays) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Hard | -| 1 | [两数之和](https://github.com/openset/leetcode/tree/master/problems/two-sum) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | +| 1292 | [元素和小于等于阈值的正方形的最大边长](../../problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold) | [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 1287 | [有序数组中出现次数超过25%的元素](../../problems/element-appearing-more-than-25-in-sorted-array) | [[数组](../array/README.md)] | Easy | +| 1277 | [统计全为 1 的正方形子矩阵](../../problems/count-square-submatrices-with-all-ones) | [[数组](../array/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 1275 | [找出井字棋的获胜者](../../problems/find-winner-on-a-tic-tac-toe-game) | [[数组](../array/README.md)] | Easy | +| 1267 | [统计参与通信的服务器](../../problems/count-servers-that-communicate) | [[图](../graph/README.md)] [[数组](../array/README.md)] | Medium | +| 1266 | [访问所有点的最小时间](../../problems/minimum-time-visiting-all-points) | [[几何](../geometry/README.md)] [[数组](../array/README.md)] | Easy | +| 1260 | [二维网格迁移](../../problems/shift-2d-grid) | [[数组](../array/README.md)] | Easy | +| 1252 | [奇数值单元格的数目](../../problems/cells-with-odd-values-in-a-matrix) | [[数组](../array/README.md)] | Easy | +| 1243 | [数组变换](../../problems/array-transformation) 🔒 | [[数组](../array/README.md)] | Easy | +| 1233 | [删除子文件夹](../../problems/remove-sub-folders-from-the-filesystem) | [[数组](../array/README.md)] [[字符串](../string/README.md)] | Medium | +| 1232 | [缀点成线](../../problems/check-if-it-is-a-straight-line) | [[几何](../geometry/README.md)] [[数组](../array/README.md)] [[数学](../math/README.md)] | Easy | +| 1222 | [可以攻击国王的皇后](../../problems/queens-that-can-attack-the-king) | [[数组](../array/README.md)] | Medium | +| 1217 | [玩筹码](../../problems/play-with-chips) | [[贪心算法](../greedy/README.md)] [[数组](../array/README.md)] [[数学](../math/README.md)] | Easy | +| 1208 | [尽可能使字符串相等](../../problems/get-equal-substrings-within-budget) | [[数组](../array/README.md)] [[Sliding Window](../sliding-window/README.md)] | Medium | +| 1202 | [交换字符串中的元素](../../problems/smallest-string-with-swaps) | [[并查集](../union-find/README.md)] [[数组](../array/README.md)] | Medium | +| 1200 | [最小绝对差](../../problems/minimum-absolute-difference) | [[数组](../array/README.md)] | Easy | +| 1185 | [一周中的第几天](../../problems/day-of-the-week) | [[数组](../array/README.md)] | Easy | +| 1184 | [公交站间的距离](../../problems/distance-between-bus-stops) | [[数组](../array/README.md)] | Easy | +| 1177 | [构建回文串检测](../../problems/can-make-palindrome-from-substring) | [[数组](../array/README.md)] [[字符串](../string/README.md)] | Medium | +| 1176 | [健身计划评估](../../problems/diet-plan-performance) 🔒 | [[数组](../array/README.md)] [[Sliding Window](../sliding-window/README.md)] | Easy | +| 1170 | [比较字符串最小字母出现频次](../../problems/compare-strings-by-frequency-of-the-smallest-character) | [[数组](../array/README.md)] [[字符串](../string/README.md)] | Easy | +| 1169 | [查询无效交易](../../problems/invalid-transactions) | [[数组](../array/README.md)] [[字符串](../string/README.md)] | Medium | +| 1160 | [拼写单词](../../problems/find-words-that-can-be-formed-by-characters) | [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] | Easy | +| 1157 | [子数组中占绝大多数的元素](../../problems/online-majority-element-in-subarray) | [[线段树](../segment-tree/README.md)] [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] | Hard | +| 1152 | [用户网站访问行为分析](../../problems/analyze-user-website-visit-pattern) 🔒 | [[排序](../sort/README.md)] [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 1151 | [最少交换次数来组合所有的 1](../../problems/minimum-swaps-to-group-all-1s-together) 🔒 | [[数组](../array/README.md)] [[Sliding Window](../sliding-window/README.md)] | Medium | +| 1150 | [检查一个数是否在数组中占绝大多数](../../problems/check-if-a-number-is-majority-element-in-a-sorted-array) 🔒 | [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] | Easy | +| 1146 | [快照数组](../../problems/snapshot-array) | [[数组](../array/README.md)] | Medium | +| 1144 | [递减元素使数组呈锯齿状](../../problems/decrease-elements-to-make-array-zigzag) | [[数组](../array/README.md)] | Medium | +| 1133 | [最大唯一数](../../problems/largest-unique-number) 🔒 | [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] | Easy | +| 1128 | [等价多米诺骨牌对的数量](../../problems/number-of-equivalent-domino-pairs) | [[数组](../array/README.md)] | Easy | +| 1122 | [数组的相对排序](../../problems/relative-sort-array) | [[排序](../sort/README.md)] [[数组](../array/README.md)] | Easy | +| 1109 | [航班预订统计](../../problems/corporate-flight-bookings) | [[数组](../array/README.md)] [[数学](../math/README.md)] | Medium | +| 1099 | [小于 K 的两数之和](../../problems/two-sum-less-than-k) 🔒 | [[数组](../array/README.md)] | Easy | +| 1089 | [复写零](../../problems/duplicate-zeros) | [[数组](../array/README.md)] | Easy | +| 1086 | [前五科的均分](../../problems/high-five) 🔒 | [[排序](../sort/README.md)] [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] | Easy | +| 1085 | [最小元素各数位之和](../../problems/sum-of-digits-in-the-minimum-number) 🔒 | [[数组](../array/README.md)] | Easy | +| 1074 | [元素和为目标值的子矩阵数量](../../problems/number-of-submatrices-that-sum-to-target) | [[数组](../array/README.md)] [[动态规划](../dynamic-programming/README.md)] [[Sliding Window](../sliding-window/README.md)] | Hard | +| 1064 | [不动点](../../problems/fixed-point) 🔒 | [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] | Easy | +| 1053 | [交换一次的先前排列](../../problems/previous-permutation-with-one-swap) | [[贪心算法](../greedy/README.md)] [[数组](../array/README.md)] | Medium | +| 1052 | [爱生气的书店老板](../../problems/grumpy-bookstore-owner) | [[数组](../array/README.md)] [[Sliding Window](../sliding-window/README.md)] | Medium | +| 1051 | [高度检查器](../../problems/height-checker) | [[数组](../array/README.md)] | Easy | +| 1040 | [移动石子直到连续 II](../../problems/moving-stones-until-consecutive-ii) | [[数组](../array/README.md)] [[Sliding Window](../sliding-window/README.md)] | Medium | +| 1035 | [不相交的线](../../problems/uncrossed-lines) | [[数组](../array/README.md)] | Medium | +| 1031 | [两个非重叠子数组的最大和](../../problems/maximum-sum-of-two-non-overlapping-subarrays) | [[数组](../array/README.md)] | Medium | +| 1018 | [可被 5 整除的二进制前缀](../../problems/binary-prefix-divisible-by-5) | [[数组](../array/README.md)] | Easy | +| 1014 | [最佳观光组合](../../problems/best-sightseeing-pair) | [[数组](../array/README.md)] | Medium | +| 1013 | [将数组分成和相等的三个部分](../../problems/partition-array-into-three-parts-with-equal-sum) | [[数组](../array/README.md)] | Easy | +| 1011 | [在 D 天内送达包裹的能力](../../problems/capacity-to-ship-packages-within-d-days) | [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 1010 | [总持续时间可被 60 整除的歌曲](../../problems/pairs-of-songs-with-total-durations-divisible-by-60) | [[数组](../array/README.md)] | Easy | +| 1007 | [行相等的最少多米诺旋转](../../problems/minimum-domino-rotations-for-equal-row) | [[贪心算法](../greedy/README.md)] [[数组](../array/README.md)] | Medium | +| 1002 | [查找常用字符](../../problems/find-common-characters) | [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] | Easy | +| 999 | [车的可用捕获量](../../problems/available-captures-for-rook) | [[数组](../array/README.md)] | Easy | +| 989 | [数组形式的整数加法](../../problems/add-to-array-form-of-integer) | [[数组](../array/README.md)] | Easy | +| 985 | [查询后的偶数和](../../problems/sum-of-even-numbers-after-queries) | [[数组](../array/README.md)] | Easy | +| 978 | [最长湍流子数组](../../problems/longest-turbulent-subarray) | [[数组](../array/README.md)] [[动态规划](../dynamic-programming/README.md)] [[Sliding Window](../sliding-window/README.md)] | Medium | +| 977 | [有序数组的平方](../../problems/squares-of-a-sorted-array) | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] | Easy | +| 974 | [和可被 K 整除的子数组](../../problems/subarray-sums-divisible-by-k) | [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 969 | [煎饼排序](../../problems/pancake-sorting) | [[排序](../sort/README.md)] [[数组](../array/README.md)] | Medium | +| 962 | [最大宽度坡](../../problems/maximum-width-ramp) | [[数组](../array/README.md)] | Medium | +| 954 | [二倍数对数组](../../problems/array-of-doubled-pairs) | [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 950 | [按递增顺序显示卡牌](../../problems/reveal-cards-in-increasing-order) | [[数组](../array/README.md)] | Medium | +| 945 | [使数组唯一的最小增量](../../problems/minimum-increment-to-make-array-unique) | [[数组](../array/README.md)] | Medium | +| 941 | [有效的山脉数组](../../problems/valid-mountain-array) | [[数组](../array/README.md)] | Easy | +| 926 | [将字符串翻转到单调递增](../../problems/flip-string-to-monotone-increasing) | [[数组](../array/README.md)] | Medium | +| 922 | [按奇偶排序数组 II](../../problems/sort-array-by-parity-ii) | [[排序](../sort/README.md)] [[数组](../array/README.md)] | Easy | +| 918 | [环形子数组的最大和](../../problems/maximum-sum-circular-subarray) | [[数组](../array/README.md)] | Medium | +| 915 | [分割数组](../../problems/partition-array-into-disjoint-intervals) | [[数组](../array/README.md)] | Medium | +| 914 | [卡牌分组](../../problems/x-of-a-kind-in-a-deck-of-cards) | [[数组](../array/README.md)] [[数学](../math/README.md)] | Easy | +| 907 | [子数组的最小值之和](../../problems/sum-of-subarray-minimums) | [[栈](../stack/README.md)] [[数组](../array/README.md)] | Medium | +| 905 | [按奇偶排序数组](../../problems/sort-array-by-parity) | [[数组](../array/README.md)] | Easy | +| 900 | [RLE 迭代器](../../problems/rle-iterator) | [[数组](../array/README.md)] | Medium | +| 896 | [单调数列](../../problems/monotonic-array) | [[数组](../array/README.md)] | Easy | +| 891 | [子序列宽度之和](../../problems/sum-of-subsequence-widths) | [[数组](../array/README.md)] [[数学](../math/README.md)] | Hard | +| 888 | [公平的糖果交换](../../problems/fair-candy-swap) | [[数组](../array/README.md)] | Easy | +| 873 | [最长的斐波那契子序列的长度](../../problems/length-of-longest-fibonacci-subsequence) | [[数组](../array/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 870 | [优势洗牌](../../problems/advantage-shuffle) | [[贪心算法](../greedy/README.md)] [[数组](../array/README.md)] | Medium | +| 867 | [转置矩阵](../../problems/transpose-matrix) | [[数组](../array/README.md)] | Easy | +| 849 | [到最近的人的最大距离](../../problems/maximize-distance-to-closest-person) | [[数组](../array/README.md)] | Easy | +| 840 | [矩阵中的幻方](../../problems/magic-squares-in-grid) | [[数组](../array/README.md)] | Easy | +| 835 | [图像重叠](../../problems/image-overlap) | [[数组](../array/README.md)] | Medium | +| 832 | [翻转图像](../../problems/flipping-an-image) | [[数组](../array/README.md)] | Easy | +| 830 | [较大分组的位置](../../problems/positions-of-large-groups) | [[数组](../array/README.md)] | Easy | +| 825 | [适龄的朋友](../../problems/friends-of-appropriate-ages) | [[数组](../array/README.md)] | Medium | +| 795 | [区间子数组个数](../../problems/number-of-subarrays-with-bounded-maximum) | [[数组](../array/README.md)] | Medium | +| 792 | [匹配子序列的单词数](../../problems/number-of-matching-subsequences) | [[数组](../array/README.md)] | Medium | +| 782 | [变为棋盘](../../problems/transform-to-chessboard) | [[数组](../array/README.md)] [[数学](../math/README.md)] | Hard | +| 775 | [全局倒置与局部倒置](../../problems/global-and-local-inversions) | [[数组](../array/README.md)] [[数学](../math/README.md)] | Medium | +| 769 | [最多能完成排序的块](../../problems/max-chunks-to-make-sorted) | [[数组](../array/README.md)] | Medium | +| 768 | [最多能完成排序的块 II](../../problems/max-chunks-to-make-sorted-ii) | [[数组](../array/README.md)] | Hard | +| 766 | [托普利茨矩阵](../../problems/toeplitz-matrix) | [[数组](../array/README.md)] | Easy | +| 755 | [倒水](../../problems/pour-water) 🔒 | [[数组](../array/README.md)] | Medium | +| 747 | [至少是其他数字两倍的最大数](../../problems/largest-number-at-least-twice-of-others) | [[数组](../array/README.md)] | Easy | +| 746 | [使用最小花费爬楼梯](../../problems/min-cost-climbing-stairs) | [[数组](../array/README.md)] [[动态规划](../dynamic-programming/README.md)] | Easy | +| 729 | [我的日程安排表 I](../../problems/my-calendar-i) | [[数组](../array/README.md)] | Medium | +| 724 | [寻找数组的中心索引](../../problems/find-pivot-index) | [[数组](../array/README.md)] | Easy | +| 723 | [粉碎糖果](../../problems/candy-crush) 🔒 | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 719 | [找出第 k 小的距离对](../../problems/find-k-th-smallest-pair-distance) | [[堆](../heap/README.md)] [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] | Hard | +| 718 | [最长重复子数组](../../problems/maximum-length-of-repeated-subarray) | [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] [[二分查找](../binary-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 717 | [1比特与2比特字符](../../problems/1-bit-and-2-bit-characters) | [[数组](../array/README.md)] | Easy | +| 714 | [买卖股票的最佳时机含手续费](../../problems/best-time-to-buy-and-sell-stock-with-transaction-fee) | [[贪心算法](../greedy/README.md)] [[数组](../array/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 713 | [乘积小于K的子数组](../../problems/subarray-product-less-than-k) | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 697 | [数组的度](../../problems/degree-of-an-array) | [[数组](../array/README.md)] | Easy | +| 695 | [岛屿的最大面积](../../problems/max-area-of-island) | [[深度优先搜索](../depth-first-search/README.md)] [[数组](../array/README.md)] | Medium | +| 689 | [三个无重叠子数组的最大和](../../problems/maximum-sum-of-3-non-overlapping-subarrays) | [[数组](../array/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 674 | [最长连续递增序列](../../problems/longest-continuous-increasing-subsequence) | [[数组](../array/README.md)] | Easy | +| 670 | [最大交换](../../problems/maximum-swap) | [[数组](../array/README.md)] [[数学](../math/README.md)] | Medium | +| 667 | [优美的排列 II](../../problems/beautiful-arrangement-ii) | [[数组](../array/README.md)] | Medium | +| 665 | [非递减数列](../../problems/non-decreasing-array) | [[数组](../array/README.md)] | Easy | +| 661 | [图片平滑器](../../problems/image-smoother) | [[数组](../array/README.md)] | Easy | +| 644 | [最大平均子段和 II](../../problems/maximum-average-subarray-ii) 🔒 | [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] | Hard | +| 643 | [子数组最大平均数 I](../../problems/maximum-average-subarray-i) | [[数组](../array/README.md)] | Easy | +| 628 | [三个数的最大乘积](../../problems/maximum-product-of-three-numbers) | [[数组](../array/README.md)] [[数学](../math/README.md)] | Easy | +| 624 | [数组列表中的最大距离](../../problems/maximum-distance-in-arrays) 🔒 | [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] | Easy | +| 621 | [任务调度器](../../problems/task-scheduler) | [[贪心算法](../greedy/README.md)] [[队列](../queue/README.md)] [[数组](../array/README.md)] | Medium | +| 611 | [有效三角形的个数](../../problems/valid-triangle-number) | [[数组](../array/README.md)] | Medium | +| 605 | [种花问题](../../problems/can-place-flowers) | [[数组](../array/README.md)] | Easy | +| 581 | [最短无序连续子数组](../../problems/shortest-unsorted-continuous-subarray) | [[数组](../array/README.md)] | Easy | +| 566 | [重塑矩阵](../../problems/reshape-the-matrix) | [[数组](../array/README.md)] | Easy | +| 565 | [数组嵌套](../../problems/array-nesting) | [[数组](../array/README.md)] | Medium | +| 562 | [矩阵中最长的连续1线段](../../problems/longest-line-of-consecutive-one-in-matrix) 🔒 | [[数组](../array/README.md)] | Medium | +| 561 | [数组拆分 I](../../problems/array-partition-i) | [[数组](../array/README.md)] | Easy | +| 560 | [和为K的子数组](../../problems/subarray-sum-equals-k) | [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 548 | [将数组分割成和相等的子数组](../../problems/split-array-with-equal-sum) 🔒 | [[数组](../array/README.md)] | Medium | +| 533 | [孤独像素 II](../../problems/lonely-pixel-ii) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[数组](../array/README.md)] | Medium | +| 532 | [数组中的K-diff数对](../../problems/k-diff-pairs-in-an-array) | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] | Easy | +| 531 | [孤独像素 I](../../problems/lonely-pixel-i) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[数组](../array/README.md)] | Medium | +| 509 | [斐波那契数](../../problems/fibonacci-number) | [[数组](../array/README.md)] | Easy | +| 495 | [提莫攻击](../../problems/teemo-attacking) | [[数组](../array/README.md)] | Medium | +| 485 | [最大连续1的个数](../../problems/max-consecutive-ones) | [[数组](../array/README.md)] | Easy | +| 457 | [环形数组循环](../../problems/circular-array-loop) | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 448 | [找到所有数组中消失的数字](../../problems/find-all-numbers-disappeared-in-an-array) | [[数组](../array/README.md)] | Easy | +| 442 | [数组中重复的数据](../../problems/find-all-duplicates-in-an-array) | [[数组](../array/README.md)] | Medium | +| 414 | [第三大的数](../../problems/third-maximum-number) | [[数组](../array/README.md)] | Easy | +| 381 | [O(1) 时间插入、删除和获取随机元素 - 允许重复](../../problems/insert-delete-getrandom-o1-duplicates-allowed) | [[设计](../design/README.md)] [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] | Hard | +| 380 | [常数时间插入、删除和获取随机元素](../../problems/insert-delete-getrandom-o1) | [[设计](../design/README.md)] [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 370 | [区间加法](../../problems/range-addition) 🔒 | [[数组](../array/README.md)] | Medium | +| 289 | [生命游戏](../../problems/game-of-life) | [[数组](../array/README.md)] | Medium | +| 287 | [寻找重复数](../../problems/find-the-duplicate-number) | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 283 | [移动零](../../problems/move-zeroes) | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] | Easy | +| 280 | [摆动排序](../../problems/wiggle-sort) 🔒 | [[排序](../sort/README.md)] [[数组](../array/README.md)] | Medium | +| 277 | [搜寻名人](../../problems/find-the-celebrity) 🔒 | [[数组](../array/README.md)] | Medium | +| 268 | [缺失数字](../../problems/missing-number) | [[位运算](../bit-manipulation/README.md)] [[数组](../array/README.md)] [[数学](../math/README.md)] | Easy | +| 259 | [较小的三数之和](../../problems/3sum-smaller) 🔒 | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 245 | [最短单词距离 III](../../problems/shortest-word-distance-iii) 🔒 | [[数组](../array/README.md)] | Medium | +| 243 | [最短单词距离](../../problems/shortest-word-distance) 🔒 | [[数组](../array/README.md)] | Easy | +| 238 | [除自身以外数组的乘积](../../problems/product-of-array-except-self) | [[数组](../array/README.md)] | Medium | +| 229 | [求众数 II](../../problems/majority-element-ii) | [[数组](../array/README.md)] | Medium | +| 228 | [汇总区间](../../problems/summary-ranges) | [[数组](../array/README.md)] | Medium | +| 219 | [存在重复元素 II](../../problems/contains-duplicate-ii) | [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] | Easy | +| 217 | [存在重复元素](../../problems/contains-duplicate) | [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] | Easy | +| 216 | [组合总和 III](../../problems/combination-sum-iii) | [[数组](../array/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 209 | [长度最小的子数组](../../problems/minimum-size-subarray-sum) | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 189 | [旋转数组](../../problems/rotate-array) | [[数组](../array/README.md)] | Easy | +| 169 | [多数元素](../../problems/majority-element) | [[位运算](../bit-manipulation/README.md)] [[数组](../array/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Easy | +| 167 | [两数之和 II - 输入有序数组](../../problems/two-sum-ii-input-array-is-sorted) | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] [[二分查找](../binary-search/README.md)] | Easy | +| 163 | [缺失的区间](../../problems/missing-ranges) 🔒 | [[数组](../array/README.md)] | Medium | +| 162 | [寻找峰值](../../problems/find-peak-element) | [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 154 | [寻找旋转排序数组中的最小值 II](../../problems/find-minimum-in-rotated-sorted-array-ii) | [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] | Hard | +| 153 | [寻找旋转排序数组中的最小值](../../problems/find-minimum-in-rotated-sorted-array) | [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 152 | [乘积最大子序列](../../problems/maximum-product-subarray) | [[数组](../array/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 128 | [最长连续序列](../../problems/longest-consecutive-sequence) | [[并查集](../union-find/README.md)] [[数组](../array/README.md)] | Hard | +| 126 | [单词接龙 II](../../problems/word-ladder-ii) | [[广度优先搜索](../breadth-first-search/README.md)] [[数组](../array/README.md)] [[字符串](../string/README.md)] [[回溯算法](../backtracking/README.md)] | Hard | +| 123 | [买卖股票的最佳时机 III](../../problems/best-time-to-buy-and-sell-stock-iii) | [[数组](../array/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 122 | [买卖股票的最佳时机 II](../../problems/best-time-to-buy-and-sell-stock-ii) | [[贪心算法](../greedy/README.md)] [[数组](../array/README.md)] | Easy | +| 121 | [买卖股票的最佳时机](../../problems/best-time-to-buy-and-sell-stock) | [[数组](../array/README.md)] [[动态规划](../dynamic-programming/README.md)] | Easy | +| 120 | [三角形最小路径和](../../problems/triangle) | [[数组](../array/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 119 | [杨辉三角 II](../../problems/pascals-triangle-ii) | [[数组](../array/README.md)] | Easy | +| 118 | [杨辉三角](../../problems/pascals-triangle) | [[数组](../array/README.md)] | Easy | +| 106 | [从中序与后序遍历序列构造二叉树](../../problems/construct-binary-tree-from-inorder-and-postorder-traversal) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[数组](../array/README.md)] | Medium | +| 105 | [从前序与中序遍历序列构造二叉树](../../problems/construct-binary-tree-from-preorder-and-inorder-traversal) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[数组](../array/README.md)] | Medium | +| 90 | [子集 II](../../problems/subsets-ii) | [[数组](../array/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 88 | [合并两个有序数组](../../problems/merge-sorted-array) | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] | Easy | +| 85 | [最大矩形](../../problems/maximal-rectangle) | [[栈](../stack/README.md)] [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 84 | [柱状图中最大的矩形](../../problems/largest-rectangle-in-histogram) | [[栈](../stack/README.md)] [[数组](../array/README.md)] | Hard | +| 81 | [搜索旋转排序数组 II](../../problems/search-in-rotated-sorted-array-ii) | [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 80 | [删除排序数组中的重复项 II](../../problems/remove-duplicates-from-sorted-array-ii) | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 79 | [单词搜索](../../problems/word-search) | [[数组](../array/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 78 | [子集](../../problems/subsets) | [[位运算](../bit-manipulation/README.md)] [[数组](../array/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 75 | [颜色分类](../../problems/sort-colors) | [[排序](../sort/README.md)] [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 74 | [搜索二维矩阵](../../problems/search-a-2d-matrix) | [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 73 | [矩阵置零](../../problems/set-matrix-zeroes) | [[数组](../array/README.md)] | Medium | +| 66 | [加一](../../problems/plus-one) | [[数组](../array/README.md)] | Easy | +| 64 | [最小路径和](../../problems/minimum-path-sum) | [[数组](../array/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 63 | [不同路径 II](../../problems/unique-paths-ii) | [[数组](../array/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 62 | [不同路径](../../problems/unique-paths) | [[数组](../array/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 59 | [螺旋矩阵 II](../../problems/spiral-matrix-ii) | [[数组](../array/README.md)] | Medium | +| 57 | [插入区间](../../problems/insert-interval) | [[排序](../sort/README.md)] [[数组](../array/README.md)] | Hard | +| 56 | [合并区间](../../problems/merge-intervals) | [[排序](../sort/README.md)] [[数组](../array/README.md)] | Medium | +| 55 | [跳跃游戏](../../problems/jump-game) | [[贪心算法](../greedy/README.md)] [[数组](../array/README.md)] | Medium | +| 54 | [螺旋矩阵](../../problems/spiral-matrix) | [[数组](../array/README.md)] | Medium | +| 53 | [最大子序和](../../problems/maximum-subarray) | [[数组](../array/README.md)] [[分治算法](../divide-and-conquer/README.md)] [[动态规划](../dynamic-programming/README.md)] | Easy | +| 48 | [旋转图像](../../problems/rotate-image) | [[数组](../array/README.md)] | Medium | +| 45 | [跳跃游戏 II](../../problems/jump-game-ii) | [[贪心算法](../greedy/README.md)] [[数组](../array/README.md)] | Hard | +| 42 | [接雨水](../../problems/trapping-rain-water) | [[栈](../stack/README.md)] [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] | Hard | +| 41 | [缺失的第一个正数](../../problems/first-missing-positive) | [[数组](../array/README.md)] | Hard | +| 40 | [组合总和 II](../../problems/combination-sum-ii) | [[数组](../array/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 39 | [组合总和](../../problems/combination-sum) | [[数组](../array/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 35 | [搜索插入位置](../../problems/search-insert-position) | [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] | Easy | +| 34 | [在排序数组中查找元素的第一个和最后一个位置](../../problems/find-first-and-last-position-of-element-in-sorted-array) | [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 33 | [搜索旋转排序数组](../../problems/search-in-rotated-sorted-array) | [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 31 | [下一个排列](../../problems/next-permutation) | [[数组](../array/README.md)] | Medium | +| 27 | [移除元素](../../problems/remove-element) | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] | Easy | +| 26 | [删除排序数组中的重复项](../../problems/remove-duplicates-from-sorted-array) | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] | Easy | +| 18 | [四数之和](../../problems/4sum) | [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 16 | [最接近的三数之和](../../problems/3sum-closest) | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 15 | [三数之和](../../problems/3sum) | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 11 | [盛最多水的容器](../../problems/container-with-most-water) | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 4 | [寻找两个有序数组的中位数](../../problems/median-of-two-sorted-arrays) | [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Hard | +| 1 | [两数之和](../../problems/two-sum) | [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] | Easy | diff --git a/tag/backtracking/README.md b/tag/backtracking/README.md index 762689aa3..27e81cf48 100644 --- a/tag/backtracking/README.md +++ b/tag/backtracking/README.md @@ -5,59 +5,59 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > 回溯算法 +## [话题分类](../README.md) > 回溯算法 | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 1291 | [顺次数](https://github.com/openset/leetcode/tree/master/problems/sequential-digits) | [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 1286 | [字母组合迭代器](https://github.com/openset/leetcode/tree/master/problems/iterator-for-combination) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 1258 | [近义词句子](https://github.com/openset/leetcode/tree/master/problems/synonymous-sentences) 🔒 | [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 1240 | [铺瓷砖](https://github.com/openset/leetcode/tree/master/problems/tiling-a-rectangle-with-the-fewest-squares) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | -| 1239 | [串联字符串的最大长度](https://github.com/openset/leetcode/tree/master/problems/maximum-length-of-a-concatenated-string-with-unique-characters) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 1219 | [黄金矿工](https://github.com/openset/leetcode/tree/master/problems/path-with-maximum-gold) | [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 1215 | [步进数](https://github.com/openset/leetcode/tree/master/problems/stepping-numbers) 🔒 | [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 1088 | [易混淆数 II](https://github.com/openset/leetcode/tree/master/problems/confusing-number-ii) 🔒 | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | -| 1087 | [字母切换](https://github.com/openset/leetcode/tree/master/problems/brace-expansion) 🔒 | [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 1079 | [活字印刷](https://github.com/openset/leetcode/tree/master/problems/letter-tile-possibilities) | [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 1066 | [校园自行车分配 II](https://github.com/openset/leetcode/tree/master/problems/campus-bikes-ii) 🔒 | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 996 | [正方形数组的数目](https://github.com/openset/leetcode/tree/master/problems/number-of-squareful-arrays) | [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | -| 980 | [不同路径 III](https://github.com/openset/leetcode/tree/master/problems/unique-paths-iii) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | -| 842 | [将数组拆分成斐波那契序列](https://github.com/openset/leetcode/tree/master/problems/split-array-into-fibonacci-sequence) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 784 | [字母大小写全排列](https://github.com/openset/leetcode/tree/master/problems/letter-case-permutation) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Easy | -| 691 | [贴纸拼词](https://github.com/openset/leetcode/tree/master/problems/stickers-to-spell-word) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | -| 526 | [优美的排列](https://github.com/openset/leetcode/tree/master/problems/beautiful-arrangement) | [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 425 | [单词方块](https://github.com/openset/leetcode/tree/master/problems/word-squares) 🔒 | [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | -| 411 | [最短特异单词缩写](https://github.com/openset/leetcode/tree/master/problems/minimum-unique-word-abbreviation) 🔒 | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | -| 401 | [二进制手表](https://github.com/openset/leetcode/tree/master/problems/binary-watch) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Easy | -| 357 | [计算各个位数不同的数字个数](https://github.com/openset/leetcode/tree/master/problems/count-numbers-with-unique-digits) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 351 | [安卓系统手势解锁](https://github.com/openset/leetcode/tree/master/problems/android-unlock-patterns) 🔒 | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 320 | [列举单词的全部缩写](https://github.com/openset/leetcode/tree/master/problems/generalized-abbreviation) 🔒 | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 306 | [累加数](https://github.com/openset/leetcode/tree/master/problems/additive-number) | [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 294 | [翻转游戏 II](https://github.com/openset/leetcode/tree/master/problems/flip-game-ii) 🔒 | [[极小化极大](https://github.com/openset/leetcode/tree/master/tag/minimax/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 291 | [单词规律 II](https://github.com/openset/leetcode/tree/master/problems/word-pattern-ii) 🔒 | [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | -| 267 | [回文排列 II](https://github.com/openset/leetcode/tree/master/problems/palindrome-permutation-ii) 🔒 | [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 254 | [因子的组合](https://github.com/openset/leetcode/tree/master/problems/factor-combinations) 🔒 | [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 216 | [组合总和 III](https://github.com/openset/leetcode/tree/master/problems/combination-sum-iii) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 212 | [单词搜索 II](https://github.com/openset/leetcode/tree/master/problems/word-search-ii) | [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | -| 211 | [添加与搜索单词 - 数据结构设计](https://github.com/openset/leetcode/tree/master/problems/add-and-search-word-data-structure-design) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 140 | [单词拆分 II](https://github.com/openset/leetcode/tree/master/problems/word-break-ii) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | -| 131 | [分割回文串](https://github.com/openset/leetcode/tree/master/problems/palindrome-partitioning) | [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 126 | [单词接龙 II](https://github.com/openset/leetcode/tree/master/problems/word-ladder-ii) | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | -| 93 | [复原IP地址](https://github.com/openset/leetcode/tree/master/problems/restore-ip-addresses) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 90 | [子集 II](https://github.com/openset/leetcode/tree/master/problems/subsets-ii) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 89 | [格雷编码](https://github.com/openset/leetcode/tree/master/problems/gray-code) | [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 79 | [单词搜索](https://github.com/openset/leetcode/tree/master/problems/word-search) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 78 | [子集](https://github.com/openset/leetcode/tree/master/problems/subsets) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 77 | [组合](https://github.com/openset/leetcode/tree/master/problems/combinations) | [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 60 | [第k个排列](https://github.com/openset/leetcode/tree/master/problems/permutation-sequence) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 52 | [N皇后 II](https://github.com/openset/leetcode/tree/master/problems/n-queens-ii) | [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | -| 51 | [N皇后](https://github.com/openset/leetcode/tree/master/problems/n-queens) | [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | -| 47 | [全排列 II](https://github.com/openset/leetcode/tree/master/problems/permutations-ii) | [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 46 | [全排列](https://github.com/openset/leetcode/tree/master/problems/permutations) | [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 44 | [通配符匹配](https://github.com/openset/leetcode/tree/master/problems/wildcard-matching) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | -| 40 | [组合总和 II](https://github.com/openset/leetcode/tree/master/problems/combination-sum-ii) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 39 | [组合总和](https://github.com/openset/leetcode/tree/master/problems/combination-sum) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 37 | [解数独](https://github.com/openset/leetcode/tree/master/problems/sudoku-solver) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | -| 22 | [括号生成](https://github.com/openset/leetcode/tree/master/problems/generate-parentheses) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 17 | [电话号码的字母组合](https://github.com/openset/leetcode/tree/master/problems/letter-combinations-of-a-phone-number) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 10 | [正则表达式匹配](https://github.com/openset/leetcode/tree/master/problems/regular-expression-matching) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | +| 1291 | [顺次数](../../problems/sequential-digits) | [[回溯算法](../backtracking/README.md)] | Medium | +| 1286 | [字母组合迭代器](../../problems/iterator-for-combination) | [[设计](../design/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 1258 | [近义词句子](../../problems/synonymous-sentences) 🔒 | [[回溯算法](../backtracking/README.md)] | Medium | +| 1240 | [铺瓷砖](../../problems/tiling-a-rectangle-with-the-fewest-squares) | [[动态规划](../dynamic-programming/README.md)] [[回溯算法](../backtracking/README.md)] | Hard | +| 1239 | [串联字符串的最大长度](../../problems/maximum-length-of-a-concatenated-string-with-unique-characters) | [[位运算](../bit-manipulation/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 1219 | [黄金矿工](../../problems/path-with-maximum-gold) | [[回溯算法](../backtracking/README.md)] | Medium | +| 1215 | [步进数](../../problems/stepping-numbers) 🔒 | [[回溯算法](../backtracking/README.md)] | Medium | +| 1088 | [易混淆数 II](../../problems/confusing-number-ii) 🔒 | [[数学](../math/README.md)] [[回溯算法](../backtracking/README.md)] | Hard | +| 1087 | [字母切换](../../problems/brace-expansion) 🔒 | [[回溯算法](../backtracking/README.md)] | Medium | +| 1079 | [活字印刷](../../problems/letter-tile-possibilities) | [[回溯算法](../backtracking/README.md)] | Medium | +| 1066 | [校园自行车分配 II](../../problems/campus-bikes-ii) 🔒 | [[动态规划](../dynamic-programming/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 996 | [正方形数组的数目](../../problems/number-of-squareful-arrays) | [[图](../graph/README.md)] [[数学](../math/README.md)] [[回溯算法](../backtracking/README.md)] | Hard | +| 980 | [不同路径 III](../../problems/unique-paths-iii) | [[深度优先搜索](../depth-first-search/README.md)] [[回溯算法](../backtracking/README.md)] | Hard | +| 842 | [将数组拆分成斐波那契序列](../../problems/split-array-into-fibonacci-sequence) | [[贪心算法](../greedy/README.md)] [[字符串](../string/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 784 | [字母大小写全排列](../../problems/letter-case-permutation) | [[位运算](../bit-manipulation/README.md)] [[回溯算法](../backtracking/README.md)] | Easy | +| 691 | [贴纸拼词](../../problems/stickers-to-spell-word) | [[动态规划](../dynamic-programming/README.md)] [[回溯算法](../backtracking/README.md)] | Hard | +| 526 | [优美的排列](../../problems/beautiful-arrangement) | [[回溯算法](../backtracking/README.md)] | Medium | +| 425 | [单词方块](../../problems/word-squares) 🔒 | [[字典树](../trie/README.md)] [[回溯算法](../backtracking/README.md)] | Hard | +| 411 | [最短特异单词缩写](../../problems/minimum-unique-word-abbreviation) 🔒 | [[位运算](../bit-manipulation/README.md)] [[回溯算法](../backtracking/README.md)] | Hard | +| 401 | [二进制手表](../../problems/binary-watch) | [[位运算](../bit-manipulation/README.md)] [[回溯算法](../backtracking/README.md)] | Easy | +| 357 | [计算各个位数不同的数字个数](../../problems/count-numbers-with-unique-digits) | [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 351 | [安卓系统手势解锁](../../problems/android-unlock-patterns) 🔒 | [[动态规划](../dynamic-programming/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 320 | [列举单词的全部缩写](../../problems/generalized-abbreviation) 🔒 | [[位运算](../bit-manipulation/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 306 | [累加数](../../problems/additive-number) | [[回溯算法](../backtracking/README.md)] | Medium | +| 294 | [翻转游戏 II](../../problems/flip-game-ii) 🔒 | [[极小化极大](../minimax/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 291 | [单词规律 II](../../problems/word-pattern-ii) 🔒 | [[回溯算法](../backtracking/README.md)] | Hard | +| 267 | [回文排列 II](../../problems/palindrome-permutation-ii) 🔒 | [[回溯算法](../backtracking/README.md)] | Medium | +| 254 | [因子的组合](../../problems/factor-combinations) 🔒 | [[回溯算法](../backtracking/README.md)] | Medium | +| 216 | [组合总和 III](../../problems/combination-sum-iii) | [[数组](../array/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 212 | [单词搜索 II](../../problems/word-search-ii) | [[字典树](../trie/README.md)] [[回溯算法](../backtracking/README.md)] | Hard | +| 211 | [添加与搜索单词 - 数据结构设计](../../problems/add-and-search-word-data-structure-design) | [[设计](../design/README.md)] [[字典树](../trie/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 140 | [单词拆分 II](../../problems/word-break-ii) | [[动态规划](../dynamic-programming/README.md)] [[回溯算法](../backtracking/README.md)] | Hard | +| 131 | [分割回文串](../../problems/palindrome-partitioning) | [[回溯算法](../backtracking/README.md)] | Medium | +| 126 | [单词接龙 II](../../problems/word-ladder-ii) | [[广度优先搜索](../breadth-first-search/README.md)] [[数组](../array/README.md)] [[字符串](../string/README.md)] [[回溯算法](../backtracking/README.md)] | Hard | +| 93 | [复原IP地址](../../problems/restore-ip-addresses) | [[字符串](../string/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 90 | [子集 II](../../problems/subsets-ii) | [[数组](../array/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 89 | [格雷编码](../../problems/gray-code) | [[回溯算法](../backtracking/README.md)] | Medium | +| 79 | [单词搜索](../../problems/word-search) | [[数组](../array/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 78 | [子集](../../problems/subsets) | [[位运算](../bit-manipulation/README.md)] [[数组](../array/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 77 | [组合](../../problems/combinations) | [[回溯算法](../backtracking/README.md)] | Medium | +| 60 | [第k个排列](../../problems/permutation-sequence) | [[数学](../math/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 52 | [N皇后 II](../../problems/n-queens-ii) | [[回溯算法](../backtracking/README.md)] | Hard | +| 51 | [N皇后](../../problems/n-queens) | [[回溯算法](../backtracking/README.md)] | Hard | +| 47 | [全排列 II](../../problems/permutations-ii) | [[回溯算法](../backtracking/README.md)] | Medium | +| 46 | [全排列](../../problems/permutations) | [[回溯算法](../backtracking/README.md)] | Medium | +| 44 | [通配符匹配](../../problems/wildcard-matching) | [[贪心算法](../greedy/README.md)] [[字符串](../string/README.md)] [[动态规划](../dynamic-programming/README.md)] [[回溯算法](../backtracking/README.md)] | Hard | +| 40 | [组合总和 II](../../problems/combination-sum-ii) | [[数组](../array/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 39 | [组合总和](../../problems/combination-sum) | [[数组](../array/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 37 | [解数独](../../problems/sudoku-solver) | [[哈希表](../hash-table/README.md)] [[回溯算法](../backtracking/README.md)] | Hard | +| 22 | [括号生成](../../problems/generate-parentheses) | [[字符串](../string/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 17 | [电话号码的字母组合](../../problems/letter-combinations-of-a-phone-number) | [[字符串](../string/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 10 | [正则表达式匹配](../../problems/regular-expression-matching) | [[字符串](../string/README.md)] [[动态规划](../dynamic-programming/README.md)] [[回溯算法](../backtracking/README.md)] | Hard | diff --git a/tag/binary-indexed-tree/README.md b/tag/binary-indexed-tree/README.md index ad7125ff0..0038749bc 100644 --- a/tag/binary-indexed-tree/README.md +++ b/tag/binary-indexed-tree/README.md @@ -5,13 +5,13 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > 树状数组 +## [话题分类](../README.md) > 树状数组 | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 493 | [翻转对](https://github.com/openset/leetcode/tree/master/problems/reverse-pairs) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Hard | -| 327 | [区间和的个数](https://github.com/openset/leetcode/tree/master/problems/count-of-range-sum) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Hard | -| 315 | [计算右侧小于当前元素的个数](https://github.com/openset/leetcode/tree/master/problems/count-of-smaller-numbers-after-self) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Hard | -| 308 | [二维区域和检索 - 可变](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-mutable) 🔒 | [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] | Hard | -| 307 | [区域和检索 - 数组可修改](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-mutable) | [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] | Medium | -| 218 | [天际线问题](https://github.com/openset/leetcode/tree/master/problems/the-skyline-problem) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] [[Line Sweep](https://github.com/openset/leetcode/tree/master/tag/line-sweep/README.md)] | Hard | +| 493 | [翻转对](../../problems/reverse-pairs) | [[排序](../sort/README.md)] [[树状数组](../binary-indexed-tree/README.md)] [[线段树](../segment-tree/README.md)] [[二分查找](../binary-search/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Hard | +| 327 | [区间和的个数](../../problems/count-of-range-sum) | [[排序](../sort/README.md)] [[树状数组](../binary-indexed-tree/README.md)] [[线段树](../segment-tree/README.md)] [[二分查找](../binary-search/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Hard | +| 315 | [计算右侧小于当前元素的个数](../../problems/count-of-smaller-numbers-after-self) | [[排序](../sort/README.md)] [[树状数组](../binary-indexed-tree/README.md)] [[线段树](../segment-tree/README.md)] [[二分查找](../binary-search/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Hard | +| 308 | [二维区域和检索 - 可变](../../problems/range-sum-query-2d-mutable) 🔒 | [[树状数组](../binary-indexed-tree/README.md)] [[线段树](../segment-tree/README.md)] | Hard | +| 307 | [区域和检索 - 数组可修改](../../problems/range-sum-query-mutable) | [[树状数组](../binary-indexed-tree/README.md)] [[线段树](../segment-tree/README.md)] | Medium | +| 218 | [天际线问题](../../problems/the-skyline-problem) | [[堆](../heap/README.md)] [[树状数组](../binary-indexed-tree/README.md)] [[线段树](../segment-tree/README.md)] [[分治算法](../divide-and-conquer/README.md)] [[Line Sweep](../line-sweep/README.md)] | Hard | diff --git a/tag/binary-search-tree/README.md b/tag/binary-search-tree/README.md index 5a01d10b4..42efd4da5 100644 --- a/tag/binary-search-tree/README.md +++ b/tag/binary-search-tree/README.md @@ -5,9 +5,9 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > 二叉搜索树 +## [话题分类](../README.md) > 二叉搜索树 | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 1214 | [查找两棵二叉搜索树之和](https://github.com/openset/leetcode/tree/master/problems/two-sum-bsts) 🔒 | [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)] | Medium | -| 1038 | [从二叉搜索树到更大和树](https://github.com/openset/leetcode/tree/master/problems/binary-search-tree-to-greater-sum-tree) | [[二叉搜索树](https://github.com/openset/leetcode/tree/master/tag/binary-search-tree/README.md)] | Medium | +| 1214 | [查找两棵二叉搜索树之和](../../problems/two-sum-bsts) 🔒 | [[二叉搜索树](../binary-search-tree/README.md)] | Medium | +| 1038 | [从二叉搜索树到更大和树](../../problems/binary-search-tree-to-greater-sum-tree) | [[二叉搜索树](../binary-search-tree/README.md)] | Medium | diff --git a/tag/binary-search/README.md b/tag/binary-search/README.md index d3e79bc2e..e713cbd38 100644 --- a/tag/binary-search/README.md +++ b/tag/binary-search/README.md @@ -5,88 +5,88 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > 二分查找 +## [话题分类](../README.md) > 二分查找 | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 1292 | [元素和小于等于阈值的正方形的最大边长](https://github.com/openset/leetcode/tree/master/problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 1283 | [使结果不超过阈值的最小除数](https://github.com/openset/leetcode/tree/master/problems/find-the-smallest-divisor-given-a-threshold) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 1237 | [找出给定方程的正整数解](https://github.com/openset/leetcode/tree/master/problems/find-positive-integer-solution-for-a-given-equation) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Easy | -| 1235 | [规划兼职工作](https://github.com/openset/leetcode/tree/master/problems/maximum-profit-in-job-scheduling) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 1231 | [分享巧克力](https://github.com/openset/leetcode/tree/master/problems/divide-chocolate) 🔒 | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Hard | -| 1201 | [丑数 III](https://github.com/openset/leetcode/tree/master/problems/ugly-number-iii) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 1198 | [找出所有行中最小公共元素](https://github.com/openset/leetcode/tree/master/problems/find-smallest-common-element-in-all-rows) 🔒 | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 1182 | [与目标颜色间的最短距离](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-to-target-color) 🔒 | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 1157 | [子数组中占绝大多数的元素](https://github.com/openset/leetcode/tree/master/problems/online-majority-element-in-subarray) | [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Hard | -| 1150 | [检查一个数是否在数组中占绝大多数](https://github.com/openset/leetcode/tree/master/problems/check-if-a-number-is-majority-element-in-a-sorted-array) 🔒 | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Easy | -| 1111 | [有效括号的嵌套深度](https://github.com/openset/leetcode/tree/master/problems/maximum-nesting-depth-of-two-valid-parentheses-strings) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 1095 | [山脉数组中查找目标值](https://github.com/openset/leetcode/tree/master/problems/find-in-mountain-array) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Hard | -| 1064 | [不动点](https://github.com/openset/leetcode/tree/master/problems/fixed-point) 🔒 | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Easy | -| 1060 | [有序数组中的缺失元素](https://github.com/openset/leetcode/tree/master/problems/missing-element-in-sorted-array) 🔒 | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 1044 | [最长重复子串](https://github.com/openset/leetcode/tree/master/problems/longest-duplicate-substring) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Hard | -| 1011 | [在 D 天内送达包裹的能力](https://github.com/openset/leetcode/tree/master/problems/capacity-to-ship-packages-within-d-days) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 981 | [基于时间的键值存储](https://github.com/openset/leetcode/tree/master/problems/time-based-key-value-store) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 927 | [三等分](https://github.com/openset/leetcode/tree/master/problems/three-equal-parts) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Hard | -| 911 | [在线选举](https://github.com/openset/leetcode/tree/master/problems/online-election) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 887 | [鸡蛋掉落](https://github.com/openset/leetcode/tree/master/problems/super-egg-drop) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 878 | [第 N 个神奇数字](https://github.com/openset/leetcode/tree/master/problems/nth-magical-number) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Hard | -| 875 | [爱吃香蕉的珂珂](https://github.com/openset/leetcode/tree/master/problems/koko-eating-bananas) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 862 | [和至少为 K 的最短子数组](https://github.com/openset/leetcode/tree/master/problems/shortest-subarray-with-sum-at-least-k) | [[队列](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Hard | -| 852 | [山脉数组的峰顶索引](https://github.com/openset/leetcode/tree/master/problems/peak-index-in-a-mountain-array) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Easy | -| 793 | [阶乘函数后K个零](https://github.com/openset/leetcode/tree/master/problems/preimage-size-of-factorial-zeroes-function) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Hard | -| 786 | [第 K 个最小的素数分数](https://github.com/openset/leetcode/tree/master/problems/k-th-smallest-prime-fraction) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Hard | -| 778 | [水位上升的泳池中游泳](https://github.com/openset/leetcode/tree/master/problems/swim-in-rising-water) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Hard | -| 774 | [最小化去加油站的最大距离](https://github.com/openset/leetcode/tree/master/problems/minimize-max-distance-to-gas-station) 🔒 | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Hard | -| 744 | [寻找比目标字母大的最小字母](https://github.com/openset/leetcode/tree/master/problems/find-smallest-letter-greater-than-target) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Easy | -| 719 | [找出第 k 小的距离对](https://github.com/openset/leetcode/tree/master/problems/find-k-th-smallest-pair-distance) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Hard | -| 718 | [最长重复子数组](https://github.com/openset/leetcode/tree/master/problems/maximum-length-of-repeated-subarray) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 710 | [黑名单中的随机数](https://github.com/openset/leetcode/tree/master/problems/random-pick-with-blacklist) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[Random](https://github.com/openset/leetcode/tree/master/tag/random/README.md)] | Hard | -| 704 | [二分查找](https://github.com/openset/leetcode/tree/master/problems/binary-search) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Easy | -| 702 | [搜索长度未知的有序数组](https://github.com/openset/leetcode/tree/master/problems/search-in-a-sorted-array-of-unknown-size) 🔒 | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 668 | [乘法表中第k小的数](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-number-in-multiplication-table) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Hard | -| 658 | [找到 K 个最接近的元素](https://github.com/openset/leetcode/tree/master/problems/find-k-closest-elements) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 644 | [最大平均子段和 II](https://github.com/openset/leetcode/tree/master/problems/maximum-average-subarray-ii) 🔒 | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Hard | -| 528 | [按权重随机选择](https://github.com/openset/leetcode/tree/master/problems/random-pick-with-weight) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[Random](https://github.com/openset/leetcode/tree/master/tag/random/README.md)] | Medium | -| 497 | [非重叠矩形中的随机点](https://github.com/openset/leetcode/tree/master/problems/random-point-in-non-overlapping-rectangles) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[Random](https://github.com/openset/leetcode/tree/master/tag/random/README.md)] | Medium | -| 493 | [翻转对](https://github.com/openset/leetcode/tree/master/problems/reverse-pairs) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Hard | -| 483 | [最小好进制](https://github.com/openset/leetcode/tree/master/problems/smallest-good-base) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Hard | -| 475 | [供暖器](https://github.com/openset/leetcode/tree/master/problems/heaters) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Easy | -| 454 | [四数相加 II](https://github.com/openset/leetcode/tree/master/problems/4sum-ii) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 441 | [排列硬币](https://github.com/openset/leetcode/tree/master/problems/arranging-coins) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Easy | -| 436 | [寻找右区间](https://github.com/openset/leetcode/tree/master/problems/find-right-interval) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 410 | [分割数组的最大值](https://github.com/openset/leetcode/tree/master/problems/split-array-largest-sum) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 392 | [判断子序列](https://github.com/openset/leetcode/tree/master/problems/is-subsequence) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Easy | -| 378 | [有序矩阵中第K小的元素](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-element-in-a-sorted-matrix) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 374 | [猜数字大小](https://github.com/openset/leetcode/tree/master/problems/guess-number-higher-or-lower) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Easy | -| 367 | [有效的完全平方数](https://github.com/openset/leetcode/tree/master/problems/valid-perfect-square) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Easy | -| 363 | [矩形区域不超过 K 的最大数值和](https://github.com/openset/leetcode/tree/master/problems/max-sum-of-rectangle-no-larger-than-k) | [[队列](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 354 | [俄罗斯套娃信封问题](https://github.com/openset/leetcode/tree/master/problems/russian-doll-envelopes) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 352 | [将数据流变为多个不相交区间](https://github.com/openset/leetcode/tree/master/problems/data-stream-as-disjoint-intervals) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md)] | Hard | -| 350 | [两个数组的交集 II](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-arrays-ii) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Easy | -| 349 | [两个数组的交集](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-arrays) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Easy | -| 327 | [区间和的个数](https://github.com/openset/leetcode/tree/master/problems/count-of-range-sum) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Hard | -| 315 | [计算右侧小于当前元素的个数](https://github.com/openset/leetcode/tree/master/problems/count-of-smaller-numbers-after-self) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Hard | -| 302 | [包含全部黑色像素的最小矩形](https://github.com/openset/leetcode/tree/master/problems/smallest-rectangle-enclosing-black-pixels) 🔒 | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Hard | -| 300 | [最长上升子序列](https://github.com/openset/leetcode/tree/master/problems/longest-increasing-subsequence) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 287 | [寻找重复数](https://github.com/openset/leetcode/tree/master/problems/find-the-duplicate-number) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 278 | [第一个错误的版本](https://github.com/openset/leetcode/tree/master/problems/first-bad-version) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Easy | -| 275 | [H指数 II](https://github.com/openset/leetcode/tree/master/problems/h-index-ii) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 270 | [最接近的二叉搜索树值](https://github.com/openset/leetcode/tree/master/problems/closest-binary-search-tree-value) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Easy | -| 240 | [搜索二维矩阵 II](https://github.com/openset/leetcode/tree/master/problems/search-a-2d-matrix-ii) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Medium | -| 230 | [二叉搜索树中第K小的元素](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-element-in-a-bst) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 222 | [完全二叉树的节点个数](https://github.com/openset/leetcode/tree/master/problems/count-complete-tree-nodes) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 209 | [长度最小的子数组](https://github.com/openset/leetcode/tree/master/problems/minimum-size-subarray-sum) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 174 | [地下城游戏](https://github.com/openset/leetcode/tree/master/problems/dungeon-game) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 167 | [两数之和 II - 输入有序数组](https://github.com/openset/leetcode/tree/master/problems/two-sum-ii-input-array-is-sorted) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Easy | -| 162 | [寻找峰值](https://github.com/openset/leetcode/tree/master/problems/find-peak-element) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 154 | [寻找旋转排序数组中的最小值 II](https://github.com/openset/leetcode/tree/master/problems/find-minimum-in-rotated-sorted-array-ii) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Hard | -| 153 | [寻找旋转排序数组中的最小值](https://github.com/openset/leetcode/tree/master/problems/find-minimum-in-rotated-sorted-array) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 81 | [搜索旋转排序数组 II](https://github.com/openset/leetcode/tree/master/problems/search-in-rotated-sorted-array-ii) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 74 | [搜索二维矩阵](https://github.com/openset/leetcode/tree/master/problems/search-a-2d-matrix) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 69 | [x 的平方根](https://github.com/openset/leetcode/tree/master/problems/sqrtx) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Easy | -| 50 | [Pow(x, n)](https://github.com/openset/leetcode/tree/master/problems/powx-n) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 35 | [搜索插入位置](https://github.com/openset/leetcode/tree/master/problems/search-insert-position) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Easy | -| 34 | [在排序数组中查找元素的第一个和最后一个位置](https://github.com/openset/leetcode/tree/master/problems/find-first-and-last-position-of-element-in-sorted-array) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 33 | [搜索旋转排序数组](https://github.com/openset/leetcode/tree/master/problems/search-in-rotated-sorted-array) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 29 | [两数相除](https://github.com/openset/leetcode/tree/master/problems/divide-two-integers) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 4 | [寻找两个有序数组的中位数](https://github.com/openset/leetcode/tree/master/problems/median-of-two-sorted-arrays) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Hard | +| 1292 | [元素和小于等于阈值的正方形的最大边长](../../problems/maximum-side-length-of-a-square-with-sum-less-than-or-equal-to-threshold) | [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 1283 | [使结果不超过阈值的最小除数](../../problems/find-the-smallest-divisor-given-a-threshold) | [[二分查找](../binary-search/README.md)] | Medium | +| 1237 | [找出给定方程的正整数解](../../problems/find-positive-integer-solution-for-a-given-equation) | [[数学](../math/README.md)] [[二分查找](../binary-search/README.md)] | Easy | +| 1235 | [规划兼职工作](../../problems/maximum-profit-in-job-scheduling) | [[排序](../sort/README.md)] [[二分查找](../binary-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 1231 | [分享巧克力](../../problems/divide-chocolate) 🔒 | [[贪心算法](../greedy/README.md)] [[二分查找](../binary-search/README.md)] | Hard | +| 1201 | [丑数 III](../../problems/ugly-number-iii) | [[数学](../math/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 1198 | [找出所有行中最小公共元素](../../problems/find-smallest-common-element-in-all-rows) 🔒 | [[哈希表](../hash-table/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 1182 | [与目标颜色间的最短距离](../../problems/shortest-distance-to-target-color) 🔒 | [[二分查找](../binary-search/README.md)] | Medium | +| 1157 | [子数组中占绝大多数的元素](../../problems/online-majority-element-in-subarray) | [[线段树](../segment-tree/README.md)] [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] | Hard | +| 1150 | [检查一个数是否在数组中占绝大多数](../../problems/check-if-a-number-is-majority-element-in-a-sorted-array) 🔒 | [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] | Easy | +| 1111 | [有效括号的嵌套深度](../../problems/maximum-nesting-depth-of-two-valid-parentheses-strings) | [[贪心算法](../greedy/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 1095 | [山脉数组中查找目标值](../../problems/find-in-mountain-array) | [[二分查找](../binary-search/README.md)] | Hard | +| 1064 | [不动点](../../problems/fixed-point) 🔒 | [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] | Easy | +| 1060 | [有序数组中的缺失元素](../../problems/missing-element-in-sorted-array) 🔒 | [[二分查找](../binary-search/README.md)] | Medium | +| 1044 | [最长重复子串](../../problems/longest-duplicate-substring) | [[哈希表](../hash-table/README.md)] [[二分查找](../binary-search/README.md)] | Hard | +| 1011 | [在 D 天内送达包裹的能力](../../problems/capacity-to-ship-packages-within-d-days) | [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 981 | [基于时间的键值存储](../../problems/time-based-key-value-store) | [[哈希表](../hash-table/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 927 | [三等分](../../problems/three-equal-parts) | [[贪心算法](../greedy/README.md)] [[数学](../math/README.md)] [[二分查找](../binary-search/README.md)] | Hard | +| 911 | [在线选举](../../problems/online-election) | [[二分查找](../binary-search/README.md)] | Medium | +| 887 | [鸡蛋掉落](../../problems/super-egg-drop) | [[数学](../math/README.md)] [[二分查找](../binary-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 878 | [第 N 个神奇数字](../../problems/nth-magical-number) | [[数学](../math/README.md)] [[二分查找](../binary-search/README.md)] | Hard | +| 875 | [爱吃香蕉的珂珂](../../problems/koko-eating-bananas) | [[二分查找](../binary-search/README.md)] | Medium | +| 862 | [和至少为 K 的最短子数组](../../problems/shortest-subarray-with-sum-at-least-k) | [[队列](../queue/README.md)] [[二分查找](../binary-search/README.md)] | Hard | +| 852 | [山脉数组的峰顶索引](../../problems/peak-index-in-a-mountain-array) | [[二分查找](../binary-search/README.md)] | Easy | +| 793 | [阶乘函数后K个零](../../problems/preimage-size-of-factorial-zeroes-function) | [[二分查找](../binary-search/README.md)] | Hard | +| 786 | [第 K 个最小的素数分数](../../problems/k-th-smallest-prime-fraction) | [[堆](../heap/README.md)] [[二分查找](../binary-search/README.md)] | Hard | +| 778 | [水位上升的泳池中游泳](../../problems/swim-in-rising-water) | [[堆](../heap/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[并查集](../union-find/README.md)] [[二分查找](../binary-search/README.md)] | Hard | +| 774 | [最小化去加油站的最大距离](../../problems/minimize-max-distance-to-gas-station) 🔒 | [[二分查找](../binary-search/README.md)] | Hard | +| 744 | [寻找比目标字母大的最小字母](../../problems/find-smallest-letter-greater-than-target) | [[二分查找](../binary-search/README.md)] | Easy | +| 719 | [找出第 k 小的距离对](../../problems/find-k-th-smallest-pair-distance) | [[堆](../heap/README.md)] [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] | Hard | +| 718 | [最长重复子数组](../../problems/maximum-length-of-repeated-subarray) | [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] [[二分查找](../binary-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 710 | [黑名单中的随机数](../../problems/random-pick-with-blacklist) | [[排序](../sort/README.md)] [[哈希表](../hash-table/README.md)] [[二分查找](../binary-search/README.md)] [[Random](../random/README.md)] | Hard | +| 704 | [二分查找](../../problems/binary-search) | [[二分查找](../binary-search/README.md)] | Easy | +| 702 | [搜索长度未知的有序数组](../../problems/search-in-a-sorted-array-of-unknown-size) 🔒 | [[二分查找](../binary-search/README.md)] | Medium | +| 668 | [乘法表中第k小的数](../../problems/kth-smallest-number-in-multiplication-table) | [[二分查找](../binary-search/README.md)] | Hard | +| 658 | [找到 K 个最接近的元素](../../problems/find-k-closest-elements) | [[二分查找](../binary-search/README.md)] | Medium | +| 644 | [最大平均子段和 II](../../problems/maximum-average-subarray-ii) 🔒 | [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] | Hard | +| 528 | [按权重随机选择](../../problems/random-pick-with-weight) | [[二分查找](../binary-search/README.md)] [[Random](../random/README.md)] | Medium | +| 497 | [非重叠矩形中的随机点](../../problems/random-point-in-non-overlapping-rectangles) | [[二分查找](../binary-search/README.md)] [[Random](../random/README.md)] | Medium | +| 493 | [翻转对](../../problems/reverse-pairs) | [[排序](../sort/README.md)] [[树状数组](../binary-indexed-tree/README.md)] [[线段树](../segment-tree/README.md)] [[二分查找](../binary-search/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Hard | +| 483 | [最小好进制](../../problems/smallest-good-base) | [[数学](../math/README.md)] [[二分查找](../binary-search/README.md)] | Hard | +| 475 | [供暖器](../../problems/heaters) | [[二分查找](../binary-search/README.md)] | Easy | +| 454 | [四数相加 II](../../problems/4sum-ii) | [[哈希表](../hash-table/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 441 | [排列硬币](../../problems/arranging-coins) | [[数学](../math/README.md)] [[二分查找](../binary-search/README.md)] | Easy | +| 436 | [寻找右区间](../../problems/find-right-interval) | [[二分查找](../binary-search/README.md)] | Medium | +| 410 | [分割数组的最大值](../../problems/split-array-largest-sum) | [[二分查找](../binary-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 392 | [判断子序列](../../problems/is-subsequence) | [[贪心算法](../greedy/README.md)] [[二分查找](../binary-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Easy | +| 378 | [有序矩阵中第K小的元素](../../problems/kth-smallest-element-in-a-sorted-matrix) | [[堆](../heap/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 374 | [猜数字大小](../../problems/guess-number-higher-or-lower) | [[二分查找](../binary-search/README.md)] | Easy | +| 367 | [有效的完全平方数](../../problems/valid-perfect-square) | [[数学](../math/README.md)] [[二分查找](../binary-search/README.md)] | Easy | +| 363 | [矩形区域不超过 K 的最大数值和](../../problems/max-sum-of-rectangle-no-larger-than-k) | [[队列](../queue/README.md)] [[二分查找](../binary-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 354 | [俄罗斯套娃信封问题](../../problems/russian-doll-envelopes) | [[二分查找](../binary-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 352 | [将数据流变为多个不相交区间](../../problems/data-stream-as-disjoint-intervals) | [[二分查找](../binary-search/README.md)] [[Ordered Map](../ordered-map/README.md)] | Hard | +| 350 | [两个数组的交集 II](../../problems/intersection-of-two-arrays-ii) | [[排序](../sort/README.md)] [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] [[二分查找](../binary-search/README.md)] | Easy | +| 349 | [两个数组的交集](../../problems/intersection-of-two-arrays) | [[排序](../sort/README.md)] [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] [[二分查找](../binary-search/README.md)] | Easy | +| 327 | [区间和的个数](../../problems/count-of-range-sum) | [[排序](../sort/README.md)] [[树状数组](../binary-indexed-tree/README.md)] [[线段树](../segment-tree/README.md)] [[二分查找](../binary-search/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Hard | +| 315 | [计算右侧小于当前元素的个数](../../problems/count-of-smaller-numbers-after-self) | [[排序](../sort/README.md)] [[树状数组](../binary-indexed-tree/README.md)] [[线段树](../segment-tree/README.md)] [[二分查找](../binary-search/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Hard | +| 302 | [包含全部黑色像素的最小矩形](../../problems/smallest-rectangle-enclosing-black-pixels) 🔒 | [[二分查找](../binary-search/README.md)] | Hard | +| 300 | [最长上升子序列](../../problems/longest-increasing-subsequence) | [[二分查找](../binary-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 287 | [寻找重复数](../../problems/find-the-duplicate-number) | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 278 | [第一个错误的版本](../../problems/first-bad-version) | [[二分查找](../binary-search/README.md)] | Easy | +| 275 | [H指数 II](../../problems/h-index-ii) | [[二分查找](../binary-search/README.md)] | Medium | +| 270 | [最接近的二叉搜索树值](../../problems/closest-binary-search-tree-value) 🔒 | [[树](../tree/README.md)] [[二分查找](../binary-search/README.md)] | Easy | +| 240 | [搜索二维矩阵 II](../../problems/search-a-2d-matrix-ii) | [[二分查找](../binary-search/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Medium | +| 230 | [二叉搜索树中第K小的元素](../../problems/kth-smallest-element-in-a-bst) | [[树](../tree/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 222 | [完全二叉树的节点个数](../../problems/count-complete-tree-nodes) | [[树](../tree/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 209 | [长度最小的子数组](../../problems/minimum-size-subarray-sum) | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 174 | [地下城游戏](../../problems/dungeon-game) | [[二分查找](../binary-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 167 | [两数之和 II - 输入有序数组](../../problems/two-sum-ii-input-array-is-sorted) | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] [[二分查找](../binary-search/README.md)] | Easy | +| 162 | [寻找峰值](../../problems/find-peak-element) | [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 154 | [寻找旋转排序数组中的最小值 II](../../problems/find-minimum-in-rotated-sorted-array-ii) | [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] | Hard | +| 153 | [寻找旋转排序数组中的最小值](../../problems/find-minimum-in-rotated-sorted-array) | [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 81 | [搜索旋转排序数组 II](../../problems/search-in-rotated-sorted-array-ii) | [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 74 | [搜索二维矩阵](../../problems/search-a-2d-matrix) | [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 69 | [x 的平方根](../../problems/sqrtx) | [[数学](../math/README.md)] [[二分查找](../binary-search/README.md)] | Easy | +| 50 | [Pow(x, n)](../../problems/powx-n) | [[数学](../math/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 35 | [搜索插入位置](../../problems/search-insert-position) | [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] | Easy | +| 34 | [在排序数组中查找元素的第一个和最后一个位置](../../problems/find-first-and-last-position-of-element-in-sorted-array) | [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 33 | [搜索旋转排序数组](../../problems/search-in-rotated-sorted-array) | [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 29 | [两数相除](../../problems/divide-two-integers) | [[数学](../math/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 4 | [寻找两个有序数组的中位数](../../problems/median-of-two-sorted-arrays) | [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Hard | diff --git a/tag/bit-manipulation/README.md b/tag/bit-manipulation/README.md index a410fb011..b33bb8c94 100644 --- a/tag/bit-manipulation/README.md +++ b/tag/bit-manipulation/README.md @@ -5,46 +5,46 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > 位运算 +## [话题分类](../README.md) > 位运算 | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 1290 | [二进制链表转整数](https://github.com/openset/leetcode/tree/master/problems/convert-binary-number-in-a-linked-list-to-integer) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Easy | -| 1256 | [加密数字](https://github.com/openset/leetcode/tree/master/problems/encode-number) 🔒 | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 1255 | [得分最高的单词集合](https://github.com/openset/leetcode/tree/master/problems/maximum-score-words-formed-by-letters) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] | Hard | -| 1239 | [串联字符串的最大长度](https://github.com/openset/leetcode/tree/master/problems/maximum-length-of-a-concatenated-string-with-unique-characters) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 1178 | [猜字谜](https://github.com/openset/leetcode/tree/master/problems/number-of-valid-words-for-each-puzzle) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Hard | -| 1131 | [绝对值表达式的最大值](https://github.com/openset/leetcode/tree/master/problems/maximum-of-absolute-value-expression) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 1125 | [最小的必要团队](https://github.com/openset/leetcode/tree/master/problems/smallest-sufficient-team) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 898 | [子数组按位或操作](https://github.com/openset/leetcode/tree/master/problems/bitwise-ors-of-subarrays) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 784 | [字母大小写全排列](https://github.com/openset/leetcode/tree/master/problems/letter-case-permutation) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Easy | -| 762 | [二进制表示中质数个计算置位](https://github.com/openset/leetcode/tree/master/problems/prime-number-of-set-bits-in-binary-representation) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] | Easy | -| 756 | [金字塔转换矩阵](https://github.com/openset/leetcode/tree/master/problems/pyramid-transition-matrix) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 751 | [IP 到 CIDR](https://github.com/openset/leetcode/tree/master/problems/ip-to-cidr) 🔒 | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] | Easy | -| 693 | [交替位二进制数](https://github.com/openset/leetcode/tree/master/problems/binary-number-with-alternating-bits) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] | Easy | -| 477 | [汉明距离总和](https://github.com/openset/leetcode/tree/master/problems/total-hamming-distance) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] | Medium | -| 476 | [数字的补数](https://github.com/openset/leetcode/tree/master/problems/number-complement) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] | Easy | -| 461 | [汉明距离](https://github.com/openset/leetcode/tree/master/problems/hamming-distance) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] | Easy | -| 421 | [数组中两个数的最大异或值](https://github.com/openset/leetcode/tree/master/problems/maximum-xor-of-two-numbers-in-an-array) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] | Medium | -| 411 | [最短特异单词缩写](https://github.com/openset/leetcode/tree/master/problems/minimum-unique-word-abbreviation) 🔒 | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | -| 405 | [数字转换为十六进制数](https://github.com/openset/leetcode/tree/master/problems/convert-a-number-to-hexadecimal) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] | Easy | -| 401 | [二进制手表](https://github.com/openset/leetcode/tree/master/problems/binary-watch) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Easy | -| 397 | [整数替换](https://github.com/openset/leetcode/tree/master/problems/integer-replacement) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 393 | [UTF-8 编码验证](https://github.com/openset/leetcode/tree/master/problems/utf-8-validation) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] | Medium | -| 389 | [找不同](https://github.com/openset/leetcode/tree/master/problems/find-the-difference) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 371 | [两整数之和](https://github.com/openset/leetcode/tree/master/problems/sum-of-two-integers) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] | Easy | -| 342 | [4的幂](https://github.com/openset/leetcode/tree/master/problems/power-of-four) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] | Easy | -| 338 | [比特位计数](https://github.com/openset/leetcode/tree/master/problems/counting-bits) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 320 | [列举单词的全部缩写](https://github.com/openset/leetcode/tree/master/problems/generalized-abbreviation) 🔒 | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 318 | [最大单词长度乘积](https://github.com/openset/leetcode/tree/master/problems/maximum-product-of-word-lengths) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] | Medium | -| 268 | [缺失数字](https://github.com/openset/leetcode/tree/master/problems/missing-number) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 260 | [只出现一次的数字 III](https://github.com/openset/leetcode/tree/master/problems/single-number-iii) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] | Medium | -| 231 | [2的幂](https://github.com/openset/leetcode/tree/master/problems/power-of-two) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 201 | [数字范围按位与](https://github.com/openset/leetcode/tree/master/problems/bitwise-and-of-numbers-range) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] | Medium | -| 191 | [位1的个数](https://github.com/openset/leetcode/tree/master/problems/number-of-1-bits) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] | Easy | -| 190 | [颠倒二进制位](https://github.com/openset/leetcode/tree/master/problems/reverse-bits) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] | Easy | -| 187 | [重复的DNA序列](https://github.com/openset/leetcode/tree/master/problems/repeated-dna-sequences) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 169 | [多数元素](https://github.com/openset/leetcode/tree/master/problems/majority-element) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Easy | -| 137 | [只出现一次的数字 II](https://github.com/openset/leetcode/tree/master/problems/single-number-ii) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] | Medium | -| 136 | [只出现一次的数字](https://github.com/openset/leetcode/tree/master/problems/single-number) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 78 | [子集](https://github.com/openset/leetcode/tree/master/problems/subsets) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | +| 1290 | [二进制链表转整数](../../problems/convert-binary-number-in-a-linked-list-to-integer) | [[位运算](../bit-manipulation/README.md)] [[链表](../linked-list/README.md)] | Easy | +| 1256 | [加密数字](../../problems/encode-number) 🔒 | [[位运算](../bit-manipulation/README.md)] [[数学](../math/README.md)] | Medium | +| 1255 | [得分最高的单词集合](../../problems/maximum-score-words-formed-by-letters) | [[位运算](../bit-manipulation/README.md)] | Hard | +| 1239 | [串联字符串的最大长度](../../problems/maximum-length-of-a-concatenated-string-with-unique-characters) | [[位运算](../bit-manipulation/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 1178 | [猜字谜](../../problems/number-of-valid-words-for-each-puzzle) | [[位运算](../bit-manipulation/README.md)] [[哈希表](../hash-table/README.md)] | Hard | +| 1131 | [绝对值表达式的最大值](../../problems/maximum-of-absolute-value-expression) | [[位运算](../bit-manipulation/README.md)] [[数学](../math/README.md)] | Medium | +| 1125 | [最小的必要团队](../../problems/smallest-sufficient-team) | [[位运算](../bit-manipulation/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 898 | [子数组按位或操作](../../problems/bitwise-ors-of-subarrays) | [[位运算](../bit-manipulation/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 784 | [字母大小写全排列](../../problems/letter-case-permutation) | [[位运算](../bit-manipulation/README.md)] [[回溯算法](../backtracking/README.md)] | Easy | +| 762 | [二进制表示中质数个计算置位](../../problems/prime-number-of-set-bits-in-binary-representation) | [[位运算](../bit-manipulation/README.md)] | Easy | +| 756 | [金字塔转换矩阵](../../problems/pyramid-transition-matrix) | [[位运算](../bit-manipulation/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 751 | [IP 到 CIDR](../../problems/ip-to-cidr) 🔒 | [[位运算](../bit-manipulation/README.md)] | Easy | +| 693 | [交替位二进制数](../../problems/binary-number-with-alternating-bits) | [[位运算](../bit-manipulation/README.md)] | Easy | +| 477 | [汉明距离总和](../../problems/total-hamming-distance) | [[位运算](../bit-manipulation/README.md)] | Medium | +| 476 | [数字的补数](../../problems/number-complement) | [[位运算](../bit-manipulation/README.md)] | Easy | +| 461 | [汉明距离](../../problems/hamming-distance) | [[位运算](../bit-manipulation/README.md)] | Easy | +| 421 | [数组中两个数的最大异或值](../../problems/maximum-xor-of-two-numbers-in-an-array) | [[位运算](../bit-manipulation/README.md)] [[字典树](../trie/README.md)] | Medium | +| 411 | [最短特异单词缩写](../../problems/minimum-unique-word-abbreviation) 🔒 | [[位运算](../bit-manipulation/README.md)] [[回溯算法](../backtracking/README.md)] | Hard | +| 405 | [数字转换为十六进制数](../../problems/convert-a-number-to-hexadecimal) | [[位运算](../bit-manipulation/README.md)] | Easy | +| 401 | [二进制手表](../../problems/binary-watch) | [[位运算](../bit-manipulation/README.md)] [[回溯算法](../backtracking/README.md)] | Easy | +| 397 | [整数替换](../../problems/integer-replacement) | [[位运算](../bit-manipulation/README.md)] [[数学](../math/README.md)] | Medium | +| 393 | [UTF-8 编码验证](../../problems/utf-8-validation) | [[位运算](../bit-manipulation/README.md)] | Medium | +| 389 | [找不同](../../problems/find-the-difference) | [[位运算](../bit-manipulation/README.md)] [[哈希表](../hash-table/README.md)] | Easy | +| 371 | [两整数之和](../../problems/sum-of-two-integers) | [[位运算](../bit-manipulation/README.md)] | Easy | +| 342 | [4的幂](../../problems/power-of-four) | [[位运算](../bit-manipulation/README.md)] | Easy | +| 338 | [比特位计数](../../problems/counting-bits) | [[位运算](../bit-manipulation/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 320 | [列举单词的全部缩写](../../problems/generalized-abbreviation) 🔒 | [[位运算](../bit-manipulation/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 318 | [最大单词长度乘积](../../problems/maximum-product-of-word-lengths) | [[位运算](../bit-manipulation/README.md)] | Medium | +| 268 | [缺失数字](../../problems/missing-number) | [[位运算](../bit-manipulation/README.md)] [[数组](../array/README.md)] [[数学](../math/README.md)] | Easy | +| 260 | [只出现一次的数字 III](../../problems/single-number-iii) | [[位运算](../bit-manipulation/README.md)] | Medium | +| 231 | [2的幂](../../problems/power-of-two) | [[位运算](../bit-manipulation/README.md)] [[数学](../math/README.md)] | Easy | +| 201 | [数字范围按位与](../../problems/bitwise-and-of-numbers-range) | [[位运算](../bit-manipulation/README.md)] | Medium | +| 191 | [位1的个数](../../problems/number-of-1-bits) | [[位运算](../bit-manipulation/README.md)] | Easy | +| 190 | [颠倒二进制位](../../problems/reverse-bits) | [[位运算](../bit-manipulation/README.md)] | Easy | +| 187 | [重复的DNA序列](../../problems/repeated-dna-sequences) | [[位运算](../bit-manipulation/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 169 | [多数元素](../../problems/majority-element) | [[位运算](../bit-manipulation/README.md)] [[数组](../array/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Easy | +| 137 | [只出现一次的数字 II](../../problems/single-number-ii) | [[位运算](../bit-manipulation/README.md)] | Medium | +| 136 | [只出现一次的数字](../../problems/single-number) | [[位运算](../bit-manipulation/README.md)] [[哈希表](../hash-table/README.md)] | Easy | +| 78 | [子集](../../problems/subsets) | [[位运算](../bit-manipulation/README.md)] [[数组](../array/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | diff --git a/tag/brainteaser/README.md b/tag/brainteaser/README.md index 279f180a2..9ca15357a 100644 --- a/tag/brainteaser/README.md +++ b/tag/brainteaser/README.md @@ -5,12 +5,12 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > 脑筋急转弯 +## [话题分类](../README.md) > 脑筋急转弯 | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 1227 | [飞机座位分配概率](https://github.com/openset/leetcode/tree/master/problems/airplane-seat-assignment-probability) | [[脑筋急转弯](https://github.com/openset/leetcode/tree/master/tag/brainteaser/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 1033 | [移动石子直到连续](https://github.com/openset/leetcode/tree/master/problems/moving-stones-until-consecutive) | [[脑筋急转弯](https://github.com/openset/leetcode/tree/master/tag/brainteaser/README.md)] | Easy | -| 777 | [在LR字符串中交换相邻字符](https://github.com/openset/leetcode/tree/master/problems/swap-adjacent-in-lr-string) | [[脑筋急转弯](https://github.com/openset/leetcode/tree/master/tag/brainteaser/README.md)] | Medium | -| 319 | [灯泡开关](https://github.com/openset/leetcode/tree/master/problems/bulb-switcher) | [[脑筋急转弯](https://github.com/openset/leetcode/tree/master/tag/brainteaser/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 292 | [Nim 游戏](https://github.com/openset/leetcode/tree/master/problems/nim-game) | [[脑筋急转弯](https://github.com/openset/leetcode/tree/master/tag/brainteaser/README.md)] [[极小化极大](https://github.com/openset/leetcode/tree/master/tag/minimax/README.md)] | Easy | +| 1227 | [飞机座位分配概率](../../problems/airplane-seat-assignment-probability) | [[脑筋急转弯](../brainteaser/README.md)] [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 1033 | [移动石子直到连续](../../problems/moving-stones-until-consecutive) | [[脑筋急转弯](../brainteaser/README.md)] | Easy | +| 777 | [在LR字符串中交换相邻字符](../../problems/swap-adjacent-in-lr-string) | [[脑筋急转弯](../brainteaser/README.md)] | Medium | +| 319 | [灯泡开关](../../problems/bulb-switcher) | [[脑筋急转弯](../brainteaser/README.md)] [[数学](../math/README.md)] | Medium | +| 292 | [Nim 游戏](../../problems/nim-game) | [[脑筋急转弯](../brainteaser/README.md)] [[极小化极大](../minimax/README.md)] | Easy | diff --git a/tag/breadth-first-search/README.md b/tag/breadth-first-search/README.md index 5e76fd0c6..cc761a19f 100644 --- a/tag/breadth-first-search/README.md +++ b/tag/breadth-first-search/README.md @@ -5,67 +5,67 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > 广度优先搜索 +## [话题分类](../README.md) > 广度优先搜索 | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 1293 | [网格中的最短路径](https://github.com/openset/leetcode/tree/master/problems/shortest-path-in-a-grid-with-obstacles-elimination) | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Hard | -| 1284 | [转化为全零矩阵的最少反转次数](https://github.com/openset/leetcode/tree/master/problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix) | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Hard | -| 1263 | [推箱子](https://github.com/openset/leetcode/tree/master/problems/minimum-moves-to-move-a-box-to-their-target-location) | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Hard | -| 1245 | [树的直径](https://github.com/openset/leetcode/tree/master/problems/tree-diameter) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 1242 | [多线程网页爬虫](https://github.com/openset/leetcode/tree/master/problems/web-crawler-multithreaded) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 1236 | [Web Crawler](https://github.com/openset/leetcode/tree/master/problems/web-crawler) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 1210 | [穿过迷宫的最少移动次数](https://github.com/openset/leetcode/tree/master/problems/minimum-moves-to-reach-target-with-rotations) | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Hard | -| 1197 | [进击的骑士](https://github.com/openset/leetcode/tree/master/problems/minimum-knight-moves) 🔒 | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 1162 | [地图分析](https://github.com/openset/leetcode/tree/master/problems/as-far-from-land-as-possible) | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 1129 | [颜色交替的最短路径](https://github.com/openset/leetcode/tree/master/problems/shortest-path-with-alternating-colors) | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 1091 | [二进制矩阵中的最短路径](https://github.com/openset/leetcode/tree/master/problems/shortest-path-in-binary-matrix) | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 1036 | [逃离大迷宫](https://github.com/openset/leetcode/tree/master/problems/escape-a-large-maze) | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Hard | -| 994 | [腐烂的橘子](https://github.com/openset/leetcode/tree/master/problems/rotting-oranges) | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Easy | -| 993 | [二叉树的堂兄弟节点](https://github.com/openset/leetcode/tree/master/problems/cousins-in-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Easy | -| 934 | [最短的桥](https://github.com/openset/leetcode/tree/master/problems/shortest-bridge) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 913 | [猫和老鼠](https://github.com/openset/leetcode/tree/master/problems/cat-and-mouse) | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[极小化极大](https://github.com/openset/leetcode/tree/master/tag/minimax/README.md)] | Hard | -| 909 | [蛇梯棋](https://github.com/openset/leetcode/tree/master/problems/snakes-and-ladders) | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 864 | [获取所有钥匙的最短路径](https://github.com/openset/leetcode/tree/master/problems/shortest-path-to-get-all-keys) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Hard | -| 863 | [二叉树中所有距离为 K 的结点](https://github.com/openset/leetcode/tree/master/problems/all-nodes-distance-k-in-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 854 | [相似度为 K 的字符串](https://github.com/openset/leetcode/tree/master/problems/k-similar-strings) | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Hard | -| 847 | [访问所有节点的最短路径](https://github.com/openset/leetcode/tree/master/problems/shortest-path-visiting-all-nodes) | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 815 | [公交路线](https://github.com/openset/leetcode/tree/master/problems/bus-routes) | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Hard | -| 787 | [K 站中转内最便宜的航班](https://github.com/openset/leetcode/tree/master/problems/cheapest-flights-within-k-stops) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 785 | [判断二分图](https://github.com/openset/leetcode/tree/master/problems/is-graph-bipartite) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 773 | [滑动谜题](https://github.com/openset/leetcode/tree/master/problems/sliding-puzzle) | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Hard | -| 752 | [打开转盘锁](https://github.com/openset/leetcode/tree/master/problems/open-the-lock) | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 743 | [网络延迟时间](https://github.com/openset/leetcode/tree/master/problems/network-delay-time) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 690 | [员工的重要性](https://github.com/openset/leetcode/tree/master/problems/employee-importance) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 675 | [为高尔夫比赛砍树](https://github.com/openset/leetcode/tree/master/problems/cut-off-trees-for-golf-event) | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Hard | -| 559 | [N叉树的最大深度](https://github.com/openset/leetcode/tree/master/problems/maximum-depth-of-n-ary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Easy | -| 542 | [01 矩阵](https://github.com/openset/leetcode/tree/master/problems/01-matrix) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 529 | [扫雷游戏](https://github.com/openset/leetcode/tree/master/problems/minesweeper) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 515 | [在每个树行中找最大值](https://github.com/openset/leetcode/tree/master/problems/find-largest-value-in-each-tree-row) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 513 | [找树左下角的值](https://github.com/openset/leetcode/tree/master/problems/find-bottom-left-tree-value) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 505 | [迷宫 II](https://github.com/openset/leetcode/tree/master/problems/the-maze-ii) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 499 | [迷宫 III](https://github.com/openset/leetcode/tree/master/problems/the-maze-iii) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Hard | -| 490 | [迷宫](https://github.com/openset/leetcode/tree/master/problems/the-maze) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 429 | [N叉树的层序遍历](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-level-order-traversal) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 417 | [太平洋大西洋水流问题](https://github.com/openset/leetcode/tree/master/problems/pacific-atlantic-water-flow) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 407 | [接雨水 II](https://github.com/openset/leetcode/tree/master/problems/trapping-rain-water-ii) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Hard | -| 323 | [无向图中连通分量的数目](https://github.com/openset/leetcode/tree/master/problems/number-of-connected-components-in-an-undirected-graph) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 317 | [离建筑物最近的距离](https://github.com/openset/leetcode/tree/master/problems/shortest-distance-from-all-buildings) 🔒 | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Hard | -| 310 | [最小高度树](https://github.com/openset/leetcode/tree/master/problems/minimum-height-trees) | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 301 | [删除无效的括号](https://github.com/openset/leetcode/tree/master/problems/remove-invalid-parentheses) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Hard | -| 286 | [墙与门](https://github.com/openset/leetcode/tree/master/problems/walls-and-gates) 🔒 | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 279 | [完全平方数](https://github.com/openset/leetcode/tree/master/problems/perfect-squares) | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 261 | [以图判树](https://github.com/openset/leetcode/tree/master/problems/graph-valid-tree) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 210 | [课程表 II](https://github.com/openset/leetcode/tree/master/problems/course-schedule-ii) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] [[拓扑排序](https://github.com/openset/leetcode/tree/master/tag/topological-sort/README.md)] | Medium | -| 207 | [课程表](https://github.com/openset/leetcode/tree/master/problems/course-schedule) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] [[拓扑排序](https://github.com/openset/leetcode/tree/master/tag/topological-sort/README.md)] | Medium | -| 200 | [岛屿数量](https://github.com/openset/leetcode/tree/master/problems/number-of-islands) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] | Medium | -| 199 | [二叉树的右视图](https://github.com/openset/leetcode/tree/master/problems/binary-tree-right-side-view) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 133 | [克隆图](https://github.com/openset/leetcode/tree/master/problems/clone-graph) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 130 | [被围绕的区域](https://github.com/openset/leetcode/tree/master/problems/surrounded-regions) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] | Medium | -| 127 | [单词接龙](https://github.com/openset/leetcode/tree/master/problems/word-ladder) | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 126 | [单词接龙 II](https://github.com/openset/leetcode/tree/master/problems/word-ladder-ii) | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | -| 111 | [二叉树的最小深度](https://github.com/openset/leetcode/tree/master/problems/minimum-depth-of-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Easy | -| 107 | [二叉树的层次遍历 II](https://github.com/openset/leetcode/tree/master/problems/binary-tree-level-order-traversal-ii) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Easy | -| 103 | [二叉树的锯齿形层次遍历](https://github.com/openset/leetcode/tree/master/problems/binary-tree-zigzag-level-order-traversal) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 102 | [二叉树的层次遍历](https://github.com/openset/leetcode/tree/master/problems/binary-tree-level-order-traversal) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 101 | [对称二叉树](https://github.com/openset/leetcode/tree/master/problems/symmetric-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Easy | +| 1293 | [网格中的最短路径](../../problems/shortest-path-in-a-grid-with-obstacles-elimination) | [[广度优先搜索](../breadth-first-search/README.md)] | Hard | +| 1284 | [转化为全零矩阵的最少反转次数](../../problems/minimum-number-of-flips-to-convert-binary-matrix-to-zero-matrix) | [[广度优先搜索](../breadth-first-search/README.md)] | Hard | +| 1263 | [推箱子](../../problems/minimum-moves-to-move-a-box-to-their-target-location) | [[广度优先搜索](../breadth-first-search/README.md)] | Hard | +| 1245 | [树的直径](../../problems/tree-diameter) 🔒 | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 1242 | [多线程网页爬虫](../../problems/web-crawler-multithreaded) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 1236 | [Web Crawler](../../problems/web-crawler) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 1210 | [穿过迷宫的最少移动次数](../../problems/minimum-moves-to-reach-target-with-rotations) | [[广度优先搜索](../breadth-first-search/README.md)] | Hard | +| 1197 | [进击的骑士](../../problems/minimum-knight-moves) 🔒 | [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 1162 | [地图分析](../../problems/as-far-from-land-as-possible) | [[广度优先搜索](../breadth-first-search/README.md)] [[图](../graph/README.md)] | Medium | +| 1129 | [颜色交替的最短路径](../../problems/shortest-path-with-alternating-colors) | [[广度优先搜索](../breadth-first-search/README.md)] [[图](../graph/README.md)] | Medium | +| 1091 | [二进制矩阵中的最短路径](../../problems/shortest-path-in-binary-matrix) | [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 1036 | [逃离大迷宫](../../problems/escape-a-large-maze) | [[广度优先搜索](../breadth-first-search/README.md)] | Hard | +| 994 | [腐烂的橘子](../../problems/rotting-oranges) | [[广度优先搜索](../breadth-first-search/README.md)] | Easy | +| 993 | [二叉树的堂兄弟节点](../../problems/cousins-in-binary-tree) | [[树](../tree/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Easy | +| 934 | [最短的桥](../../problems/shortest-bridge) | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 913 | [猫和老鼠](../../problems/cat-and-mouse) | [[广度优先搜索](../breadth-first-search/README.md)] [[极小化极大](../minimax/README.md)] | Hard | +| 909 | [蛇梯棋](../../problems/snakes-and-ladders) | [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 864 | [获取所有钥匙的最短路径](../../problems/shortest-path-to-get-all-keys) | [[堆](../heap/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Hard | +| 863 | [二叉树中所有距离为 K 的结点](../../problems/all-nodes-distance-k-in-binary-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 854 | [相似度为 K 的字符串](../../problems/k-similar-strings) | [[广度优先搜索](../breadth-first-search/README.md)] [[图](../graph/README.md)] | Hard | +| 847 | [访问所有节点的最短路径](../../problems/shortest-path-visiting-all-nodes) | [[广度优先搜索](../breadth-first-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 815 | [公交路线](../../problems/bus-routes) | [[广度优先搜索](../breadth-first-search/README.md)] | Hard | +| 787 | [K 站中转内最便宜的航班](../../problems/cheapest-flights-within-k-stops) | [[堆](../heap/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 785 | [判断二分图](../../problems/is-graph-bipartite) | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[图](../graph/README.md)] | Medium | +| 773 | [滑动谜题](../../problems/sliding-puzzle) | [[广度优先搜索](../breadth-first-search/README.md)] | Hard | +| 752 | [打开转盘锁](../../problems/open-the-lock) | [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 743 | [网络延迟时间](../../problems/network-delay-time) | [[堆](../heap/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[图](../graph/README.md)] | Medium | +| 690 | [员工的重要性](../../problems/employee-importance) | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[哈希表](../hash-table/README.md)] | Easy | +| 675 | [为高尔夫比赛砍树](../../problems/cut-off-trees-for-golf-event) | [[广度优先搜索](../breadth-first-search/README.md)] | Hard | +| 559 | [N叉树的最大深度](../../problems/maximum-depth-of-n-ary-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Easy | +| 542 | [01 矩阵](../../problems/01-matrix) | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 529 | [扫雷游戏](../../problems/minesweeper) | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 515 | [在每个树行中找最大值](../../problems/find-largest-value-in-each-tree-row) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 513 | [找树左下角的值](../../problems/find-bottom-left-tree-value) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 505 | [迷宫 II](../../problems/the-maze-ii) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 499 | [迷宫 III](../../problems/the-maze-iii) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Hard | +| 490 | [迷宫](../../problems/the-maze) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 429 | [N叉树的层序遍历](../../problems/n-ary-tree-level-order-traversal) | [[树](../tree/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 417 | [太平洋大西洋水流问题](../../problems/pacific-atlantic-water-flow) | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 407 | [接雨水 II](../../problems/trapping-rain-water-ii) | [[堆](../heap/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Hard | +| 323 | [无向图中连通分量的数目](../../problems/number-of-connected-components-in-an-undirected-graph) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Medium | +| 317 | [离建筑物最近的距离](../../problems/shortest-distance-from-all-buildings) 🔒 | [[广度优先搜索](../breadth-first-search/README.md)] | Hard | +| 310 | [最小高度树](../../problems/minimum-height-trees) | [[广度优先搜索](../breadth-first-search/README.md)] [[图](../graph/README.md)] | Medium | +| 301 | [删除无效的括号](../../problems/remove-invalid-parentheses) | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Hard | +| 286 | [墙与门](../../problems/walls-and-gates) 🔒 | [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 279 | [完全平方数](../../problems/perfect-squares) | [[广度优先搜索](../breadth-first-search/README.md)] [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 261 | [以图判树](../../problems/graph-valid-tree) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Medium | +| 210 | [课程表 II](../../problems/course-schedule-ii) | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[图](../graph/README.md)] [[拓扑排序](../topological-sort/README.md)] | Medium | +| 207 | [课程表](../../problems/course-schedule) | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[图](../graph/README.md)] [[拓扑排序](../topological-sort/README.md)] | Medium | +| 200 | [岛屿数量](../../problems/number-of-islands) | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[并查集](../union-find/README.md)] | Medium | +| 199 | [二叉树的右视图](../../problems/binary-tree-right-side-view) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 133 | [克隆图](../../problems/clone-graph) | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[图](../graph/README.md)] | Medium | +| 130 | [被围绕的区域](../../problems/surrounded-regions) | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[并查集](../union-find/README.md)] | Medium | +| 127 | [单词接龙](../../problems/word-ladder) | [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 126 | [单词接龙 II](../../problems/word-ladder-ii) | [[广度优先搜索](../breadth-first-search/README.md)] [[数组](../array/README.md)] [[字符串](../string/README.md)] [[回溯算法](../backtracking/README.md)] | Hard | +| 111 | [二叉树的最小深度](../../problems/minimum-depth-of-binary-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Easy | +| 107 | [二叉树的层次遍历 II](../../problems/binary-tree-level-order-traversal-ii) | [[树](../tree/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Easy | +| 103 | [二叉树的锯齿形层次遍历](../../problems/binary-tree-zigzag-level-order-traversal) | [[栈](../stack/README.md)] [[树](../tree/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 102 | [二叉树的层次遍历](../../problems/binary-tree-level-order-traversal) | [[树](../tree/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 101 | [对称二叉树](../../problems/symmetric-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Easy | diff --git a/tag/depth-first-search/README.md b/tag/depth-first-search/README.md index c2ea6715c..f48d651a0 100644 --- a/tag/depth-first-search/README.md +++ b/tag/depth-first-search/README.md @@ -5,121 +5,121 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > 深度优先搜索 +## [话题分类](../README.md) > 深度优先搜索 | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 1273 | [删除树节点](https://github.com/openset/leetcode/tree/master/problems/delete-tree-nodes) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 1254 | [统计封闭岛屿的数目](https://github.com/openset/leetcode/tree/master/problems/number-of-closed-islands) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 1245 | [树的直径](https://github.com/openset/leetcode/tree/master/problems/tree-diameter) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 1242 | [多线程网页爬虫](https://github.com/openset/leetcode/tree/master/problems/web-crawler-multithreaded) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 1236 | [Web Crawler](https://github.com/openset/leetcode/tree/master/problems/web-crawler) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 1203 | [项目管理](https://github.com/openset/leetcode/tree/master/problems/sort-items-by-groups-respecting-dependencies) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] [[拓扑排序](https://github.com/openset/leetcode/tree/master/tag/topological-sort/README.md)] | Hard | -| 1192 | [查找集群内的「关键连接」](https://github.com/openset/leetcode/tree/master/problems/critical-connections-in-a-network) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Hard | -| 1145 | [二叉树着色游戏](https://github.com/openset/leetcode/tree/master/problems/binary-tree-coloring-game) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 1136 | [平行课程](https://github.com/openset/leetcode/tree/master/problems/parallel-courses) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 1123 | [最深叶节点的最近公共祖先](https://github.com/openset/leetcode/tree/master/problems/lowest-common-ancestor-of-deepest-leaves) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 1110 | [删点成林](https://github.com/openset/leetcode/tree/master/problems/delete-nodes-and-return-forest) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 1102 | [得分最高的路径](https://github.com/openset/leetcode/tree/master/problems/path-with-maximum-minimum-value) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 1080 | [根到叶路径上的不足节点](https://github.com/openset/leetcode/tree/master/problems/insufficient-nodes-in-root-to-leaf-paths) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 1061 | [按字典序排列最小的等效字符串](https://github.com/openset/leetcode/tree/master/problems/lexicographically-smallest-equivalent-string) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] | Medium | -| 1059 | [从始点到终点的所有路径](https://github.com/openset/leetcode/tree/master/problems/all-paths-from-source-lead-to-destination) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 1034 | [边框着色](https://github.com/openset/leetcode/tree/master/problems/coloring-a-border) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 1028 | [从先序遍历还原二叉树](https://github.com/openset/leetcode/tree/master/problems/recover-a-tree-from-preorder-traversal) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Hard | -| 1026 | [节点与其祖先之间的最大差值](https://github.com/openset/leetcode/tree/master/problems/maximum-difference-between-node-and-ancestor) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 1020 | [飞地的数量](https://github.com/openset/leetcode/tree/master/problems/number-of-enclaves) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 988 | [从叶结点开始的最小字符串](https://github.com/openset/leetcode/tree/master/problems/smallest-string-starting-from-leaf) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 980 | [不同路径 III](https://github.com/openset/leetcode/tree/master/problems/unique-paths-iii) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | -| 979 | [在二叉树中分配硬币](https://github.com/openset/leetcode/tree/master/problems/distribute-coins-in-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 971 | [翻转二叉树以匹配先序遍历](https://github.com/openset/leetcode/tree/master/problems/flip-binary-tree-to-match-preorder-traversal) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 968 | [监控二叉树](https://github.com/openset/leetcode/tree/master/problems/binary-tree-cameras) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 959 | [由斜杠划分区域](https://github.com/openset/leetcode/tree/master/problems/regions-cut-by-slashes) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 947 | [移除最多的同行或同列石头](https://github.com/openset/leetcode/tree/master/problems/most-stones-removed-with-same-row-or-column) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] | Medium | -| 934 | [最短的桥](https://github.com/openset/leetcode/tree/master/problems/shortest-bridge) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 928 | [尽量减少恶意软件的传播 II](https://github.com/openset/leetcode/tree/master/problems/minimize-malware-spread-ii) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Hard | -| 924 | [尽量减少恶意软件的传播](https://github.com/openset/leetcode/tree/master/problems/minimize-malware-spread) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] | Hard | -| 897 | [递增顺序查找树](https://github.com/openset/leetcode/tree/master/problems/increasing-order-search-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Easy | -| 886 | [可能的二分法](https://github.com/openset/leetcode/tree/master/problems/possible-bipartition) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 872 | [叶子相似的树](https://github.com/openset/leetcode/tree/master/problems/leaf-similar-trees) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Easy | -| 863 | [二叉树中所有距离为 K 的结点](https://github.com/openset/leetcode/tree/master/problems/all-nodes-distance-k-in-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 851 | [喧闹和富有](https://github.com/openset/leetcode/tree/master/problems/loud-and-rich) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 841 | [钥匙和房间](https://github.com/openset/leetcode/tree/master/problems/keys-and-rooms) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 839 | [相似字符串组](https://github.com/openset/leetcode/tree/master/problems/similar-string-groups) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Hard | -| 834 | [树中距离之和](https://github.com/openset/leetcode/tree/master/problems/sum-of-distances-in-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Hard | -| 827 | [最大人工岛](https://github.com/openset/leetcode/tree/master/problems/making-a-large-island) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Hard | -| 802 | [找到最终的安全状态](https://github.com/openset/leetcode/tree/master/problems/find-eventual-safe-states) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 785 | [判断二分图](https://github.com/openset/leetcode/tree/master/problems/is-graph-bipartite) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 778 | [水位上升的泳池中游泳](https://github.com/openset/leetcode/tree/master/problems/swim-in-rising-water) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Hard | -| 756 | [金字塔转换矩阵](https://github.com/openset/leetcode/tree/master/problems/pyramid-transition-matrix) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 753 | [破解保险箱](https://github.com/openset/leetcode/tree/master/problems/cracking-the-safe) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Hard | -| 749 | [隔离病毒](https://github.com/openset/leetcode/tree/master/problems/contain-virus) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Hard | -| 743 | [网络延迟时间](https://github.com/openset/leetcode/tree/master/problems/network-delay-time) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 737 | [句子相似性 II](https://github.com/openset/leetcode/tree/master/problems/sentence-similarity-ii) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] | Medium | -| 733 | [图像渲染](https://github.com/openset/leetcode/tree/master/problems/flood-fill) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Easy | -| 721 | [账户合并](https://github.com/openset/leetcode/tree/master/problems/accounts-merge) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] | Medium | -| 711 | [不同岛屿的数量 II](https://github.com/openset/leetcode/tree/master/problems/number-of-distinct-islands-ii) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Hard | -| 695 | [岛屿的最大面积](https://github.com/openset/leetcode/tree/master/problems/max-area-of-island) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 694 | [不同岛屿的数量](https://github.com/openset/leetcode/tree/master/problems/number-of-distinct-islands) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 690 | [员工的重要性](https://github.com/openset/leetcode/tree/master/problems/employee-importance) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 685 | [冗余连接 II](https://github.com/openset/leetcode/tree/master/problems/redundant-connection-ii) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Hard | -| 679 | [24 点游戏](https://github.com/openset/leetcode/tree/master/problems/24-game) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Hard | -| 664 | [奇怪的打印机](https://github.com/openset/leetcode/tree/master/problems/strange-printer) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 638 | [大礼包](https://github.com/openset/leetcode/tree/master/problems/shopping-offers) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 576 | [出界的路径数](https://github.com/openset/leetcode/tree/master/problems/out-of-boundary-paths) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 559 | [N叉树的最大深度](https://github.com/openset/leetcode/tree/master/problems/maximum-depth-of-n-ary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Easy | -| 547 | [朋友圈](https://github.com/openset/leetcode/tree/master/problems/friend-circles) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] | Medium | -| 546 | [移除盒子](https://github.com/openset/leetcode/tree/master/problems/remove-boxes) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 542 | [01 矩阵](https://github.com/openset/leetcode/tree/master/problems/01-matrix) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 533 | [孤独像素 II](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-ii) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 531 | [孤独像素 I](https://github.com/openset/leetcode/tree/master/problems/lonely-pixel-i) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 529 | [扫雷游戏](https://github.com/openset/leetcode/tree/master/problems/minesweeper) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 515 | [在每个树行中找最大值](https://github.com/openset/leetcode/tree/master/problems/find-largest-value-in-each-tree-row) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 514 | [自由之路](https://github.com/openset/leetcode/tree/master/problems/freedom-trail) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 513 | [找树左下角的值](https://github.com/openset/leetcode/tree/master/problems/find-bottom-left-tree-value) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 505 | [迷宫 II](https://github.com/openset/leetcode/tree/master/problems/the-maze-ii) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 499 | [迷宫 III](https://github.com/openset/leetcode/tree/master/problems/the-maze-iii) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Hard | -| 494 | [目标和](https://github.com/openset/leetcode/tree/master/problems/target-sum) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 491 | [递增子序列](https://github.com/openset/leetcode/tree/master/problems/increasing-subsequences) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 490 | [迷宫](https://github.com/openset/leetcode/tree/master/problems/the-maze) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 489 | [扫地机器人](https://github.com/openset/leetcode/tree/master/problems/robot-room-cleaner) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Hard | -| 488 | [祖玛游戏](https://github.com/openset/leetcode/tree/master/problems/zuma-game) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Hard | -| 473 | [火柴拼正方形](https://github.com/openset/leetcode/tree/master/problems/matchsticks-to-square) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 472 | [连接词](https://github.com/openset/leetcode/tree/master/problems/concatenated-words) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 439 | [三元表达式解析器](https://github.com/openset/leetcode/tree/master/problems/ternary-expression-parser) 🔒 | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 430 | [扁平化多级双向链表](https://github.com/openset/leetcode/tree/master/problems/flatten-a-multilevel-doubly-linked-list) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Medium | -| 417 | [太平洋大西洋水流问题](https://github.com/openset/leetcode/tree/master/problems/pacific-atlantic-water-flow) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 394 | [字符串解码](https://github.com/openset/leetcode/tree/master/problems/decode-string) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 366 | [寻找完全二叉树的叶子节点](https://github.com/openset/leetcode/tree/master/problems/find-leaves-of-binary-tree) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 364 | [加权嵌套序列和 II](https://github.com/openset/leetcode/tree/master/problems/nested-list-weight-sum-ii) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 339 | [嵌套列表权重和](https://github.com/openset/leetcode/tree/master/problems/nested-list-weight-sum) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Easy | -| 337 | [打家劫舍 III](https://github.com/openset/leetcode/tree/master/problems/house-robber-iii) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 332 | [重新安排行程](https://github.com/openset/leetcode/tree/master/problems/reconstruct-itinerary) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 329 | [矩阵中的最长递增路径](https://github.com/openset/leetcode/tree/master/problems/longest-increasing-path-in-a-matrix) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[拓扑排序](https://github.com/openset/leetcode/tree/master/tag/topological-sort/README.md)] [[记忆化](https://github.com/openset/leetcode/tree/master/tag/memoization/README.md)] | Hard | -| 323 | [无向图中连通分量的数目](https://github.com/openset/leetcode/tree/master/problems/number-of-connected-components-in-an-undirected-graph) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 301 | [删除无效的括号](https://github.com/openset/leetcode/tree/master/problems/remove-invalid-parentheses) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Hard | -| 261 | [以图判树](https://github.com/openset/leetcode/tree/master/problems/graph-valid-tree) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 257 | [二叉树的所有路径](https://github.com/openset/leetcode/tree/master/problems/binary-tree-paths) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Easy | -| 210 | [课程表 II](https://github.com/openset/leetcode/tree/master/problems/course-schedule-ii) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] [[拓扑排序](https://github.com/openset/leetcode/tree/master/tag/topological-sort/README.md)] | Medium | -| 207 | [课程表](https://github.com/openset/leetcode/tree/master/problems/course-schedule) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] [[拓扑排序](https://github.com/openset/leetcode/tree/master/tag/topological-sort/README.md)] | Medium | -| 200 | [岛屿数量](https://github.com/openset/leetcode/tree/master/problems/number-of-islands) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] | Medium | -| 199 | [二叉树的右视图](https://github.com/openset/leetcode/tree/master/problems/binary-tree-right-side-view) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 133 | [克隆图](https://github.com/openset/leetcode/tree/master/problems/clone-graph) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 130 | [被围绕的区域](https://github.com/openset/leetcode/tree/master/problems/surrounded-regions) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] | Medium | -| 129 | [求根到叶子节点数字之和](https://github.com/openset/leetcode/tree/master/problems/sum-root-to-leaf-numbers) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 124 | [二叉树中的最大路径和](https://github.com/openset/leetcode/tree/master/problems/binary-tree-maximum-path-sum) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Hard | -| 117 | [填充每个节点的下一个右侧节点指针 II](https://github.com/openset/leetcode/tree/master/problems/populating-next-right-pointers-in-each-node-ii) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 116 | [填充每个节点的下一个右侧节点指针](https://github.com/openset/leetcode/tree/master/problems/populating-next-right-pointers-in-each-node) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 114 | [二叉树展开为链表](https://github.com/openset/leetcode/tree/master/problems/flatten-binary-tree-to-linked-list) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 113 | [路径总和 II](https://github.com/openset/leetcode/tree/master/problems/path-sum-ii) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 112 | [路径总和](https://github.com/openset/leetcode/tree/master/problems/path-sum) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Easy | -| 111 | [二叉树的最小深度](https://github.com/openset/leetcode/tree/master/problems/minimum-depth-of-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Easy | -| 110 | [平衡二叉树](https://github.com/openset/leetcode/tree/master/problems/balanced-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Easy | -| 109 | [有序链表转换二叉搜索树](https://github.com/openset/leetcode/tree/master/problems/convert-sorted-list-to-binary-search-tree) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Medium | -| 108 | [将有序数组转换为二叉搜索树](https://github.com/openset/leetcode/tree/master/problems/convert-sorted-array-to-binary-search-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Easy | -| 106 | [从中序与后序遍历序列构造二叉树](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-inorder-and-postorder-traversal) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 105 | [从前序与中序遍历序列构造二叉树](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-preorder-and-inorder-traversal) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 104 | [二叉树的最大深度](https://github.com/openset/leetcode/tree/master/problems/maximum-depth-of-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Easy | -| 101 | [对称二叉树](https://github.com/openset/leetcode/tree/master/problems/symmetric-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Easy | -| 100 | [相同的树](https://github.com/openset/leetcode/tree/master/problems/same-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Easy | -| 99 | [恢复二叉搜索树](https://github.com/openset/leetcode/tree/master/problems/recover-binary-search-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Hard | -| 98 | [验证二叉搜索树](https://github.com/openset/leetcode/tree/master/problems/validate-binary-search-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | +| 1273 | [删除树节点](../../problems/delete-tree-nodes) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 1254 | [统计封闭岛屿的数目](../../problems/number-of-closed-islands) | [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 1245 | [树的直径](../../problems/tree-diameter) 🔒 | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 1242 | [多线程网页爬虫](../../problems/web-crawler-multithreaded) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 1236 | [Web Crawler](../../problems/web-crawler) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 1203 | [项目管理](../../problems/sort-items-by-groups-respecting-dependencies) | [[深度优先搜索](../depth-first-search/README.md)] [[图](../graph/README.md)] [[拓扑排序](../topological-sort/README.md)] | Hard | +| 1192 | [查找集群内的「关键连接」](../../problems/critical-connections-in-a-network) | [[深度优先搜索](../depth-first-search/README.md)] | Hard | +| 1145 | [二叉树着色游戏](../../problems/binary-tree-coloring-game) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 1136 | [平行课程](../../problems/parallel-courses) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[图](../graph/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 1123 | [最深叶节点的最近公共祖先](../../problems/lowest-common-ancestor-of-deepest-leaves) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 1110 | [删点成林](../../problems/delete-nodes-and-return-forest) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 1102 | [得分最高的路径](../../problems/path-with-maximum-minimum-value) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Medium | +| 1080 | [根到叶路径上的不足节点](../../problems/insufficient-nodes-in-root-to-leaf-paths) | [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 1061 | [按字典序排列最小的等效字符串](../../problems/lexicographically-smallest-equivalent-string) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[并查集](../union-find/README.md)] | Medium | +| 1059 | [从始点到终点的所有路径](../../problems/all-paths-from-source-lead-to-destination) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[图](../graph/README.md)] | Medium | +| 1034 | [边框着色](../../problems/coloring-a-border) | [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 1028 | [从先序遍历还原二叉树](../../problems/recover-a-tree-from-preorder-traversal) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Hard | +| 1026 | [节点与其祖先之间的最大差值](../../problems/maximum-difference-between-node-and-ancestor) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 1020 | [飞地的数量](../../problems/number-of-enclaves) | [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 988 | [从叶结点开始的最小字符串](../../problems/smallest-string-starting-from-leaf) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 980 | [不同路径 III](../../problems/unique-paths-iii) | [[深度优先搜索](../depth-first-search/README.md)] [[回溯算法](../backtracking/README.md)] | Hard | +| 979 | [在二叉树中分配硬币](../../problems/distribute-coins-in-binary-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 971 | [翻转二叉树以匹配先序遍历](../../problems/flip-binary-tree-to-match-preorder-traversal) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 968 | [监控二叉树](../../problems/binary-tree-cameras) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 959 | [由斜杠划分区域](../../problems/regions-cut-by-slashes) | [[深度优先搜索](../depth-first-search/README.md)] [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Medium | +| 947 | [移除最多的同行或同列石头](../../problems/most-stones-removed-with-same-row-or-column) | [[深度优先搜索](../depth-first-search/README.md)] [[并查集](../union-find/README.md)] | Medium | +| 934 | [最短的桥](../../problems/shortest-bridge) | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 928 | [尽量减少恶意软件的传播 II](../../problems/minimize-malware-spread-ii) | [[深度优先搜索](../depth-first-search/README.md)] [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Hard | +| 924 | [尽量减少恶意软件的传播](../../problems/minimize-malware-spread) | [[深度优先搜索](../depth-first-search/README.md)] [[并查集](../union-find/README.md)] | Hard | +| 897 | [递增顺序查找树](../../problems/increasing-order-search-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Easy | +| 886 | [可能的二分法](../../problems/possible-bipartition) | [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 872 | [叶子相似的树](../../problems/leaf-similar-trees) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Easy | +| 863 | [二叉树中所有距离为 K 的结点](../../problems/all-nodes-distance-k-in-binary-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 851 | [喧闹和富有](../../problems/loud-and-rich) | [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 841 | [钥匙和房间](../../problems/keys-and-rooms) | [[深度优先搜索](../depth-first-search/README.md)] [[图](../graph/README.md)] | Medium | +| 839 | [相似字符串组](../../problems/similar-string-groups) | [[深度优先搜索](../depth-first-search/README.md)] [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Hard | +| 834 | [树中距离之和](../../problems/sum-of-distances-in-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Hard | +| 827 | [最大人工岛](../../problems/making-a-large-island) | [[深度优先搜索](../depth-first-search/README.md)] | Hard | +| 802 | [找到最终的安全状态](../../problems/find-eventual-safe-states) | [[深度优先搜索](../depth-first-search/README.md)] [[图](../graph/README.md)] | Medium | +| 785 | [判断二分图](../../problems/is-graph-bipartite) | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[图](../graph/README.md)] | Medium | +| 778 | [水位上升的泳池中游泳](../../problems/swim-in-rising-water) | [[堆](../heap/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[并查集](../union-find/README.md)] [[二分查找](../binary-search/README.md)] | Hard | +| 756 | [金字塔转换矩阵](../../problems/pyramid-transition-matrix) | [[位运算](../bit-manipulation/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 753 | [破解保险箱](../../problems/cracking-the-safe) | [[深度优先搜索](../depth-first-search/README.md)] [[数学](../math/README.md)] | Hard | +| 749 | [隔离病毒](../../problems/contain-virus) | [[深度优先搜索](../depth-first-search/README.md)] | Hard | +| 743 | [网络延迟时间](../../problems/network-delay-time) | [[堆](../heap/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[图](../graph/README.md)] | Medium | +| 737 | [句子相似性 II](../../problems/sentence-similarity-ii) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[并查集](../union-find/README.md)] | Medium | +| 733 | [图像渲染](../../problems/flood-fill) | [[深度优先搜索](../depth-first-search/README.md)] | Easy | +| 721 | [账户合并](../../problems/accounts-merge) | [[深度优先搜索](../depth-first-search/README.md)] [[并查集](../union-find/README.md)] | Medium | +| 711 | [不同岛屿的数量 II](../../problems/number-of-distinct-islands-ii) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[哈希表](../hash-table/README.md)] | Hard | +| 695 | [岛屿的最大面积](../../problems/max-area-of-island) | [[深度优先搜索](../depth-first-search/README.md)] [[数组](../array/README.md)] | Medium | +| 694 | [不同岛屿的数量](../../problems/number-of-distinct-islands) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 690 | [员工的重要性](../../problems/employee-importance) | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[哈希表](../hash-table/README.md)] | Easy | +| 685 | [冗余连接 II](../../problems/redundant-connection-ii) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Hard | +| 679 | [24 点游戏](../../problems/24-game) | [[深度优先搜索](../depth-first-search/README.md)] | Hard | +| 664 | [奇怪的打印机](../../problems/strange-printer) | [[深度优先搜索](../depth-first-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 638 | [大礼包](../../problems/shopping-offers) | [[深度优先搜索](../depth-first-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 576 | [出界的路径数](../../problems/out-of-boundary-paths) | [[深度优先搜索](../depth-first-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 559 | [N叉树的最大深度](../../problems/maximum-depth-of-n-ary-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Easy | +| 547 | [朋友圈](../../problems/friend-circles) | [[深度优先搜索](../depth-first-search/README.md)] [[并查集](../union-find/README.md)] | Medium | +| 546 | [移除盒子](../../problems/remove-boxes) | [[深度优先搜索](../depth-first-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 542 | [01 矩阵](../../problems/01-matrix) | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 533 | [孤独像素 II](../../problems/lonely-pixel-ii) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[数组](../array/README.md)] | Medium | +| 531 | [孤独像素 I](../../problems/lonely-pixel-i) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[数组](../array/README.md)] | Medium | +| 529 | [扫雷游戏](../../problems/minesweeper) | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 515 | [在每个树行中找最大值](../../problems/find-largest-value-in-each-tree-row) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 514 | [自由之路](../../problems/freedom-trail) | [[深度优先搜索](../depth-first-search/README.md)] [[分治算法](../divide-and-conquer/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 513 | [找树左下角的值](../../problems/find-bottom-left-tree-value) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 505 | [迷宫 II](../../problems/the-maze-ii) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 499 | [迷宫 III](../../problems/the-maze-iii) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Hard | +| 494 | [目标和](../../problems/target-sum) | [[深度优先搜索](../depth-first-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 491 | [递增子序列](../../problems/increasing-subsequences) | [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 490 | [迷宫](../../problems/the-maze) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 489 | [扫地机器人](../../problems/robot-room-cleaner) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] | Hard | +| 488 | [祖玛游戏](../../problems/zuma-game) | [[深度优先搜索](../depth-first-search/README.md)] | Hard | +| 473 | [火柴拼正方形](../../problems/matchsticks-to-square) | [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 472 | [连接词](../../problems/concatenated-words) | [[深度优先搜索](../depth-first-search/README.md)] [[字典树](../trie/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 439 | [三元表达式解析器](../../problems/ternary-expression-parser) 🔒 | [[栈](../stack/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 430 | [扁平化多级双向链表](../../problems/flatten-a-multilevel-doubly-linked-list) | [[深度优先搜索](../depth-first-search/README.md)] [[链表](../linked-list/README.md)] | Medium | +| 417 | [太平洋大西洋水流问题](../../problems/pacific-atlantic-water-flow) | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 394 | [字符串解码](../../problems/decode-string) | [[栈](../stack/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 366 | [寻找完全二叉树的叶子节点](../../problems/find-leaves-of-binary-tree) 🔒 | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 364 | [加权嵌套序列和 II](../../problems/nested-list-weight-sum-ii) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 339 | [嵌套列表权重和](../../problems/nested-list-weight-sum) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] | Easy | +| 337 | [打家劫舍 III](../../problems/house-robber-iii) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 332 | [重新安排行程](../../problems/reconstruct-itinerary) | [[深度优先搜索](../depth-first-search/README.md)] [[图](../graph/README.md)] | Medium | +| 329 | [矩阵中的最长递增路径](../../problems/longest-increasing-path-in-a-matrix) | [[深度优先搜索](../depth-first-search/README.md)] [[拓扑排序](../topological-sort/README.md)] [[记忆化](../memoization/README.md)] | Hard | +| 323 | [无向图中连通分量的数目](../../problems/number-of-connected-components-in-an-undirected-graph) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Medium | +| 301 | [删除无效的括号](../../problems/remove-invalid-parentheses) | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Hard | +| 261 | [以图判树](../../problems/graph-valid-tree) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Medium | +| 257 | [二叉树的所有路径](../../problems/binary-tree-paths) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Easy | +| 210 | [课程表 II](../../problems/course-schedule-ii) | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[图](../graph/README.md)] [[拓扑排序](../topological-sort/README.md)] | Medium | +| 207 | [课程表](../../problems/course-schedule) | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[图](../graph/README.md)] [[拓扑排序](../topological-sort/README.md)] | Medium | +| 200 | [岛屿数量](../../problems/number-of-islands) | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[并查集](../union-find/README.md)] | Medium | +| 199 | [二叉树的右视图](../../problems/binary-tree-right-side-view) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 133 | [克隆图](../../problems/clone-graph) | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[图](../graph/README.md)] | Medium | +| 130 | [被围绕的区域](../../problems/surrounded-regions) | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[并查集](../union-find/README.md)] | Medium | +| 129 | [求根到叶子节点数字之和](../../problems/sum-root-to-leaf-numbers) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 124 | [二叉树中的最大路径和](../../problems/binary-tree-maximum-path-sum) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Hard | +| 117 | [填充每个节点的下一个右侧节点指针 II](../../problems/populating-next-right-pointers-in-each-node-ii) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 116 | [填充每个节点的下一个右侧节点指针](../../problems/populating-next-right-pointers-in-each-node) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 114 | [二叉树展开为链表](../../problems/flatten-binary-tree-to-linked-list) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 113 | [路径总和 II](../../problems/path-sum-ii) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 112 | [路径总和](../../problems/path-sum) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Easy | +| 111 | [二叉树的最小深度](../../problems/minimum-depth-of-binary-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Easy | +| 110 | [平衡二叉树](../../problems/balanced-binary-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Easy | +| 109 | [有序链表转换二叉搜索树](../../problems/convert-sorted-list-to-binary-search-tree) | [[深度优先搜索](../depth-first-search/README.md)] [[链表](../linked-list/README.md)] | Medium | +| 108 | [将有序数组转换为二叉搜索树](../../problems/convert-sorted-array-to-binary-search-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Easy | +| 106 | [从中序与后序遍历序列构造二叉树](../../problems/construct-binary-tree-from-inorder-and-postorder-traversal) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[数组](../array/README.md)] | Medium | +| 105 | [从前序与中序遍历序列构造二叉树](../../problems/construct-binary-tree-from-preorder-and-inorder-traversal) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[数组](../array/README.md)] | Medium | +| 104 | [二叉树的最大深度](../../problems/maximum-depth-of-binary-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Easy | +| 101 | [对称二叉树](../../problems/symmetric-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Easy | +| 100 | [相同的树](../../problems/same-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Easy | +| 99 | [恢复二叉搜索树](../../problems/recover-binary-search-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Hard | +| 98 | [验证二叉搜索树](../../problems/validate-binary-search-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | diff --git a/tag/design/README.md b/tag/design/README.md index 314e592c2..d96b9f132 100644 --- a/tag/design/README.md +++ b/tag/design/README.md @@ -5,50 +5,50 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > 设计 +## [话题分类](../README.md) > 设计 | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 1286 | [字母组合迭代器](https://github.com/openset/leetcode/tree/master/problems/iterator-for-combination) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 1244 | [力扣排行榜](https://github.com/openset/leetcode/tree/master/problems/design-a-leaderboard) 🔒 | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 1206 | [设计跳表](https://github.com/openset/leetcode/tree/master/problems/design-skiplist) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] | Hard | -| 1172 | [餐盘栈](https://github.com/openset/leetcode/tree/master/problems/dinner-plate-stacks) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] | Hard | -| 1166 | [设计文件系统](https://github.com/openset/leetcode/tree/master/problems/design-file-system) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 716 | [最大栈](https://github.com/openset/leetcode/tree/master/problems/max-stack) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] | Easy | -| 707 | [设计链表](https://github.com/openset/leetcode/tree/master/problems/design-linked-list) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Medium | -| 706 | [设计哈希映射](https://github.com/openset/leetcode/tree/master/problems/design-hashmap) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 705 | [设计哈希集合](https://github.com/openset/leetcode/tree/master/problems/design-hashset) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 642 | [设计搜索自动补全系统](https://github.com/openset/leetcode/tree/master/problems/design-search-autocomplete-system) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] | Hard | -| 641 | [设计循环双端队列](https://github.com/openset/leetcode/tree/master/problems/design-circular-deque) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[队列](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)] | Medium | -| 635 | [设计日志存储系统](https://github.com/openset/leetcode/tree/master/problems/design-log-storage-system) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 631 | [设计 Excel 求和公式](https://github.com/openset/leetcode/tree/master/problems/design-excel-sum-formula) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] | Hard | -| 622 | [设计循环队列](https://github.com/openset/leetcode/tree/master/problems/design-circular-queue) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[队列](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)] | Medium | -| 604 | [迭代压缩字符串](https://github.com/openset/leetcode/tree/master/problems/design-compressed-string-iterator) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] | Easy | -| 588 | [设计内存文件系统](https://github.com/openset/leetcode/tree/master/problems/design-in-memory-file-system) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] | Hard | -| 460 | [LFU缓存](https://github.com/openset/leetcode/tree/master/problems/lfu-cache) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] | Hard | -| 432 | [全 O(1) 的数据结构](https://github.com/openset/leetcode/tree/master/problems/all-oone-data-structure) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] | Hard | -| 381 | [O(1) 时间插入、删除和获取随机元素 - 允许重复](https://github.com/openset/leetcode/tree/master/problems/insert-delete-getrandom-o1-duplicates-allowed) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Hard | -| 380 | [常数时间插入、删除和获取随机元素](https://github.com/openset/leetcode/tree/master/problems/insert-delete-getrandom-o1) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 379 | [电话目录管理系统](https://github.com/openset/leetcode/tree/master/problems/design-phone-directory) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Medium | -| 362 | [敲击计数器](https://github.com/openset/leetcode/tree/master/problems/design-hit-counter) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] | Medium | -| 359 | [日志速率限制器](https://github.com/openset/leetcode/tree/master/problems/logger-rate-limiter) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 355 | [设计推特](https://github.com/openset/leetcode/tree/master/problems/design-twitter) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 353 | [贪吃蛇](https://github.com/openset/leetcode/tree/master/problems/design-snake-game) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[队列](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)] | Medium | -| 348 | [判定井字棋胜负](https://github.com/openset/leetcode/tree/master/problems/design-tic-tac-toe) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] | Medium | -| 346 | [数据流中的移动平均值](https://github.com/openset/leetcode/tree/master/problems/moving-average-from-data-stream) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[队列](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)] | Easy | -| 341 | [扁平化嵌套列表迭代器](https://github.com/openset/leetcode/tree/master/problems/flatten-nested-list-iterator) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] | Medium | -| 297 | [二叉树的序列化与反序列化](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] | Hard | -| 295 | [数据流的中位数](https://github.com/openset/leetcode/tree/master/problems/find-median-from-data-stream) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] | Hard | -| 288 | [单词的唯一缩写](https://github.com/openset/leetcode/tree/master/problems/unique-word-abbreviation) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 284 | [顶端迭代器](https://github.com/openset/leetcode/tree/master/problems/peeking-iterator) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] | Medium | -| 281 | [锯齿迭代器](https://github.com/openset/leetcode/tree/master/problems/zigzag-iterator) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] | Medium | -| 251 | [展开二维向量](https://github.com/openset/leetcode/tree/master/problems/flatten-2d-vector) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] | Medium | -| 244 | [最短单词距离 II](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance-ii) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 232 | [用栈实现队列](https://github.com/openset/leetcode/tree/master/problems/implement-queue-using-stacks) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] | Easy | -| 225 | [用队列实现栈](https://github.com/openset/leetcode/tree/master/problems/implement-stack-using-queues) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] | Easy | -| 211 | [添加与搜索单词 - 数据结构设计](https://github.com/openset/leetcode/tree/master/problems/add-and-search-word-data-structure-design) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 208 | [实现 Trie (前缀树)](https://github.com/openset/leetcode/tree/master/problems/implement-trie-prefix-tree) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] | Medium | -| 173 | [二叉搜索树迭代器](https://github.com/openset/leetcode/tree/master/problems/binary-search-tree-iterator) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] | Medium | -| 170 | [两数之和 III - 数据结构设计](https://github.com/openset/leetcode/tree/master/problems/two-sum-iii-data-structure-design) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 155 | [最小栈](https://github.com/openset/leetcode/tree/master/problems/min-stack) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] | Easy | -| 146 | [LRU缓存机制](https://github.com/openset/leetcode/tree/master/problems/lru-cache) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] | Medium | +| 1286 | [字母组合迭代器](../../problems/iterator-for-combination) | [[设计](../design/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 1244 | [力扣排行榜](../../problems/design-a-leaderboard) 🔒 | [[排序](../sort/README.md)] [[设计](../design/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 1206 | [设计跳表](../../problems/design-skiplist) | [[设计](../design/README.md)] | Hard | +| 1172 | [餐盘栈](../../problems/dinner-plate-stacks) | [[设计](../design/README.md)] | Hard | +| 1166 | [设计文件系统](../../problems/design-file-system) 🔒 | [[设计](../design/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 716 | [最大栈](../../problems/max-stack) 🔒 | [[设计](../design/README.md)] | Easy | +| 707 | [设计链表](../../problems/design-linked-list) | [[设计](../design/README.md)] [[链表](../linked-list/README.md)] | Medium | +| 706 | [设计哈希映射](../../problems/design-hashmap) | [[设计](../design/README.md)] [[哈希表](../hash-table/README.md)] | Easy | +| 705 | [设计哈希集合](../../problems/design-hashset) | [[设计](../design/README.md)] [[哈希表](../hash-table/README.md)] | Easy | +| 642 | [设计搜索自动补全系统](../../problems/design-search-autocomplete-system) 🔒 | [[设计](../design/README.md)] [[字典树](../trie/README.md)] | Hard | +| 641 | [设计循环双端队列](../../problems/design-circular-deque) | [[设计](../design/README.md)] [[队列](../queue/README.md)] | Medium | +| 635 | [设计日志存储系统](../../problems/design-log-storage-system) 🔒 | [[设计](../design/README.md)] [[字符串](../string/README.md)] | Medium | +| 631 | [设计 Excel 求和公式](../../problems/design-excel-sum-formula) 🔒 | [[设计](../design/README.md)] | Hard | +| 622 | [设计循环队列](../../problems/design-circular-queue) | [[设计](../design/README.md)] [[队列](../queue/README.md)] | Medium | +| 604 | [迭代压缩字符串](../../problems/design-compressed-string-iterator) 🔒 | [[设计](../design/README.md)] | Easy | +| 588 | [设计内存文件系统](../../problems/design-in-memory-file-system) 🔒 | [[设计](../design/README.md)] | Hard | +| 460 | [LFU缓存](../../problems/lfu-cache) | [[设计](../design/README.md)] | Hard | +| 432 | [全 O(1) 的数据结构](../../problems/all-oone-data-structure) | [[设计](../design/README.md)] | Hard | +| 381 | [O(1) 时间插入、删除和获取随机元素 - 允许重复](../../problems/insert-delete-getrandom-o1-duplicates-allowed) | [[设计](../design/README.md)] [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] | Hard | +| 380 | [常数时间插入、删除和获取随机元素](../../problems/insert-delete-getrandom-o1) | [[设计](../design/README.md)] [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 379 | [电话目录管理系统](../../problems/design-phone-directory) 🔒 | [[设计](../design/README.md)] [[链表](../linked-list/README.md)] | Medium | +| 362 | [敲击计数器](../../problems/design-hit-counter) 🔒 | [[设计](../design/README.md)] | Medium | +| 359 | [日志速率限制器](../../problems/logger-rate-limiter) 🔒 | [[设计](../design/README.md)] [[哈希表](../hash-table/README.md)] | Easy | +| 355 | [设计推特](../../problems/design-twitter) | [[堆](../heap/README.md)] [[设计](../design/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 353 | [贪吃蛇](../../problems/design-snake-game) 🔒 | [[设计](../design/README.md)] [[队列](../queue/README.md)] | Medium | +| 348 | [判定井字棋胜负](../../problems/design-tic-tac-toe) 🔒 | [[设计](../design/README.md)] | Medium | +| 346 | [数据流中的移动平均值](../../problems/moving-average-from-data-stream) 🔒 | [[设计](../design/README.md)] [[队列](../queue/README.md)] | Easy | +| 341 | [扁平化嵌套列表迭代器](../../problems/flatten-nested-list-iterator) | [[栈](../stack/README.md)] [[设计](../design/README.md)] | Medium | +| 297 | [二叉树的序列化与反序列化](../../problems/serialize-and-deserialize-binary-tree) | [[树](../tree/README.md)] [[设计](../design/README.md)] | Hard | +| 295 | [数据流的中位数](../../problems/find-median-from-data-stream) | [[堆](../heap/README.md)] [[设计](../design/README.md)] | Hard | +| 288 | [单词的唯一缩写](../../problems/unique-word-abbreviation) 🔒 | [[设计](../design/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 284 | [顶端迭代器](../../problems/peeking-iterator) | [[设计](../design/README.md)] | Medium | +| 281 | [锯齿迭代器](../../problems/zigzag-iterator) 🔒 | [[设计](../design/README.md)] | Medium | +| 251 | [展开二维向量](../../problems/flatten-2d-vector) 🔒 | [[设计](../design/README.md)] | Medium | +| 244 | [最短单词距离 II](../../problems/shortest-word-distance-ii) 🔒 | [[设计](../design/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 232 | [用栈实现队列](../../problems/implement-queue-using-stacks) | [[栈](../stack/README.md)] [[设计](../design/README.md)] | Easy | +| 225 | [用队列实现栈](../../problems/implement-stack-using-queues) | [[栈](../stack/README.md)] [[设计](../design/README.md)] | Easy | +| 211 | [添加与搜索单词 - 数据结构设计](../../problems/add-and-search-word-data-structure-design) | [[设计](../design/README.md)] [[字典树](../trie/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 208 | [实现 Trie (前缀树)](../../problems/implement-trie-prefix-tree) | [[设计](../design/README.md)] [[字典树](../trie/README.md)] | Medium | +| 173 | [二叉搜索树迭代器](../../problems/binary-search-tree-iterator) | [[栈](../stack/README.md)] [[树](../tree/README.md)] [[设计](../design/README.md)] | Medium | +| 170 | [两数之和 III - 数据结构设计](../../problems/two-sum-iii-data-structure-design) 🔒 | [[设计](../design/README.md)] [[哈希表](../hash-table/README.md)] | Easy | +| 155 | [最小栈](../../problems/min-stack) | [[栈](../stack/README.md)] [[设计](../design/README.md)] | Easy | +| 146 | [LRU缓存机制](../../problems/lru-cache) | [[设计](../design/README.md)] | Medium | diff --git a/tag/divide-and-conquer/README.md b/tag/divide-and-conquer/README.md index aee63daf9..63807f675 100644 --- a/tag/divide-and-conquer/README.md +++ b/tag/divide-and-conquer/README.md @@ -5,26 +5,26 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > 分治算法 +## [话题分类](../README.md) > 分治算法 | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 1274 | [矩形内船只的数目](https://github.com/openset/leetcode/tree/master/problems/number-of-ships-in-a-rectangle) 🔒 | [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Hard | -| 973 | [最接近原点的 K 个点](https://github.com/openset/leetcode/tree/master/problems/k-closest-points-to-origin) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Medium | -| 932 | [漂亮数组](https://github.com/openset/leetcode/tree/master/problems/beautiful-array) | [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Medium | -| 903 | [DI 序列的有效排列](https://github.com/openset/leetcode/tree/master/problems/valid-permutations-for-di-sequence) | [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 514 | [自由之路](https://github.com/openset/leetcode/tree/master/problems/freedom-trail) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 493 | [翻转对](https://github.com/openset/leetcode/tree/master/problems/reverse-pairs) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Hard | -| 426 | [将二叉搜索树转化为排序的双向链表](https://github.com/openset/leetcode/tree/master/problems/convert-binary-search-tree-to-sorted-doubly-linked-list) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Medium | -| 327 | [区间和的个数](https://github.com/openset/leetcode/tree/master/problems/count-of-range-sum) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Hard | -| 315 | [计算右侧小于当前元素的个数](https://github.com/openset/leetcode/tree/master/problems/count-of-smaller-numbers-after-self) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Hard | -| 312 | [戳气球](https://github.com/openset/leetcode/tree/master/problems/burst-balloons) | [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 282 | [给表达式添加运算符](https://github.com/openset/leetcode/tree/master/problems/expression-add-operators) | [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Hard | -| 241 | [为运算表达式设计优先级](https://github.com/openset/leetcode/tree/master/problems/different-ways-to-add-parentheses) | [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Medium | -| 240 | [搜索二维矩阵 II](https://github.com/openset/leetcode/tree/master/problems/search-a-2d-matrix-ii) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Medium | -| 218 | [天际线问题](https://github.com/openset/leetcode/tree/master/problems/the-skyline-problem) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] [[Line Sweep](https://github.com/openset/leetcode/tree/master/tag/line-sweep/README.md)] | Hard | -| 215 | [数组中的第K个最大元素](https://github.com/openset/leetcode/tree/master/problems/kth-largest-element-in-an-array) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Medium | -| 169 | [多数元素](https://github.com/openset/leetcode/tree/master/problems/majority-element) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Easy | -| 53 | [最大子序和](https://github.com/openset/leetcode/tree/master/problems/maximum-subarray) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Easy | -| 23 | [合并K个排序链表](https://github.com/openset/leetcode/tree/master/problems/merge-k-sorted-lists) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Hard | -| 4 | [寻找两个有序数组的中位数](https://github.com/openset/leetcode/tree/master/problems/median-of-two-sorted-arrays) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Hard | +| 1274 | [矩形内船只的数目](../../problems/number-of-ships-in-a-rectangle) 🔒 | [[分治算法](../divide-and-conquer/README.md)] | Hard | +| 973 | [最接近原点的 K 个点](../../problems/k-closest-points-to-origin) | [[堆](../heap/README.md)] [[排序](../sort/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Medium | +| 932 | [漂亮数组](../../problems/beautiful-array) | [[分治算法](../divide-and-conquer/README.md)] | Medium | +| 903 | [DI 序列的有效排列](../../problems/valid-permutations-for-di-sequence) | [[分治算法](../divide-and-conquer/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 514 | [自由之路](../../problems/freedom-trail) | [[深度优先搜索](../depth-first-search/README.md)] [[分治算法](../divide-and-conquer/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 493 | [翻转对](../../problems/reverse-pairs) | [[排序](../sort/README.md)] [[树状数组](../binary-indexed-tree/README.md)] [[线段树](../segment-tree/README.md)] [[二分查找](../binary-search/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Hard | +| 426 | [将二叉搜索树转化为排序的双向链表](../../problems/convert-binary-search-tree-to-sorted-doubly-linked-list) 🔒 | [[树](../tree/README.md)] [[链表](../linked-list/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Medium | +| 327 | [区间和的个数](../../problems/count-of-range-sum) | [[排序](../sort/README.md)] [[树状数组](../binary-indexed-tree/README.md)] [[线段树](../segment-tree/README.md)] [[二分查找](../binary-search/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Hard | +| 315 | [计算右侧小于当前元素的个数](../../problems/count-of-smaller-numbers-after-self) | [[排序](../sort/README.md)] [[树状数组](../binary-indexed-tree/README.md)] [[线段树](../segment-tree/README.md)] [[二分查找](../binary-search/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Hard | +| 312 | [戳气球](../../problems/burst-balloons) | [[分治算法](../divide-and-conquer/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 282 | [给表达式添加运算符](../../problems/expression-add-operators) | [[分治算法](../divide-and-conquer/README.md)] | Hard | +| 241 | [为运算表达式设计优先级](../../problems/different-ways-to-add-parentheses) | [[分治算法](../divide-and-conquer/README.md)] | Medium | +| 240 | [搜索二维矩阵 II](../../problems/search-a-2d-matrix-ii) | [[二分查找](../binary-search/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Medium | +| 218 | [天际线问题](../../problems/the-skyline-problem) | [[堆](../heap/README.md)] [[树状数组](../binary-indexed-tree/README.md)] [[线段树](../segment-tree/README.md)] [[分治算法](../divide-and-conquer/README.md)] [[Line Sweep](../line-sweep/README.md)] | Hard | +| 215 | [数组中的第K个最大元素](../../problems/kth-largest-element-in-an-array) | [[堆](../heap/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Medium | +| 169 | [多数元素](../../problems/majority-element) | [[位运算](../bit-manipulation/README.md)] [[数组](../array/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Easy | +| 53 | [最大子序和](../../problems/maximum-subarray) | [[数组](../array/README.md)] [[分治算法](../divide-and-conquer/README.md)] [[动态规划](../dynamic-programming/README.md)] | Easy | +| 23 | [合并K个排序链表](../../problems/merge-k-sorted-lists) | [[堆](../heap/README.md)] [[链表](../linked-list/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Hard | +| 4 | [寻找两个有序数组的中位数](../../problems/median-of-two-sorted-arrays) | [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Hard | diff --git a/tag/dynamic-programming/README.md b/tag/dynamic-programming/README.md index 95bbda0e4..c69b90d2f 100644 --- a/tag/dynamic-programming/README.md +++ b/tag/dynamic-programming/README.md @@ -5,181 +5,181 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > 动态规划 +## [话题分类](../README.md) > 动态规划 | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 1289 | [下降路径最小和 II](https://github.com/openset/leetcode/tree/master/problems/minimum-falling-path-sum-ii) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 1278 | [分割回文串 III](https://github.com/openset/leetcode/tree/master/problems/palindrome-partitioning-iii) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 1277 | [统计全为 1 的正方形子矩阵](https://github.com/openset/leetcode/tree/master/problems/count-square-submatrices-with-all-ones) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 1273 | [删除树节点](https://github.com/openset/leetcode/tree/master/problems/delete-tree-nodes) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 1269 | [停在原地的方案数](https://github.com/openset/leetcode/tree/master/problems/number-of-ways-to-stay-in-the-same-place-after-some-steps) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 1262 | [可被三整除的最大和](https://github.com/openset/leetcode/tree/master/problems/greatest-sum-divisible-by-three) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 1259 | [不相交的握手](https://github.com/openset/leetcode/tree/master/problems/handshakes-that-dont-cross) 🔒 | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 1246 | [删除回文子数组](https://github.com/openset/leetcode/tree/master/problems/palindrome-removal) 🔒 | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 1240 | [铺瓷砖](https://github.com/openset/leetcode/tree/master/problems/tiling-a-rectangle-with-the-fewest-squares) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | -| 1235 | [规划兼职工作](https://github.com/openset/leetcode/tree/master/problems/maximum-profit-in-job-scheduling) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 1230 | [抛掷硬币](https://github.com/openset/leetcode/tree/master/problems/toss-strange-coins) 🔒 | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 1227 | [飞机座位分配概率](https://github.com/openset/leetcode/tree/master/problems/airplane-seat-assignment-probability) | [[脑筋急转弯](https://github.com/openset/leetcode/tree/master/tag/brainteaser/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 1223 | [掷骰子模拟](https://github.com/openset/leetcode/tree/master/problems/dice-roll-simulation) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 1220 | [统计元音字母序列的数目](https://github.com/openset/leetcode/tree/master/problems/count-vowels-permutation) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 1218 | [最长定差子序列](https://github.com/openset/leetcode/tree/master/problems/longest-arithmetic-subsequence-of-given-difference) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 1216 | [验证回文字符串 III](https://github.com/openset/leetcode/tree/master/problems/valid-palindrome-iii) 🔒 | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 1199 | [建造街区的最短时间](https://github.com/openset/leetcode/tree/master/problems/minimum-time-to-build-blocks) 🔒 | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 1191 | [K 次串联后最大子数组之和](https://github.com/openset/leetcode/tree/master/problems/k-concatenation-maximum-sum) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 1187 | [使数组严格递增](https://github.com/openset/leetcode/tree/master/problems/make-array-strictly-increasing) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 1186 | [删除一次得到子数组最大和](https://github.com/openset/leetcode/tree/master/problems/maximum-subarray-sum-with-one-deletion) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 1155 | [掷骰子的N种方法](https://github.com/openset/leetcode/tree/master/problems/number-of-dice-rolls-with-target-sum) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 1147 | [段式回文](https://github.com/openset/leetcode/tree/master/problems/longest-chunked-palindrome-decomposition) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 1143 | [最长公共子序列](https://github.com/openset/leetcode/tree/master/problems/longest-common-subsequence) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 1140 | [石子游戏 II](https://github.com/openset/leetcode/tree/master/problems/stone-game-ii) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 1139 | [最大的以 1 为边界的正方形](https://github.com/openset/leetcode/tree/master/problems/largest-1-bordered-square) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 1136 | [平行课程](https://github.com/openset/leetcode/tree/master/problems/parallel-courses) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 1130 | [叶值的最小代价生成树](https://github.com/openset/leetcode/tree/master/problems/minimum-cost-tree-from-leaf-values) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 1125 | [最小的必要团队](https://github.com/openset/leetcode/tree/master/problems/smallest-sufficient-team) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 1105 | [填充书架](https://github.com/openset/leetcode/tree/master/problems/filling-bookcase-shelves) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 1092 | [最短公共超序列](https://github.com/openset/leetcode/tree/master/problems/shortest-common-supersequence) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 1074 | [元素和为目标值的子矩阵数量](https://github.com/openset/leetcode/tree/master/problems/number-of-submatrices-that-sum-to-target) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Hard | -| 1067 | [范围内的数字计数](https://github.com/openset/leetcode/tree/master/problems/digit-count-in-range) 🔒 | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 1066 | [校园自行车分配 II](https://github.com/openset/leetcode/tree/master/problems/campus-bikes-ii) 🔒 | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 1058 | [最小化舍入误差以满足目标](https://github.com/openset/leetcode/tree/master/problems/minimize-rounding-error-to-meet-target) 🔒 | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 1055 | [形成字符串的最短路径](https://github.com/openset/leetcode/tree/master/problems/shortest-way-to-form-string) 🔒 | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 1049 | [最后一块石头的重量 II](https://github.com/openset/leetcode/tree/master/problems/last-stone-weight-ii) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 1048 | [最长字符串链](https://github.com/openset/leetcode/tree/master/problems/longest-string-chain) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 1039 | [多边形三角剖分的最低得分](https://github.com/openset/leetcode/tree/master/problems/minimum-score-triangulation-of-polygon) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 1027 | [最长等差数列](https://github.com/openset/leetcode/tree/master/problems/longest-arithmetic-sequence) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 1025 | [除数博弈](https://github.com/openset/leetcode/tree/master/problems/divisor-game) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Easy | -| 1024 | [视频拼接](https://github.com/openset/leetcode/tree/master/problems/video-stitching) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 1012 | [至少有 1 位重复的数字](https://github.com/openset/leetcode/tree/master/problems/numbers-with-repeated-digits) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 1000 | [合并石头的最低成本](https://github.com/openset/leetcode/tree/master/problems/minimum-cost-to-merge-stones) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 983 | [最低票价](https://github.com/openset/leetcode/tree/master/problems/minimum-cost-for-tickets) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 982 | [按位与为零的三元组](https://github.com/openset/leetcode/tree/master/problems/triples-with-bitwise-and-equal-to-zero) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 978 | [最长湍流子数组](https://github.com/openset/leetcode/tree/master/problems/longest-turbulent-subarray) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Medium | -| 975 | [奇偶跳](https://github.com/openset/leetcode/tree/master/problems/odd-even-jump) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] [[Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md)] | Hard | -| 968 | [监控二叉树](https://github.com/openset/leetcode/tree/master/problems/binary-tree-cameras) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 967 | [连续差相同的数字](https://github.com/openset/leetcode/tree/master/problems/numbers-with-same-consecutive-differences) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 964 | [表示数字的最少运算符](https://github.com/openset/leetcode/tree/master/problems/least-operators-to-express-number) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 960 | [删列造序 III](https://github.com/openset/leetcode/tree/master/problems/delete-columns-to-make-sorted-iii) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 956 | [最高的广告牌](https://github.com/openset/leetcode/tree/master/problems/tallest-billboard) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 943 | [最短超级串](https://github.com/openset/leetcode/tree/master/problems/find-the-shortest-superstring) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 940 | [不同的子序列 II](https://github.com/openset/leetcode/tree/master/problems/distinct-subsequences-ii) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 935 | [骑士拨号器](https://github.com/openset/leetcode/tree/master/problems/knight-dialer) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 931 | [下降路径最小和](https://github.com/openset/leetcode/tree/master/problems/minimum-falling-path-sum) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 920 | [播放列表的数量](https://github.com/openset/leetcode/tree/master/problems/number-of-music-playlists) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 903 | [DI 序列的有效排列](https://github.com/openset/leetcode/tree/master/problems/valid-permutations-for-di-sequence) | [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 902 | [最大为 N 的数字组合](https://github.com/openset/leetcode/tree/master/problems/numbers-at-most-n-given-digit-set) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 898 | [子数组按位或操作](https://github.com/openset/leetcode/tree/master/problems/bitwise-ors-of-subarrays) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 887 | [鸡蛋掉落](https://github.com/openset/leetcode/tree/master/problems/super-egg-drop) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 879 | [盈利计划](https://github.com/openset/leetcode/tree/master/problems/profitable-schemes) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 877 | [石子游戏](https://github.com/openset/leetcode/tree/master/problems/stone-game) | [[极小化极大](https://github.com/openset/leetcode/tree/master/tag/minimax/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 873 | [最长的斐波那契子序列的长度](https://github.com/openset/leetcode/tree/master/problems/length-of-longest-fibonacci-subsequence) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 871 | [最低加油次数](https://github.com/openset/leetcode/tree/master/problems/minimum-number-of-refueling-stops) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 847 | [访问所有节点的最短路径](https://github.com/openset/leetcode/tree/master/problems/shortest-path-visiting-all-nodes) | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 838 | [推多米诺](https://github.com/openset/leetcode/tree/master/problems/push-dominoes) | [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 837 | [新21点](https://github.com/openset/leetcode/tree/master/problems/new-21-game) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 818 | [赛车](https://github.com/openset/leetcode/tree/master/problems/race-car) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 813 | [最大平均值和的分组](https://github.com/openset/leetcode/tree/master/problems/largest-sum-of-averages) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 808 | [分汤](https://github.com/openset/leetcode/tree/master/problems/soup-servings) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 801 | [使序列递增的最小交换次数](https://github.com/openset/leetcode/tree/master/problems/minimum-swaps-to-make-sequences-increasing) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 790 | [多米诺和托米诺平铺](https://github.com/openset/leetcode/tree/master/problems/domino-and-tromino-tiling) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 787 | [K 站中转内最便宜的航班](https://github.com/openset/leetcode/tree/master/problems/cheapest-flights-within-k-stops) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 764 | [最大加号标志](https://github.com/openset/leetcode/tree/master/problems/largest-plus-sign) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 750 | [角矩形的数量](https://github.com/openset/leetcode/tree/master/problems/number-of-corner-rectangles) 🔒 | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 746 | [使用最小花费爬楼梯](https://github.com/openset/leetcode/tree/master/problems/min-cost-climbing-stairs) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Easy | -| 741 | [摘樱桃](https://github.com/openset/leetcode/tree/master/problems/cherry-pickup) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 740 | [删除与获得点数](https://github.com/openset/leetcode/tree/master/problems/delete-and-earn) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 730 | [统计不同回文子字符串](https://github.com/openset/leetcode/tree/master/problems/count-different-palindromic-subsequences) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 727 | [最小窗口子序列](https://github.com/openset/leetcode/tree/master/problems/minimum-window-subsequence) 🔒 | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Hard | -| 718 | [最长重复子数组](https://github.com/openset/leetcode/tree/master/problems/maximum-length-of-repeated-subarray) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 714 | [买卖股票的最佳时机含手续费](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-with-transaction-fee) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 712 | [两个字符串的最小ASCII删除和](https://github.com/openset/leetcode/tree/master/problems/minimum-ascii-delete-sum-for-two-strings) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 698 | [划分为k个相等的子集](https://github.com/openset/leetcode/tree/master/problems/partition-to-k-equal-sum-subsets) | [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 691 | [贴纸拼词](https://github.com/openset/leetcode/tree/master/problems/stickers-to-spell-word) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | -| 689 | [三个无重叠子数组的最大和](https://github.com/openset/leetcode/tree/master/problems/maximum-sum-of-3-non-overlapping-subarrays) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 688 | [“马”在棋盘上的概率](https://github.com/openset/leetcode/tree/master/problems/knight-probability-in-chessboard) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 673 | [最长递增子序列的个数](https://github.com/openset/leetcode/tree/master/problems/number-of-longest-increasing-subsequence) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 664 | [奇怪的打印机](https://github.com/openset/leetcode/tree/master/problems/strange-printer) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 656 | [金币路径](https://github.com/openset/leetcode/tree/master/problems/coin-path) 🔒 | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 651 | [4键键盘](https://github.com/openset/leetcode/tree/master/problems/4-keys-keyboard) 🔒 | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 650 | [只有两个键的键盘](https://github.com/openset/leetcode/tree/master/problems/2-keys-keyboard) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 647 | [回文子串](https://github.com/openset/leetcode/tree/master/problems/palindromic-substrings) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 646 | [最长数对链](https://github.com/openset/leetcode/tree/master/problems/maximum-length-of-pair-chain) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 639 | [解码方法 2](https://github.com/openset/leetcode/tree/master/problems/decode-ways-ii) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 638 | [大礼包](https://github.com/openset/leetcode/tree/master/problems/shopping-offers) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 629 | [K个逆序对数组](https://github.com/openset/leetcode/tree/master/problems/k-inverse-pairs-array) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 600 | [不含连续1的非负整数](https://github.com/openset/leetcode/tree/master/problems/non-negative-integers-without-consecutive-ones) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 576 | [出界的路径数](https://github.com/openset/leetcode/tree/master/problems/out-of-boundary-paths) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 568 | [最大休假天数](https://github.com/openset/leetcode/tree/master/problems/maximum-vacation-days) 🔒 | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 552 | [学生出勤记录 II](https://github.com/openset/leetcode/tree/master/problems/student-attendance-record-ii) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 546 | [移除盒子](https://github.com/openset/leetcode/tree/master/problems/remove-boxes) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 523 | [连续的子数组和](https://github.com/openset/leetcode/tree/master/problems/continuous-subarray-sum) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 517 | [超级洗衣机](https://github.com/openset/leetcode/tree/master/problems/super-washing-machines) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 516 | [最长回文子序列](https://github.com/openset/leetcode/tree/master/problems/longest-palindromic-subsequence) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 514 | [自由之路](https://github.com/openset/leetcode/tree/master/problems/freedom-trail) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 494 | [目标和](https://github.com/openset/leetcode/tree/master/problems/target-sum) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 486 | [预测赢家](https://github.com/openset/leetcode/tree/master/problems/predict-the-winner) | [[极小化极大](https://github.com/openset/leetcode/tree/master/tag/minimax/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 474 | [一和零](https://github.com/openset/leetcode/tree/master/problems/ones-and-zeroes) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 472 | [连接词](https://github.com/openset/leetcode/tree/master/problems/concatenated-words) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 471 | [编码最短长度的字符串](https://github.com/openset/leetcode/tree/master/problems/encode-string-with-shortest-length) 🔒 | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 467 | [环绕字符串中唯一的子字符串](https://github.com/openset/leetcode/tree/master/problems/unique-substrings-in-wraparound-string) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 466 | [统计重复个数](https://github.com/openset/leetcode/tree/master/problems/count-the-repetitions) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 464 | [我能赢吗](https://github.com/openset/leetcode/tree/master/problems/can-i-win) | [[极小化极大](https://github.com/openset/leetcode/tree/master/tag/minimax/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 446 | [等差数列划分 II - 子序列](https://github.com/openset/leetcode/tree/master/problems/arithmetic-slices-ii-subsequence) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 418 | [屏幕可显示句子的数量](https://github.com/openset/leetcode/tree/master/problems/sentence-screen-fitting) 🔒 | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 416 | [分割等和子集](https://github.com/openset/leetcode/tree/master/problems/partition-equal-subset-sum) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 413 | [等差数列划分](https://github.com/openset/leetcode/tree/master/problems/arithmetic-slices) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 410 | [分割数组的最大值](https://github.com/openset/leetcode/tree/master/problems/split-array-largest-sum) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 403 | [青蛙过河](https://github.com/openset/leetcode/tree/master/problems/frog-jump) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 392 | [判断子序列](https://github.com/openset/leetcode/tree/master/problems/is-subsequence) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Easy | -| 377 | [组合总和 Ⅳ](https://github.com/openset/leetcode/tree/master/problems/combination-sum-iv) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 376 | [摆动序列](https://github.com/openset/leetcode/tree/master/problems/wiggle-subsequence) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 375 | [猜数字大小 II](https://github.com/openset/leetcode/tree/master/problems/guess-number-higher-or-lower-ii) | [[极小化极大](https://github.com/openset/leetcode/tree/master/tag/minimax/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 368 | [最大整除子集](https://github.com/openset/leetcode/tree/master/problems/largest-divisible-subset) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 363 | [矩形区域不超过 K 的最大数值和](https://github.com/openset/leetcode/tree/master/problems/max-sum-of-rectangle-no-larger-than-k) | [[队列](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 361 | [轰炸敌人](https://github.com/openset/leetcode/tree/master/problems/bomb-enemy) 🔒 | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 357 | [计算各个位数不同的数字个数](https://github.com/openset/leetcode/tree/master/problems/count-numbers-with-unique-digits) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 354 | [俄罗斯套娃信封问题](https://github.com/openset/leetcode/tree/master/problems/russian-doll-envelopes) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 351 | [安卓系统手势解锁](https://github.com/openset/leetcode/tree/master/problems/android-unlock-patterns) 🔒 | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 343 | [整数拆分](https://github.com/openset/leetcode/tree/master/problems/integer-break) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 338 | [比特位计数](https://github.com/openset/leetcode/tree/master/problems/counting-bits) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 322 | [零钱兑换](https://github.com/openset/leetcode/tree/master/problems/coin-change) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 321 | [拼接最大数](https://github.com/openset/leetcode/tree/master/problems/create-maximum-number) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 312 | [戳气球](https://github.com/openset/leetcode/tree/master/problems/burst-balloons) | [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 309 | [最佳买卖股票时机含冷冻期](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-with-cooldown) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 304 | [二维区域和检索 - 矩阵不可变](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-immutable) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 303 | [区域和检索 - 数组不可变](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-immutable) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Easy | -| 300 | [最长上升子序列](https://github.com/openset/leetcode/tree/master/problems/longest-increasing-subsequence) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 279 | [完全平方数](https://github.com/openset/leetcode/tree/master/problems/perfect-squares) | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 276 | [栅栏涂色](https://github.com/openset/leetcode/tree/master/problems/paint-fence) 🔒 | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Easy | -| 265 | [粉刷房子 II](https://github.com/openset/leetcode/tree/master/problems/paint-house-ii) 🔒 | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 264 | [丑数 II](https://github.com/openset/leetcode/tree/master/problems/ugly-number-ii) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 256 | [粉刷房子](https://github.com/openset/leetcode/tree/master/problems/paint-house) 🔒 | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Easy | -| 221 | [最大正方形](https://github.com/openset/leetcode/tree/master/problems/maximal-square) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 213 | [打家劫舍 II](https://github.com/openset/leetcode/tree/master/problems/house-robber-ii) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 198 | [打家劫舍](https://github.com/openset/leetcode/tree/master/problems/house-robber) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Easy | -| 188 | [买卖股票的最佳时机 IV](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-iv) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 174 | [地下城游戏](https://github.com/openset/leetcode/tree/master/problems/dungeon-game) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 152 | [乘积最大子序列](https://github.com/openset/leetcode/tree/master/problems/maximum-product-subarray) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 140 | [单词拆分 II](https://github.com/openset/leetcode/tree/master/problems/word-break-ii) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | -| 139 | [单词拆分](https://github.com/openset/leetcode/tree/master/problems/word-break) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 132 | [分割回文串 II](https://github.com/openset/leetcode/tree/master/problems/palindrome-partitioning-ii) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 123 | [买卖股票的最佳时机 III](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-iii) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 121 | [买卖股票的最佳时机](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Easy | -| 120 | [三角形最小路径和](https://github.com/openset/leetcode/tree/master/problems/triangle) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 115 | [不同的子序列](https://github.com/openset/leetcode/tree/master/problems/distinct-subsequences) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 97 | [交错字符串](https://github.com/openset/leetcode/tree/master/problems/interleaving-string) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 96 | [不同的二叉搜索树](https://github.com/openset/leetcode/tree/master/problems/unique-binary-search-trees) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 95 | [不同的二叉搜索树 II](https://github.com/openset/leetcode/tree/master/problems/unique-binary-search-trees-ii) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 91 | [解码方法](https://github.com/openset/leetcode/tree/master/problems/decode-ways) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 87 | [扰乱字符串](https://github.com/openset/leetcode/tree/master/problems/scramble-string) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 85 | [最大矩形](https://github.com/openset/leetcode/tree/master/problems/maximal-rectangle) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 72 | [编辑距离](https://github.com/openset/leetcode/tree/master/problems/edit-distance) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 70 | [爬楼梯](https://github.com/openset/leetcode/tree/master/problems/climbing-stairs) | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Easy | -| 64 | [最小路径和](https://github.com/openset/leetcode/tree/master/problems/minimum-path-sum) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 63 | [不同路径 II](https://github.com/openset/leetcode/tree/master/problems/unique-paths-ii) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 62 | [不同路径](https://github.com/openset/leetcode/tree/master/problems/unique-paths) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 53 | [最大子序和](https://github.com/openset/leetcode/tree/master/problems/maximum-subarray) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Easy | -| 44 | [通配符匹配](https://github.com/openset/leetcode/tree/master/problems/wildcard-matching) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | -| 32 | [最长有效括号](https://github.com/openset/leetcode/tree/master/problems/longest-valid-parentheses) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 10 | [正则表达式匹配](https://github.com/openset/leetcode/tree/master/problems/regular-expression-matching) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | -| 5 | [最长回文子串](https://github.com/openset/leetcode/tree/master/problems/longest-palindromic-substring) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | +| 1289 | [下降路径最小和 II](../../problems/minimum-falling-path-sum-ii) | [[动态规划](../dynamic-programming/README.md)] | Hard | +| 1278 | [分割回文串 III](../../problems/palindrome-partitioning-iii) | [[动态规划](../dynamic-programming/README.md)] | Hard | +| 1277 | [统计全为 1 的正方形子矩阵](../../problems/count-square-submatrices-with-all-ones) | [[数组](../array/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 1273 | [删除树节点](../../problems/delete-tree-nodes) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 1269 | [停在原地的方案数](../../problems/number-of-ways-to-stay-in-the-same-place-after-some-steps) | [[动态规划](../dynamic-programming/README.md)] | Hard | +| 1262 | [可被三整除的最大和](../../problems/greatest-sum-divisible-by-three) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 1259 | [不相交的握手](../../problems/handshakes-that-dont-cross) 🔒 | [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 1246 | [删除回文子数组](../../problems/palindrome-removal) 🔒 | [[动态规划](../dynamic-programming/README.md)] | Hard | +| 1240 | [铺瓷砖](../../problems/tiling-a-rectangle-with-the-fewest-squares) | [[动态规划](../dynamic-programming/README.md)] [[回溯算法](../backtracking/README.md)] | Hard | +| 1235 | [规划兼职工作](../../problems/maximum-profit-in-job-scheduling) | [[排序](../sort/README.md)] [[二分查找](../binary-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 1230 | [抛掷硬币](../../problems/toss-strange-coins) 🔒 | [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 1227 | [飞机座位分配概率](../../problems/airplane-seat-assignment-probability) | [[脑筋急转弯](../brainteaser/README.md)] [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 1223 | [掷骰子模拟](../../problems/dice-roll-simulation) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 1220 | [统计元音字母序列的数目](../../problems/count-vowels-permutation) | [[动态规划](../dynamic-programming/README.md)] | Hard | +| 1218 | [最长定差子序列](../../problems/longest-arithmetic-subsequence-of-given-difference) | [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 1216 | [验证回文字符串 III](../../problems/valid-palindrome-iii) 🔒 | [[字符串](../string/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 1199 | [建造街区的最短时间](../../problems/minimum-time-to-build-blocks) 🔒 | [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 1191 | [K 次串联后最大子数组之和](../../problems/k-concatenation-maximum-sum) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 1187 | [使数组严格递增](../../problems/make-array-strictly-increasing) | [[动态规划](../dynamic-programming/README.md)] | Hard | +| 1186 | [删除一次得到子数组最大和](../../problems/maximum-subarray-sum-with-one-deletion) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 1155 | [掷骰子的N种方法](../../problems/number-of-dice-rolls-with-target-sum) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 1147 | [段式回文](../../problems/longest-chunked-palindrome-decomposition) | [[动态规划](../dynamic-programming/README.md)] | Hard | +| 1143 | [最长公共子序列](../../problems/longest-common-subsequence) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 1140 | [石子游戏 II](../../problems/stone-game-ii) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 1139 | [最大的以 1 为边界的正方形](../../problems/largest-1-bordered-square) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 1136 | [平行课程](../../problems/parallel-courses) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[图](../graph/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 1130 | [叶值的最小代价生成树](../../problems/minimum-cost-tree-from-leaf-values) | [[栈](../stack/README.md)] [[树](../tree/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 1125 | [最小的必要团队](../../problems/smallest-sufficient-team) | [[位运算](../bit-manipulation/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 1105 | [填充书架](../../problems/filling-bookcase-shelves) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 1092 | [最短公共超序列](../../problems/shortest-common-supersequence) | [[动态规划](../dynamic-programming/README.md)] | Hard | +| 1074 | [元素和为目标值的子矩阵数量](../../problems/number-of-submatrices-that-sum-to-target) | [[数组](../array/README.md)] [[动态规划](../dynamic-programming/README.md)] [[Sliding Window](../sliding-window/README.md)] | Hard | +| 1067 | [范围内的数字计数](../../problems/digit-count-in-range) 🔒 | [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 1066 | [校园自行车分配 II](../../problems/campus-bikes-ii) 🔒 | [[动态规划](../dynamic-programming/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 1058 | [最小化舍入误差以满足目标](../../problems/minimize-rounding-error-to-meet-target) 🔒 | [[贪心算法](../greedy/README.md)] [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 1055 | [形成字符串的最短路径](../../problems/shortest-way-to-form-string) 🔒 | [[贪心算法](../greedy/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 1049 | [最后一块石头的重量 II](../../problems/last-stone-weight-ii) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 1048 | [最长字符串链](../../problems/longest-string-chain) | [[哈希表](../hash-table/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 1039 | [多边形三角剖分的最低得分](../../problems/minimum-score-triangulation-of-polygon) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 1027 | [最长等差数列](../../problems/longest-arithmetic-sequence) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 1025 | [除数博弈](../../problems/divisor-game) | [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Easy | +| 1024 | [视频拼接](../../problems/video-stitching) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 1012 | [至少有 1 位重复的数字](../../problems/numbers-with-repeated-digits) | [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 1000 | [合并石头的最低成本](../../problems/minimum-cost-to-merge-stones) | [[动态规划](../dynamic-programming/README.md)] | Hard | +| 983 | [最低票价](../../problems/minimum-cost-for-tickets) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 982 | [按位与为零的三元组](../../problems/triples-with-bitwise-and-equal-to-zero) | [[动态规划](../dynamic-programming/README.md)] | Hard | +| 978 | [最长湍流子数组](../../problems/longest-turbulent-subarray) | [[数组](../array/README.md)] [[动态规划](../dynamic-programming/README.md)] [[Sliding Window](../sliding-window/README.md)] | Medium | +| 975 | [奇偶跳](../../problems/odd-even-jump) | [[栈](../stack/README.md)] [[动态规划](../dynamic-programming/README.md)] [[Ordered Map](../ordered-map/README.md)] | Hard | +| 968 | [监控二叉树](../../problems/binary-tree-cameras) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 967 | [连续差相同的数字](../../problems/numbers-with-same-consecutive-differences) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 964 | [表示数字的最少运算符](../../problems/least-operators-to-express-number) | [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 960 | [删列造序 III](../../problems/delete-columns-to-make-sorted-iii) | [[动态规划](../dynamic-programming/README.md)] | Hard | +| 956 | [最高的广告牌](../../problems/tallest-billboard) | [[动态规划](../dynamic-programming/README.md)] | Hard | +| 943 | [最短超级串](../../problems/find-the-shortest-superstring) | [[动态规划](../dynamic-programming/README.md)] | Hard | +| 940 | [不同的子序列 II](../../problems/distinct-subsequences-ii) | [[动态规划](../dynamic-programming/README.md)] | Hard | +| 935 | [骑士拨号器](../../problems/knight-dialer) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 931 | [下降路径最小和](../../problems/minimum-falling-path-sum) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 920 | [播放列表的数量](../../problems/number-of-music-playlists) | [[动态规划](../dynamic-programming/README.md)] | Hard | +| 903 | [DI 序列的有效排列](../../problems/valid-permutations-for-di-sequence) | [[分治算法](../divide-and-conquer/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 902 | [最大为 N 的数字组合](../../problems/numbers-at-most-n-given-digit-set) | [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 898 | [子数组按位或操作](../../problems/bitwise-ors-of-subarrays) | [[位运算](../bit-manipulation/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 887 | [鸡蛋掉落](../../problems/super-egg-drop) | [[数学](../math/README.md)] [[二分查找](../binary-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 879 | [盈利计划](../../problems/profitable-schemes) | [[动态规划](../dynamic-programming/README.md)] | Hard | +| 877 | [石子游戏](../../problems/stone-game) | [[极小化极大](../minimax/README.md)] [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 873 | [最长的斐波那契子序列的长度](../../problems/length-of-longest-fibonacci-subsequence) | [[数组](../array/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 871 | [最低加油次数](../../problems/minimum-number-of-refueling-stops) | [[堆](../heap/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 847 | [访问所有节点的最短路径](../../problems/shortest-path-visiting-all-nodes) | [[广度优先搜索](../breadth-first-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 838 | [推多米诺](../../problems/push-dominoes) | [[双指针](../two-pointers/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 837 | [新21点](../../problems/new-21-game) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 818 | [赛车](../../problems/race-car) | [[堆](../heap/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 813 | [最大平均值和的分组](../../problems/largest-sum-of-averages) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 808 | [分汤](../../problems/soup-servings) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 801 | [使序列递增的最小交换次数](../../problems/minimum-swaps-to-make-sequences-increasing) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 790 | [多米诺和托米诺平铺](../../problems/domino-and-tromino-tiling) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 787 | [K 站中转内最便宜的航班](../../problems/cheapest-flights-within-k-stops) | [[堆](../heap/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 764 | [最大加号标志](../../problems/largest-plus-sign) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 750 | [角矩形的数量](../../problems/number-of-corner-rectangles) 🔒 | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 746 | [使用最小花费爬楼梯](../../problems/min-cost-climbing-stairs) | [[数组](../array/README.md)] [[动态规划](../dynamic-programming/README.md)] | Easy | +| 741 | [摘樱桃](../../problems/cherry-pickup) | [[动态规划](../dynamic-programming/README.md)] | Hard | +| 740 | [删除与获得点数](../../problems/delete-and-earn) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 730 | [统计不同回文子字符串](../../problems/count-different-palindromic-subsequences) | [[字符串](../string/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 727 | [最小窗口子序列](../../problems/minimum-window-subsequence) 🔒 | [[动态规划](../dynamic-programming/README.md)] [[Sliding Window](../sliding-window/README.md)] | Hard | +| 718 | [最长重复子数组](../../problems/maximum-length-of-repeated-subarray) | [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] [[二分查找](../binary-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 714 | [买卖股票的最佳时机含手续费](../../problems/best-time-to-buy-and-sell-stock-with-transaction-fee) | [[贪心算法](../greedy/README.md)] [[数组](../array/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 712 | [两个字符串的最小ASCII删除和](../../problems/minimum-ascii-delete-sum-for-two-strings) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 698 | [划分为k个相等的子集](../../problems/partition-to-k-equal-sum-subsets) | [[递归](../recursion/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 691 | [贴纸拼词](../../problems/stickers-to-spell-word) | [[动态规划](../dynamic-programming/README.md)] [[回溯算法](../backtracking/README.md)] | Hard | +| 689 | [三个无重叠子数组的最大和](../../problems/maximum-sum-of-3-non-overlapping-subarrays) | [[数组](../array/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 688 | [“马”在棋盘上的概率](../../problems/knight-probability-in-chessboard) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 673 | [最长递增子序列的个数](../../problems/number-of-longest-increasing-subsequence) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 664 | [奇怪的打印机](../../problems/strange-printer) | [[深度优先搜索](../depth-first-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 656 | [金币路径](../../problems/coin-path) 🔒 | [[动态规划](../dynamic-programming/README.md)] | Hard | +| 651 | [4键键盘](../../problems/4-keys-keyboard) 🔒 | [[贪心算法](../greedy/README.md)] [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 650 | [只有两个键的键盘](../../problems/2-keys-keyboard) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 647 | [回文子串](../../problems/palindromic-substrings) | [[字符串](../string/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 646 | [最长数对链](../../problems/maximum-length-of-pair-chain) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 639 | [解码方法 2](../../problems/decode-ways-ii) | [[动态规划](../dynamic-programming/README.md)] | Hard | +| 638 | [大礼包](../../problems/shopping-offers) | [[深度优先搜索](../depth-first-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 629 | [K个逆序对数组](../../problems/k-inverse-pairs-array) | [[动态规划](../dynamic-programming/README.md)] | Hard | +| 600 | [不含连续1的非负整数](../../problems/non-negative-integers-without-consecutive-ones) | [[动态规划](../dynamic-programming/README.md)] | Hard | +| 576 | [出界的路径数](../../problems/out-of-boundary-paths) | [[深度优先搜索](../depth-first-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 568 | [最大休假天数](../../problems/maximum-vacation-days) 🔒 | [[动态规划](../dynamic-programming/README.md)] | Hard | +| 552 | [学生出勤记录 II](../../problems/student-attendance-record-ii) | [[动态规划](../dynamic-programming/README.md)] | Hard | +| 546 | [移除盒子](../../problems/remove-boxes) | [[深度优先搜索](../depth-first-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 523 | [连续的子数组和](../../problems/continuous-subarray-sum) | [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 517 | [超级洗衣机](../../problems/super-washing-machines) | [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 516 | [最长回文子序列](../../problems/longest-palindromic-subsequence) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 514 | [自由之路](../../problems/freedom-trail) | [[深度优先搜索](../depth-first-search/README.md)] [[分治算法](../divide-and-conquer/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 494 | [目标和](../../problems/target-sum) | [[深度优先搜索](../depth-first-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 486 | [预测赢家](../../problems/predict-the-winner) | [[极小化极大](../minimax/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 474 | [一和零](../../problems/ones-and-zeroes) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 472 | [连接词](../../problems/concatenated-words) | [[深度优先搜索](../depth-first-search/README.md)] [[字典树](../trie/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 471 | [编码最短长度的字符串](../../problems/encode-string-with-shortest-length) 🔒 | [[动态规划](../dynamic-programming/README.md)] | Hard | +| 467 | [环绕字符串中唯一的子字符串](../../problems/unique-substrings-in-wraparound-string) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 466 | [统计重复个数](../../problems/count-the-repetitions) | [[动态规划](../dynamic-programming/README.md)] | Hard | +| 464 | [我能赢吗](../../problems/can-i-win) | [[极小化极大](../minimax/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 446 | [等差数列划分 II - 子序列](../../problems/arithmetic-slices-ii-subsequence) | [[动态规划](../dynamic-programming/README.md)] | Hard | +| 418 | [屏幕可显示句子的数量](../../problems/sentence-screen-fitting) 🔒 | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 416 | [分割等和子集](../../problems/partition-equal-subset-sum) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 413 | [等差数列划分](../../problems/arithmetic-slices) | [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 410 | [分割数组的最大值](../../problems/split-array-largest-sum) | [[二分查找](../binary-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 403 | [青蛙过河](../../problems/frog-jump) | [[动态规划](../dynamic-programming/README.md)] | Hard | +| 392 | [判断子序列](../../problems/is-subsequence) | [[贪心算法](../greedy/README.md)] [[二分查找](../binary-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Easy | +| 377 | [组合总和 Ⅳ](../../problems/combination-sum-iv) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 376 | [摆动序列](../../problems/wiggle-subsequence) | [[贪心算法](../greedy/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 375 | [猜数字大小 II](../../problems/guess-number-higher-or-lower-ii) | [[极小化极大](../minimax/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 368 | [最大整除子集](../../problems/largest-divisible-subset) | [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 363 | [矩形区域不超过 K 的最大数值和](../../problems/max-sum-of-rectangle-no-larger-than-k) | [[队列](../queue/README.md)] [[二分查找](../binary-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 361 | [轰炸敌人](../../problems/bomb-enemy) 🔒 | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 357 | [计算各个位数不同的数字个数](../../problems/count-numbers-with-unique-digits) | [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 354 | [俄罗斯套娃信封问题](../../problems/russian-doll-envelopes) | [[二分查找](../binary-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 351 | [安卓系统手势解锁](../../problems/android-unlock-patterns) 🔒 | [[动态规划](../dynamic-programming/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 343 | [整数拆分](../../problems/integer-break) | [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 338 | [比特位计数](../../problems/counting-bits) | [[位运算](../bit-manipulation/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 322 | [零钱兑换](../../problems/coin-change) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 321 | [拼接最大数](../../problems/create-maximum-number) | [[贪心算法](../greedy/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 312 | [戳气球](../../problems/burst-balloons) | [[分治算法](../divide-and-conquer/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 309 | [最佳买卖股票时机含冷冻期](../../problems/best-time-to-buy-and-sell-stock-with-cooldown) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 304 | [二维区域和检索 - 矩阵不可变](../../problems/range-sum-query-2d-immutable) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 303 | [区域和检索 - 数组不可变](../../problems/range-sum-query-immutable) | [[动态规划](../dynamic-programming/README.md)] | Easy | +| 300 | [最长上升子序列](../../problems/longest-increasing-subsequence) | [[二分查找](../binary-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 279 | [完全平方数](../../problems/perfect-squares) | [[广度优先搜索](../breadth-first-search/README.md)] [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 276 | [栅栏涂色](../../problems/paint-fence) 🔒 | [[动态规划](../dynamic-programming/README.md)] | Easy | +| 265 | [粉刷房子 II](../../problems/paint-house-ii) 🔒 | [[动态规划](../dynamic-programming/README.md)] | Hard | +| 264 | [丑数 II](../../problems/ugly-number-ii) | [[堆](../heap/README.md)] [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 256 | [粉刷房子](../../problems/paint-house) 🔒 | [[动态规划](../dynamic-programming/README.md)] | Easy | +| 221 | [最大正方形](../../problems/maximal-square) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 213 | [打家劫舍 II](../../problems/house-robber-ii) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 198 | [打家劫舍](../../problems/house-robber) | [[动态规划](../dynamic-programming/README.md)] | Easy | +| 188 | [买卖股票的最佳时机 IV](../../problems/best-time-to-buy-and-sell-stock-iv) | [[动态规划](../dynamic-programming/README.md)] | Hard | +| 174 | [地下城游戏](../../problems/dungeon-game) | [[二分查找](../binary-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 152 | [乘积最大子序列](../../problems/maximum-product-subarray) | [[数组](../array/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 140 | [单词拆分 II](../../problems/word-break-ii) | [[动态规划](../dynamic-programming/README.md)] [[回溯算法](../backtracking/README.md)] | Hard | +| 139 | [单词拆分](../../problems/word-break) | [[动态规划](../dynamic-programming/README.md)] | Medium | +| 132 | [分割回文串 II](../../problems/palindrome-partitioning-ii) | [[动态规划](../dynamic-programming/README.md)] | Hard | +| 123 | [买卖股票的最佳时机 III](../../problems/best-time-to-buy-and-sell-stock-iii) | [[数组](../array/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 121 | [买卖股票的最佳时机](../../problems/best-time-to-buy-and-sell-stock) | [[数组](../array/README.md)] [[动态规划](../dynamic-programming/README.md)] | Easy | +| 120 | [三角形最小路径和](../../problems/triangle) | [[数组](../array/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 115 | [不同的子序列](../../problems/distinct-subsequences) | [[字符串](../string/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 97 | [交错字符串](../../problems/interleaving-string) | [[字符串](../string/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 96 | [不同的二叉搜索树](../../problems/unique-binary-search-trees) | [[树](../tree/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 95 | [不同的二叉搜索树 II](../../problems/unique-binary-search-trees-ii) | [[树](../tree/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 91 | [解码方法](../../problems/decode-ways) | [[字符串](../string/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 87 | [扰乱字符串](../../problems/scramble-string) | [[字符串](../string/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 85 | [最大矩形](../../problems/maximal-rectangle) | [[栈](../stack/README.md)] [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 72 | [编辑距离](../../problems/edit-distance) | [[字符串](../string/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 70 | [爬楼梯](../../problems/climbing-stairs) | [[动态规划](../dynamic-programming/README.md)] | Easy | +| 64 | [最小路径和](../../problems/minimum-path-sum) | [[数组](../array/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 63 | [不同路径 II](../../problems/unique-paths-ii) | [[数组](../array/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 62 | [不同路径](../../problems/unique-paths) | [[数组](../array/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 53 | [最大子序和](../../problems/maximum-subarray) | [[数组](../array/README.md)] [[分治算法](../divide-and-conquer/README.md)] [[动态规划](../dynamic-programming/README.md)] | Easy | +| 44 | [通配符匹配](../../problems/wildcard-matching) | [[贪心算法](../greedy/README.md)] [[字符串](../string/README.md)] [[动态规划](../dynamic-programming/README.md)] [[回溯算法](../backtracking/README.md)] | Hard | +| 32 | [最长有效括号](../../problems/longest-valid-parentheses) | [[字符串](../string/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 10 | [正则表达式匹配](../../problems/regular-expression-matching) | [[字符串](../string/README.md)] [[动态规划](../dynamic-programming/README.md)] [[回溯算法](../backtracking/README.md)] | Hard | +| 5 | [最长回文子串](../../problems/longest-palindromic-substring) | [[字符串](../string/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | diff --git a/tag/geometry/README.md b/tag/geometry/README.md index 275a6eb17..91db869fc 100644 --- a/tag/geometry/README.md +++ b/tag/geometry/README.md @@ -5,12 +5,12 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > 几何 +## [话题分类](../README.md) > 几何 | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 1266 | [访问所有点的最小时间](https://github.com/openset/leetcode/tree/master/problems/minimum-time-visiting-all-points) | [[几何](https://github.com/openset/leetcode/tree/master/tag/geometry/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 1232 | [缀点成线](https://github.com/openset/leetcode/tree/master/problems/check-if-it-is-a-straight-line) | [[几何](https://github.com/openset/leetcode/tree/master/tag/geometry/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 963 | [最小面积矩形 II](https://github.com/openset/leetcode/tree/master/problems/minimum-area-rectangle-ii) | [[几何](https://github.com/openset/leetcode/tree/master/tag/geometry/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 892 | [三维形体的表面积](https://github.com/openset/leetcode/tree/master/problems/surface-area-of-3d-shapes) | [[几何](https://github.com/openset/leetcode/tree/master/tag/geometry/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 587 | [安装栅栏](https://github.com/openset/leetcode/tree/master/problems/erect-the-fence) | [[几何](https://github.com/openset/leetcode/tree/master/tag/geometry/README.md)] | Hard | +| 1266 | [访问所有点的最小时间](../../problems/minimum-time-visiting-all-points) | [[几何](../geometry/README.md)] [[数组](../array/README.md)] | Easy | +| 1232 | [缀点成线](../../problems/check-if-it-is-a-straight-line) | [[几何](../geometry/README.md)] [[数组](../array/README.md)] [[数学](../math/README.md)] | Easy | +| 963 | [最小面积矩形 II](../../problems/minimum-area-rectangle-ii) | [[几何](../geometry/README.md)] [[数学](../math/README.md)] | Medium | +| 892 | [三维形体的表面积](../../problems/surface-area-of-3d-shapes) | [[几何](../geometry/README.md)] [[数学](../math/README.md)] | Easy | +| 587 | [安装栅栏](../../problems/erect-the-fence) | [[几何](../geometry/README.md)] | Hard | diff --git a/tag/graph/README.md b/tag/graph/README.md index 095c3a33a..7b4877e3f 100644 --- a/tag/graph/README.md +++ b/tag/graph/README.md @@ -5,44 +5,44 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > 图 +## [话题分类](../README.md) > 图 | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 1267 | [统计参与通信的服务器](https://github.com/openset/leetcode/tree/master/problems/count-servers-that-communicate) | [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 1203 | [项目管理](https://github.com/openset/leetcode/tree/master/problems/sort-items-by-groups-respecting-dependencies) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] [[拓扑排序](https://github.com/openset/leetcode/tree/master/tag/topological-sort/README.md)] | Hard | -| 1168 | [水资源分配优化](https://github.com/openset/leetcode/tree/master/problems/optimize-water-distribution-in-a-village) 🔒 | [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Hard | -| 1162 | [地图分析](https://github.com/openset/leetcode/tree/master/problems/as-far-from-land-as-possible) | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 1161 | [最大层内元素和](https://github.com/openset/leetcode/tree/master/problems/maximum-level-sum-of-a-binary-tree) | [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 1153 | [字符串转化](https://github.com/openset/leetcode/tree/master/problems/string-transforms-into-another-string) 🔒 | [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Hard | -| 1136 | [平行课程](https://github.com/openset/leetcode/tree/master/problems/parallel-courses) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 1135 | [最低成本联通所有城市](https://github.com/openset/leetcode/tree/master/problems/connecting-cities-with-minimum-cost) 🔒 | [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 1129 | [颜色交替的最短路径](https://github.com/openset/leetcode/tree/master/problems/shortest-path-with-alternating-colors) | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 1102 | [得分最高的路径](https://github.com/openset/leetcode/tree/master/problems/path-with-maximum-minimum-value) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 1059 | [从始点到终点的所有路径](https://github.com/openset/leetcode/tree/master/problems/all-paths-from-source-lead-to-destination) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 1043 | [分隔数组以得到最大和](https://github.com/openset/leetcode/tree/master/problems/partition-array-for-maximum-sum) | [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 1042 | [不邻接植花](https://github.com/openset/leetcode/tree/master/problems/flower-planting-with-no-adjacent) | [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Easy | -| 997 | [找到小镇的法官](https://github.com/openset/leetcode/tree/master/problems/find-the-town-judge) | [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Easy | -| 996 | [正方形数组的数目](https://github.com/openset/leetcode/tree/master/problems/number-of-squareful-arrays) | [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | -| 990 | [等式方程的可满足性](https://github.com/openset/leetcode/tree/master/problems/satisfiability-of-equality-equations) | [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 959 | [由斜杠划分区域](https://github.com/openset/leetcode/tree/master/problems/regions-cut-by-slashes) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 928 | [尽量减少恶意软件的传播 II](https://github.com/openset/leetcode/tree/master/problems/minimize-malware-spread-ii) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Hard | -| 854 | [相似度为 K 的字符串](https://github.com/openset/leetcode/tree/master/problems/k-similar-strings) | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Hard | -| 841 | [钥匙和房间](https://github.com/openset/leetcode/tree/master/problems/keys-and-rooms) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 839 | [相似字符串组](https://github.com/openset/leetcode/tree/master/problems/similar-string-groups) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Hard | -| 802 | [找到最终的安全状态](https://github.com/openset/leetcode/tree/master/problems/find-eventual-safe-states) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 785 | [判断二分图](https://github.com/openset/leetcode/tree/master/problems/is-graph-bipartite) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 765 | [情侣牵手](https://github.com/openset/leetcode/tree/master/problems/couples-holding-hands) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Hard | -| 743 | [网络延迟时间](https://github.com/openset/leetcode/tree/master/problems/network-delay-time) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 685 | [冗余连接 II](https://github.com/openset/leetcode/tree/master/problems/redundant-connection-ii) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Hard | -| 684 | [冗余连接](https://github.com/openset/leetcode/tree/master/problems/redundant-connection) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 444 | [序列重建](https://github.com/openset/leetcode/tree/master/problems/sequence-reconstruction) 🔒 | [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] [[拓扑排序](https://github.com/openset/leetcode/tree/master/tag/topological-sort/README.md)] | Medium | -| 399 | [除法求值](https://github.com/openset/leetcode/tree/master/problems/evaluate-division) | [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 332 | [重新安排行程](https://github.com/openset/leetcode/tree/master/problems/reconstruct-itinerary) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 323 | [无向图中连通分量的数目](https://github.com/openset/leetcode/tree/master/problems/number-of-connected-components-in-an-undirected-graph) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 310 | [最小高度树](https://github.com/openset/leetcode/tree/master/problems/minimum-height-trees) | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 269 | [火星词典](https://github.com/openset/leetcode/tree/master/problems/alien-dictionary) 🔒 | [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] [[拓扑排序](https://github.com/openset/leetcode/tree/master/tag/topological-sort/README.md)] | Hard | -| 261 | [以图判树](https://github.com/openset/leetcode/tree/master/problems/graph-valid-tree) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 210 | [课程表 II](https://github.com/openset/leetcode/tree/master/problems/course-schedule-ii) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] [[拓扑排序](https://github.com/openset/leetcode/tree/master/tag/topological-sort/README.md)] | Medium | -| 207 | [课程表](https://github.com/openset/leetcode/tree/master/problems/course-schedule) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] [[拓扑排序](https://github.com/openset/leetcode/tree/master/tag/topological-sort/README.md)] | Medium | -| 133 | [克隆图](https://github.com/openset/leetcode/tree/master/problems/clone-graph) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | +| 1267 | [统计参与通信的服务器](../../problems/count-servers-that-communicate) | [[图](../graph/README.md)] [[数组](../array/README.md)] | Medium | +| 1203 | [项目管理](../../problems/sort-items-by-groups-respecting-dependencies) | [[深度优先搜索](../depth-first-search/README.md)] [[图](../graph/README.md)] [[拓扑排序](../topological-sort/README.md)] | Hard | +| 1168 | [水资源分配优化](../../problems/optimize-water-distribution-in-a-village) 🔒 | [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Hard | +| 1162 | [地图分析](../../problems/as-far-from-land-as-possible) | [[广度优先搜索](../breadth-first-search/README.md)] [[图](../graph/README.md)] | Medium | +| 1161 | [最大层内元素和](../../problems/maximum-level-sum-of-a-binary-tree) | [[图](../graph/README.md)] | Medium | +| 1153 | [字符串转化](../../problems/string-transforms-into-another-string) 🔒 | [[图](../graph/README.md)] | Hard | +| 1136 | [平行课程](../../problems/parallel-courses) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[图](../graph/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 1135 | [最低成本联通所有城市](../../problems/connecting-cities-with-minimum-cost) 🔒 | [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Medium | +| 1129 | [颜色交替的最短路径](../../problems/shortest-path-with-alternating-colors) | [[广度优先搜索](../breadth-first-search/README.md)] [[图](../graph/README.md)] | Medium | +| 1102 | [得分最高的路径](../../problems/path-with-maximum-minimum-value) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Medium | +| 1059 | [从始点到终点的所有路径](../../problems/all-paths-from-source-lead-to-destination) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[图](../graph/README.md)] | Medium | +| 1043 | [分隔数组以得到最大和](../../problems/partition-array-for-maximum-sum) | [[图](../graph/README.md)] | Medium | +| 1042 | [不邻接植花](../../problems/flower-planting-with-no-adjacent) | [[图](../graph/README.md)] | Easy | +| 997 | [找到小镇的法官](../../problems/find-the-town-judge) | [[图](../graph/README.md)] | Easy | +| 996 | [正方形数组的数目](../../problems/number-of-squareful-arrays) | [[图](../graph/README.md)] [[数学](../math/README.md)] [[回溯算法](../backtracking/README.md)] | Hard | +| 990 | [等式方程的可满足性](../../problems/satisfiability-of-equality-equations) | [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Medium | +| 959 | [由斜杠划分区域](../../problems/regions-cut-by-slashes) | [[深度优先搜索](../depth-first-search/README.md)] [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Medium | +| 928 | [尽量减少恶意软件的传播 II](../../problems/minimize-malware-spread-ii) | [[深度优先搜索](../depth-first-search/README.md)] [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Hard | +| 854 | [相似度为 K 的字符串](../../problems/k-similar-strings) | [[广度优先搜索](../breadth-first-search/README.md)] [[图](../graph/README.md)] | Hard | +| 841 | [钥匙和房间](../../problems/keys-and-rooms) | [[深度优先搜索](../depth-first-search/README.md)] [[图](../graph/README.md)] | Medium | +| 839 | [相似字符串组](../../problems/similar-string-groups) | [[深度优先搜索](../depth-first-search/README.md)] [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Hard | +| 802 | [找到最终的安全状态](../../problems/find-eventual-safe-states) | [[深度优先搜索](../depth-first-search/README.md)] [[图](../graph/README.md)] | Medium | +| 785 | [判断二分图](../../problems/is-graph-bipartite) | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[图](../graph/README.md)] | Medium | +| 765 | [情侣牵手](../../problems/couples-holding-hands) | [[贪心算法](../greedy/README.md)] [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Hard | +| 743 | [网络延迟时间](../../problems/network-delay-time) | [[堆](../heap/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[图](../graph/README.md)] | Medium | +| 685 | [冗余连接 II](../../problems/redundant-connection-ii) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Hard | +| 684 | [冗余连接](../../problems/redundant-connection) | [[树](../tree/README.md)] [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Medium | +| 444 | [序列重建](../../problems/sequence-reconstruction) 🔒 | [[图](../graph/README.md)] [[拓扑排序](../topological-sort/README.md)] | Medium | +| 399 | [除法求值](../../problems/evaluate-division) | [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Medium | +| 332 | [重新安排行程](../../problems/reconstruct-itinerary) | [[深度优先搜索](../depth-first-search/README.md)] [[图](../graph/README.md)] | Medium | +| 323 | [无向图中连通分量的数目](../../problems/number-of-connected-components-in-an-undirected-graph) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Medium | +| 310 | [最小高度树](../../problems/minimum-height-trees) | [[广度优先搜索](../breadth-first-search/README.md)] [[图](../graph/README.md)] | Medium | +| 269 | [火星词典](../../problems/alien-dictionary) 🔒 | [[图](../graph/README.md)] [[拓扑排序](../topological-sort/README.md)] | Hard | +| 261 | [以图判树](../../problems/graph-valid-tree) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Medium | +| 210 | [课程表 II](../../problems/course-schedule-ii) | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[图](../graph/README.md)] [[拓扑排序](../topological-sort/README.md)] | Medium | +| 207 | [课程表](../../problems/course-schedule) | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[图](../graph/README.md)] [[拓扑排序](../topological-sort/README.md)] | Medium | +| 133 | [克隆图](../../problems/clone-graph) | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[图](../graph/README.md)] | Medium | diff --git a/tag/greedy/README.md b/tag/greedy/README.md index 212b7ddc1..7c819aa53 100644 --- a/tag/greedy/README.md +++ b/tag/greedy/README.md @@ -5,75 +5,75 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > 贪心算法 +## [话题分类](../README.md) > 贪心算法 | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 1282 | [用户分组](https://github.com/openset/leetcode/tree/master/problems/group-the-people-given-the-group-size-they-belong-to) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Medium | -| 1276 | [不浪费原料的汉堡制作方案](https://github.com/openset/leetcode/tree/master/problems/number-of-burgers-with-no-waste-of-ingredients) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 1253 | [重构 2 行二进制矩阵](https://github.com/openset/leetcode/tree/master/problems/reconstruct-a-2-row-binary-matrix) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 1247 | [交换字符使得字符串相同](https://github.com/openset/leetcode/tree/master/problems/minimum-swaps-to-make-strings-equal) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 1231 | [分享巧克力](https://github.com/openset/leetcode/tree/master/problems/divide-chocolate) 🔒 | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Hard | -| 1221 | [分割平衡字符串](https://github.com/openset/leetcode/tree/master/problems/split-a-string-in-balanced-strings) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 1217 | [玩筹码](https://github.com/openset/leetcode/tree/master/problems/play-with-chips) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 1196 | [最多可以买到的苹果数量](https://github.com/openset/leetcode/tree/master/problems/how-many-apples-can-you-put-into-the-basket) 🔒 | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Easy | -| 1167 | [连接棒材的最低费用](https://github.com/openset/leetcode/tree/master/problems/minimum-cost-to-connect-sticks) 🔒 | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Medium | -| 1111 | [有效括号的嵌套深度](https://github.com/openset/leetcode/tree/master/problems/maximum-nesting-depth-of-two-valid-parentheses-strings) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 1094 | [拼车](https://github.com/openset/leetcode/tree/master/problems/car-pooling) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Medium | -| 1090 | [受标签影响的最大值](https://github.com/openset/leetcode/tree/master/problems/largest-values-from-labels) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 1058 | [最小化舍入误差以满足目标](https://github.com/openset/leetcode/tree/master/problems/minimize-rounding-error-to-meet-target) 🔒 | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 1057 | [校园自行车分配](https://github.com/openset/leetcode/tree/master/problems/campus-bikes) 🔒 | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] | Medium | -| 1055 | [形成字符串的最短路径](https://github.com/openset/leetcode/tree/master/problems/shortest-way-to-form-string) 🔒 | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 1053 | [交换一次的先前排列](https://github.com/openset/leetcode/tree/master/problems/previous-permutation-with-one-swap) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 1046 | [最后一块石头的重量](https://github.com/openset/leetcode/tree/master/problems/last-stone-weight) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Easy | -| 1029 | [两地调度](https://github.com/openset/leetcode/tree/master/problems/two-city-scheduling) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Easy | -| 1007 | [行相等的最少多米诺旋转](https://github.com/openset/leetcode/tree/master/problems/minimum-domino-rotations-for-equal-row) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 1005 | [K 次取反后最大化的数组和](https://github.com/openset/leetcode/tree/master/problems/maximize-sum-of-array-after-k-negations) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Easy | -| 995 | [K 连续位的最小翻转次数](https://github.com/openset/leetcode/tree/master/problems/minimum-number-of-k-consecutive-bit-flips) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Hard | -| 991 | [坏了的计算器](https://github.com/openset/leetcode/tree/master/problems/broken-calculator) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 984 | [不含 AAA 或 BBB 的字符串](https://github.com/openset/leetcode/tree/master/problems/string-without-aaa-or-bbb) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Medium | -| 955 | [删列造序 II](https://github.com/openset/leetcode/tree/master/problems/delete-columns-to-make-sorted-ii) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Medium | -| 948 | [令牌放置](https://github.com/openset/leetcode/tree/master/problems/bag-of-tokens) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Medium | -| 944 | [删列造序](https://github.com/openset/leetcode/tree/master/problems/delete-columns-to-make-sorted) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Easy | -| 936 | [戳印序列](https://github.com/openset/leetcode/tree/master/problems/stamping-the-sequence) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 927 | [三等分](https://github.com/openset/leetcode/tree/master/problems/three-equal-parts) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Hard | -| 921 | [使括号有效的最少添加](https://github.com/openset/leetcode/tree/master/problems/minimum-add-to-make-parentheses-valid) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Medium | -| 910 | [最小差值 II](https://github.com/openset/leetcode/tree/master/problems/smallest-range-ii) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 881 | [救生艇](https://github.com/openset/leetcode/tree/master/problems/boats-to-save-people) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 874 | [模拟行走机器人](https://github.com/openset/leetcode/tree/master/problems/walking-robot-simulation) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Easy | -| 870 | [优势洗牌](https://github.com/openset/leetcode/tree/master/problems/advantage-shuffle) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 861 | [翻转矩阵后的得分](https://github.com/openset/leetcode/tree/master/problems/score-after-flipping-matrix) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Medium | -| 860 | [柠檬水找零](https://github.com/openset/leetcode/tree/master/problems/lemonade-change) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Easy | -| 842 | [将数组拆分成斐波那契序列](https://github.com/openset/leetcode/tree/master/problems/split-array-into-fibonacci-sequence) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 767 | [重构字符串](https://github.com/openset/leetcode/tree/master/problems/reorganize-string) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 765 | [情侣牵手](https://github.com/openset/leetcode/tree/master/problems/couples-holding-hands) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Hard | -| 763 | [划分字母区间](https://github.com/openset/leetcode/tree/master/problems/partition-labels) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 759 | [员工空闲时间](https://github.com/openset/leetcode/tree/master/problems/employee-free-time) 🔒 | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Hard | -| 757 | [ 设置交集大小至少为2](https://github.com/openset/leetcode/tree/master/problems/set-intersection-size-at-least-two) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Hard | -| 738 | [单调递增的数字](https://github.com/openset/leetcode/tree/master/problems/monotone-increasing-digits) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Medium | -| 714 | [买卖股票的最佳时机含手续费](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-with-transaction-fee) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 659 | [分割数组为连续子序列](https://github.com/openset/leetcode/tree/master/problems/split-array-into-consecutive-subsequences) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Medium | -| 651 | [4键键盘](https://github.com/openset/leetcode/tree/master/problems/4-keys-keyboard) 🔒 | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 649 | [Dota2 参议院](https://github.com/openset/leetcode/tree/master/problems/dota2-senate) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Medium | -| 630 | [课程表 III](https://github.com/openset/leetcode/tree/master/problems/course-schedule-iii) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Hard | -| 621 | [任务调度器](https://github.com/openset/leetcode/tree/master/problems/task-scheduler) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[队列](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 502 | [IPO](https://github.com/openset/leetcode/tree/master/problems/ipo) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Hard | -| 484 | [寻找排列](https://github.com/openset/leetcode/tree/master/problems/find-permutation) 🔒 | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Medium | -| 455 | [分发饼干](https://github.com/openset/leetcode/tree/master/problems/assign-cookies) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Easy | -| 452 | [用最少数量的箭引爆气球](https://github.com/openset/leetcode/tree/master/problems/minimum-number-of-arrows-to-burst-balloons) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Medium | -| 435 | [无重叠区间](https://github.com/openset/leetcode/tree/master/problems/non-overlapping-intervals) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Medium | -| 406 | [根据身高重建队列](https://github.com/openset/leetcode/tree/master/problems/queue-reconstruction-by-height) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Medium | -| 402 | [移掉K位数字](https://github.com/openset/leetcode/tree/master/problems/remove-k-digits) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Medium | -| 392 | [判断子序列](https://github.com/openset/leetcode/tree/master/problems/is-subsequence) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Easy | -| 376 | [摆动序列](https://github.com/openset/leetcode/tree/master/problems/wiggle-subsequence) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 358 | [K 距离间隔重排字符串](https://github.com/openset/leetcode/tree/master/problems/rearrange-string-k-distance-apart) 🔒 | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Hard | -| 330 | [按要求补齐数组](https://github.com/openset/leetcode/tree/master/problems/patching-array) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Hard | -| 321 | [拼接最大数](https://github.com/openset/leetcode/tree/master/problems/create-maximum-number) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 316 | [去除重复字母](https://github.com/openset/leetcode/tree/master/problems/remove-duplicate-letters) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Hard | -| 253 | [会议室 II](https://github.com/openset/leetcode/tree/master/problems/meeting-rooms-ii) 🔒 | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] | Medium | -| 135 | [分发糖果](https://github.com/openset/leetcode/tree/master/problems/candy) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Hard | -| 134 | [加油站](https://github.com/openset/leetcode/tree/master/problems/gas-station) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Medium | -| 122 | [买卖股票的最佳时机 II](https://github.com/openset/leetcode/tree/master/problems/best-time-to-buy-and-sell-stock-ii) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 55 | [跳跃游戏](https://github.com/openset/leetcode/tree/master/problems/jump-game) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 45 | [跳跃游戏 II](https://github.com/openset/leetcode/tree/master/problems/jump-game-ii) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Hard | -| 44 | [通配符匹配](https://github.com/openset/leetcode/tree/master/problems/wildcard-matching) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | +| 1282 | [用户分组](../../problems/group-the-people-given-the-group-size-they-belong-to) | [[贪心算法](../greedy/README.md)] | Medium | +| 1276 | [不浪费原料的汉堡制作方案](../../problems/number-of-burgers-with-no-waste-of-ingredients) | [[贪心算法](../greedy/README.md)] [[数学](../math/README.md)] | Medium | +| 1253 | [重构 2 行二进制矩阵](../../problems/reconstruct-a-2-row-binary-matrix) | [[贪心算法](../greedy/README.md)] [[数学](../math/README.md)] | Medium | +| 1247 | [交换字符使得字符串相同](../../problems/minimum-swaps-to-make-strings-equal) | [[贪心算法](../greedy/README.md)] [[字符串](../string/README.md)] | Medium | +| 1231 | [分享巧克力](../../problems/divide-chocolate) 🔒 | [[贪心算法](../greedy/README.md)] [[二分查找](../binary-search/README.md)] | Hard | +| 1221 | [分割平衡字符串](../../problems/split-a-string-in-balanced-strings) | [[贪心算法](../greedy/README.md)] [[字符串](../string/README.md)] | Easy | +| 1217 | [玩筹码](../../problems/play-with-chips) | [[贪心算法](../greedy/README.md)] [[数组](../array/README.md)] [[数学](../math/README.md)] | Easy | +| 1196 | [最多可以买到的苹果数量](../../problems/how-many-apples-can-you-put-into-the-basket) 🔒 | [[贪心算法](../greedy/README.md)] | Easy | +| 1167 | [连接棒材的最低费用](../../problems/minimum-cost-to-connect-sticks) 🔒 | [[贪心算法](../greedy/README.md)] | Medium | +| 1111 | [有效括号的嵌套深度](../../problems/maximum-nesting-depth-of-two-valid-parentheses-strings) | [[贪心算法](../greedy/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 1094 | [拼车](../../problems/car-pooling) | [[贪心算法](../greedy/README.md)] | Medium | +| 1090 | [受标签影响的最大值](../../problems/largest-values-from-labels) | [[贪心算法](../greedy/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 1058 | [最小化舍入误差以满足目标](../../problems/minimize-rounding-error-to-meet-target) 🔒 | [[贪心算法](../greedy/README.md)] [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 1057 | [校园自行车分配](../../problems/campus-bikes) 🔒 | [[贪心算法](../greedy/README.md)] [[排序](../sort/README.md)] | Medium | +| 1055 | [形成字符串的最短路径](../../problems/shortest-way-to-form-string) 🔒 | [[贪心算法](../greedy/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 1053 | [交换一次的先前排列](../../problems/previous-permutation-with-one-swap) | [[贪心算法](../greedy/README.md)] [[数组](../array/README.md)] | Medium | +| 1046 | [最后一块石头的重量](../../problems/last-stone-weight) | [[堆](../heap/README.md)] [[贪心算法](../greedy/README.md)] | Easy | +| 1029 | [两地调度](../../problems/two-city-scheduling) | [[贪心算法](../greedy/README.md)] | Easy | +| 1007 | [行相等的最少多米诺旋转](../../problems/minimum-domino-rotations-for-equal-row) | [[贪心算法](../greedy/README.md)] [[数组](../array/README.md)] | Medium | +| 1005 | [K 次取反后最大化的数组和](../../problems/maximize-sum-of-array-after-k-negations) | [[贪心算法](../greedy/README.md)] | Easy | +| 995 | [K 连续位的最小翻转次数](../../problems/minimum-number-of-k-consecutive-bit-flips) | [[贪心算法](../greedy/README.md)] [[Sliding Window](../sliding-window/README.md)] | Hard | +| 991 | [坏了的计算器](../../problems/broken-calculator) | [[贪心算法](../greedy/README.md)] [[数学](../math/README.md)] | Medium | +| 984 | [不含 AAA 或 BBB 的字符串](../../problems/string-without-aaa-or-bbb) | [[贪心算法](../greedy/README.md)] | Medium | +| 955 | [删列造序 II](../../problems/delete-columns-to-make-sorted-ii) | [[贪心算法](../greedy/README.md)] | Medium | +| 948 | [令牌放置](../../problems/bag-of-tokens) | [[贪心算法](../greedy/README.md)] | Medium | +| 944 | [删列造序](../../problems/delete-columns-to-make-sorted) | [[贪心算法](../greedy/README.md)] | Easy | +| 936 | [戳印序列](../../problems/stamping-the-sequence) | [[贪心算法](../greedy/README.md)] [[字符串](../string/README.md)] | Hard | +| 927 | [三等分](../../problems/three-equal-parts) | [[贪心算法](../greedy/README.md)] [[数学](../math/README.md)] [[二分查找](../binary-search/README.md)] | Hard | +| 921 | [使括号有效的最少添加](../../problems/minimum-add-to-make-parentheses-valid) | [[栈](../stack/README.md)] [[贪心算法](../greedy/README.md)] | Medium | +| 910 | [最小差值 II](../../problems/smallest-range-ii) | [[贪心算法](../greedy/README.md)] [[数学](../math/README.md)] | Medium | +| 881 | [救生艇](../../problems/boats-to-save-people) | [[贪心算法](../greedy/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 874 | [模拟行走机器人](../../problems/walking-robot-simulation) | [[贪心算法](../greedy/README.md)] | Easy | +| 870 | [优势洗牌](../../problems/advantage-shuffle) | [[贪心算法](../greedy/README.md)] [[数组](../array/README.md)] | Medium | +| 861 | [翻转矩阵后的得分](../../problems/score-after-flipping-matrix) | [[贪心算法](../greedy/README.md)] | Medium | +| 860 | [柠檬水找零](../../problems/lemonade-change) | [[贪心算法](../greedy/README.md)] | Easy | +| 842 | [将数组拆分成斐波那契序列](../../problems/split-array-into-fibonacci-sequence) | [[贪心算法](../greedy/README.md)] [[字符串](../string/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 767 | [重构字符串](../../problems/reorganize-string) | [[堆](../heap/README.md)] [[贪心算法](../greedy/README.md)] [[排序](../sort/README.md)] [[字符串](../string/README.md)] | Medium | +| 765 | [情侣牵手](../../problems/couples-holding-hands) | [[贪心算法](../greedy/README.md)] [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Hard | +| 763 | [划分字母区间](../../problems/partition-labels) | [[贪心算法](../greedy/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 759 | [员工空闲时间](../../problems/employee-free-time) 🔒 | [[堆](../heap/README.md)] [[贪心算法](../greedy/README.md)] | Hard | +| 757 | [ 设置交集大小至少为2](../../problems/set-intersection-size-at-least-two) | [[贪心算法](../greedy/README.md)] | Hard | +| 738 | [单调递增的数字](../../problems/monotone-increasing-digits) | [[贪心算法](../greedy/README.md)] | Medium | +| 714 | [买卖股票的最佳时机含手续费](../../problems/best-time-to-buy-and-sell-stock-with-transaction-fee) | [[贪心算法](../greedy/README.md)] [[数组](../array/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 659 | [分割数组为连续子序列](../../problems/split-array-into-consecutive-subsequences) | [[堆](../heap/README.md)] [[贪心算法](../greedy/README.md)] | Medium | +| 651 | [4键键盘](../../problems/4-keys-keyboard) 🔒 | [[贪心算法](../greedy/README.md)] [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 649 | [Dota2 参议院](../../problems/dota2-senate) | [[贪心算法](../greedy/README.md)] | Medium | +| 630 | [课程表 III](../../problems/course-schedule-iii) | [[贪心算法](../greedy/README.md)] | Hard | +| 621 | [任务调度器](../../problems/task-scheduler) | [[贪心算法](../greedy/README.md)] [[队列](../queue/README.md)] [[数组](../array/README.md)] | Medium | +| 502 | [IPO](../../problems/ipo) | [[堆](../heap/README.md)] [[贪心算法](../greedy/README.md)] | Hard | +| 484 | [寻找排列](../../problems/find-permutation) 🔒 | [[贪心算法](../greedy/README.md)] | Medium | +| 455 | [分发饼干](../../problems/assign-cookies) | [[贪心算法](../greedy/README.md)] | Easy | +| 452 | [用最少数量的箭引爆气球](../../problems/minimum-number-of-arrows-to-burst-balloons) | [[贪心算法](../greedy/README.md)] | Medium | +| 435 | [无重叠区间](../../problems/non-overlapping-intervals) | [[贪心算法](../greedy/README.md)] | Medium | +| 406 | [根据身高重建队列](../../problems/queue-reconstruction-by-height) | [[贪心算法](../greedy/README.md)] | Medium | +| 402 | [移掉K位数字](../../problems/remove-k-digits) | [[栈](../stack/README.md)] [[贪心算法](../greedy/README.md)] | Medium | +| 392 | [判断子序列](../../problems/is-subsequence) | [[贪心算法](../greedy/README.md)] [[二分查找](../binary-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Easy | +| 376 | [摆动序列](../../problems/wiggle-subsequence) | [[贪心算法](../greedy/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 358 | [K 距离间隔重排字符串](../../problems/rearrange-string-k-distance-apart) 🔒 | [[堆](../heap/README.md)] [[贪心算法](../greedy/README.md)] [[哈希表](../hash-table/README.md)] | Hard | +| 330 | [按要求补齐数组](../../problems/patching-array) | [[贪心算法](../greedy/README.md)] | Hard | +| 321 | [拼接最大数](../../problems/create-maximum-number) | [[贪心算法](../greedy/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 316 | [去除重复字母](../../problems/remove-duplicate-letters) | [[栈](../stack/README.md)] [[贪心算法](../greedy/README.md)] | Hard | +| 253 | [会议室 II](../../problems/meeting-rooms-ii) 🔒 | [[堆](../heap/README.md)] [[贪心算法](../greedy/README.md)] [[排序](../sort/README.md)] | Medium | +| 135 | [分发糖果](../../problems/candy) | [[贪心算法](../greedy/README.md)] | Hard | +| 134 | [加油站](../../problems/gas-station) | [[贪心算法](../greedy/README.md)] | Medium | +| 122 | [买卖股票的最佳时机 II](../../problems/best-time-to-buy-and-sell-stock-ii) | [[贪心算法](../greedy/README.md)] [[数组](../array/README.md)] | Easy | +| 55 | [跳跃游戏](../../problems/jump-game) | [[贪心算法](../greedy/README.md)] [[数组](../array/README.md)] | Medium | +| 45 | [跳跃游戏 II](../../problems/jump-game-ii) | [[贪心算法](../greedy/README.md)] [[数组](../array/README.md)] | Hard | +| 44 | [通配符匹配](../../problems/wildcard-matching) | [[贪心算法](../greedy/README.md)] [[字符串](../string/README.md)] [[动态规划](../dynamic-programming/README.md)] [[回溯算法](../backtracking/README.md)] | Hard | diff --git a/tag/hash-table/README.md b/tag/hash-table/README.md index 4a94414ad..4d9098833 100644 --- a/tag/hash-table/README.md +++ b/tag/hash-table/README.md @@ -5,128 +5,128 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > 哈希表 +## [话题分类](../README.md) > 哈希表 | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 1261 | [在受污染的二叉树中查找元素](https://github.com/openset/leetcode/tree/master/problems/find-elements-in-a-contaminated-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 1244 | [力扣排行榜](https://github.com/openset/leetcode/tree/master/problems/design-a-leaderboard) 🔒 | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 1224 | [最大相等频率](https://github.com/openset/leetcode/tree/master/problems/maximum-equal-frequency) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Hard | -| 1213 | [三个有序数组的交集](https://github.com/openset/leetcode/tree/master/problems/intersection-of-three-sorted-arrays) 🔒 | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Easy | -| 1207 | [独一无二的出现次数](https://github.com/openset/leetcode/tree/master/problems/unique-number-of-occurrences) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 1198 | [找出所有行中最小公共元素](https://github.com/openset/leetcode/tree/master/problems/find-smallest-common-element-in-all-rows) 🔒 | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 1189 | [“气球” 的最大数量](https://github.com/openset/leetcode/tree/master/problems/maximum-number-of-balloons) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 1178 | [猜字谜](https://github.com/openset/leetcode/tree/master/problems/number-of-valid-words-for-each-puzzle) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Hard | -| 1166 | [设计文件系统](https://github.com/openset/leetcode/tree/master/problems/design-file-system) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 1160 | [拼写单词](https://github.com/openset/leetcode/tree/master/problems/find-words-that-can-be-formed-by-characters) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 1152 | [用户网站访问行为分析](https://github.com/openset/leetcode/tree/master/problems/analyze-user-website-visit-pattern) 🔒 | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 1138 | [字母板上的路径](https://github.com/openset/leetcode/tree/master/problems/alphabet-board-path) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 1133 | [最大唯一数](https://github.com/openset/leetcode/tree/master/problems/largest-unique-number) 🔒 | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 1090 | [受标签影响的最大值](https://github.com/openset/leetcode/tree/master/problems/largest-values-from-labels) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 1086 | [前五科的均分](https://github.com/openset/leetcode/tree/master/problems/high-five) 🔒 | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 1078 | [Bigram 分词](https://github.com/openset/leetcode/tree/master/problems/occurrences-after-bigram) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 1072 | [按列翻转得到最大值等行数](https://github.com/openset/leetcode/tree/master/problems/flip-columns-for-maximum-number-of-equal-rows) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 1048 | [最长字符串链](https://github.com/openset/leetcode/tree/master/problems/longest-string-chain) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 1044 | [最长重复子串](https://github.com/openset/leetcode/tree/master/problems/longest-duplicate-substring) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Hard | -| 1002 | [查找常用字符](https://github.com/openset/leetcode/tree/master/problems/find-common-characters) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 1001 | [网格照明](https://github.com/openset/leetcode/tree/master/problems/grid-illumination) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Hard | -| 992 | [K 个不同整数的子数组](https://github.com/openset/leetcode/tree/master/problems/subarrays-with-k-different-integers) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Hard | -| 987 | [二叉树的垂序遍历](https://github.com/openset/leetcode/tree/master/problems/vertical-order-traversal-of-a-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 981 | [基于时间的键值存储](https://github.com/openset/leetcode/tree/master/problems/time-based-key-value-store) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 974 | [和可被 K 整除的子数组](https://github.com/openset/leetcode/tree/master/problems/subarray-sums-divisible-by-k) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 970 | [强整数](https://github.com/openset/leetcode/tree/master/problems/powerful-integers) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 966 | [元音拼写检查器](https://github.com/openset/leetcode/tree/master/problems/vowel-spellchecker) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 961 | [重复 N 次的元素](https://github.com/openset/leetcode/tree/master/problems/n-repeated-element-in-size-2n-array) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 957 | [N 天后的牢房](https://github.com/openset/leetcode/tree/master/problems/prison-cells-after-n-days) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 954 | [二倍数对数组](https://github.com/openset/leetcode/tree/master/problems/array-of-doubled-pairs) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 953 | [验证外星语词典](https://github.com/openset/leetcode/tree/master/problems/verifying-an-alien-dictionary) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 939 | [最小面积矩形](https://github.com/openset/leetcode/tree/master/problems/minimum-area-rectangle) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 930 | [和相同的二元子数组](https://github.com/openset/leetcode/tree/master/problems/binary-subarrays-with-sum) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 895 | [最大频率栈](https://github.com/openset/leetcode/tree/master/problems/maximum-frequency-stack) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Hard | -| 884 | [两句话中的不常见单词](https://github.com/openset/leetcode/tree/master/problems/uncommon-words-from-two-sentences) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 811 | [子域名访问计数](https://github.com/openset/leetcode/tree/master/problems/subdomain-visit-count) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 781 | [森林中的兔子](https://github.com/openset/leetcode/tree/master/problems/rabbits-in-forest) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 771 | [宝石与石头](https://github.com/openset/leetcode/tree/master/problems/jewels-and-stones) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 770 | [基本计算器 IV](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-iv) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 760 | [找出变位映射](https://github.com/openset/leetcode/tree/master/problems/find-anagram-mappings) 🔒 | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 748 | [最短完整词](https://github.com/openset/leetcode/tree/master/problems/shortest-completing-word) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 739 | [每日温度](https://github.com/openset/leetcode/tree/master/problems/daily-temperatures) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 734 | [句子相似性](https://github.com/openset/leetcode/tree/master/problems/sentence-similarity) 🔒 | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 726 | [原子的数量](https://github.com/openset/leetcode/tree/master/problems/number-of-atoms) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Hard | -| 720 | [词典中最长的单词](https://github.com/openset/leetcode/tree/master/problems/longest-word-in-dictionary) | [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 718 | [最长重复子数组](https://github.com/openset/leetcode/tree/master/problems/maximum-length-of-repeated-subarray) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 711 | [不同岛屿的数量 II](https://github.com/openset/leetcode/tree/master/problems/number-of-distinct-islands-ii) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Hard | -| 710 | [黑名单中的随机数](https://github.com/openset/leetcode/tree/master/problems/random-pick-with-blacklist) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[Random](https://github.com/openset/leetcode/tree/master/tag/random/README.md)] | Hard | -| 706 | [设计哈希映射](https://github.com/openset/leetcode/tree/master/problems/design-hashmap) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 705 | [设计哈希集合](https://github.com/openset/leetcode/tree/master/problems/design-hashset) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 694 | [不同岛屿的数量](https://github.com/openset/leetcode/tree/master/problems/number-of-distinct-islands) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 692 | [前K个高频单词](https://github.com/openset/leetcode/tree/master/problems/top-k-frequent-words) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 690 | [员工的重要性](https://github.com/openset/leetcode/tree/master/problems/employee-importance) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 676 | [实现一个魔法字典](https://github.com/openset/leetcode/tree/master/problems/implement-magic-dictionary) | [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 648 | [单词替换](https://github.com/openset/leetcode/tree/master/problems/replace-words) | [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 645 | [错误的集合](https://github.com/openset/leetcode/tree/master/problems/set-mismatch) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 632 | [最小区间](https://github.com/openset/leetcode/tree/master/problems/smallest-range-covering-elements-from-k-lists) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 624 | [数组列表中的最大距离](https://github.com/openset/leetcode/tree/master/problems/maximum-distance-in-arrays) 🔒 | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 609 | [在系统中查找重复文件](https://github.com/openset/leetcode/tree/master/problems/find-duplicate-file-in-system) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 599 | [两个列表的最小索引总和](https://github.com/openset/leetcode/tree/master/problems/minimum-index-sum-of-two-lists) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 594 | [最长和谐子序列](https://github.com/openset/leetcode/tree/master/problems/longest-harmonious-subsequence) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 575 | [分糖果](https://github.com/openset/leetcode/tree/master/problems/distribute-candies) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 560 | [和为K的子数组](https://github.com/openset/leetcode/tree/master/problems/subarray-sum-equals-k) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 554 | [砖墙](https://github.com/openset/leetcode/tree/master/problems/brick-wall) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 535 | [TinyURL 的加密与解密](https://github.com/openset/leetcode/tree/master/problems/encode-and-decode-tinyurl) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 525 | [连续数组](https://github.com/openset/leetcode/tree/master/problems/contiguous-array) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 508 | [出现次数最多的子树元素和](https://github.com/openset/leetcode/tree/master/problems/most-frequent-subtree-sum) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 500 | [键盘行](https://github.com/openset/leetcode/tree/master/problems/keyboard-row) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 463 | [岛屿的周长](https://github.com/openset/leetcode/tree/master/problems/island-perimeter) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 454 | [四数相加 II](https://github.com/openset/leetcode/tree/master/problems/4sum-ii) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 451 | [根据字符出现频率排序](https://github.com/openset/leetcode/tree/master/problems/sort-characters-by-frequency) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 447 | [回旋镖的数量](https://github.com/openset/leetcode/tree/master/problems/number-of-boomerangs) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 438 | [找到字符串中所有字母异位词](https://github.com/openset/leetcode/tree/master/problems/find-all-anagrams-in-a-string) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 409 | [最长回文串](https://github.com/openset/leetcode/tree/master/problems/longest-palindrome) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 389 | [找不同](https://github.com/openset/leetcode/tree/master/problems/find-the-difference) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 387 | [字符串中的第一个唯一字符](https://github.com/openset/leetcode/tree/master/problems/first-unique-character-in-a-string) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 381 | [O(1) 时间插入、删除和获取随机元素 - 允许重复](https://github.com/openset/leetcode/tree/master/problems/insert-delete-getrandom-o1-duplicates-allowed) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Hard | -| 380 | [常数时间插入、删除和获取随机元素](https://github.com/openset/leetcode/tree/master/problems/insert-delete-getrandom-o1) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 359 | [日志速率限制器](https://github.com/openset/leetcode/tree/master/problems/logger-rate-limiter) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 358 | [K 距离间隔重排字符串](https://github.com/openset/leetcode/tree/master/problems/rearrange-string-k-distance-apart) 🔒 | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Hard | -| 356 | [直线镜像](https://github.com/openset/leetcode/tree/master/problems/line-reflection) 🔒 | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 355 | [设计推特](https://github.com/openset/leetcode/tree/master/problems/design-twitter) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 350 | [两个数组的交集 II](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-arrays-ii) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Easy | -| 349 | [两个数组的交集](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-arrays) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Easy | -| 347 | [前 K 个高频元素](https://github.com/openset/leetcode/tree/master/problems/top-k-frequent-elements) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 340 | [至多包含 K 个不同字符的最长子串](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-k-distinct-characters) 🔒 | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Hard | -| 336 | [回文对](https://github.com/openset/leetcode/tree/master/problems/palindrome-pairs) | [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 325 | [和等于 k 的最长子数组长度](https://github.com/openset/leetcode/tree/master/problems/maximum-size-subarray-sum-equals-k) 🔒 | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 314 | [二叉树的垂直遍历](https://github.com/openset/leetcode/tree/master/problems/binary-tree-vertical-order-traversal) 🔒 | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 311 | [稀疏矩阵的乘法](https://github.com/openset/leetcode/tree/master/problems/sparse-matrix-multiplication) 🔒 | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 299 | [猜数字游戏](https://github.com/openset/leetcode/tree/master/problems/bulls-and-cows) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 290 | [单词规律](https://github.com/openset/leetcode/tree/master/problems/word-pattern) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 288 | [单词的唯一缩写](https://github.com/openset/leetcode/tree/master/problems/unique-word-abbreviation) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 274 | [H指数](https://github.com/openset/leetcode/tree/master/problems/h-index) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 266 | [回文排列](https://github.com/openset/leetcode/tree/master/problems/palindrome-permutation) 🔒 | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 249 | [移位字符串分组](https://github.com/openset/leetcode/tree/master/problems/group-shifted-strings) 🔒 | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 246 | [中心对称数](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number) 🔒 | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 244 | [最短单词距离 II](https://github.com/openset/leetcode/tree/master/problems/shortest-word-distance-ii) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 242 | [有效的字母异位词](https://github.com/openset/leetcode/tree/master/problems/valid-anagram) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 219 | [存在重复元素 II](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate-ii) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 217 | [存在重复元素](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 205 | [同构字符串](https://github.com/openset/leetcode/tree/master/problems/isomorphic-strings) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 204 | [计数质数](https://github.com/openset/leetcode/tree/master/problems/count-primes) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 202 | [快乐数](https://github.com/openset/leetcode/tree/master/problems/happy-number) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 187 | [重复的DNA序列](https://github.com/openset/leetcode/tree/master/problems/repeated-dna-sequences) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 170 | [两数之和 III - 数据结构设计](https://github.com/openset/leetcode/tree/master/problems/two-sum-iii-data-structure-design) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 166 | [分数到小数](https://github.com/openset/leetcode/tree/master/problems/fraction-to-recurring-decimal) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 159 | [至多包含两个不同字符的最长子串](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-two-distinct-characters) 🔒 | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Medium | -| 149 | [直线上最多的点数](https://github.com/openset/leetcode/tree/master/problems/max-points-on-a-line) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Hard | -| 138 | [复制带随机指针的链表](https://github.com/openset/leetcode/tree/master/problems/copy-list-with-random-pointer) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Medium | -| 136 | [只出现一次的数字](https://github.com/openset/leetcode/tree/master/problems/single-number) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 94 | [二叉树的中序遍历](https://github.com/openset/leetcode/tree/master/problems/binary-tree-inorder-traversal) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 85 | [最大矩形](https://github.com/openset/leetcode/tree/master/problems/maximal-rectangle) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 76 | [最小覆盖子串](https://github.com/openset/leetcode/tree/master/problems/minimum-window-substring) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Hard | -| 49 | [字母异位词分组](https://github.com/openset/leetcode/tree/master/problems/group-anagrams) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 37 | [解数独](https://github.com/openset/leetcode/tree/master/problems/sudoku-solver) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | -| 36 | [有效的数独](https://github.com/openset/leetcode/tree/master/problems/valid-sudoku) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 30 | [串联所有单词的子串](https://github.com/openset/leetcode/tree/master/problems/substring-with-concatenation-of-all-words) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 18 | [四数之和](https://github.com/openset/leetcode/tree/master/problems/4sum) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 3 | [无重复字符的最长子串](https://github.com/openset/leetcode/tree/master/problems/longest-substring-without-repeating-characters) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Medium | -| 1 | [两数之和](https://github.com/openset/leetcode/tree/master/problems/two-sum) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | +| 1261 | [在受污染的二叉树中查找元素](../../problems/find-elements-in-a-contaminated-binary-tree) | [[树](../tree/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 1244 | [力扣排行榜](../../problems/design-a-leaderboard) 🔒 | [[排序](../sort/README.md)] [[设计](../design/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 1224 | [最大相等频率](../../problems/maximum-equal-frequency) | [[哈希表](../hash-table/README.md)] | Hard | +| 1213 | [三个有序数组的交集](../../problems/intersection-of-three-sorted-arrays) 🔒 | [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] | Easy | +| 1207 | [独一无二的出现次数](../../problems/unique-number-of-occurrences) | [[哈希表](../hash-table/README.md)] | Easy | +| 1198 | [找出所有行中最小公共元素](../../problems/find-smallest-common-element-in-all-rows) 🔒 | [[哈希表](../hash-table/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 1189 | [“气球” 的最大数量](../../problems/maximum-number-of-balloons) | [[哈希表](../hash-table/README.md)] [[字符串](../string/README.md)] | Easy | +| 1178 | [猜字谜](../../problems/number-of-valid-words-for-each-puzzle) | [[位运算](../bit-manipulation/README.md)] [[哈希表](../hash-table/README.md)] | Hard | +| 1166 | [设计文件系统](../../problems/design-file-system) 🔒 | [[设计](../design/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 1160 | [拼写单词](../../problems/find-words-that-can-be-formed-by-characters) | [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] | Easy | +| 1152 | [用户网站访问行为分析](../../problems/analyze-user-website-visit-pattern) 🔒 | [[排序](../sort/README.md)] [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 1138 | [字母板上的路径](../../problems/alphabet-board-path) | [[哈希表](../hash-table/README.md)] [[字符串](../string/README.md)] | Medium | +| 1133 | [最大唯一数](../../problems/largest-unique-number) 🔒 | [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] | Easy | +| 1090 | [受标签影响的最大值](../../problems/largest-values-from-labels) | [[贪心算法](../greedy/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 1086 | [前五科的均分](../../problems/high-five) 🔒 | [[排序](../sort/README.md)] [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] | Easy | +| 1078 | [Bigram 分词](../../problems/occurrences-after-bigram) | [[哈希表](../hash-table/README.md)] | Easy | +| 1072 | [按列翻转得到最大值等行数](../../problems/flip-columns-for-maximum-number-of-equal-rows) | [[哈希表](../hash-table/README.md)] | Medium | +| 1048 | [最长字符串链](../../problems/longest-string-chain) | [[哈希表](../hash-table/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 1044 | [最长重复子串](../../problems/longest-duplicate-substring) | [[哈希表](../hash-table/README.md)] [[二分查找](../binary-search/README.md)] | Hard | +| 1002 | [查找常用字符](../../problems/find-common-characters) | [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] | Easy | +| 1001 | [网格照明](../../problems/grid-illumination) | [[哈希表](../hash-table/README.md)] | Hard | +| 992 | [K 个不同整数的子数组](../../problems/subarrays-with-k-different-integers) | [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] [[Sliding Window](../sliding-window/README.md)] | Hard | +| 987 | [二叉树的垂序遍历](../../problems/vertical-order-traversal-of-a-binary-tree) | [[树](../tree/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 981 | [基于时间的键值存储](../../problems/time-based-key-value-store) | [[哈希表](../hash-table/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 974 | [和可被 K 整除的子数组](../../problems/subarray-sums-divisible-by-k) | [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 970 | [强整数](../../problems/powerful-integers) | [[哈希表](../hash-table/README.md)] [[数学](../math/README.md)] | Easy | +| 966 | [元音拼写检查器](../../problems/vowel-spellchecker) | [[哈希表](../hash-table/README.md)] [[字符串](../string/README.md)] | Medium | +| 961 | [重复 N 次的元素](../../problems/n-repeated-element-in-size-2n-array) | [[哈希表](../hash-table/README.md)] | Easy | +| 957 | [N 天后的牢房](../../problems/prison-cells-after-n-days) | [[哈希表](../hash-table/README.md)] | Medium | +| 954 | [二倍数对数组](../../problems/array-of-doubled-pairs) | [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 953 | [验证外星语词典](../../problems/verifying-an-alien-dictionary) | [[哈希表](../hash-table/README.md)] | Easy | +| 939 | [最小面积矩形](../../problems/minimum-area-rectangle) | [[哈希表](../hash-table/README.md)] | Medium | +| 930 | [和相同的二元子数组](../../problems/binary-subarrays-with-sum) | [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 895 | [最大频率栈](../../problems/maximum-frequency-stack) | [[栈](../stack/README.md)] [[哈希表](../hash-table/README.md)] | Hard | +| 884 | [两句话中的不常见单词](../../problems/uncommon-words-from-two-sentences) | [[哈希表](../hash-table/README.md)] | Easy | +| 811 | [子域名访问计数](../../problems/subdomain-visit-count) | [[哈希表](../hash-table/README.md)] | Easy | +| 781 | [森林中的兔子](../../problems/rabbits-in-forest) | [[哈希表](../hash-table/README.md)] [[数学](../math/README.md)] | Medium | +| 771 | [宝石与石头](../../problems/jewels-and-stones) | [[哈希表](../hash-table/README.md)] | Easy | +| 770 | [基本计算器 IV](../../problems/basic-calculator-iv) | [[栈](../stack/README.md)] [[哈希表](../hash-table/README.md)] [[字符串](../string/README.md)] | Hard | +| 760 | [找出变位映射](../../problems/find-anagram-mappings) 🔒 | [[哈希表](../hash-table/README.md)] | Easy | +| 748 | [最短完整词](../../problems/shortest-completing-word) | [[哈希表](../hash-table/README.md)] | Easy | +| 739 | [每日温度](../../problems/daily-temperatures) | [[栈](../stack/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 734 | [句子相似性](../../problems/sentence-similarity) 🔒 | [[哈希表](../hash-table/README.md)] | Easy | +| 726 | [原子的数量](../../problems/number-of-atoms) | [[栈](../stack/README.md)] [[递归](../recursion/README.md)] [[哈希表](../hash-table/README.md)] | Hard | +| 720 | [词典中最长的单词](../../problems/longest-word-in-dictionary) | [[字典树](../trie/README.md)] [[哈希表](../hash-table/README.md)] | Easy | +| 718 | [最长重复子数组](../../problems/maximum-length-of-repeated-subarray) | [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] [[二分查找](../binary-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 711 | [不同岛屿的数量 II](../../problems/number-of-distinct-islands-ii) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[哈希表](../hash-table/README.md)] | Hard | +| 710 | [黑名单中的随机数](../../problems/random-pick-with-blacklist) | [[排序](../sort/README.md)] [[哈希表](../hash-table/README.md)] [[二分查找](../binary-search/README.md)] [[Random](../random/README.md)] | Hard | +| 706 | [设计哈希映射](../../problems/design-hashmap) | [[设计](../design/README.md)] [[哈希表](../hash-table/README.md)] | Easy | +| 705 | [设计哈希集合](../../problems/design-hashset) | [[设计](../design/README.md)] [[哈希表](../hash-table/README.md)] | Easy | +| 694 | [不同岛屿的数量](../../problems/number-of-distinct-islands) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 692 | [前K个高频单词](../../problems/top-k-frequent-words) | [[堆](../heap/README.md)] [[字典树](../trie/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 690 | [员工的重要性](../../problems/employee-importance) | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[哈希表](../hash-table/README.md)] | Easy | +| 676 | [实现一个魔法字典](../../problems/implement-magic-dictionary) | [[字典树](../trie/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 648 | [单词替换](../../problems/replace-words) | [[字典树](../trie/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 645 | [错误的集合](../../problems/set-mismatch) | [[哈希表](../hash-table/README.md)] [[数学](../math/README.md)] | Easy | +| 632 | [最小区间](../../problems/smallest-range-covering-elements-from-k-lists) | [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] [[字符串](../string/README.md)] | Hard | +| 624 | [数组列表中的最大距离](../../problems/maximum-distance-in-arrays) 🔒 | [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] | Easy | +| 609 | [在系统中查找重复文件](../../problems/find-duplicate-file-in-system) | [[哈希表](../hash-table/README.md)] [[字符串](../string/README.md)] | Medium | +| 599 | [两个列表的最小索引总和](../../problems/minimum-index-sum-of-two-lists) | [[哈希表](../hash-table/README.md)] | Easy | +| 594 | [最长和谐子序列](../../problems/longest-harmonious-subsequence) | [[哈希表](../hash-table/README.md)] | Easy | +| 575 | [分糖果](../../problems/distribute-candies) | [[哈希表](../hash-table/README.md)] | Easy | +| 560 | [和为K的子数组](../../problems/subarray-sum-equals-k) | [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 554 | [砖墙](../../problems/brick-wall) | [[哈希表](../hash-table/README.md)] | Medium | +| 535 | [TinyURL 的加密与解密](../../problems/encode-and-decode-tinyurl) | [[哈希表](../hash-table/README.md)] [[数学](../math/README.md)] | Medium | +| 525 | [连续数组](../../problems/contiguous-array) | [[哈希表](../hash-table/README.md)] | Medium | +| 508 | [出现次数最多的子树元素和](../../problems/most-frequent-subtree-sum) | [[树](../tree/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 500 | [键盘行](../../problems/keyboard-row) | [[哈希表](../hash-table/README.md)] | Easy | +| 463 | [岛屿的周长](../../problems/island-perimeter) | [[哈希表](../hash-table/README.md)] | Easy | +| 454 | [四数相加 II](../../problems/4sum-ii) | [[哈希表](../hash-table/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 451 | [根据字符出现频率排序](../../problems/sort-characters-by-frequency) | [[堆](../heap/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 447 | [回旋镖的数量](../../problems/number-of-boomerangs) | [[哈希表](../hash-table/README.md)] | Easy | +| 438 | [找到字符串中所有字母异位词](../../problems/find-all-anagrams-in-a-string) | [[哈希表](../hash-table/README.md)] | Medium | +| 409 | [最长回文串](../../problems/longest-palindrome) | [[哈希表](../hash-table/README.md)] | Easy | +| 389 | [找不同](../../problems/find-the-difference) | [[位运算](../bit-manipulation/README.md)] [[哈希表](../hash-table/README.md)] | Easy | +| 387 | [字符串中的第一个唯一字符](../../problems/first-unique-character-in-a-string) | [[哈希表](../hash-table/README.md)] [[字符串](../string/README.md)] | Easy | +| 381 | [O(1) 时间插入、删除和获取随机元素 - 允许重复](../../problems/insert-delete-getrandom-o1-duplicates-allowed) | [[设计](../design/README.md)] [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] | Hard | +| 380 | [常数时间插入、删除和获取随机元素](../../problems/insert-delete-getrandom-o1) | [[设计](../design/README.md)] [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 359 | [日志速率限制器](../../problems/logger-rate-limiter) 🔒 | [[设计](../design/README.md)] [[哈希表](../hash-table/README.md)] | Easy | +| 358 | [K 距离间隔重排字符串](../../problems/rearrange-string-k-distance-apart) 🔒 | [[堆](../heap/README.md)] [[贪心算法](../greedy/README.md)] [[哈希表](../hash-table/README.md)] | Hard | +| 356 | [直线镜像](../../problems/line-reflection) 🔒 | [[哈希表](../hash-table/README.md)] [[数学](../math/README.md)] | Medium | +| 355 | [设计推特](../../problems/design-twitter) | [[堆](../heap/README.md)] [[设计](../design/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 350 | [两个数组的交集 II](../../problems/intersection-of-two-arrays-ii) | [[排序](../sort/README.md)] [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] [[二分查找](../binary-search/README.md)] | Easy | +| 349 | [两个数组的交集](../../problems/intersection-of-two-arrays) | [[排序](../sort/README.md)] [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] [[二分查找](../binary-search/README.md)] | Easy | +| 347 | [前 K 个高频元素](../../problems/top-k-frequent-elements) | [[堆](../heap/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 340 | [至多包含 K 个不同字符的最长子串](../../problems/longest-substring-with-at-most-k-distinct-characters) 🔒 | [[哈希表](../hash-table/README.md)] [[字符串](../string/README.md)] [[Sliding Window](../sliding-window/README.md)] | Hard | +| 336 | [回文对](../../problems/palindrome-pairs) | [[字典树](../trie/README.md)] [[哈希表](../hash-table/README.md)] [[字符串](../string/README.md)] | Hard | +| 325 | [和等于 k 的最长子数组长度](../../problems/maximum-size-subarray-sum-equals-k) 🔒 | [[哈希表](../hash-table/README.md)] | Medium | +| 314 | [二叉树的垂直遍历](../../problems/binary-tree-vertical-order-traversal) 🔒 | [[哈希表](../hash-table/README.md)] | Medium | +| 311 | [稀疏矩阵的乘法](../../problems/sparse-matrix-multiplication) 🔒 | [[哈希表](../hash-table/README.md)] | Medium | +| 299 | [猜数字游戏](../../problems/bulls-and-cows) | [[哈希表](../hash-table/README.md)] | Easy | +| 290 | [单词规律](../../problems/word-pattern) | [[哈希表](../hash-table/README.md)] | Easy | +| 288 | [单词的唯一缩写](../../problems/unique-word-abbreviation) 🔒 | [[设计](../design/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 274 | [H指数](../../problems/h-index) | [[排序](../sort/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 266 | [回文排列](../../problems/palindrome-permutation) 🔒 | [[哈希表](../hash-table/README.md)] | Easy | +| 249 | [移位字符串分组](../../problems/group-shifted-strings) 🔒 | [[哈希表](../hash-table/README.md)] [[字符串](../string/README.md)] | Medium | +| 246 | [中心对称数](../../problems/strobogrammatic-number) 🔒 | [[哈希表](../hash-table/README.md)] [[数学](../math/README.md)] | Easy | +| 244 | [最短单词距离 II](../../problems/shortest-word-distance-ii) 🔒 | [[设计](../design/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 242 | [有效的字母异位词](../../problems/valid-anagram) | [[排序](../sort/README.md)] [[哈希表](../hash-table/README.md)] | Easy | +| 219 | [存在重复元素 II](../../problems/contains-duplicate-ii) | [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] | Easy | +| 217 | [存在重复元素](../../problems/contains-duplicate) | [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] | Easy | +| 205 | [同构字符串](../../problems/isomorphic-strings) | [[哈希表](../hash-table/README.md)] | Easy | +| 204 | [计数质数](../../problems/count-primes) | [[哈希表](../hash-table/README.md)] [[数学](../math/README.md)] | Easy | +| 202 | [快乐数](../../problems/happy-number) | [[哈希表](../hash-table/README.md)] [[数学](../math/README.md)] | Easy | +| 187 | [重复的DNA序列](../../problems/repeated-dna-sequences) | [[位运算](../bit-manipulation/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 170 | [两数之和 III - 数据结构设计](../../problems/two-sum-iii-data-structure-design) 🔒 | [[设计](../design/README.md)] [[哈希表](../hash-table/README.md)] | Easy | +| 166 | [分数到小数](../../problems/fraction-to-recurring-decimal) | [[哈希表](../hash-table/README.md)] [[数学](../math/README.md)] | Medium | +| 159 | [至多包含两个不同字符的最长子串](../../problems/longest-substring-with-at-most-two-distinct-characters) 🔒 | [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] [[字符串](../string/README.md)] [[Sliding Window](../sliding-window/README.md)] | Medium | +| 149 | [直线上最多的点数](../../problems/max-points-on-a-line) | [[哈希表](../hash-table/README.md)] [[数学](../math/README.md)] | Hard | +| 138 | [复制带随机指针的链表](../../problems/copy-list-with-random-pointer) | [[哈希表](../hash-table/README.md)] [[链表](../linked-list/README.md)] | Medium | +| 136 | [只出现一次的数字](../../problems/single-number) | [[位运算](../bit-manipulation/README.md)] [[哈希表](../hash-table/README.md)] | Easy | +| 94 | [二叉树的中序遍历](../../problems/binary-tree-inorder-traversal) | [[栈](../stack/README.md)] [[树](../tree/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 85 | [最大矩形](../../problems/maximal-rectangle) | [[栈](../stack/README.md)] [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 76 | [最小覆盖子串](../../problems/minimum-window-substring) | [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] [[字符串](../string/README.md)] [[Sliding Window](../sliding-window/README.md)] | Hard | +| 49 | [字母异位词分组](../../problems/group-anagrams) | [[哈希表](../hash-table/README.md)] [[字符串](../string/README.md)] | Medium | +| 37 | [解数独](../../problems/sudoku-solver) | [[哈希表](../hash-table/README.md)] [[回溯算法](../backtracking/README.md)] | Hard | +| 36 | [有效的数独](../../problems/valid-sudoku) | [[哈希表](../hash-table/README.md)] | Medium | +| 30 | [串联所有单词的子串](../../problems/substring-with-concatenation-of-all-words) | [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] [[字符串](../string/README.md)] | Hard | +| 18 | [四数之和](../../problems/4sum) | [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 3 | [无重复字符的最长子串](../../problems/longest-substring-without-repeating-characters) | [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] [[字符串](../string/README.md)] [[Sliding Window](../sliding-window/README.md)] | Medium | +| 1 | [两数之和](../../problems/two-sum) | [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] | Easy | diff --git a/tag/heap/README.md b/tag/heap/README.md index fc75ef978..bb21437a3 100644 --- a/tag/heap/README.md +++ b/tag/heap/README.md @@ -5,41 +5,41 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > 堆 +## [话题分类](../README.md) > 堆 | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 1054 | [距离相等的条形码](https://github.com/openset/leetcode/tree/master/problems/distant-barcodes) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] | Medium | -| 1046 | [最后一块石头的重量](https://github.com/openset/leetcode/tree/master/problems/last-stone-weight) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Easy | -| 973 | [最接近原点的 K 个点](https://github.com/openset/leetcode/tree/master/problems/k-closest-points-to-origin) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Medium | -| 882 | [细分图中的可到达结点](https://github.com/openset/leetcode/tree/master/problems/reachable-nodes-in-subdivided-graph) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] | Hard | -| 871 | [最低加油次数](https://github.com/openset/leetcode/tree/master/problems/minimum-number-of-refueling-stops) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 864 | [获取所有钥匙的最短路径](https://github.com/openset/leetcode/tree/master/problems/shortest-path-to-get-all-keys) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Hard | -| 857 | [雇佣 K 名工人的最低成本](https://github.com/openset/leetcode/tree/master/problems/minimum-cost-to-hire-k-workers) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] | Hard | -| 818 | [赛车](https://github.com/openset/leetcode/tree/master/problems/race-car) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 787 | [K 站中转内最便宜的航班](https://github.com/openset/leetcode/tree/master/problems/cheapest-flights-within-k-stops) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 786 | [第 K 个最小的素数分数](https://github.com/openset/leetcode/tree/master/problems/k-th-smallest-prime-fraction) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Hard | -| 778 | [水位上升的泳池中游泳](https://github.com/openset/leetcode/tree/master/problems/swim-in-rising-water) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Hard | -| 767 | [重构字符串](https://github.com/openset/leetcode/tree/master/problems/reorganize-string) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 759 | [员工空闲时间](https://github.com/openset/leetcode/tree/master/problems/employee-free-time) 🔒 | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Hard | -| 743 | [网络延迟时间](https://github.com/openset/leetcode/tree/master/problems/network-delay-time) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 719 | [找出第 k 小的距离对](https://github.com/openset/leetcode/tree/master/problems/find-k-th-smallest-pair-distance) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Hard | -| 703 | [数据流中的第K大元素](https://github.com/openset/leetcode/tree/master/problems/kth-largest-element-in-a-stream) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] | Easy | -| 692 | [前K个高频单词](https://github.com/openset/leetcode/tree/master/problems/top-k-frequent-words) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 659 | [分割数组为连续子序列](https://github.com/openset/leetcode/tree/master/problems/split-array-into-consecutive-subsequences) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Medium | -| 502 | [IPO](https://github.com/openset/leetcode/tree/master/problems/ipo) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Hard | -| 451 | [根据字符出现频率排序](https://github.com/openset/leetcode/tree/master/problems/sort-characters-by-frequency) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 407 | [接雨水 II](https://github.com/openset/leetcode/tree/master/problems/trapping-rain-water-ii) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Hard | -| 378 | [有序矩阵中第K小的元素](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-element-in-a-sorted-matrix) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 373 | [查找和最小的K对数字](https://github.com/openset/leetcode/tree/master/problems/find-k-pairs-with-smallest-sums) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] | Medium | -| 358 | [K 距离间隔重排字符串](https://github.com/openset/leetcode/tree/master/problems/rearrange-string-k-distance-apart) 🔒 | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Hard | -| 355 | [设计推特](https://github.com/openset/leetcode/tree/master/problems/design-twitter) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 347 | [前 K 个高频元素](https://github.com/openset/leetcode/tree/master/problems/top-k-frequent-elements) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 313 | [超级丑数](https://github.com/openset/leetcode/tree/master/problems/super-ugly-number) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 295 | [数据流的中位数](https://github.com/openset/leetcode/tree/master/problems/find-median-from-data-stream) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] | Hard | -| 264 | [丑数 II](https://github.com/openset/leetcode/tree/master/problems/ugly-number-ii) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 253 | [会议室 II](https://github.com/openset/leetcode/tree/master/problems/meeting-rooms-ii) 🔒 | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] | Medium | -| 239 | [滑动窗口最大值](https://github.com/openset/leetcode/tree/master/problems/sliding-window-maximum) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Hard | -| 218 | [天际线问题](https://github.com/openset/leetcode/tree/master/problems/the-skyline-problem) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] [[Line Sweep](https://github.com/openset/leetcode/tree/master/tag/line-sweep/README.md)] | Hard | -| 215 | [数组中的第K个最大元素](https://github.com/openset/leetcode/tree/master/problems/kth-largest-element-in-an-array) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Medium | -| 23 | [合并K个排序链表](https://github.com/openset/leetcode/tree/master/problems/merge-k-sorted-lists) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Hard | +| 1054 | [距离相等的条形码](../../problems/distant-barcodes) | [[堆](../heap/README.md)] [[排序](../sort/README.md)] | Medium | +| 1046 | [最后一块石头的重量](../../problems/last-stone-weight) | [[堆](../heap/README.md)] [[贪心算法](../greedy/README.md)] | Easy | +| 973 | [最接近原点的 K 个点](../../problems/k-closest-points-to-origin) | [[堆](../heap/README.md)] [[排序](../sort/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Medium | +| 882 | [细分图中的可到达结点](../../problems/reachable-nodes-in-subdivided-graph) | [[堆](../heap/README.md)] | Hard | +| 871 | [最低加油次数](../../problems/minimum-number-of-refueling-stops) | [[堆](../heap/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 864 | [获取所有钥匙的最短路径](../../problems/shortest-path-to-get-all-keys) | [[堆](../heap/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Hard | +| 857 | [雇佣 K 名工人的最低成本](../../problems/minimum-cost-to-hire-k-workers) | [[堆](../heap/README.md)] | Hard | +| 818 | [赛车](../../problems/race-car) | [[堆](../heap/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 787 | [K 站中转内最便宜的航班](../../problems/cheapest-flights-within-k-stops) | [[堆](../heap/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 786 | [第 K 个最小的素数分数](../../problems/k-th-smallest-prime-fraction) | [[堆](../heap/README.md)] [[二分查找](../binary-search/README.md)] | Hard | +| 778 | [水位上升的泳池中游泳](../../problems/swim-in-rising-water) | [[堆](../heap/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[并查集](../union-find/README.md)] [[二分查找](../binary-search/README.md)] | Hard | +| 767 | [重构字符串](../../problems/reorganize-string) | [[堆](../heap/README.md)] [[贪心算法](../greedy/README.md)] [[排序](../sort/README.md)] [[字符串](../string/README.md)] | Medium | +| 759 | [员工空闲时间](../../problems/employee-free-time) 🔒 | [[堆](../heap/README.md)] [[贪心算法](../greedy/README.md)] | Hard | +| 743 | [网络延迟时间](../../problems/network-delay-time) | [[堆](../heap/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[图](../graph/README.md)] | Medium | +| 719 | [找出第 k 小的距离对](../../problems/find-k-th-smallest-pair-distance) | [[堆](../heap/README.md)] [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] | Hard | +| 703 | [数据流中的第K大元素](../../problems/kth-largest-element-in-a-stream) | [[堆](../heap/README.md)] | Easy | +| 692 | [前K个高频单词](../../problems/top-k-frequent-words) | [[堆](../heap/README.md)] [[字典树](../trie/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 659 | [分割数组为连续子序列](../../problems/split-array-into-consecutive-subsequences) | [[堆](../heap/README.md)] [[贪心算法](../greedy/README.md)] | Medium | +| 502 | [IPO](../../problems/ipo) | [[堆](../heap/README.md)] [[贪心算法](../greedy/README.md)] | Hard | +| 451 | [根据字符出现频率排序](../../problems/sort-characters-by-frequency) | [[堆](../heap/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 407 | [接雨水 II](../../problems/trapping-rain-water-ii) | [[堆](../heap/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Hard | +| 378 | [有序矩阵中第K小的元素](../../problems/kth-smallest-element-in-a-sorted-matrix) | [[堆](../heap/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 373 | [查找和最小的K对数字](../../problems/find-k-pairs-with-smallest-sums) | [[堆](../heap/README.md)] | Medium | +| 358 | [K 距离间隔重排字符串](../../problems/rearrange-string-k-distance-apart) 🔒 | [[堆](../heap/README.md)] [[贪心算法](../greedy/README.md)] [[哈希表](../hash-table/README.md)] | Hard | +| 355 | [设计推特](../../problems/design-twitter) | [[堆](../heap/README.md)] [[设计](../design/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 347 | [前 K 个高频元素](../../problems/top-k-frequent-elements) | [[堆](../heap/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 313 | [超级丑数](../../problems/super-ugly-number) | [[堆](../heap/README.md)] [[数学](../math/README.md)] | Medium | +| 295 | [数据流的中位数](../../problems/find-median-from-data-stream) | [[堆](../heap/README.md)] [[设计](../design/README.md)] | Hard | +| 264 | [丑数 II](../../problems/ugly-number-ii) | [[堆](../heap/README.md)] [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 253 | [会议室 II](../../problems/meeting-rooms-ii) 🔒 | [[堆](../heap/README.md)] [[贪心算法](../greedy/README.md)] [[排序](../sort/README.md)] | Medium | +| 239 | [滑动窗口最大值](../../problems/sliding-window-maximum) | [[堆](../heap/README.md)] [[Sliding Window](../sliding-window/README.md)] | Hard | +| 218 | [天际线问题](../../problems/the-skyline-problem) | [[堆](../heap/README.md)] [[树状数组](../binary-indexed-tree/README.md)] [[线段树](../segment-tree/README.md)] [[分治算法](../divide-and-conquer/README.md)] [[Line Sweep](../line-sweep/README.md)] | Hard | +| 215 | [数组中的第K个最大元素](../../problems/kth-largest-element-in-an-array) | [[堆](../heap/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Medium | +| 23 | [合并K个排序链表](../../problems/merge-k-sorted-lists) | [[堆](../heap/README.md)] [[链表](../linked-list/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Hard | diff --git a/tag/line-sweep/README.md b/tag/line-sweep/README.md index d7e128c21..b72c19577 100644 --- a/tag/line-sweep/README.md +++ b/tag/line-sweep/README.md @@ -5,13 +5,13 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > Line Sweep +## [话题分类](../README.md) > Line Sweep | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 1288 | [删除被覆盖区间](https://github.com/openset/leetcode/tree/master/problems/remove-covered-intervals) | [[Line Sweep](https://github.com/openset/leetcode/tree/master/tag/line-sweep/README.md)] | Medium | -| 1272 | [删除区间](https://github.com/openset/leetcode/tree/master/problems/remove-interval) 🔒 | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[Line Sweep](https://github.com/openset/leetcode/tree/master/tag/line-sweep/README.md)] | Medium | -| 1229 | [安排会议日程](https://github.com/openset/leetcode/tree/master/problems/meeting-scheduler) 🔒 | [[Line Sweep](https://github.com/openset/leetcode/tree/master/tag/line-sweep/README.md)] | Medium | -| 850 | [矩形面积 II](https://github.com/openset/leetcode/tree/master/problems/rectangle-area-ii) | [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[Line Sweep](https://github.com/openset/leetcode/tree/master/tag/line-sweep/README.md)] | Hard | -| 391 | [完美矩形](https://github.com/openset/leetcode/tree/master/problems/perfect-rectangle) | [[Line Sweep](https://github.com/openset/leetcode/tree/master/tag/line-sweep/README.md)] | Hard | -| 218 | [天际线问题](https://github.com/openset/leetcode/tree/master/problems/the-skyline-problem) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] [[Line Sweep](https://github.com/openset/leetcode/tree/master/tag/line-sweep/README.md)] | Hard | +| 1288 | [删除被覆盖区间](../../problems/remove-covered-intervals) | [[Line Sweep](../line-sweep/README.md)] | Medium | +| 1272 | [删除区间](../../problems/remove-interval) 🔒 | [[数学](../math/README.md)] [[Line Sweep](../line-sweep/README.md)] | Medium | +| 1229 | [安排会议日程](../../problems/meeting-scheduler) 🔒 | [[Line Sweep](../line-sweep/README.md)] | Medium | +| 850 | [矩形面积 II](../../problems/rectangle-area-ii) | [[线段树](../segment-tree/README.md)] [[Line Sweep](../line-sweep/README.md)] | Hard | +| 391 | [完美矩形](../../problems/perfect-rectangle) | [[Line Sweep](../line-sweep/README.md)] | Hard | +| 218 | [天际线问题](../../problems/the-skyline-problem) | [[堆](../heap/README.md)] [[树状数组](../binary-indexed-tree/README.md)] [[线段树](../segment-tree/README.md)] [[分治算法](../divide-and-conquer/README.md)] [[Line Sweep](../line-sweep/README.md)] | Hard | diff --git a/tag/linked-list/README.md b/tag/linked-list/README.md index 1549bc29b..20c3c937c 100644 --- a/tag/linked-list/README.md +++ b/tag/linked-list/README.md @@ -5,44 +5,44 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > 链表 +## [话题分类](../README.md) > 链表 | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 1290 | [二进制链表转整数](https://github.com/openset/leetcode/tree/master/problems/convert-binary-number-in-a-linked-list-to-integer) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Easy | -| 1171 | [从链表中删去总和值为零的连续节点](https://github.com/openset/leetcode/tree/master/problems/remove-zero-sum-consecutive-nodes-from-linked-list) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Medium | -| 1019 | [链表中的下一个更大节点](https://github.com/openset/leetcode/tree/master/problems/next-greater-node-in-linked-list) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Medium | -| 876 | [链表的中间结点](https://github.com/openset/leetcode/tree/master/problems/middle-of-the-linked-list) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Easy | -| 817 | [链表组件](https://github.com/openset/leetcode/tree/master/problems/linked-list-components) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Medium | -| 725 | [分隔链表](https://github.com/openset/leetcode/tree/master/problems/split-linked-list-in-parts) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Medium | -| 708 | [循环有序列表的插入](https://github.com/openset/leetcode/tree/master/problems/insert-into-a-sorted-circular-linked-list) 🔒 | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Medium | -| 707 | [设计链表](https://github.com/openset/leetcode/tree/master/problems/design-linked-list) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Medium | -| 445 | [两数相加 II](https://github.com/openset/leetcode/tree/master/problems/add-two-numbers-ii) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Medium | -| 430 | [扁平化多级双向链表](https://github.com/openset/leetcode/tree/master/problems/flatten-a-multilevel-doubly-linked-list) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Medium | -| 426 | [将二叉搜索树转化为排序的双向链表](https://github.com/openset/leetcode/tree/master/problems/convert-binary-search-tree-to-sorted-doubly-linked-list) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Medium | -| 379 | [电话目录管理系统](https://github.com/openset/leetcode/tree/master/problems/design-phone-directory) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Medium | -| 369 | [给单链表加一](https://github.com/openset/leetcode/tree/master/problems/plus-one-linked-list) 🔒 | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Medium | -| 328 | [奇偶链表](https://github.com/openset/leetcode/tree/master/problems/odd-even-linked-list) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Medium | -| 237 | [删除链表中的节点](https://github.com/openset/leetcode/tree/master/problems/delete-node-in-a-linked-list) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Easy | -| 234 | [回文链表](https://github.com/openset/leetcode/tree/master/problems/palindrome-linked-list) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Easy | -| 206 | [反转链表](https://github.com/openset/leetcode/tree/master/problems/reverse-linked-list) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Easy | -| 203 | [移除链表元素](https://github.com/openset/leetcode/tree/master/problems/remove-linked-list-elements) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Easy | -| 160 | [相交链表](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-linked-lists) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Easy | -| 148 | [排序链表](https://github.com/openset/leetcode/tree/master/problems/sort-list) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Medium | -| 147 | [对链表进行插入排序](https://github.com/openset/leetcode/tree/master/problems/insertion-sort-list) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Medium | -| 143 | [重排链表](https://github.com/openset/leetcode/tree/master/problems/reorder-list) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Medium | -| 142 | [环形链表 II](https://github.com/openset/leetcode/tree/master/problems/linked-list-cycle-ii) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 141 | [环形链表](https://github.com/openset/leetcode/tree/master/problems/linked-list-cycle) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Easy | -| 138 | [复制带随机指针的链表](https://github.com/openset/leetcode/tree/master/problems/copy-list-with-random-pointer) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Medium | -| 109 | [有序链表转换二叉搜索树](https://github.com/openset/leetcode/tree/master/problems/convert-sorted-list-to-binary-search-tree) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Medium | -| 92 | [反转链表 II](https://github.com/openset/leetcode/tree/master/problems/reverse-linked-list-ii) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Medium | -| 86 | [分隔链表](https://github.com/openset/leetcode/tree/master/problems/partition-list) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 83 | [删除排序链表中的重复元素](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-list) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Easy | -| 82 | [删除排序链表中的重复元素 II](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-list-ii) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Medium | -| 61 | [旋转链表](https://github.com/openset/leetcode/tree/master/problems/rotate-list) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 25 | [K 个一组翻转链表](https://github.com/openset/leetcode/tree/master/problems/reverse-nodes-in-k-group) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Hard | -| 24 | [两两交换链表中的节点](https://github.com/openset/leetcode/tree/master/problems/swap-nodes-in-pairs) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Medium | -| 23 | [合并K个排序链表](https://github.com/openset/leetcode/tree/master/problems/merge-k-sorted-lists) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Hard | -| 21 | [合并两个有序链表](https://github.com/openset/leetcode/tree/master/problems/merge-two-sorted-lists) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Easy | -| 19 | [删除链表的倒数第N个节点](https://github.com/openset/leetcode/tree/master/problems/remove-nth-node-from-end-of-list) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 2 | [两数相加](https://github.com/openset/leetcode/tree/master/problems/add-two-numbers) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | +| 1290 | [二进制链表转整数](../../problems/convert-binary-number-in-a-linked-list-to-integer) | [[位运算](../bit-manipulation/README.md)] [[链表](../linked-list/README.md)] | Easy | +| 1171 | [从链表中删去总和值为零的连续节点](../../problems/remove-zero-sum-consecutive-nodes-from-linked-list) | [[链表](../linked-list/README.md)] | Medium | +| 1019 | [链表中的下一个更大节点](../../problems/next-greater-node-in-linked-list) | [[栈](../stack/README.md)] [[链表](../linked-list/README.md)] | Medium | +| 876 | [链表的中间结点](../../problems/middle-of-the-linked-list) | [[链表](../linked-list/README.md)] | Easy | +| 817 | [链表组件](../../problems/linked-list-components) | [[链表](../linked-list/README.md)] | Medium | +| 725 | [分隔链表](../../problems/split-linked-list-in-parts) | [[链表](../linked-list/README.md)] | Medium | +| 708 | [循环有序列表的插入](../../problems/insert-into-a-sorted-circular-linked-list) 🔒 | [[链表](../linked-list/README.md)] | Medium | +| 707 | [设计链表](../../problems/design-linked-list) | [[设计](../design/README.md)] [[链表](../linked-list/README.md)] | Medium | +| 445 | [两数相加 II](../../problems/add-two-numbers-ii) | [[链表](../linked-list/README.md)] | Medium | +| 430 | [扁平化多级双向链表](../../problems/flatten-a-multilevel-doubly-linked-list) | [[深度优先搜索](../depth-first-search/README.md)] [[链表](../linked-list/README.md)] | Medium | +| 426 | [将二叉搜索树转化为排序的双向链表](../../problems/convert-binary-search-tree-to-sorted-doubly-linked-list) 🔒 | [[树](../tree/README.md)] [[链表](../linked-list/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Medium | +| 379 | [电话目录管理系统](../../problems/design-phone-directory) 🔒 | [[设计](../design/README.md)] [[链表](../linked-list/README.md)] | Medium | +| 369 | [给单链表加一](../../problems/plus-one-linked-list) 🔒 | [[链表](../linked-list/README.md)] | Medium | +| 328 | [奇偶链表](../../problems/odd-even-linked-list) | [[链表](../linked-list/README.md)] | Medium | +| 237 | [删除链表中的节点](../../problems/delete-node-in-a-linked-list) | [[链表](../linked-list/README.md)] | Easy | +| 234 | [回文链表](../../problems/palindrome-linked-list) | [[链表](../linked-list/README.md)] [[双指针](../two-pointers/README.md)] | Easy | +| 206 | [反转链表](../../problems/reverse-linked-list) | [[链表](../linked-list/README.md)] | Easy | +| 203 | [移除链表元素](../../problems/remove-linked-list-elements) | [[链表](../linked-list/README.md)] | Easy | +| 160 | [相交链表](../../problems/intersection-of-two-linked-lists) | [[链表](../linked-list/README.md)] | Easy | +| 148 | [排序链表](../../problems/sort-list) | [[排序](../sort/README.md)] [[链表](../linked-list/README.md)] | Medium | +| 147 | [对链表进行插入排序](../../problems/insertion-sort-list) | [[排序](../sort/README.md)] [[链表](../linked-list/README.md)] | Medium | +| 143 | [重排链表](../../problems/reorder-list) | [[链表](../linked-list/README.md)] | Medium | +| 142 | [环形链表 II](../../problems/linked-list-cycle-ii) | [[链表](../linked-list/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 141 | [环形链表](../../problems/linked-list-cycle) | [[链表](../linked-list/README.md)] [[双指针](../two-pointers/README.md)] | Easy | +| 138 | [复制带随机指针的链表](../../problems/copy-list-with-random-pointer) | [[哈希表](../hash-table/README.md)] [[链表](../linked-list/README.md)] | Medium | +| 109 | [有序链表转换二叉搜索树](../../problems/convert-sorted-list-to-binary-search-tree) | [[深度优先搜索](../depth-first-search/README.md)] [[链表](../linked-list/README.md)] | Medium | +| 92 | [反转链表 II](../../problems/reverse-linked-list-ii) | [[链表](../linked-list/README.md)] | Medium | +| 86 | [分隔链表](../../problems/partition-list) | [[链表](../linked-list/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 83 | [删除排序链表中的重复元素](../../problems/remove-duplicates-from-sorted-list) | [[链表](../linked-list/README.md)] | Easy | +| 82 | [删除排序链表中的重复元素 II](../../problems/remove-duplicates-from-sorted-list-ii) | [[链表](../linked-list/README.md)] | Medium | +| 61 | [旋转链表](../../problems/rotate-list) | [[链表](../linked-list/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 25 | [K 个一组翻转链表](../../problems/reverse-nodes-in-k-group) | [[链表](../linked-list/README.md)] | Hard | +| 24 | [两两交换链表中的节点](../../problems/swap-nodes-in-pairs) | [[链表](../linked-list/README.md)] | Medium | +| 23 | [合并K个排序链表](../../problems/merge-k-sorted-lists) | [[堆](../heap/README.md)] [[链表](../linked-list/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Hard | +| 21 | [合并两个有序链表](../../problems/merge-two-sorted-lists) | [[链表](../linked-list/README.md)] | Easy | +| 19 | [删除链表的倒数第N个节点](../../problems/remove-nth-node-from-end-of-list) | [[链表](../linked-list/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 2 | [两数相加](../../problems/add-two-numbers) | [[链表](../linked-list/README.md)] [[数学](../math/README.md)] | Medium | diff --git a/tag/math/README.md b/tag/math/README.md index eedbb5392..2ca06bfff 100644 --- a/tag/math/README.md +++ b/tag/math/README.md @@ -5,170 +5,170 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > 数学 +## [话题分类](../README.md) > 数学 | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 1281 | [整数的各位积和之差](https://github.com/openset/leetcode/tree/master/problems/subtract-the-product-and-sum-of-digits-of-an-integer) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 1276 | [不浪费原料的汉堡制作方案](https://github.com/openset/leetcode/tree/master/problems/number-of-burgers-with-no-waste-of-ingredients) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 1272 | [删除区间](https://github.com/openset/leetcode/tree/master/problems/remove-interval) 🔒 | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[Line Sweep](https://github.com/openset/leetcode/tree/master/tag/line-sweep/README.md)] | Medium | -| 1271 | [十六进制魔术数字](https://github.com/openset/leetcode/tree/master/problems/hexspeak) 🔒 | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 1259 | [不相交的握手](https://github.com/openset/leetcode/tree/master/problems/handshakes-that-dont-cross) 🔒 | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 1256 | [加密数字](https://github.com/openset/leetcode/tree/master/problems/encode-number) 🔒 | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 1253 | [重构 2 行二进制矩阵](https://github.com/openset/leetcode/tree/master/problems/reconstruct-a-2-row-binary-matrix) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 1250 | [检查「好数组」](https://github.com/openset/leetcode/tree/master/problems/check-if-it-is-a-good-array) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Hard | -| 1238 | [循环码排列](https://github.com/openset/leetcode/tree/master/problems/circular-permutation-in-binary-representation) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 1237 | [找出给定方程的正整数解](https://github.com/openset/leetcode/tree/master/problems/find-positive-integer-solution-for-a-given-equation) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Easy | -| 1232 | [缀点成线](https://github.com/openset/leetcode/tree/master/problems/check-if-it-is-a-straight-line) | [[几何](https://github.com/openset/leetcode/tree/master/tag/geometry/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 1230 | [抛掷硬币](https://github.com/openset/leetcode/tree/master/problems/toss-strange-coins) 🔒 | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 1228 | [等差数列中缺失的数字](https://github.com/openset/leetcode/tree/master/problems/missing-number-in-arithmetic-progression) 🔒 | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 1227 | [飞机座位分配概率](https://github.com/openset/leetcode/tree/master/problems/airplane-seat-assignment-probability) | [[脑筋急转弯](https://github.com/openset/leetcode/tree/master/tag/brainteaser/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 1218 | [最长定差子序列](https://github.com/openset/leetcode/tree/master/problems/longest-arithmetic-subsequence-of-given-difference) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 1217 | [玩筹码](https://github.com/openset/leetcode/tree/master/problems/play-with-chips) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 1201 | [丑数 III](https://github.com/openset/leetcode/tree/master/problems/ugly-number-iii) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 1199 | [建造街区的最短时间](https://github.com/openset/leetcode/tree/master/problems/minimum-time-to-build-blocks) 🔒 | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 1183 | [矩阵中 1 的最大数量](https://github.com/openset/leetcode/tree/master/problems/maximum-number-of-ones) 🔒 | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Hard | -| 1180 | [统计只含单一字母的子串](https://github.com/openset/leetcode/tree/master/problems/count-substrings-with-only-one-distinct-letter) 🔒 | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 1175 | [质数排列](https://github.com/openset/leetcode/tree/master/problems/prime-arrangements) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 1154 | [一年中的第几天](https://github.com/openset/leetcode/tree/master/problems/day-of-the-year) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 1134 | [阿姆斯特朗数](https://github.com/openset/leetcode/tree/master/problems/armstrong-number) 🔒 | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 1131 | [绝对值表达式的最大值](https://github.com/openset/leetcode/tree/master/problems/maximum-of-absolute-value-expression) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 1121 | [将数组分成几个递增序列](https://github.com/openset/leetcode/tree/master/problems/divide-array-into-increasing-sequences) 🔒 | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Hard | -| 1109 | [航班预订统计](https://github.com/openset/leetcode/tree/master/problems/corporate-flight-bookings) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 1104 | [二叉树寻路](https://github.com/openset/leetcode/tree/master/problems/path-in-zigzag-labelled-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 1103 | [分糖果 II](https://github.com/openset/leetcode/tree/master/problems/distribute-candies-to-people) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 1093 | [大样本统计](https://github.com/openset/leetcode/tree/master/problems/statistics-from-a-large-sample) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 1088 | [易混淆数 II](https://github.com/openset/leetcode/tree/master/problems/confusing-number-ii) 🔒 | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | -| 1073 | [负二进制数相加](https://github.com/openset/leetcode/tree/master/problems/adding-two-negabinary-numbers) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 1067 | [范围内的数字计数](https://github.com/openset/leetcode/tree/master/problems/digit-count-in-range) 🔒 | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 1058 | [最小化舍入误差以满足目标](https://github.com/openset/leetcode/tree/master/problems/minimize-rounding-error-to-meet-target) 🔒 | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 1056 | [易混淆数](https://github.com/openset/leetcode/tree/master/problems/confusing-number) 🔒 | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 1041 | [困于环中的机器人](https://github.com/openset/leetcode/tree/master/problems/robot-bounded-in-circle) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 1037 | [有效的回旋镖](https://github.com/openset/leetcode/tree/master/problems/valid-boomerang) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 1025 | [除数博弈](https://github.com/openset/leetcode/tree/master/problems/divisor-game) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Easy | -| 1017 | [负二进制转换](https://github.com/openset/leetcode/tree/master/problems/convert-to-base-2) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 1015 | [可被 K 整除的最小整数](https://github.com/openset/leetcode/tree/master/problems/smallest-integer-divisible-by-k) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 1012 | [至少有 1 位重复的数字](https://github.com/openset/leetcode/tree/master/problems/numbers-with-repeated-digits) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 1009 | [十进制整数的反码](https://github.com/openset/leetcode/tree/master/problems/complement-of-base-10-integer) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 1006 | [笨阶乘](https://github.com/openset/leetcode/tree/master/problems/clumsy-factorial) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 996 | [正方形数组的数目](https://github.com/openset/leetcode/tree/master/problems/number-of-squareful-arrays) | [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | -| 991 | [坏了的计算器](https://github.com/openset/leetcode/tree/master/problems/broken-calculator) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 976 | [三角形的最大周长](https://github.com/openset/leetcode/tree/master/problems/largest-perimeter-triangle) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 972 | [相等的有理数](https://github.com/openset/leetcode/tree/master/problems/equal-rational-numbers) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Hard | -| 970 | [强整数](https://github.com/openset/leetcode/tree/master/problems/powerful-integers) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 964 | [表示数字的最少运算符](https://github.com/openset/leetcode/tree/master/problems/least-operators-to-express-number) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 963 | [最小面积矩形 II](https://github.com/openset/leetcode/tree/master/problems/minimum-area-rectangle-ii) | [[几何](https://github.com/openset/leetcode/tree/master/tag/geometry/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 952 | [按公因数计算最大组件大小](https://github.com/openset/leetcode/tree/master/problems/largest-component-size-by-common-factor) | [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Hard | -| 949 | [给定数字能组成的最大时间](https://github.com/openset/leetcode/tree/master/problems/largest-time-for-given-digits) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 942 | [增减字符串匹配](https://github.com/openset/leetcode/tree/master/problems/di-string-match) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 927 | [三等分](https://github.com/openset/leetcode/tree/master/problems/three-equal-parts) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Hard | -| 914 | [卡牌分组](https://github.com/openset/leetcode/tree/master/problems/x-of-a-kind-in-a-deck-of-cards) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 910 | [最小差值 II](https://github.com/openset/leetcode/tree/master/problems/smallest-range-ii) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 908 | [最小差值 I](https://github.com/openset/leetcode/tree/master/problems/smallest-range-i) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 906 | [超级回文数](https://github.com/openset/leetcode/tree/master/problems/super-palindromes) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Hard | -| 902 | [最大为 N 的数字组合](https://github.com/openset/leetcode/tree/master/problems/numbers-at-most-n-given-digit-set) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 899 | [有序队列](https://github.com/openset/leetcode/tree/master/problems/orderly-queue) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 892 | [三维形体的表面积](https://github.com/openset/leetcode/tree/master/problems/surface-area-of-3d-shapes) | [[几何](https://github.com/openset/leetcode/tree/master/tag/geometry/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 891 | [子序列宽度之和](https://github.com/openset/leetcode/tree/master/problems/sum-of-subsequence-widths) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Hard | -| 887 | [鸡蛋掉落](https://github.com/openset/leetcode/tree/master/problems/super-egg-drop) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 885 | [螺旋矩阵 III](https://github.com/openset/leetcode/tree/master/problems/spiral-matrix-iii) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 883 | [三维形体投影面积](https://github.com/openset/leetcode/tree/master/problems/projection-area-of-3d-shapes) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 878 | [第 N 个神奇数字](https://github.com/openset/leetcode/tree/master/problems/nth-magical-number) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Hard | -| 877 | [石子游戏](https://github.com/openset/leetcode/tree/master/problems/stone-game) | [[极小化极大](https://github.com/openset/leetcode/tree/master/tag/minimax/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 869 | [重新排序得到 2 的幂](https://github.com/openset/leetcode/tree/master/problems/reordered-power-of-2) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 868 | [二进制间距](https://github.com/openset/leetcode/tree/master/problems/binary-gap) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 866 | [回文素数](https://github.com/openset/leetcode/tree/master/problems/prime-palindrome) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 858 | [镜面反射](https://github.com/openset/leetcode/tree/master/problems/mirror-reflection) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 836 | [矩形重叠](https://github.com/openset/leetcode/tree/master/problems/rectangle-overlap) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 829 | [连续整数求和](https://github.com/openset/leetcode/tree/master/problems/consecutive-numbers-sum) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Hard | -| 812 | [最大三角形面积](https://github.com/openset/leetcode/tree/master/problems/largest-triangle-area) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 810 | [黑板异或游戏](https://github.com/openset/leetcode/tree/master/problems/chalkboard-xor-game) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Hard | -| 805 | [数组的均值分割](https://github.com/openset/leetcode/tree/master/problems/split-array-with-same-average) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Hard | -| 800 | [相似 RGB 颜色](https://github.com/openset/leetcode/tree/master/problems/similar-rgb-color) 🔒 | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 794 | [有效的井字游戏](https://github.com/openset/leetcode/tree/master/problems/valid-tic-tac-toe-state) | [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 789 | [逃脱阻碍者](https://github.com/openset/leetcode/tree/master/problems/escape-the-ghosts) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 782 | [变为棋盘](https://github.com/openset/leetcode/tree/master/problems/transform-to-chessboard) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Hard | -| 781 | [森林中的兔子](https://github.com/openset/leetcode/tree/master/problems/rabbits-in-forest) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 780 | [到达终点](https://github.com/openset/leetcode/tree/master/problems/reaching-points) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Hard | -| 775 | [全局倒置与局部倒置](https://github.com/openset/leetcode/tree/master/problems/global-and-local-inversions) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 754 | [到达终点数字](https://github.com/openset/leetcode/tree/master/problems/reach-a-number) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 753 | [破解保险箱](https://github.com/openset/leetcode/tree/master/problems/cracking-the-safe) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Hard | -| 728 | [自除数](https://github.com/openset/leetcode/tree/master/problems/self-dividing-numbers) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 672 | [灯泡开关 Ⅱ](https://github.com/openset/leetcode/tree/master/problems/bulb-switcher-ii) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 670 | [最大交换](https://github.com/openset/leetcode/tree/master/problems/maximum-swap) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 660 | [移除 9](https://github.com/openset/leetcode/tree/master/problems/remove-9) 🔒 | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Hard | -| 651 | [4键键盘](https://github.com/openset/leetcode/tree/master/problems/4-keys-keyboard) 🔒 | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 645 | [错误的集合](https://github.com/openset/leetcode/tree/master/problems/set-mismatch) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 640 | [求解方程](https://github.com/openset/leetcode/tree/master/problems/solve-the-equation) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 634 | [寻找数组的错位排列](https://github.com/openset/leetcode/tree/master/problems/find-the-derangement-of-an-array) 🔒 | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 633 | [平方数之和](https://github.com/openset/leetcode/tree/master/problems/sum-of-square-numbers) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 628 | [三个数的最大乘积](https://github.com/openset/leetcode/tree/master/problems/maximum-product-of-three-numbers) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 625 | [最小因式分解](https://github.com/openset/leetcode/tree/master/problems/minimum-factorization) 🔒 | [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 598 | [范围求和 II](https://github.com/openset/leetcode/tree/master/problems/range-addition-ii) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 593 | [有效的正方形](https://github.com/openset/leetcode/tree/master/problems/valid-square) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 592 | [分数加减运算](https://github.com/openset/leetcode/tree/master/problems/fraction-addition-and-subtraction) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 573 | [松鼠模拟](https://github.com/openset/leetcode/tree/master/problems/squirrel-simulation) 🔒 | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 553 | [最优除法](https://github.com/openset/leetcode/tree/master/problems/optimal-division) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 537 | [复数乘法](https://github.com/openset/leetcode/tree/master/problems/complex-number-multiplication) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 535 | [TinyURL 的加密与解密](https://github.com/openset/leetcode/tree/master/problems/encode-and-decode-tinyurl) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 523 | [连续的子数组和](https://github.com/openset/leetcode/tree/master/problems/continuous-subarray-sum) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 517 | [超级洗衣机](https://github.com/openset/leetcode/tree/master/problems/super-washing-machines) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 507 | [完美数](https://github.com/openset/leetcode/tree/master/problems/perfect-number) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 483 | [最小好进制](https://github.com/openset/leetcode/tree/master/problems/smallest-good-base) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Hard | -| 478 | [在圆内随机生成点](https://github.com/openset/leetcode/tree/master/problems/generate-random-point-in-a-circle) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[Random](https://github.com/openset/leetcode/tree/master/tag/random/README.md)] [[Rejection Sampling](https://github.com/openset/leetcode/tree/master/tag/rejection-sampling/README.md)] | Medium | -| 469 | [凸多边形](https://github.com/openset/leetcode/tree/master/problems/convex-polygon) 🔒 | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 462 | [最少移动次数使数组元素相等 II](https://github.com/openset/leetcode/tree/master/problems/minimum-moves-to-equal-array-elements-ii) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 458 | [可怜的小猪](https://github.com/openset/leetcode/tree/master/problems/poor-pigs) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Hard | -| 453 | [最小移动次数使数组元素相等](https://github.com/openset/leetcode/tree/master/problems/minimum-moves-to-equal-array-elements) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 441 | [排列硬币](https://github.com/openset/leetcode/tree/master/problems/arranging-coins) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Easy | -| 423 | [从英文中重建数字](https://github.com/openset/leetcode/tree/master/problems/reconstruct-original-digits-from-english) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 413 | [等差数列划分](https://github.com/openset/leetcode/tree/master/problems/arithmetic-slices) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 400 | [第N个数字](https://github.com/openset/leetcode/tree/master/problems/nth-digit) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 397 | [整数替换](https://github.com/openset/leetcode/tree/master/problems/integer-replacement) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 396 | [旋转函数](https://github.com/openset/leetcode/tree/master/problems/rotate-function) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 372 | [超级次方](https://github.com/openset/leetcode/tree/master/problems/super-pow) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 368 | [最大整除子集](https://github.com/openset/leetcode/tree/master/problems/largest-divisible-subset) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 367 | [有效的完全平方数](https://github.com/openset/leetcode/tree/master/problems/valid-perfect-square) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Easy | -| 365 | [水壶问题](https://github.com/openset/leetcode/tree/master/problems/water-and-jug-problem) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 360 | [有序转化数组](https://github.com/openset/leetcode/tree/master/problems/sort-transformed-array) 🔒 | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 357 | [计算各个位数不同的数字个数](https://github.com/openset/leetcode/tree/master/problems/count-numbers-with-unique-digits) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 356 | [直线镜像](https://github.com/openset/leetcode/tree/master/problems/line-reflection) 🔒 | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 343 | [整数拆分](https://github.com/openset/leetcode/tree/master/problems/integer-break) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 335 | [路径交叉](https://github.com/openset/leetcode/tree/master/problems/self-crossing) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Hard | -| 326 | [3的幂](https://github.com/openset/leetcode/tree/master/problems/power-of-three) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 319 | [灯泡开关](https://github.com/openset/leetcode/tree/master/problems/bulb-switcher) | [[脑筋急转弯](https://github.com/openset/leetcode/tree/master/tag/brainteaser/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 313 | [超级丑数](https://github.com/openset/leetcode/tree/master/problems/super-ugly-number) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 296 | [最佳的碰头地点](https://github.com/openset/leetcode/tree/master/problems/best-meeting-point) 🔒 | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Hard | -| 279 | [完全平方数](https://github.com/openset/leetcode/tree/master/problems/perfect-squares) | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 273 | [整数转换英文表示](https://github.com/openset/leetcode/tree/master/problems/integer-to-english-words) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 268 | [缺失数字](https://github.com/openset/leetcode/tree/master/problems/missing-number) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 264 | [丑数 II](https://github.com/openset/leetcode/tree/master/problems/ugly-number-ii) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 263 | [丑数](https://github.com/openset/leetcode/tree/master/problems/ugly-number) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 258 | [各位相加](https://github.com/openset/leetcode/tree/master/problems/add-digits) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 248 | [中心对称数 III](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number-iii) 🔒 | [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Hard | -| 247 | [中心对称数 II](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number-ii) 🔒 | [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 246 | [中心对称数](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number) 🔒 | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 233 | [数字 1 的个数](https://github.com/openset/leetcode/tree/master/problems/number-of-digit-one) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Hard | -| 231 | [2的幂](https://github.com/openset/leetcode/tree/master/problems/power-of-two) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 224 | [基本计算器](https://github.com/openset/leetcode/tree/master/problems/basic-calculator) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Hard | -| 223 | [矩形面积](https://github.com/openset/leetcode/tree/master/problems/rectangle-area) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 204 | [计数质数](https://github.com/openset/leetcode/tree/master/problems/count-primes) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 202 | [快乐数](https://github.com/openset/leetcode/tree/master/problems/happy-number) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 172 | [阶乘后的零](https://github.com/openset/leetcode/tree/master/problems/factorial-trailing-zeroes) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 171 | [Excel表列序号](https://github.com/openset/leetcode/tree/master/problems/excel-sheet-column-number) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 168 | [Excel表列名称](https://github.com/openset/leetcode/tree/master/problems/excel-sheet-column-title) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 166 | [分数到小数](https://github.com/openset/leetcode/tree/master/problems/fraction-to-recurring-decimal) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 149 | [直线上最多的点数](https://github.com/openset/leetcode/tree/master/problems/max-points-on-a-line) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Hard | -| 69 | [x 的平方根](https://github.com/openset/leetcode/tree/master/problems/sqrtx) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Easy | -| 67 | [二进制求和](https://github.com/openset/leetcode/tree/master/problems/add-binary) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 65 | [有效数字](https://github.com/openset/leetcode/tree/master/problems/valid-number) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 60 | [第k个排列](https://github.com/openset/leetcode/tree/master/problems/permutation-sequence) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 50 | [Pow(x, n)](https://github.com/openset/leetcode/tree/master/problems/powx-n) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 43 | [字符串相乘](https://github.com/openset/leetcode/tree/master/problems/multiply-strings) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 29 | [两数相除](https://github.com/openset/leetcode/tree/master/problems/divide-two-integers) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 13 | [罗马数字转整数](https://github.com/openset/leetcode/tree/master/problems/roman-to-integer) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 12 | [整数转罗马数字](https://github.com/openset/leetcode/tree/master/problems/integer-to-roman) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 9 | [回文数](https://github.com/openset/leetcode/tree/master/problems/palindrome-number) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 8 | [字符串转换整数 (atoi)](https://github.com/openset/leetcode/tree/master/problems/string-to-integer-atoi) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 7 | [整数反转](https://github.com/openset/leetcode/tree/master/problems/reverse-integer) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 2 | [两数相加](https://github.com/openset/leetcode/tree/master/problems/add-two-numbers) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | +| 1281 | [整数的各位积和之差](../../problems/subtract-the-product-and-sum-of-digits-of-an-integer) | [[数学](../math/README.md)] | Easy | +| 1276 | [不浪费原料的汉堡制作方案](../../problems/number-of-burgers-with-no-waste-of-ingredients) | [[贪心算法](../greedy/README.md)] [[数学](../math/README.md)] | Medium | +| 1272 | [删除区间](../../problems/remove-interval) 🔒 | [[数学](../math/README.md)] [[Line Sweep](../line-sweep/README.md)] | Medium | +| 1271 | [十六进制魔术数字](../../problems/hexspeak) 🔒 | [[数学](../math/README.md)] [[字符串](../string/README.md)] | Easy | +| 1259 | [不相交的握手](../../problems/handshakes-that-dont-cross) 🔒 | [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 1256 | [加密数字](../../problems/encode-number) 🔒 | [[位运算](../bit-manipulation/README.md)] [[数学](../math/README.md)] | Medium | +| 1253 | [重构 2 行二进制矩阵](../../problems/reconstruct-a-2-row-binary-matrix) | [[贪心算法](../greedy/README.md)] [[数学](../math/README.md)] | Medium | +| 1250 | [检查「好数组」](../../problems/check-if-it-is-a-good-array) | [[数学](../math/README.md)] | Hard | +| 1238 | [循环码排列](../../problems/circular-permutation-in-binary-representation) | [[数学](../math/README.md)] | Medium | +| 1237 | [找出给定方程的正整数解](../../problems/find-positive-integer-solution-for-a-given-equation) | [[数学](../math/README.md)] [[二分查找](../binary-search/README.md)] | Easy | +| 1232 | [缀点成线](../../problems/check-if-it-is-a-straight-line) | [[几何](../geometry/README.md)] [[数组](../array/README.md)] [[数学](../math/README.md)] | Easy | +| 1230 | [抛掷硬币](../../problems/toss-strange-coins) 🔒 | [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 1228 | [等差数列中缺失的数字](../../problems/missing-number-in-arithmetic-progression) 🔒 | [[数学](../math/README.md)] | Easy | +| 1227 | [飞机座位分配概率](../../problems/airplane-seat-assignment-probability) | [[脑筋急转弯](../brainteaser/README.md)] [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 1218 | [最长定差子序列](../../problems/longest-arithmetic-subsequence-of-given-difference) | [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 1217 | [玩筹码](../../problems/play-with-chips) | [[贪心算法](../greedy/README.md)] [[数组](../array/README.md)] [[数学](../math/README.md)] | Easy | +| 1201 | [丑数 III](../../problems/ugly-number-iii) | [[数学](../math/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 1199 | [建造街区的最短时间](../../problems/minimum-time-to-build-blocks) 🔒 | [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 1183 | [矩阵中 1 的最大数量](../../problems/maximum-number-of-ones) 🔒 | [[排序](../sort/README.md)] [[数学](../math/README.md)] | Hard | +| 1180 | [统计只含单一字母的子串](../../problems/count-substrings-with-only-one-distinct-letter) 🔒 | [[数学](../math/README.md)] [[字符串](../string/README.md)] | Easy | +| 1175 | [质数排列](../../problems/prime-arrangements) | [[数学](../math/README.md)] | Easy | +| 1154 | [一年中的第几天](../../problems/day-of-the-year) | [[数学](../math/README.md)] | Easy | +| 1134 | [阿姆斯特朗数](../../problems/armstrong-number) 🔒 | [[数学](../math/README.md)] | Easy | +| 1131 | [绝对值表达式的最大值](../../problems/maximum-of-absolute-value-expression) | [[位运算](../bit-manipulation/README.md)] [[数学](../math/README.md)] | Medium | +| 1121 | [将数组分成几个递增序列](../../problems/divide-array-into-increasing-sequences) 🔒 | [[数学](../math/README.md)] | Hard | +| 1109 | [航班预订统计](../../problems/corporate-flight-bookings) | [[数组](../array/README.md)] [[数学](../math/README.md)] | Medium | +| 1104 | [二叉树寻路](../../problems/path-in-zigzag-labelled-binary-tree) | [[树](../tree/README.md)] [[数学](../math/README.md)] | Medium | +| 1103 | [分糖果 II](../../problems/distribute-candies-to-people) | [[数学](../math/README.md)] | Easy | +| 1093 | [大样本统计](../../problems/statistics-from-a-large-sample) | [[数学](../math/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 1088 | [易混淆数 II](../../problems/confusing-number-ii) 🔒 | [[数学](../math/README.md)] [[回溯算法](../backtracking/README.md)] | Hard | +| 1073 | [负二进制数相加](../../problems/adding-two-negabinary-numbers) | [[数学](../math/README.md)] | Medium | +| 1067 | [范围内的数字计数](../../problems/digit-count-in-range) 🔒 | [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 1058 | [最小化舍入误差以满足目标](../../problems/minimize-rounding-error-to-meet-target) 🔒 | [[贪心算法](../greedy/README.md)] [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 1056 | [易混淆数](../../problems/confusing-number) 🔒 | [[数学](../math/README.md)] | Easy | +| 1041 | [困于环中的机器人](../../problems/robot-bounded-in-circle) | [[数学](../math/README.md)] | Medium | +| 1037 | [有效的回旋镖](../../problems/valid-boomerang) | [[数学](../math/README.md)] | Easy | +| 1025 | [除数博弈](../../problems/divisor-game) | [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Easy | +| 1017 | [负二进制转换](../../problems/convert-to-base-2) | [[数学](../math/README.md)] | Medium | +| 1015 | [可被 K 整除的最小整数](../../problems/smallest-integer-divisible-by-k) | [[数学](../math/README.md)] | Medium | +| 1012 | [至少有 1 位重复的数字](../../problems/numbers-with-repeated-digits) | [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 1009 | [十进制整数的反码](../../problems/complement-of-base-10-integer) | [[数学](../math/README.md)] | Easy | +| 1006 | [笨阶乘](../../problems/clumsy-factorial) | [[数学](../math/README.md)] | Medium | +| 996 | [正方形数组的数目](../../problems/number-of-squareful-arrays) | [[图](../graph/README.md)] [[数学](../math/README.md)] [[回溯算法](../backtracking/README.md)] | Hard | +| 991 | [坏了的计算器](../../problems/broken-calculator) | [[贪心算法](../greedy/README.md)] [[数学](../math/README.md)] | Medium | +| 976 | [三角形的最大周长](../../problems/largest-perimeter-triangle) | [[排序](../sort/README.md)] [[数学](../math/README.md)] | Easy | +| 972 | [相等的有理数](../../problems/equal-rational-numbers) | [[数学](../math/README.md)] | Hard | +| 970 | [强整数](../../problems/powerful-integers) | [[哈希表](../hash-table/README.md)] [[数学](../math/README.md)] | Easy | +| 964 | [表示数字的最少运算符](../../problems/least-operators-to-express-number) | [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 963 | [最小面积矩形 II](../../problems/minimum-area-rectangle-ii) | [[几何](../geometry/README.md)] [[数学](../math/README.md)] | Medium | +| 952 | [按公因数计算最大组件大小](../../problems/largest-component-size-by-common-factor) | [[并查集](../union-find/README.md)] [[数学](../math/README.md)] | Hard | +| 949 | [给定数字能组成的最大时间](../../problems/largest-time-for-given-digits) | [[数学](../math/README.md)] | Easy | +| 942 | [增减字符串匹配](../../problems/di-string-match) | [[数学](../math/README.md)] | Easy | +| 927 | [三等分](../../problems/three-equal-parts) | [[贪心算法](../greedy/README.md)] [[数学](../math/README.md)] [[二分查找](../binary-search/README.md)] | Hard | +| 914 | [卡牌分组](../../problems/x-of-a-kind-in-a-deck-of-cards) | [[数组](../array/README.md)] [[数学](../math/README.md)] | Easy | +| 910 | [最小差值 II](../../problems/smallest-range-ii) | [[贪心算法](../greedy/README.md)] [[数学](../math/README.md)] | Medium | +| 908 | [最小差值 I](../../problems/smallest-range-i) | [[数学](../math/README.md)] | Easy | +| 906 | [超级回文数](../../problems/super-palindromes) | [[数学](../math/README.md)] | Hard | +| 902 | [最大为 N 的数字组合](../../problems/numbers-at-most-n-given-digit-set) | [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 899 | [有序队列](../../problems/orderly-queue) | [[数学](../math/README.md)] [[字符串](../string/README.md)] | Hard | +| 892 | [三维形体的表面积](../../problems/surface-area-of-3d-shapes) | [[几何](../geometry/README.md)] [[数学](../math/README.md)] | Easy | +| 891 | [子序列宽度之和](../../problems/sum-of-subsequence-widths) | [[数组](../array/README.md)] [[数学](../math/README.md)] | Hard | +| 887 | [鸡蛋掉落](../../problems/super-egg-drop) | [[数学](../math/README.md)] [[二分查找](../binary-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 885 | [螺旋矩阵 III](../../problems/spiral-matrix-iii) | [[数学](../math/README.md)] | Medium | +| 883 | [三维形体投影面积](../../problems/projection-area-of-3d-shapes) | [[数学](../math/README.md)] | Easy | +| 878 | [第 N 个神奇数字](../../problems/nth-magical-number) | [[数学](../math/README.md)] [[二分查找](../binary-search/README.md)] | Hard | +| 877 | [石子游戏](../../problems/stone-game) | [[极小化极大](../minimax/README.md)] [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 869 | [重新排序得到 2 的幂](../../problems/reordered-power-of-2) | [[数学](../math/README.md)] | Medium | +| 868 | [二进制间距](../../problems/binary-gap) | [[数学](../math/README.md)] | Easy | +| 866 | [回文素数](../../problems/prime-palindrome) | [[数学](../math/README.md)] | Medium | +| 858 | [镜面反射](../../problems/mirror-reflection) | [[数学](../math/README.md)] | Medium | +| 836 | [矩形重叠](../../problems/rectangle-overlap) | [[数学](../math/README.md)] | Easy | +| 829 | [连续整数求和](../../problems/consecutive-numbers-sum) | [[数学](../math/README.md)] | Hard | +| 812 | [最大三角形面积](../../problems/largest-triangle-area) | [[数学](../math/README.md)] | Easy | +| 810 | [黑板异或游戏](../../problems/chalkboard-xor-game) | [[数学](../math/README.md)] | Hard | +| 805 | [数组的均值分割](../../problems/split-array-with-same-average) | [[数学](../math/README.md)] | Hard | +| 800 | [相似 RGB 颜色](../../problems/similar-rgb-color) 🔒 | [[数学](../math/README.md)] [[字符串](../string/README.md)] | Easy | +| 794 | [有效的井字游戏](../../problems/valid-tic-tac-toe-state) | [[递归](../recursion/README.md)] [[数学](../math/README.md)] | Medium | +| 789 | [逃脱阻碍者](../../problems/escape-the-ghosts) | [[数学](../math/README.md)] | Medium | +| 782 | [变为棋盘](../../problems/transform-to-chessboard) | [[数组](../array/README.md)] [[数学](../math/README.md)] | Hard | +| 781 | [森林中的兔子](../../problems/rabbits-in-forest) | [[哈希表](../hash-table/README.md)] [[数学](../math/README.md)] | Medium | +| 780 | [到达终点](../../problems/reaching-points) | [[数学](../math/README.md)] | Hard | +| 775 | [全局倒置与局部倒置](../../problems/global-and-local-inversions) | [[数组](../array/README.md)] [[数学](../math/README.md)] | Medium | +| 754 | [到达终点数字](../../problems/reach-a-number) | [[数学](../math/README.md)] | Medium | +| 753 | [破解保险箱](../../problems/cracking-the-safe) | [[深度优先搜索](../depth-first-search/README.md)] [[数学](../math/README.md)] | Hard | +| 728 | [自除数](../../problems/self-dividing-numbers) | [[数学](../math/README.md)] | Easy | +| 672 | [灯泡开关 Ⅱ](../../problems/bulb-switcher-ii) | [[数学](../math/README.md)] | Medium | +| 670 | [最大交换](../../problems/maximum-swap) | [[数组](../array/README.md)] [[数学](../math/README.md)] | Medium | +| 660 | [移除 9](../../problems/remove-9) 🔒 | [[数学](../math/README.md)] | Hard | +| 651 | [4键键盘](../../problems/4-keys-keyboard) 🔒 | [[贪心算法](../greedy/README.md)] [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 645 | [错误的集合](../../problems/set-mismatch) | [[哈希表](../hash-table/README.md)] [[数学](../math/README.md)] | Easy | +| 640 | [求解方程](../../problems/solve-the-equation) | [[数学](../math/README.md)] | Medium | +| 634 | [寻找数组的错位排列](../../problems/find-the-derangement-of-an-array) 🔒 | [[数学](../math/README.md)] | Medium | +| 633 | [平方数之和](../../problems/sum-of-square-numbers) | [[数学](../math/README.md)] | Easy | +| 628 | [三个数的最大乘积](../../problems/maximum-product-of-three-numbers) | [[数组](../array/README.md)] [[数学](../math/README.md)] | Easy | +| 625 | [最小因式分解](../../problems/minimum-factorization) 🔒 | [[递归](../recursion/README.md)] [[数学](../math/README.md)] | Medium | +| 598 | [范围求和 II](../../problems/range-addition-ii) | [[数学](../math/README.md)] | Easy | +| 593 | [有效的正方形](../../problems/valid-square) | [[数学](../math/README.md)] | Medium | +| 592 | [分数加减运算](../../problems/fraction-addition-and-subtraction) | [[数学](../math/README.md)] | Medium | +| 573 | [松鼠模拟](../../problems/squirrel-simulation) 🔒 | [[数学](../math/README.md)] | Medium | +| 553 | [最优除法](../../problems/optimal-division) | [[数学](../math/README.md)] [[字符串](../string/README.md)] | Medium | +| 537 | [复数乘法](../../problems/complex-number-multiplication) | [[数学](../math/README.md)] [[字符串](../string/README.md)] | Medium | +| 535 | [TinyURL 的加密与解密](../../problems/encode-and-decode-tinyurl) | [[哈希表](../hash-table/README.md)] [[数学](../math/README.md)] | Medium | +| 523 | [连续的子数组和](../../problems/continuous-subarray-sum) | [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 517 | [超级洗衣机](../../problems/super-washing-machines) | [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 507 | [完美数](../../problems/perfect-number) | [[数学](../math/README.md)] | Easy | +| 483 | [最小好进制](../../problems/smallest-good-base) | [[数学](../math/README.md)] [[二分查找](../binary-search/README.md)] | Hard | +| 478 | [在圆内随机生成点](../../problems/generate-random-point-in-a-circle) | [[数学](../math/README.md)] [[Random](../random/README.md)] [[Rejection Sampling](../rejection-sampling/README.md)] | Medium | +| 469 | [凸多边形](../../problems/convex-polygon) 🔒 | [[数学](../math/README.md)] | Medium | +| 462 | [最少移动次数使数组元素相等 II](../../problems/minimum-moves-to-equal-array-elements-ii) | [[数学](../math/README.md)] | Medium | +| 458 | [可怜的小猪](../../problems/poor-pigs) | [[数学](../math/README.md)] | Hard | +| 453 | [最小移动次数使数组元素相等](../../problems/minimum-moves-to-equal-array-elements) | [[数学](../math/README.md)] | Easy | +| 441 | [排列硬币](../../problems/arranging-coins) | [[数学](../math/README.md)] [[二分查找](../binary-search/README.md)] | Easy | +| 423 | [从英文中重建数字](../../problems/reconstruct-original-digits-from-english) | [[数学](../math/README.md)] | Medium | +| 413 | [等差数列划分](../../problems/arithmetic-slices) | [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 400 | [第N个数字](../../problems/nth-digit) | [[数学](../math/README.md)] | Medium | +| 397 | [整数替换](../../problems/integer-replacement) | [[位运算](../bit-manipulation/README.md)] [[数学](../math/README.md)] | Medium | +| 396 | [旋转函数](../../problems/rotate-function) | [[数学](../math/README.md)] | Medium | +| 372 | [超级次方](../../problems/super-pow) | [[数学](../math/README.md)] | Medium | +| 368 | [最大整除子集](../../problems/largest-divisible-subset) | [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 367 | [有效的完全平方数](../../problems/valid-perfect-square) | [[数学](../math/README.md)] [[二分查找](../binary-search/README.md)] | Easy | +| 365 | [水壶问题](../../problems/water-and-jug-problem) | [[数学](../math/README.md)] | Medium | +| 360 | [有序转化数组](../../problems/sort-transformed-array) 🔒 | [[数学](../math/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 357 | [计算各个位数不同的数字个数](../../problems/count-numbers-with-unique-digits) | [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 356 | [直线镜像](../../problems/line-reflection) 🔒 | [[哈希表](../hash-table/README.md)] [[数学](../math/README.md)] | Medium | +| 343 | [整数拆分](../../problems/integer-break) | [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 335 | [路径交叉](../../problems/self-crossing) | [[数学](../math/README.md)] | Hard | +| 326 | [3的幂](../../problems/power-of-three) | [[数学](../math/README.md)] | Easy | +| 319 | [灯泡开关](../../problems/bulb-switcher) | [[脑筋急转弯](../brainteaser/README.md)] [[数学](../math/README.md)] | Medium | +| 313 | [超级丑数](../../problems/super-ugly-number) | [[堆](../heap/README.md)] [[数学](../math/README.md)] | Medium | +| 296 | [最佳的碰头地点](../../problems/best-meeting-point) 🔒 | [[排序](../sort/README.md)] [[数学](../math/README.md)] | Hard | +| 279 | [完全平方数](../../problems/perfect-squares) | [[广度优先搜索](../breadth-first-search/README.md)] [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 273 | [整数转换英文表示](../../problems/integer-to-english-words) | [[数学](../math/README.md)] [[字符串](../string/README.md)] | Hard | +| 268 | [缺失数字](../../problems/missing-number) | [[位运算](../bit-manipulation/README.md)] [[数组](../array/README.md)] [[数学](../math/README.md)] | Easy | +| 264 | [丑数 II](../../problems/ugly-number-ii) | [[堆](../heap/README.md)] [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 263 | [丑数](../../problems/ugly-number) | [[数学](../math/README.md)] | Easy | +| 258 | [各位相加](../../problems/add-digits) | [[数学](../math/README.md)] | Easy | +| 248 | [中心对称数 III](../../problems/strobogrammatic-number-iii) 🔒 | [[递归](../recursion/README.md)] [[数学](../math/README.md)] | Hard | +| 247 | [中心对称数 II](../../problems/strobogrammatic-number-ii) 🔒 | [[递归](../recursion/README.md)] [[数学](../math/README.md)] | Medium | +| 246 | [中心对称数](../../problems/strobogrammatic-number) 🔒 | [[哈希表](../hash-table/README.md)] [[数学](../math/README.md)] | Easy | +| 233 | [数字 1 的个数](../../problems/number-of-digit-one) | [[数学](../math/README.md)] | Hard | +| 231 | [2的幂](../../problems/power-of-two) | [[位运算](../bit-manipulation/README.md)] [[数学](../math/README.md)] | Easy | +| 224 | [基本计算器](../../problems/basic-calculator) | [[栈](../stack/README.md)] [[数学](../math/README.md)] | Hard | +| 223 | [矩形面积](../../problems/rectangle-area) | [[数学](../math/README.md)] | Medium | +| 204 | [计数质数](../../problems/count-primes) | [[哈希表](../hash-table/README.md)] [[数学](../math/README.md)] | Easy | +| 202 | [快乐数](../../problems/happy-number) | [[哈希表](../hash-table/README.md)] [[数学](../math/README.md)] | Easy | +| 172 | [阶乘后的零](../../problems/factorial-trailing-zeroes) | [[数学](../math/README.md)] | Easy | +| 171 | [Excel表列序号](../../problems/excel-sheet-column-number) | [[数学](../math/README.md)] | Easy | +| 168 | [Excel表列名称](../../problems/excel-sheet-column-title) | [[数学](../math/README.md)] | Easy | +| 166 | [分数到小数](../../problems/fraction-to-recurring-decimal) | [[哈希表](../hash-table/README.md)] [[数学](../math/README.md)] | Medium | +| 149 | [直线上最多的点数](../../problems/max-points-on-a-line) | [[哈希表](../hash-table/README.md)] [[数学](../math/README.md)] | Hard | +| 69 | [x 的平方根](../../problems/sqrtx) | [[数学](../math/README.md)] [[二分查找](../binary-search/README.md)] | Easy | +| 67 | [二进制求和](../../problems/add-binary) | [[数学](../math/README.md)] [[字符串](../string/README.md)] | Easy | +| 65 | [有效数字](../../problems/valid-number) | [[数学](../math/README.md)] [[字符串](../string/README.md)] | Hard | +| 60 | [第k个排列](../../problems/permutation-sequence) | [[数学](../math/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 50 | [Pow(x, n)](../../problems/powx-n) | [[数学](../math/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 43 | [字符串相乘](../../problems/multiply-strings) | [[数学](../math/README.md)] [[字符串](../string/README.md)] | Medium | +| 29 | [两数相除](../../problems/divide-two-integers) | [[数学](../math/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 13 | [罗马数字转整数](../../problems/roman-to-integer) | [[数学](../math/README.md)] [[字符串](../string/README.md)] | Easy | +| 12 | [整数转罗马数字](../../problems/integer-to-roman) | [[数学](../math/README.md)] [[字符串](../string/README.md)] | Medium | +| 9 | [回文数](../../problems/palindrome-number) | [[数学](../math/README.md)] | Easy | +| 8 | [字符串转换整数 (atoi)](../../problems/string-to-integer-atoi) | [[数学](../math/README.md)] [[字符串](../string/README.md)] | Medium | +| 7 | [整数反转](../../problems/reverse-integer) | [[数学](../math/README.md)] | Easy | +| 2 | [两数相加](../../problems/add-two-numbers) | [[链表](../linked-list/README.md)] [[数学](../math/README.md)] | Medium | diff --git a/tag/memoization/README.md b/tag/memoization/README.md index 1e9282f91..8b57a4940 100644 --- a/tag/memoization/README.md +++ b/tag/memoization/README.md @@ -5,8 +5,8 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > 记忆化 +## [话题分类](../README.md) > 记忆化 | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 329 | [矩阵中的最长递增路径](https://github.com/openset/leetcode/tree/master/problems/longest-increasing-path-in-a-matrix) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[拓扑排序](https://github.com/openset/leetcode/tree/master/tag/topological-sort/README.md)] [[记忆化](https://github.com/openset/leetcode/tree/master/tag/memoization/README.md)] | Hard | +| 329 | [矩阵中的最长递增路径](../../problems/longest-increasing-path-in-a-matrix) | [[深度优先搜索](../depth-first-search/README.md)] [[拓扑排序](../topological-sort/README.md)] [[记忆化](../memoization/README.md)] | Hard | diff --git a/tag/minimax/README.md b/tag/minimax/README.md index b1f2f7b2d..bfd9897a4 100644 --- a/tag/minimax/README.md +++ b/tag/minimax/README.md @@ -5,15 +5,15 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > 极小化极大 +## [话题分类](../README.md) > 极小化极大 | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 913 | [猫和老鼠](https://github.com/openset/leetcode/tree/master/problems/cat-and-mouse) | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[极小化极大](https://github.com/openset/leetcode/tree/master/tag/minimax/README.md)] | Hard | -| 877 | [石子游戏](https://github.com/openset/leetcode/tree/master/problems/stone-game) | [[极小化极大](https://github.com/openset/leetcode/tree/master/tag/minimax/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 843 | [猜猜这个单词](https://github.com/openset/leetcode/tree/master/problems/guess-the-word) | [[极小化极大](https://github.com/openset/leetcode/tree/master/tag/minimax/README.md)] | Hard | -| 486 | [预测赢家](https://github.com/openset/leetcode/tree/master/problems/predict-the-winner) | [[极小化极大](https://github.com/openset/leetcode/tree/master/tag/minimax/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 464 | [我能赢吗](https://github.com/openset/leetcode/tree/master/problems/can-i-win) | [[极小化极大](https://github.com/openset/leetcode/tree/master/tag/minimax/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 375 | [猜数字大小 II](https://github.com/openset/leetcode/tree/master/problems/guess-number-higher-or-lower-ii) | [[极小化极大](https://github.com/openset/leetcode/tree/master/tag/minimax/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 294 | [翻转游戏 II](https://github.com/openset/leetcode/tree/master/problems/flip-game-ii) 🔒 | [[极小化极大](https://github.com/openset/leetcode/tree/master/tag/minimax/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 292 | [Nim 游戏](https://github.com/openset/leetcode/tree/master/problems/nim-game) | [[脑筋急转弯](https://github.com/openset/leetcode/tree/master/tag/brainteaser/README.md)] [[极小化极大](https://github.com/openset/leetcode/tree/master/tag/minimax/README.md)] | Easy | +| 913 | [猫和老鼠](../../problems/cat-and-mouse) | [[广度优先搜索](../breadth-first-search/README.md)] [[极小化极大](../minimax/README.md)] | Hard | +| 877 | [石子游戏](../../problems/stone-game) | [[极小化极大](../minimax/README.md)] [[数学](../math/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 843 | [猜猜这个单词](../../problems/guess-the-word) | [[极小化极大](../minimax/README.md)] | Hard | +| 486 | [预测赢家](../../problems/predict-the-winner) | [[极小化极大](../minimax/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 464 | [我能赢吗](../../problems/can-i-win) | [[极小化极大](../minimax/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 375 | [猜数字大小 II](../../problems/guess-number-higher-or-lower-ii) | [[极小化极大](../minimax/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 294 | [翻转游戏 II](../../problems/flip-game-ii) 🔒 | [[极小化极大](../minimax/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 292 | [Nim 游戏](../../problems/nim-game) | [[脑筋急转弯](../brainteaser/README.md)] [[极小化极大](../minimax/README.md)] | Easy | diff --git a/tag/ordered-map/README.md b/tag/ordered-map/README.md index 90f73139e..19a1d5a98 100644 --- a/tag/ordered-map/README.md +++ b/tag/ordered-map/README.md @@ -5,17 +5,17 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > Ordered Map +## [话题分类](../README.md) > Ordered Map | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 975 | [奇偶跳](https://github.com/openset/leetcode/tree/master/problems/odd-even-jump) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] [[Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md)] | Hard | -| 855 | [考场就座](https://github.com/openset/leetcode/tree/master/problems/exam-room) | [[Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md)] | Medium | -| 846 | [一手顺子](https://github.com/openset/leetcode/tree/master/problems/hand-of-straights) | [[Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md)] | Medium | -| 732 | [我的日程安排表 III](https://github.com/openset/leetcode/tree/master/problems/my-calendar-iii) | [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md)] | Hard | -| 731 | [我的日程安排表 II](https://github.com/openset/leetcode/tree/master/problems/my-calendar-ii) | [[Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md)] | Medium | -| 715 | [Range 模块](https://github.com/openset/leetcode/tree/master/problems/range-module) | [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md)] | Hard | -| 699 | [掉落的方块](https://github.com/openset/leetcode/tree/master/problems/falling-squares) | [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md)] | Hard | -| 683 | [K 个空花盆](https://github.com/openset/leetcode/tree/master/problems/k-empty-slots) 🔒 | [[Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md)] | Hard | -| 352 | [将数据流变为多个不相交区间](https://github.com/openset/leetcode/tree/master/problems/data-stream-as-disjoint-intervals) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md)] | Hard | -| 220 | [存在重复元素 III](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate-iii) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md)] | Medium | +| 975 | [奇偶跳](../../problems/odd-even-jump) | [[栈](../stack/README.md)] [[动态规划](../dynamic-programming/README.md)] [[Ordered Map](../ordered-map/README.md)] | Hard | +| 855 | [考场就座](../../problems/exam-room) | [[Ordered Map](../ordered-map/README.md)] | Medium | +| 846 | [一手顺子](../../problems/hand-of-straights) | [[Ordered Map](../ordered-map/README.md)] | Medium | +| 732 | [我的日程安排表 III](../../problems/my-calendar-iii) | [[线段树](../segment-tree/README.md)] [[Ordered Map](../ordered-map/README.md)] | Hard | +| 731 | [我的日程安排表 II](../../problems/my-calendar-ii) | [[Ordered Map](../ordered-map/README.md)] | Medium | +| 715 | [Range 模块](../../problems/range-module) | [[线段树](../segment-tree/README.md)] [[Ordered Map](../ordered-map/README.md)] | Hard | +| 699 | [掉落的方块](../../problems/falling-squares) | [[线段树](../segment-tree/README.md)] [[Ordered Map](../ordered-map/README.md)] | Hard | +| 683 | [K 个空花盆](../../problems/k-empty-slots) 🔒 | [[Ordered Map](../ordered-map/README.md)] | Hard | +| 352 | [将数据流变为多个不相交区间](../../problems/data-stream-as-disjoint-intervals) | [[二分查找](../binary-search/README.md)] [[Ordered Map](../ordered-map/README.md)] | Hard | +| 220 | [存在重复元素 III](../../problems/contains-duplicate-iii) | [[排序](../sort/README.md)] [[Ordered Map](../ordered-map/README.md)] | Medium | diff --git a/tag/queue/README.md b/tag/queue/README.md index 334b8bc4f..f83d54bcb 100644 --- a/tag/queue/README.md +++ b/tag/queue/README.md @@ -5,16 +5,16 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > 队列 +## [话题分类](../README.md) > 队列 | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 933 | [最近的请求次数](https://github.com/openset/leetcode/tree/master/problems/number-of-recent-calls) | [[队列](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)] | Easy | -| 862 | [和至少为 K 的最短子数组](https://github.com/openset/leetcode/tree/master/problems/shortest-subarray-with-sum-at-least-k) | [[队列](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Hard | -| 641 | [设计循环双端队列](https://github.com/openset/leetcode/tree/master/problems/design-circular-deque) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[队列](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)] | Medium | -| 622 | [设计循环队列](https://github.com/openset/leetcode/tree/master/problems/design-circular-queue) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[队列](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)] | Medium | -| 621 | [任务调度器](https://github.com/openset/leetcode/tree/master/problems/task-scheduler) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[队列](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 582 | [杀死进程](https://github.com/openset/leetcode/tree/master/problems/kill-process) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[队列](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)] | Medium | -| 363 | [矩形区域不超过 K 的最大数值和](https://github.com/openset/leetcode/tree/master/problems/max-sum-of-rectangle-no-larger-than-k) | [[队列](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 353 | [贪吃蛇](https://github.com/openset/leetcode/tree/master/problems/design-snake-game) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[队列](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)] | Medium | -| 346 | [数据流中的移动平均值](https://github.com/openset/leetcode/tree/master/problems/moving-average-from-data-stream) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[队列](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)] | Easy | +| 933 | [最近的请求次数](../../problems/number-of-recent-calls) | [[队列](../queue/README.md)] | Easy | +| 862 | [和至少为 K 的最短子数组](../../problems/shortest-subarray-with-sum-at-least-k) | [[队列](../queue/README.md)] [[二分查找](../binary-search/README.md)] | Hard | +| 641 | [设计循环双端队列](../../problems/design-circular-deque) | [[设计](../design/README.md)] [[队列](../queue/README.md)] | Medium | +| 622 | [设计循环队列](../../problems/design-circular-queue) | [[设计](../design/README.md)] [[队列](../queue/README.md)] | Medium | +| 621 | [任务调度器](../../problems/task-scheduler) | [[贪心算法](../greedy/README.md)] [[队列](../queue/README.md)] [[数组](../array/README.md)] | Medium | +| 582 | [杀死进程](../../problems/kill-process) 🔒 | [[树](../tree/README.md)] [[队列](../queue/README.md)] | Medium | +| 363 | [矩形区域不超过 K 的最大数值和](../../problems/max-sum-of-rectangle-no-larger-than-k) | [[队列](../queue/README.md)] [[二分查找](../binary-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 353 | [贪吃蛇](../../problems/design-snake-game) 🔒 | [[设计](../design/README.md)] [[队列](../queue/README.md)] | Medium | +| 346 | [数据流中的移动平均值](../../problems/moving-average-from-data-stream) 🔒 | [[设计](../design/README.md)] [[队列](../queue/README.md)] | Easy | diff --git a/tag/random/README.md b/tag/random/README.md index 7b6c82e1b..53eac31f1 100644 --- a/tag/random/README.md +++ b/tag/random/README.md @@ -5,13 +5,13 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > Random +## [话题分类](../README.md) > Random | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 710 | [黑名单中的随机数](https://github.com/openset/leetcode/tree/master/problems/random-pick-with-blacklist) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[Random](https://github.com/openset/leetcode/tree/master/tag/random/README.md)] | Hard | -| 528 | [按权重随机选择](https://github.com/openset/leetcode/tree/master/problems/random-pick-with-weight) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[Random](https://github.com/openset/leetcode/tree/master/tag/random/README.md)] | Medium | -| 519 | [随机翻转矩阵](https://github.com/openset/leetcode/tree/master/problems/random-flip-matrix) | [[Random](https://github.com/openset/leetcode/tree/master/tag/random/README.md)] | Medium | -| 497 | [非重叠矩形中的随机点](https://github.com/openset/leetcode/tree/master/problems/random-point-in-non-overlapping-rectangles) | [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[Random](https://github.com/openset/leetcode/tree/master/tag/random/README.md)] | Medium | -| 478 | [在圆内随机生成点](https://github.com/openset/leetcode/tree/master/problems/generate-random-point-in-a-circle) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[Random](https://github.com/openset/leetcode/tree/master/tag/random/README.md)] [[Rejection Sampling](https://github.com/openset/leetcode/tree/master/tag/rejection-sampling/README.md)] | Medium | -| 470 | [用 Rand7() 实现 Rand10()](https://github.com/openset/leetcode/tree/master/problems/implement-rand10-using-rand7) | [[Random](https://github.com/openset/leetcode/tree/master/tag/random/README.md)] [[Rejection Sampling](https://github.com/openset/leetcode/tree/master/tag/rejection-sampling/README.md)] | Medium | +| 710 | [黑名单中的随机数](../../problems/random-pick-with-blacklist) | [[排序](../sort/README.md)] [[哈希表](../hash-table/README.md)] [[二分查找](../binary-search/README.md)] [[Random](../random/README.md)] | Hard | +| 528 | [按权重随机选择](../../problems/random-pick-with-weight) | [[二分查找](../binary-search/README.md)] [[Random](../random/README.md)] | Medium | +| 519 | [随机翻转矩阵](../../problems/random-flip-matrix) | [[Random](../random/README.md)] | Medium | +| 497 | [非重叠矩形中的随机点](../../problems/random-point-in-non-overlapping-rectangles) | [[二分查找](../binary-search/README.md)] [[Random](../random/README.md)] | Medium | +| 478 | [在圆内随机生成点](../../problems/generate-random-point-in-a-circle) | [[数学](../math/README.md)] [[Random](../random/README.md)] [[Rejection Sampling](../rejection-sampling/README.md)] | Medium | +| 470 | [用 Rand7() 实现 Rand10()](../../problems/implement-rand10-using-rand7) | [[Random](../random/README.md)] [[Rejection Sampling](../rejection-sampling/README.md)] | Medium | diff --git a/tag/recursion/README.md b/tag/recursion/README.md index 8e30e1029..2e9d297ae 100644 --- a/tag/recursion/README.md +++ b/tag/recursion/README.md @@ -5,22 +5,22 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > 递归 +## [话题分类](../README.md) > 递归 | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 1137 | [第 N 个泰波那契数](https://github.com/openset/leetcode/tree/master/problems/n-th-tribonacci-number) | [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] | Easy | -| 938 | [二叉搜索树的范围和](https://github.com/openset/leetcode/tree/master/problems/range-sum-of-bst) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] | Easy | -| 894 | [所有可能的满二叉树](https://github.com/openset/leetcode/tree/master/problems/all-possible-full-binary-trees) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] | Medium | -| 794 | [有效的井字游戏](https://github.com/openset/leetcode/tree/master/problems/valid-tic-tac-toe-state) | [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 783 | [二叉搜索树结点最小距离](https://github.com/openset/leetcode/tree/master/problems/minimum-distance-between-bst-nodes) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] | Easy | -| 779 | [第K个语法符号](https://github.com/openset/leetcode/tree/master/problems/k-th-symbol-in-grammar) | [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] | Medium | -| 776 | [拆分二叉搜索树](https://github.com/openset/leetcode/tree/master/problems/split-bst) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] | Medium | -| 761 | [特殊的二进制序列](https://github.com/openset/leetcode/tree/master/problems/special-binary-string) | [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 726 | [原子的数量](https://github.com/openset/leetcode/tree/master/problems/number-of-atoms) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Hard | -| 698 | [划分为k个相等的子集](https://github.com/openset/leetcode/tree/master/problems/partition-to-k-equal-sum-subsets) | [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 687 | [最长同值路径](https://github.com/openset/leetcode/tree/master/problems/longest-univalue-path) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] | Easy | -| 625 | [最小因式分解](https://github.com/openset/leetcode/tree/master/problems/minimum-factorization) 🔒 | [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 544 | [输出比赛匹配对](https://github.com/openset/leetcode/tree/master/problems/output-contest-matches) 🔒 | [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 248 | [中心对称数 III](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number-iii) 🔒 | [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Hard | -| 247 | [中心对称数 II](https://github.com/openset/leetcode/tree/master/problems/strobogrammatic-number-ii) 🔒 | [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | +| 1137 | [第 N 个泰波那契数](../../problems/n-th-tribonacci-number) | [[递归](../recursion/README.md)] | Easy | +| 938 | [二叉搜索树的范围和](../../problems/range-sum-of-bst) | [[树](../tree/README.md)] [[递归](../recursion/README.md)] | Easy | +| 894 | [所有可能的满二叉树](../../problems/all-possible-full-binary-trees) | [[树](../tree/README.md)] [[递归](../recursion/README.md)] | Medium | +| 794 | [有效的井字游戏](../../problems/valid-tic-tac-toe-state) | [[递归](../recursion/README.md)] [[数学](../math/README.md)] | Medium | +| 783 | [二叉搜索树结点最小距离](../../problems/minimum-distance-between-bst-nodes) | [[树](../tree/README.md)] [[递归](../recursion/README.md)] | Easy | +| 779 | [第K个语法符号](../../problems/k-th-symbol-in-grammar) | [[递归](../recursion/README.md)] | Medium | +| 776 | [拆分二叉搜索树](../../problems/split-bst) 🔒 | [[树](../tree/README.md)] [[递归](../recursion/README.md)] | Medium | +| 761 | [特殊的二进制序列](../../problems/special-binary-string) | [[递归](../recursion/README.md)] [[字符串](../string/README.md)] | Hard | +| 726 | [原子的数量](../../problems/number-of-atoms) | [[栈](../stack/README.md)] [[递归](../recursion/README.md)] [[哈希表](../hash-table/README.md)] | Hard | +| 698 | [划分为k个相等的子集](../../problems/partition-to-k-equal-sum-subsets) | [[递归](../recursion/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 687 | [最长同值路径](../../problems/longest-univalue-path) | [[树](../tree/README.md)] [[递归](../recursion/README.md)] | Easy | +| 625 | [最小因式分解](../../problems/minimum-factorization) 🔒 | [[递归](../recursion/README.md)] [[数学](../math/README.md)] | Medium | +| 544 | [输出比赛匹配对](../../problems/output-contest-matches) 🔒 | [[递归](../recursion/README.md)] [[字符串](../string/README.md)] | Medium | +| 248 | [中心对称数 III](../../problems/strobogrammatic-number-iii) 🔒 | [[递归](../recursion/README.md)] [[数学](../math/README.md)] | Hard | +| 247 | [中心对称数 II](../../problems/strobogrammatic-number-ii) 🔒 | [[递归](../recursion/README.md)] [[数学](../math/README.md)] | Medium | diff --git a/tag/rejection-sampling/README.md b/tag/rejection-sampling/README.md index 2e5258a04..510709f4d 100644 --- a/tag/rejection-sampling/README.md +++ b/tag/rejection-sampling/README.md @@ -5,9 +5,9 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > Rejection Sampling +## [话题分类](../README.md) > Rejection Sampling | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 478 | [在圆内随机生成点](https://github.com/openset/leetcode/tree/master/problems/generate-random-point-in-a-circle) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[Random](https://github.com/openset/leetcode/tree/master/tag/random/README.md)] [[Rejection Sampling](https://github.com/openset/leetcode/tree/master/tag/rejection-sampling/README.md)] | Medium | -| 470 | [用 Rand7() 实现 Rand10()](https://github.com/openset/leetcode/tree/master/problems/implement-rand10-using-rand7) | [[Random](https://github.com/openset/leetcode/tree/master/tag/random/README.md)] [[Rejection Sampling](https://github.com/openset/leetcode/tree/master/tag/rejection-sampling/README.md)] | Medium | +| 478 | [在圆内随机生成点](../../problems/generate-random-point-in-a-circle) | [[数学](../math/README.md)] [[Random](../random/README.md)] [[Rejection Sampling](../rejection-sampling/README.md)] | Medium | +| 470 | [用 Rand7() 实现 Rand10()](../../problems/implement-rand10-using-rand7) | [[Random](../random/README.md)] [[Rejection Sampling](../rejection-sampling/README.md)] | Medium | diff --git a/tag/reservoir-sampling/README.md b/tag/reservoir-sampling/README.md index f816564af..4d9d5b6b8 100644 --- a/tag/reservoir-sampling/README.md +++ b/tag/reservoir-sampling/README.md @@ -5,9 +5,9 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > 蓄水池抽样 +## [话题分类](../README.md) > 蓄水池抽样 | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 398 | [随机数索引](https://github.com/openset/leetcode/tree/master/problems/random-pick-index) | [[蓄水池抽样](https://github.com/openset/leetcode/tree/master/tag/reservoir-sampling/README.md)] | Medium | -| 382 | [链表随机节点](https://github.com/openset/leetcode/tree/master/problems/linked-list-random-node) | [[蓄水池抽样](https://github.com/openset/leetcode/tree/master/tag/reservoir-sampling/README.md)] | Medium | +| 398 | [随机数索引](../../problems/random-pick-index) | [[蓄水池抽样](../reservoir-sampling/README.md)] | Medium | +| 382 | [链表随机节点](../../problems/linked-list-random-node) | [[蓄水池抽样](../reservoir-sampling/README.md)] | Medium | diff --git a/tag/rolling-hash/README.md b/tag/rolling-hash/README.md index 3ed09eb4f..4584c71c6 100644 --- a/tag/rolling-hash/README.md +++ b/tag/rolling-hash/README.md @@ -5,7 +5,7 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > Rolling Hash +## [话题分类](../README.md) > Rolling Hash | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | diff --git a/tag/segment-tree/README.md b/tag/segment-tree/README.md index 600969c34..221b8b50c 100644 --- a/tag/segment-tree/README.md +++ b/tag/segment-tree/README.md @@ -5,18 +5,18 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > 线段树 +## [话题分类](../README.md) > 线段树 | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 1157 | [子数组中占绝大多数的元素](https://github.com/openset/leetcode/tree/master/problems/online-majority-element-in-subarray) | [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Hard | -| 850 | [矩形面积 II](https://github.com/openset/leetcode/tree/master/problems/rectangle-area-ii) | [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[Line Sweep](https://github.com/openset/leetcode/tree/master/tag/line-sweep/README.md)] | Hard | -| 732 | [我的日程安排表 III](https://github.com/openset/leetcode/tree/master/problems/my-calendar-iii) | [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md)] | Hard | -| 715 | [Range 模块](https://github.com/openset/leetcode/tree/master/problems/range-module) | [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md)] | Hard | -| 699 | [掉落的方块](https://github.com/openset/leetcode/tree/master/problems/falling-squares) | [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md)] | Hard | -| 493 | [翻转对](https://github.com/openset/leetcode/tree/master/problems/reverse-pairs) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Hard | -| 327 | [区间和的个数](https://github.com/openset/leetcode/tree/master/problems/count-of-range-sum) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Hard | -| 315 | [计算右侧小于当前元素的个数](https://github.com/openset/leetcode/tree/master/problems/count-of-smaller-numbers-after-self) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Hard | -| 308 | [二维区域和检索 - 可变](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-2d-mutable) 🔒 | [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] | Hard | -| 307 | [区域和检索 - 数组可修改](https://github.com/openset/leetcode/tree/master/problems/range-sum-query-mutable) | [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] | Medium | -| 218 | [天际线问题](https://github.com/openset/leetcode/tree/master/problems/the-skyline-problem) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] [[Line Sweep](https://github.com/openset/leetcode/tree/master/tag/line-sweep/README.md)] | Hard | +| 1157 | [子数组中占绝大多数的元素](../../problems/online-majority-element-in-subarray) | [[线段树](../segment-tree/README.md)] [[数组](../array/README.md)] [[二分查找](../binary-search/README.md)] | Hard | +| 850 | [矩形面积 II](../../problems/rectangle-area-ii) | [[线段树](../segment-tree/README.md)] [[Line Sweep](../line-sweep/README.md)] | Hard | +| 732 | [我的日程安排表 III](../../problems/my-calendar-iii) | [[线段树](../segment-tree/README.md)] [[Ordered Map](../ordered-map/README.md)] | Hard | +| 715 | [Range 模块](../../problems/range-module) | [[线段树](../segment-tree/README.md)] [[Ordered Map](../ordered-map/README.md)] | Hard | +| 699 | [掉落的方块](../../problems/falling-squares) | [[线段树](../segment-tree/README.md)] [[Ordered Map](../ordered-map/README.md)] | Hard | +| 493 | [翻转对](../../problems/reverse-pairs) | [[排序](../sort/README.md)] [[树状数组](../binary-indexed-tree/README.md)] [[线段树](../segment-tree/README.md)] [[二分查找](../binary-search/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Hard | +| 327 | [区间和的个数](../../problems/count-of-range-sum) | [[排序](../sort/README.md)] [[树状数组](../binary-indexed-tree/README.md)] [[线段树](../segment-tree/README.md)] [[二分查找](../binary-search/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Hard | +| 315 | [计算右侧小于当前元素的个数](../../problems/count-of-smaller-numbers-after-self) | [[排序](../sort/README.md)] [[树状数组](../binary-indexed-tree/README.md)] [[线段树](../segment-tree/README.md)] [[二分查找](../binary-search/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Hard | +| 308 | [二维区域和检索 - 可变](../../problems/range-sum-query-2d-mutable) 🔒 | [[树状数组](../binary-indexed-tree/README.md)] [[线段树](../segment-tree/README.md)] | Hard | +| 307 | [区域和检索 - 数组可修改](../../problems/range-sum-query-mutable) | [[树状数组](../binary-indexed-tree/README.md)] [[线段树](../segment-tree/README.md)] | Medium | +| 218 | [天际线问题](../../problems/the-skyline-problem) | [[堆](../heap/README.md)] [[树状数组](../binary-indexed-tree/README.md)] [[线段树](../segment-tree/README.md)] [[分治算法](../divide-and-conquer/README.md)] [[Line Sweep](../line-sweep/README.md)] | Hard | diff --git a/tag/sliding-window/README.md b/tag/sliding-window/README.md index 9943e5b44..840ed4c1d 100644 --- a/tag/sliding-window/README.md +++ b/tag/sliding-window/README.md @@ -5,27 +5,27 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > Sliding Window +## [话题分类](../README.md) > Sliding Window | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 1208 | [尽可能使字符串相等](https://github.com/openset/leetcode/tree/master/problems/get-equal-substrings-within-budget) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Medium | -| 1176 | [健身计划评估](https://github.com/openset/leetcode/tree/master/problems/diet-plan-performance) 🔒 | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Easy | -| 1151 | [最少交换次数来组合所有的 1](https://github.com/openset/leetcode/tree/master/problems/minimum-swaps-to-group-all-1s-together) 🔒 | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Medium | -| 1100 | [长度为 K 的无重复字符子串](https://github.com/openset/leetcode/tree/master/problems/find-k-length-substrings-with-no-repeated-characters) 🔒 | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Medium | -| 1074 | [元素和为目标值的子矩阵数量](https://github.com/openset/leetcode/tree/master/problems/number-of-submatrices-that-sum-to-target) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Hard | -| 1052 | [爱生气的书店老板](https://github.com/openset/leetcode/tree/master/problems/grumpy-bookstore-owner) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Medium | -| 1040 | [移动石子直到连续 II](https://github.com/openset/leetcode/tree/master/problems/moving-stones-until-consecutive-ii) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Medium | -| 1004 | [最大连续1的个数 III](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones-iii) | [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Medium | -| 995 | [K 连续位的最小翻转次数](https://github.com/openset/leetcode/tree/master/problems/minimum-number-of-k-consecutive-bit-flips) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Hard | -| 992 | [K 个不同整数的子数组](https://github.com/openset/leetcode/tree/master/problems/subarrays-with-k-different-integers) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Hard | -| 978 | [最长湍流子数组](https://github.com/openset/leetcode/tree/master/problems/longest-turbulent-subarray) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Medium | -| 727 | [最小窗口子序列](https://github.com/openset/leetcode/tree/master/problems/minimum-window-subsequence) 🔒 | [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Hard | -| 567 | [字符串的排列](https://github.com/openset/leetcode/tree/master/problems/permutation-in-string) | [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Medium | -| 480 | [滑动窗口中位数](https://github.com/openset/leetcode/tree/master/problems/sliding-window-median) | [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Hard | -| 424 | [替换后的最长重复字符](https://github.com/openset/leetcode/tree/master/problems/longest-repeating-character-replacement) | [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Medium | -| 340 | [至多包含 K 个不同字符的最长子串](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-k-distinct-characters) 🔒 | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Hard | -| 239 | [滑动窗口最大值](https://github.com/openset/leetcode/tree/master/problems/sliding-window-maximum) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Hard | -| 159 | [至多包含两个不同字符的最长子串](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-two-distinct-characters) 🔒 | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Medium | -| 76 | [最小覆盖子串](https://github.com/openset/leetcode/tree/master/problems/minimum-window-substring) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Hard | -| 3 | [无重复字符的最长子串](https://github.com/openset/leetcode/tree/master/problems/longest-substring-without-repeating-characters) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Medium | +| 1208 | [尽可能使字符串相等](../../problems/get-equal-substrings-within-budget) | [[数组](../array/README.md)] [[Sliding Window](../sliding-window/README.md)] | Medium | +| 1176 | [健身计划评估](../../problems/diet-plan-performance) 🔒 | [[数组](../array/README.md)] [[Sliding Window](../sliding-window/README.md)] | Easy | +| 1151 | [最少交换次数来组合所有的 1](../../problems/minimum-swaps-to-group-all-1s-together) 🔒 | [[数组](../array/README.md)] [[Sliding Window](../sliding-window/README.md)] | Medium | +| 1100 | [长度为 K 的无重复字符子串](../../problems/find-k-length-substrings-with-no-repeated-characters) 🔒 | [[字符串](../string/README.md)] [[Sliding Window](../sliding-window/README.md)] | Medium | +| 1074 | [元素和为目标值的子矩阵数量](../../problems/number-of-submatrices-that-sum-to-target) | [[数组](../array/README.md)] [[动态规划](../dynamic-programming/README.md)] [[Sliding Window](../sliding-window/README.md)] | Hard | +| 1052 | [爱生气的书店老板](../../problems/grumpy-bookstore-owner) | [[数组](../array/README.md)] [[Sliding Window](../sliding-window/README.md)] | Medium | +| 1040 | [移动石子直到连续 II](../../problems/moving-stones-until-consecutive-ii) | [[数组](../array/README.md)] [[Sliding Window](../sliding-window/README.md)] | Medium | +| 1004 | [最大连续1的个数 III](../../problems/max-consecutive-ones-iii) | [[双指针](../two-pointers/README.md)] [[Sliding Window](../sliding-window/README.md)] | Medium | +| 995 | [K 连续位的最小翻转次数](../../problems/minimum-number-of-k-consecutive-bit-flips) | [[贪心算法](../greedy/README.md)] [[Sliding Window](../sliding-window/README.md)] | Hard | +| 992 | [K 个不同整数的子数组](../../problems/subarrays-with-k-different-integers) | [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] [[Sliding Window](../sliding-window/README.md)] | Hard | +| 978 | [最长湍流子数组](../../problems/longest-turbulent-subarray) | [[数组](../array/README.md)] [[动态规划](../dynamic-programming/README.md)] [[Sliding Window](../sliding-window/README.md)] | Medium | +| 727 | [最小窗口子序列](../../problems/minimum-window-subsequence) 🔒 | [[动态规划](../dynamic-programming/README.md)] [[Sliding Window](../sliding-window/README.md)] | Hard | +| 567 | [字符串的排列](../../problems/permutation-in-string) | [[双指针](../two-pointers/README.md)] [[Sliding Window](../sliding-window/README.md)] | Medium | +| 480 | [滑动窗口中位数](../../problems/sliding-window-median) | [[Sliding Window](../sliding-window/README.md)] | Hard | +| 424 | [替换后的最长重复字符](../../problems/longest-repeating-character-replacement) | [[双指针](../two-pointers/README.md)] [[Sliding Window](../sliding-window/README.md)] | Medium | +| 340 | [至多包含 K 个不同字符的最长子串](../../problems/longest-substring-with-at-most-k-distinct-characters) 🔒 | [[哈希表](../hash-table/README.md)] [[字符串](../string/README.md)] [[Sliding Window](../sliding-window/README.md)] | Hard | +| 239 | [滑动窗口最大值](../../problems/sliding-window-maximum) | [[堆](../heap/README.md)] [[Sliding Window](../sliding-window/README.md)] | Hard | +| 159 | [至多包含两个不同字符的最长子串](../../problems/longest-substring-with-at-most-two-distinct-characters) 🔒 | [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] [[字符串](../string/README.md)] [[Sliding Window](../sliding-window/README.md)] | Medium | +| 76 | [最小覆盖子串](../../problems/minimum-window-substring) | [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] [[字符串](../string/README.md)] [[Sliding Window](../sliding-window/README.md)] | Hard | +| 3 | [无重复字符的最长子串](../../problems/longest-substring-without-repeating-characters) | [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] [[字符串](../string/README.md)] [[Sliding Window](../sliding-window/README.md)] | Medium | diff --git a/tag/sort/README.md b/tag/sort/README.md index 25022b6c9..fa76fdf87 100644 --- a/tag/sort/README.md +++ b/tag/sort/README.md @@ -5,45 +5,45 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > 排序 +## [话题分类](../README.md) > 排序 | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 1244 | [力扣排行榜](https://github.com/openset/leetcode/tree/master/problems/design-a-leaderboard) 🔒 | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 1235 | [规划兼职工作](https://github.com/openset/leetcode/tree/master/problems/maximum-profit-in-job-scheduling) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 1183 | [矩阵中 1 的最大数量](https://github.com/openset/leetcode/tree/master/problems/maximum-number-of-ones) 🔒 | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Hard | -| 1152 | [用户网站访问行为分析](https://github.com/openset/leetcode/tree/master/problems/analyze-user-website-visit-pattern) 🔒 | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 1122 | [数组的相对排序](https://github.com/openset/leetcode/tree/master/problems/relative-sort-array) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 1086 | [前五科的均分](https://github.com/openset/leetcode/tree/master/problems/high-five) 🔒 | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 1057 | [校园自行车分配](https://github.com/openset/leetcode/tree/master/problems/campus-bikes) 🔒 | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] | Medium | -| 1054 | [距离相等的条形码](https://github.com/openset/leetcode/tree/master/problems/distant-barcodes) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] | Medium | -| 1030 | [距离顺序排列矩阵单元格](https://github.com/openset/leetcode/tree/master/problems/matrix-cells-in-distance-order) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] | Easy | -| 976 | [三角形的最大周长](https://github.com/openset/leetcode/tree/master/problems/largest-perimeter-triangle) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Easy | -| 973 | [最接近原点的 K 个点](https://github.com/openset/leetcode/tree/master/problems/k-closest-points-to-origin) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Medium | -| 969 | [煎饼排序](https://github.com/openset/leetcode/tree/master/problems/pancake-sorting) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 922 | [按奇偶排序数组 II](https://github.com/openset/leetcode/tree/master/problems/sort-array-by-parity-ii) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Easy | -| 853 | [车队](https://github.com/openset/leetcode/tree/master/problems/car-fleet) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] | Medium | -| 767 | [重构字符串](https://github.com/openset/leetcode/tree/master/problems/reorganize-string) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 710 | [黑名单中的随机数](https://github.com/openset/leetcode/tree/master/problems/random-pick-with-blacklist) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[Random](https://github.com/openset/leetcode/tree/master/tag/random/README.md)] | Hard | -| 527 | [单词缩写](https://github.com/openset/leetcode/tree/master/problems/word-abbreviation) 🔒 | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 524 | [通过删除字母匹配到字典里最长单词](https://github.com/openset/leetcode/tree/master/problems/longest-word-in-dictionary-through-deleting) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 493 | [翻转对](https://github.com/openset/leetcode/tree/master/problems/reverse-pairs) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Hard | -| 350 | [两个数组的交集 II](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-arrays-ii) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Easy | -| 349 | [两个数组的交集](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-arrays) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Easy | -| 327 | [区间和的个数](https://github.com/openset/leetcode/tree/master/problems/count-of-range-sum) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Hard | -| 324 | [摆动排序 II](https://github.com/openset/leetcode/tree/master/problems/wiggle-sort-ii) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] | Medium | -| 315 | [计算右侧小于当前元素的个数](https://github.com/openset/leetcode/tree/master/problems/count-of-smaller-numbers-after-self) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[树状数组](https://github.com/openset/leetcode/tree/master/tag/binary-indexed-tree/README.md)] [[线段树](https://github.com/openset/leetcode/tree/master/tag/segment-tree/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Hard | -| 296 | [最佳的碰头地点](https://github.com/openset/leetcode/tree/master/problems/best-meeting-point) 🔒 | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Hard | -| 280 | [摆动排序](https://github.com/openset/leetcode/tree/master/problems/wiggle-sort) 🔒 | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 274 | [H指数](https://github.com/openset/leetcode/tree/master/problems/h-index) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 253 | [会议室 II](https://github.com/openset/leetcode/tree/master/problems/meeting-rooms-ii) 🔒 | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] | Medium | -| 252 | [会议室](https://github.com/openset/leetcode/tree/master/problems/meeting-rooms) 🔒 | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] | Easy | -| 242 | [有效的字母异位词](https://github.com/openset/leetcode/tree/master/problems/valid-anagram) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 220 | [存在重复元素 III](https://github.com/openset/leetcode/tree/master/problems/contains-duplicate-iii) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md)] | Medium | -| 179 | [最大数](https://github.com/openset/leetcode/tree/master/problems/largest-number) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] | Medium | -| 164 | [最大间距](https://github.com/openset/leetcode/tree/master/problems/maximum-gap) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] | Hard | -| 148 | [排序链表](https://github.com/openset/leetcode/tree/master/problems/sort-list) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Medium | -| 147 | [对链表进行插入排序](https://github.com/openset/leetcode/tree/master/problems/insertion-sort-list) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Medium | -| 75 | [颜色分类](https://github.com/openset/leetcode/tree/master/problems/sort-colors) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 57 | [插入区间](https://github.com/openset/leetcode/tree/master/problems/insert-interval) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Hard | -| 56 | [合并区间](https://github.com/openset/leetcode/tree/master/problems/merge-intervals) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | +| 1244 | [力扣排行榜](../../problems/design-a-leaderboard) 🔒 | [[排序](../sort/README.md)] [[设计](../design/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 1235 | [规划兼职工作](../../problems/maximum-profit-in-job-scheduling) | [[排序](../sort/README.md)] [[二分查找](../binary-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 1183 | [矩阵中 1 的最大数量](../../problems/maximum-number-of-ones) 🔒 | [[排序](../sort/README.md)] [[数学](../math/README.md)] | Hard | +| 1152 | [用户网站访问行为分析](../../problems/analyze-user-website-visit-pattern) 🔒 | [[排序](../sort/README.md)] [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 1122 | [数组的相对排序](../../problems/relative-sort-array) | [[排序](../sort/README.md)] [[数组](../array/README.md)] | Easy | +| 1086 | [前五科的均分](../../problems/high-five) 🔒 | [[排序](../sort/README.md)] [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] | Easy | +| 1057 | [校园自行车分配](../../problems/campus-bikes) 🔒 | [[贪心算法](../greedy/README.md)] [[排序](../sort/README.md)] | Medium | +| 1054 | [距离相等的条形码](../../problems/distant-barcodes) | [[堆](../heap/README.md)] [[排序](../sort/README.md)] | Medium | +| 1030 | [距离顺序排列矩阵单元格](../../problems/matrix-cells-in-distance-order) | [[排序](../sort/README.md)] | Easy | +| 976 | [三角形的最大周长](../../problems/largest-perimeter-triangle) | [[排序](../sort/README.md)] [[数学](../math/README.md)] | Easy | +| 973 | [最接近原点的 K 个点](../../problems/k-closest-points-to-origin) | [[堆](../heap/README.md)] [[排序](../sort/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Medium | +| 969 | [煎饼排序](../../problems/pancake-sorting) | [[排序](../sort/README.md)] [[数组](../array/README.md)] | Medium | +| 922 | [按奇偶排序数组 II](../../problems/sort-array-by-parity-ii) | [[排序](../sort/README.md)] [[数组](../array/README.md)] | Easy | +| 853 | [车队](../../problems/car-fleet) | [[排序](../sort/README.md)] | Medium | +| 767 | [重构字符串](../../problems/reorganize-string) | [[堆](../heap/README.md)] [[贪心算法](../greedy/README.md)] [[排序](../sort/README.md)] [[字符串](../string/README.md)] | Medium | +| 710 | [黑名单中的随机数](../../problems/random-pick-with-blacklist) | [[排序](../sort/README.md)] [[哈希表](../hash-table/README.md)] [[二分查找](../binary-search/README.md)] [[Random](../random/README.md)] | Hard | +| 527 | [单词缩写](../../problems/word-abbreviation) 🔒 | [[排序](../sort/README.md)] [[字符串](../string/README.md)] | Hard | +| 524 | [通过删除字母匹配到字典里最长单词](../../problems/longest-word-in-dictionary-through-deleting) | [[排序](../sort/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 493 | [翻转对](../../problems/reverse-pairs) | [[排序](../sort/README.md)] [[树状数组](../binary-indexed-tree/README.md)] [[线段树](../segment-tree/README.md)] [[二分查找](../binary-search/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Hard | +| 350 | [两个数组的交集 II](../../problems/intersection-of-two-arrays-ii) | [[排序](../sort/README.md)] [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] [[二分查找](../binary-search/README.md)] | Easy | +| 349 | [两个数组的交集](../../problems/intersection-of-two-arrays) | [[排序](../sort/README.md)] [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] [[二分查找](../binary-search/README.md)] | Easy | +| 327 | [区间和的个数](../../problems/count-of-range-sum) | [[排序](../sort/README.md)] [[树状数组](../binary-indexed-tree/README.md)] [[线段树](../segment-tree/README.md)] [[二分查找](../binary-search/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Hard | +| 324 | [摆动排序 II](../../problems/wiggle-sort-ii) | [[排序](../sort/README.md)] | Medium | +| 315 | [计算右侧小于当前元素的个数](../../problems/count-of-smaller-numbers-after-self) | [[排序](../sort/README.md)] [[树状数组](../binary-indexed-tree/README.md)] [[线段树](../segment-tree/README.md)] [[二分查找](../binary-search/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Hard | +| 296 | [最佳的碰头地点](../../problems/best-meeting-point) 🔒 | [[排序](../sort/README.md)] [[数学](../math/README.md)] | Hard | +| 280 | [摆动排序](../../problems/wiggle-sort) 🔒 | [[排序](../sort/README.md)] [[数组](../array/README.md)] | Medium | +| 274 | [H指数](../../problems/h-index) | [[排序](../sort/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 253 | [会议室 II](../../problems/meeting-rooms-ii) 🔒 | [[堆](../heap/README.md)] [[贪心算法](../greedy/README.md)] [[排序](../sort/README.md)] | Medium | +| 252 | [会议室](../../problems/meeting-rooms) 🔒 | [[排序](../sort/README.md)] | Easy | +| 242 | [有效的字母异位词](../../problems/valid-anagram) | [[排序](../sort/README.md)] [[哈希表](../hash-table/README.md)] | Easy | +| 220 | [存在重复元素 III](../../problems/contains-duplicate-iii) | [[排序](../sort/README.md)] [[Ordered Map](../ordered-map/README.md)] | Medium | +| 179 | [最大数](../../problems/largest-number) | [[排序](../sort/README.md)] | Medium | +| 164 | [最大间距](../../problems/maximum-gap) | [[排序](../sort/README.md)] | Hard | +| 148 | [排序链表](../../problems/sort-list) | [[排序](../sort/README.md)] [[链表](../linked-list/README.md)] | Medium | +| 147 | [对链表进行插入排序](../../problems/insertion-sort-list) | [[排序](../sort/README.md)] [[链表](../linked-list/README.md)] | Medium | +| 75 | [颜色分类](../../problems/sort-colors) | [[排序](../sort/README.md)] [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 57 | [插入区间](../../problems/insert-interval) | [[排序](../sort/README.md)] [[数组](../array/README.md)] | Hard | +| 56 | [合并区间](../../problems/merge-intervals) | [[排序](../sort/README.md)] [[数组](../array/README.md)] | Medium | diff --git a/tag/stack/README.md b/tag/stack/README.md index d280a120e..a67c9392d 100644 --- a/tag/stack/README.md +++ b/tag/stack/README.md @@ -5,61 +5,61 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > 栈 +## [话题分类](../README.md) > 栈 | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 1249 | [移除无效的括号](https://github.com/openset/leetcode/tree/master/problems/minimum-remove-to-make-valid-parentheses) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 1209 | [删除字符串中的所有相邻重复项 II](https://github.com/openset/leetcode/tree/master/problems/remove-all-adjacent-duplicates-in-string-ii) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] | Medium | -| 1190 | [反转每对括号间的子串](https://github.com/openset/leetcode/tree/master/problems/reverse-substrings-between-each-pair-of-parentheses) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] | Medium | -| 1130 | [叶值的最小代价生成树](https://github.com/openset/leetcode/tree/master/problems/minimum-cost-tree-from-leaf-values) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 1124 | [表现良好的最长时间段](https://github.com/openset/leetcode/tree/master/problems/longest-well-performing-interval) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] | Medium | -| 1063 | [有效子数组的数目](https://github.com/openset/leetcode/tree/master/problems/number-of-valid-subarrays) 🔒 | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] | Hard | -| 1047 | [删除字符串中的所有相邻重复项](https://github.com/openset/leetcode/tree/master/problems/remove-all-adjacent-duplicates-in-string) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] | Easy | -| 1021 | [删除最外层的括号](https://github.com/openset/leetcode/tree/master/problems/remove-outermost-parentheses) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] | Easy | -| 1019 | [链表中的下一个更大节点](https://github.com/openset/leetcode/tree/master/problems/next-greater-node-in-linked-list) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] | Medium | -| 1003 | [检查替换后的词是否有效](https://github.com/openset/leetcode/tree/master/problems/check-if-word-is-valid-after-substitutions) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 975 | [奇偶跳](https://github.com/openset/leetcode/tree/master/problems/odd-even-jump) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] [[Ordered Map](https://github.com/openset/leetcode/tree/master/tag/ordered-map/README.md)] | Hard | -| 946 | [验证栈序列](https://github.com/openset/leetcode/tree/master/problems/validate-stack-sequences) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] | Medium | -| 921 | [使括号有效的最少添加](https://github.com/openset/leetcode/tree/master/problems/minimum-add-to-make-parentheses-valid) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Medium | -| 907 | [子数组的最小值之和](https://github.com/openset/leetcode/tree/master/problems/sum-of-subarray-minimums) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 901 | [股票价格跨度](https://github.com/openset/leetcode/tree/master/problems/online-stock-span) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] | Medium | -| 895 | [最大频率栈](https://github.com/openset/leetcode/tree/master/problems/maximum-frequency-stack) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Hard | -| 880 | [索引处的解码字符串](https://github.com/openset/leetcode/tree/master/problems/decoded-string-at-index) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] | Medium | -| 856 | [括号的分数](https://github.com/openset/leetcode/tree/master/problems/score-of-parentheses) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 844 | [比较含退格的字符串](https://github.com/openset/leetcode/tree/master/problems/backspace-string-compare) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Easy | -| 772 | [基本计算器 III](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-iii) 🔒 | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 770 | [基本计算器 IV](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-iv) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 739 | [每日温度](https://github.com/openset/leetcode/tree/master/problems/daily-temperatures) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 735 | [行星碰撞](https://github.com/openset/leetcode/tree/master/problems/asteroid-collision) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] | Medium | -| 726 | [原子的数量](https://github.com/openset/leetcode/tree/master/problems/number-of-atoms) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Hard | -| 682 | [棒球比赛](https://github.com/openset/leetcode/tree/master/problems/baseball-game) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] | Easy | -| 636 | [函数的独占时间](https://github.com/openset/leetcode/tree/master/problems/exclusive-time-of-functions) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] | Medium | -| 591 | [标签验证器](https://github.com/openset/leetcode/tree/master/problems/tag-validator) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 503 | [下一个更大元素 II](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-ii) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] | Medium | -| 496 | [下一个更大元素 I](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-i) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] | Easy | -| 456 | [132模式](https://github.com/openset/leetcode/tree/master/problems/132-pattern) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] | Medium | -| 439 | [三元表达式解析器](https://github.com/openset/leetcode/tree/master/problems/ternary-expression-parser) 🔒 | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 402 | [移掉K位数字](https://github.com/openset/leetcode/tree/master/problems/remove-k-digits) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Medium | -| 394 | [字符串解码](https://github.com/openset/leetcode/tree/master/problems/decode-string) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 385 | [迷你语法分析器](https://github.com/openset/leetcode/tree/master/problems/mini-parser) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 341 | [扁平化嵌套列表迭代器](https://github.com/openset/leetcode/tree/master/problems/flatten-nested-list-iterator) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] | Medium | -| 331 | [验证二叉树的前序序列化](https://github.com/openset/leetcode/tree/master/problems/verify-preorder-serialization-of-a-binary-tree) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] | Medium | -| 316 | [去除重复字母](https://github.com/openset/leetcode/tree/master/problems/remove-duplicate-letters) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] | Hard | -| 272 | [最接近的二叉搜索树值 II](https://github.com/openset/leetcode/tree/master/problems/closest-binary-search-tree-value-ii) 🔒 | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Hard | -| 255 | [验证前序遍历序列二叉搜索树](https://github.com/openset/leetcode/tree/master/problems/verify-preorder-sequence-in-binary-search-tree) 🔒 | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Medium | -| 232 | [用栈实现队列](https://github.com/openset/leetcode/tree/master/problems/implement-queue-using-stacks) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] | Easy | -| 225 | [用队列实现栈](https://github.com/openset/leetcode/tree/master/problems/implement-stack-using-queues) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] | Easy | -| 224 | [基本计算器](https://github.com/openset/leetcode/tree/master/problems/basic-calculator) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Hard | -| 173 | [二叉搜索树迭代器](https://github.com/openset/leetcode/tree/master/problems/binary-search-tree-iterator) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] | Medium | -| 155 | [最小栈](https://github.com/openset/leetcode/tree/master/problems/min-stack) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] | Easy | -| 150 | [逆波兰表达式求值](https://github.com/openset/leetcode/tree/master/problems/evaluate-reverse-polish-notation) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] | Medium | -| 145 | [二叉树的后序遍历](https://github.com/openset/leetcode/tree/master/problems/binary-tree-postorder-traversal) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Hard | -| 144 | [二叉树的前序遍历](https://github.com/openset/leetcode/tree/master/problems/binary-tree-preorder-traversal) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Medium | -| 103 | [二叉树的锯齿形层次遍历](https://github.com/openset/leetcode/tree/master/problems/binary-tree-zigzag-level-order-traversal) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 94 | [二叉树的中序遍历](https://github.com/openset/leetcode/tree/master/problems/binary-tree-inorder-traversal) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 85 | [最大矩形](https://github.com/openset/leetcode/tree/master/problems/maximal-rectangle) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 84 | [柱状图中最大的矩形](https://github.com/openset/leetcode/tree/master/problems/largest-rectangle-in-histogram) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Hard | -| 71 | [简化路径](https://github.com/openset/leetcode/tree/master/problems/simplify-path) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 42 | [接雨水](https://github.com/openset/leetcode/tree/master/problems/trapping-rain-water) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Hard | -| 20 | [有效的括号](https://github.com/openset/leetcode/tree/master/problems/valid-parentheses) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | +| 1249 | [移除无效的括号](../../problems/minimum-remove-to-make-valid-parentheses) | [[栈](../stack/README.md)] [[字符串](../string/README.md)] | Medium | +| 1209 | [删除字符串中的所有相邻重复项 II](../../problems/remove-all-adjacent-duplicates-in-string-ii) | [[栈](../stack/README.md)] | Medium | +| 1190 | [反转每对括号间的子串](../../problems/reverse-substrings-between-each-pair-of-parentheses) | [[栈](../stack/README.md)] | Medium | +| 1130 | [叶值的最小代价生成树](../../problems/minimum-cost-tree-from-leaf-values) | [[栈](../stack/README.md)] [[树](../tree/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 1124 | [表现良好的最长时间段](../../problems/longest-well-performing-interval) | [[栈](../stack/README.md)] | Medium | +| 1063 | [有效子数组的数目](../../problems/number-of-valid-subarrays) 🔒 | [[栈](../stack/README.md)] | Hard | +| 1047 | [删除字符串中的所有相邻重复项](../../problems/remove-all-adjacent-duplicates-in-string) | [[栈](../stack/README.md)] | Easy | +| 1021 | [删除最外层的括号](../../problems/remove-outermost-parentheses) | [[栈](../stack/README.md)] | Easy | +| 1019 | [链表中的下一个更大节点](../../problems/next-greater-node-in-linked-list) | [[栈](../stack/README.md)] [[链表](../linked-list/README.md)] | Medium | +| 1003 | [检查替换后的词是否有效](../../problems/check-if-word-is-valid-after-substitutions) | [[栈](../stack/README.md)] [[字符串](../string/README.md)] | Medium | +| 975 | [奇偶跳](../../problems/odd-even-jump) | [[栈](../stack/README.md)] [[动态规划](../dynamic-programming/README.md)] [[Ordered Map](../ordered-map/README.md)] | Hard | +| 946 | [验证栈序列](../../problems/validate-stack-sequences) | [[栈](../stack/README.md)] | Medium | +| 921 | [使括号有效的最少添加](../../problems/minimum-add-to-make-parentheses-valid) | [[栈](../stack/README.md)] [[贪心算法](../greedy/README.md)] | Medium | +| 907 | [子数组的最小值之和](../../problems/sum-of-subarray-minimums) | [[栈](../stack/README.md)] [[数组](../array/README.md)] | Medium | +| 901 | [股票价格跨度](../../problems/online-stock-span) | [[栈](../stack/README.md)] | Medium | +| 895 | [最大频率栈](../../problems/maximum-frequency-stack) | [[栈](../stack/README.md)] [[哈希表](../hash-table/README.md)] | Hard | +| 880 | [索引处的解码字符串](../../problems/decoded-string-at-index) | [[栈](../stack/README.md)] | Medium | +| 856 | [括号的分数](../../problems/score-of-parentheses) | [[栈](../stack/README.md)] [[字符串](../string/README.md)] | Medium | +| 844 | [比较含退格的字符串](../../problems/backspace-string-compare) | [[栈](../stack/README.md)] [[双指针](../two-pointers/README.md)] | Easy | +| 772 | [基本计算器 III](../../problems/basic-calculator-iii) 🔒 | [[栈](../stack/README.md)] [[字符串](../string/README.md)] | Hard | +| 770 | [基本计算器 IV](../../problems/basic-calculator-iv) | [[栈](../stack/README.md)] [[哈希表](../hash-table/README.md)] [[字符串](../string/README.md)] | Hard | +| 739 | [每日温度](../../problems/daily-temperatures) | [[栈](../stack/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 735 | [行星碰撞](../../problems/asteroid-collision) | [[栈](../stack/README.md)] | Medium | +| 726 | [原子的数量](../../problems/number-of-atoms) | [[栈](../stack/README.md)] [[递归](../recursion/README.md)] [[哈希表](../hash-table/README.md)] | Hard | +| 682 | [棒球比赛](../../problems/baseball-game) | [[栈](../stack/README.md)] | Easy | +| 636 | [函数的独占时间](../../problems/exclusive-time-of-functions) | [[栈](../stack/README.md)] | Medium | +| 591 | [标签验证器](../../problems/tag-validator) | [[栈](../stack/README.md)] [[字符串](../string/README.md)] | Hard | +| 503 | [下一个更大元素 II](../../problems/next-greater-element-ii) | [[栈](../stack/README.md)] | Medium | +| 496 | [下一个更大元素 I](../../problems/next-greater-element-i) | [[栈](../stack/README.md)] | Easy | +| 456 | [132模式](../../problems/132-pattern) | [[栈](../stack/README.md)] | Medium | +| 439 | [三元表达式解析器](../../problems/ternary-expression-parser) 🔒 | [[栈](../stack/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 402 | [移掉K位数字](../../problems/remove-k-digits) | [[栈](../stack/README.md)] [[贪心算法](../greedy/README.md)] | Medium | +| 394 | [字符串解码](../../problems/decode-string) | [[栈](../stack/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 385 | [迷你语法分析器](../../problems/mini-parser) | [[栈](../stack/README.md)] [[字符串](../string/README.md)] | Medium | +| 341 | [扁平化嵌套列表迭代器](../../problems/flatten-nested-list-iterator) | [[栈](../stack/README.md)] [[设计](../design/README.md)] | Medium | +| 331 | [验证二叉树的前序序列化](../../problems/verify-preorder-serialization-of-a-binary-tree) | [[栈](../stack/README.md)] | Medium | +| 316 | [去除重复字母](../../problems/remove-duplicate-letters) | [[栈](../stack/README.md)] [[贪心算法](../greedy/README.md)] | Hard | +| 272 | [最接近的二叉搜索树值 II](../../problems/closest-binary-search-tree-value-ii) 🔒 | [[栈](../stack/README.md)] [[树](../tree/README.md)] | Hard | +| 255 | [验证前序遍历序列二叉搜索树](../../problems/verify-preorder-sequence-in-binary-search-tree) 🔒 | [[栈](../stack/README.md)] [[树](../tree/README.md)] | Medium | +| 232 | [用栈实现队列](../../problems/implement-queue-using-stacks) | [[栈](../stack/README.md)] [[设计](../design/README.md)] | Easy | +| 225 | [用队列实现栈](../../problems/implement-stack-using-queues) | [[栈](../stack/README.md)] [[设计](../design/README.md)] | Easy | +| 224 | [基本计算器](../../problems/basic-calculator) | [[栈](../stack/README.md)] [[数学](../math/README.md)] | Hard | +| 173 | [二叉搜索树迭代器](../../problems/binary-search-tree-iterator) | [[栈](../stack/README.md)] [[树](../tree/README.md)] [[设计](../design/README.md)] | Medium | +| 155 | [最小栈](../../problems/min-stack) | [[栈](../stack/README.md)] [[设计](../design/README.md)] | Easy | +| 150 | [逆波兰表达式求值](../../problems/evaluate-reverse-polish-notation) | [[栈](../stack/README.md)] | Medium | +| 145 | [二叉树的后序遍历](../../problems/binary-tree-postorder-traversal) | [[栈](../stack/README.md)] [[树](../tree/README.md)] | Hard | +| 144 | [二叉树的前序遍历](../../problems/binary-tree-preorder-traversal) | [[栈](../stack/README.md)] [[树](../tree/README.md)] | Medium | +| 103 | [二叉树的锯齿形层次遍历](../../problems/binary-tree-zigzag-level-order-traversal) | [[栈](../stack/README.md)] [[树](../tree/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 94 | [二叉树的中序遍历](../../problems/binary-tree-inorder-traversal) | [[栈](../stack/README.md)] [[树](../tree/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 85 | [最大矩形](../../problems/maximal-rectangle) | [[栈](../stack/README.md)] [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 84 | [柱状图中最大的矩形](../../problems/largest-rectangle-in-histogram) | [[栈](../stack/README.md)] [[数组](../array/README.md)] | Hard | +| 71 | [简化路径](../../problems/simplify-path) | [[栈](../stack/README.md)] [[字符串](../string/README.md)] | Medium | +| 42 | [接雨水](../../problems/trapping-rain-water) | [[栈](../stack/README.md)] [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] | Hard | +| 20 | [有效的括号](../../problems/valid-parentheses) | [[栈](../stack/README.md)] [[字符串](../string/README.md)] | Easy | diff --git a/tag/string/README.md b/tag/string/README.md index 3db7038fb..82fa26b3c 100644 --- a/tag/string/README.md +++ b/tag/string/README.md @@ -5,157 +5,157 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > 字符串 +## [话题分类](../README.md) > 字符串 | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 1271 | [十六进制魔术数字](https://github.com/openset/leetcode/tree/master/problems/hexspeak) 🔒 | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 1268 | [搜索推荐系统](https://github.com/openset/leetcode/tree/master/problems/search-suggestions-system) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 1249 | [移除无效的括号](https://github.com/openset/leetcode/tree/master/problems/minimum-remove-to-make-valid-parentheses) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 1247 | [交换字符使得字符串相同](https://github.com/openset/leetcode/tree/master/problems/minimum-swaps-to-make-strings-equal) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 1234 | [替换子串得到平衡字符串](https://github.com/openset/leetcode/tree/master/problems/replace-the-substring-for-balanced-string) | [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 1233 | [删除子文件夹](https://github.com/openset/leetcode/tree/master/problems/remove-sub-folders-from-the-filesystem) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 1221 | [分割平衡字符串](https://github.com/openset/leetcode/tree/master/problems/split-a-string-in-balanced-strings) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 1216 | [验证回文字符串 III](https://github.com/openset/leetcode/tree/master/problems/valid-palindrome-iii) 🔒 | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 1189 | [“气球” 的最大数量](https://github.com/openset/leetcode/tree/master/problems/maximum-number-of-balloons) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 1181 | [前后拼接](https://github.com/openset/leetcode/tree/master/problems/before-and-after-puzzle) 🔒 | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 1180 | [统计只含单一字母的子串](https://github.com/openset/leetcode/tree/master/problems/count-substrings-with-only-one-distinct-letter) 🔒 | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 1177 | [构建回文串检测](https://github.com/openset/leetcode/tree/master/problems/can-make-palindrome-from-substring) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 1170 | [比较字符串最小字母出现频次](https://github.com/openset/leetcode/tree/master/problems/compare-strings-by-frequency-of-the-smallest-character) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 1169 | [查询无效交易](https://github.com/openset/leetcode/tree/master/problems/invalid-transactions) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 1165 | [单行键盘](https://github.com/openset/leetcode/tree/master/problems/single-row-keyboard) 🔒 | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 1163 | [按字典序排在最后的子串](https://github.com/openset/leetcode/tree/master/problems/last-substring-in-lexicographical-order) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 1156 | [单字符重复子串的最大长度](https://github.com/openset/leetcode/tree/master/problems/swap-for-longest-repeated-character-substring) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 1138 | [字母板上的路径](https://github.com/openset/leetcode/tree/master/problems/alphabet-board-path) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 1119 | [删去字符串中的元音](https://github.com/openset/leetcode/tree/master/problems/remove-vowels-from-a-string) 🔒 | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 1108 | [IP 地址无效化](https://github.com/openset/leetcode/tree/master/problems/defanging-an-ip-address) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 1106 | [解析布尔表达式](https://github.com/openset/leetcode/tree/master/problems/parsing-a-boolean-expression) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 1100 | [长度为 K 的无重复字符子串](https://github.com/openset/leetcode/tree/master/problems/find-k-length-substrings-with-no-repeated-characters) 🔒 | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Medium | -| 1096 | [花括号展开 II](https://github.com/openset/leetcode/tree/master/problems/brace-expansion-ii) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 1081 | [不同字符的最小子序列](https://github.com/openset/leetcode/tree/master/problems/smallest-subsequence-of-distinct-characters) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 1071 | [字符串的最大公因子](https://github.com/openset/leetcode/tree/master/problems/greatest-common-divisor-of-strings) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 1065 | [字符串的索引对](https://github.com/openset/leetcode/tree/master/problems/index-pairs-of-a-string) 🔒 | [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 1062 | [最长重复子串](https://github.com/openset/leetcode/tree/master/problems/longest-repeating-substring) 🔒 | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 1023 | [驼峰式匹配](https://github.com/openset/leetcode/tree/master/problems/camelcase-matching) | [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 1016 | [子串能表示从 1 到 N 数字的二进制串](https://github.com/openset/leetcode/tree/master/problems/binary-string-with-substrings-representing-1-to-n) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 1003 | [检查替换后的词是否有效](https://github.com/openset/leetcode/tree/master/problems/check-if-word-is-valid-after-substitutions) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 966 | [元音拼写检查器](https://github.com/openset/leetcode/tree/master/problems/vowel-spellchecker) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 937 | [重新排列日志文件](https://github.com/openset/leetcode/tree/master/problems/reorder-data-in-log-files) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 936 | [戳印序列](https://github.com/openset/leetcode/tree/master/problems/stamping-the-sequence) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 929 | [独特的电子邮件地址](https://github.com/openset/leetcode/tree/master/problems/unique-email-addresses) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 925 | [长按键入](https://github.com/openset/leetcode/tree/master/problems/long-pressed-name) | [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 917 | [仅仅反转字母](https://github.com/openset/leetcode/tree/master/problems/reverse-only-letters) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 916 | [单词子集](https://github.com/openset/leetcode/tree/master/problems/word-subsets) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 899 | [有序队列](https://github.com/openset/leetcode/tree/master/problems/orderly-queue) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 893 | [特殊等价字符串组](https://github.com/openset/leetcode/tree/master/problems/groups-of-special-equivalent-strings) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 890 | [查找和替换模式](https://github.com/openset/leetcode/tree/master/problems/find-and-replace-pattern) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 859 | [亲密字符串](https://github.com/openset/leetcode/tree/master/problems/buddy-strings) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 856 | [括号的分数](https://github.com/openset/leetcode/tree/master/problems/score-of-parentheses) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 848 | [字母移位](https://github.com/openset/leetcode/tree/master/problems/shifting-letters) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 842 | [将数组拆分成斐波那契序列](https://github.com/openset/leetcode/tree/master/problems/split-array-into-fibonacci-sequence) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 833 | [字符串中的查找与替换](https://github.com/openset/leetcode/tree/master/problems/find-and-replace-in-string) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 831 | [隐藏个人信息](https://github.com/openset/leetcode/tree/master/problems/masking-personal-information) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 824 | [山羊拉丁文](https://github.com/openset/leetcode/tree/master/problems/goat-latin) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 819 | [最常见的单词](https://github.com/openset/leetcode/tree/master/problems/most-common-word) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 816 | [模糊坐标](https://github.com/openset/leetcode/tree/master/problems/ambiguous-coordinates) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 809 | [情感丰富的文字](https://github.com/openset/leetcode/tree/master/problems/expressive-words) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 804 | [唯一摩尔斯密码词](https://github.com/openset/leetcode/tree/master/problems/unique-morse-code-words) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 800 | [相似 RGB 颜色](https://github.com/openset/leetcode/tree/master/problems/similar-rgb-color) 🔒 | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 791 | [自定义字符串排序](https://github.com/openset/leetcode/tree/master/problems/custom-sort-string) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 788 | [旋转数字](https://github.com/openset/leetcode/tree/master/problems/rotated-digits) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 772 | [基本计算器 III](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-iii) 🔒 | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 770 | [基本计算器 IV](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-iv) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 767 | [重构字符串](https://github.com/openset/leetcode/tree/master/problems/reorganize-string) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 761 | [特殊的二进制序列](https://github.com/openset/leetcode/tree/master/problems/special-binary-string) | [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 758 | [字符串中的加粗单词](https://github.com/openset/leetcode/tree/master/problems/bold-words-in-string) 🔒 | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 736 | [Lisp 语法解析](https://github.com/openset/leetcode/tree/master/problems/parse-lisp-expression) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 730 | [统计不同回文子字符串](https://github.com/openset/leetcode/tree/master/problems/count-different-palindromic-subsequences) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 722 | [删除注释](https://github.com/openset/leetcode/tree/master/problems/remove-comments) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 709 | [转换成小写字母](https://github.com/openset/leetcode/tree/master/problems/to-lower-case) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 696 | [计数二进制子串](https://github.com/openset/leetcode/tree/master/problems/count-binary-substrings) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 686 | [重复叠加字符串匹配](https://github.com/openset/leetcode/tree/master/problems/repeated-string-match) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 681 | [最近时刻](https://github.com/openset/leetcode/tree/master/problems/next-closest-time) 🔒 | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 680 | [验证回文字符串 Ⅱ](https://github.com/openset/leetcode/tree/master/problems/valid-palindrome-ii) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 678 | [有效的括号字符串](https://github.com/openset/leetcode/tree/master/problems/valid-parenthesis-string) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 657 | [机器人能否返回原点](https://github.com/openset/leetcode/tree/master/problems/robot-return-to-origin) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 647 | [回文子串](https://github.com/openset/leetcode/tree/master/problems/palindromic-substrings) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 635 | [设计日志存储系统](https://github.com/openset/leetcode/tree/master/problems/design-log-storage-system) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 632 | [最小区间](https://github.com/openset/leetcode/tree/master/problems/smallest-range-covering-elements-from-k-lists) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 616 | [给字符串添加加粗标签](https://github.com/openset/leetcode/tree/master/problems/add-bold-tag-in-string) 🔒 | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 609 | [在系统中查找重复文件](https://github.com/openset/leetcode/tree/master/problems/find-duplicate-file-in-system) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 606 | [根据二叉树创建字符串](https://github.com/openset/leetcode/tree/master/problems/construct-string-from-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 591 | [标签验证器](https://github.com/openset/leetcode/tree/master/problems/tag-validator) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 583 | [两个字符串的删除操作](https://github.com/openset/leetcode/tree/master/problems/delete-operation-for-two-strings) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 564 | [寻找最近的回文数](https://github.com/openset/leetcode/tree/master/problems/find-the-closest-palindrome) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 557 | [反转字符串中的单词 III](https://github.com/openset/leetcode/tree/master/problems/reverse-words-in-a-string-iii) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 556 | [下一个更大元素 III](https://github.com/openset/leetcode/tree/master/problems/next-greater-element-iii) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 555 | [分割连接字符串](https://github.com/openset/leetcode/tree/master/problems/split-concatenated-strings) 🔒 | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 553 | [最优除法](https://github.com/openset/leetcode/tree/master/problems/optimal-division) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 551 | [学生出勤记录 I](https://github.com/openset/leetcode/tree/master/problems/student-attendance-record-i) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 544 | [输出比赛匹配对](https://github.com/openset/leetcode/tree/master/problems/output-contest-matches) 🔒 | [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 541 | [反转字符串 II](https://github.com/openset/leetcode/tree/master/problems/reverse-string-ii) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 539 | [最小时间差](https://github.com/openset/leetcode/tree/master/problems/minimum-time-difference) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 537 | [复数乘法](https://github.com/openset/leetcode/tree/master/problems/complex-number-multiplication) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 536 | [从字符串生成二叉树](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-string) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 527 | [单词缩写](https://github.com/openset/leetcode/tree/master/problems/word-abbreviation) 🔒 | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 522 | [最长特殊序列 II](https://github.com/openset/leetcode/tree/master/problems/longest-uncommon-subsequence-ii) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 521 | [最长特殊序列 Ⅰ](https://github.com/openset/leetcode/tree/master/problems/longest-uncommon-subsequence-i) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 520 | [检测大写字母](https://github.com/openset/leetcode/tree/master/problems/detect-capital) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 468 | [验证IP地址](https://github.com/openset/leetcode/tree/master/problems/validate-ip-address) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 459 | [重复的子字符串](https://github.com/openset/leetcode/tree/master/problems/repeated-substring-pattern) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 443 | [压缩字符串](https://github.com/openset/leetcode/tree/master/problems/string-compression) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 434 | [字符串中的单词数](https://github.com/openset/leetcode/tree/master/problems/number-of-segments-in-a-string) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 415 | [字符串相加](https://github.com/openset/leetcode/tree/master/problems/add-strings) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 408 | [有效单词缩写](https://github.com/openset/leetcode/tree/master/problems/valid-word-abbreviation) 🔒 | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 387 | [字符串中的第一个唯一字符](https://github.com/openset/leetcode/tree/master/problems/first-unique-character-in-a-string) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 385 | [迷你语法分析器](https://github.com/openset/leetcode/tree/master/problems/mini-parser) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 383 | [赎金信](https://github.com/openset/leetcode/tree/master/problems/ransom-note) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 345 | [反转字符串中的元音字母](https://github.com/openset/leetcode/tree/master/problems/reverse-vowels-of-a-string) | [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 344 | [反转字符串](https://github.com/openset/leetcode/tree/master/problems/reverse-string) | [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 340 | [至多包含 K 个不同字符的最长子串](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-k-distinct-characters) 🔒 | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Hard | -| 336 | [回文对](https://github.com/openset/leetcode/tree/master/problems/palindrome-pairs) | [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 293 | [翻转游戏](https://github.com/openset/leetcode/tree/master/problems/flip-game) 🔒 | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 273 | [整数转换英文表示](https://github.com/openset/leetcode/tree/master/problems/integer-to-english-words) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 271 | [字符串的编码与解码](https://github.com/openset/leetcode/tree/master/problems/encode-and-decode-strings) 🔒 | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 249 | [移位字符串分组](https://github.com/openset/leetcode/tree/master/problems/group-shifted-strings) 🔒 | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 227 | [基本计算器 II](https://github.com/openset/leetcode/tree/master/problems/basic-calculator-ii) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 214 | [最短回文串](https://github.com/openset/leetcode/tree/master/problems/shortest-palindrome) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 186 | [翻转字符串里的单词 II](https://github.com/openset/leetcode/tree/master/problems/reverse-words-in-a-string-ii) 🔒 | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 165 | [比较版本号](https://github.com/openset/leetcode/tree/master/problems/compare-version-numbers) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 161 | [相隔为 1 的编辑距离](https://github.com/openset/leetcode/tree/master/problems/one-edit-distance) 🔒 | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 159 | [至多包含两个不同字符的最长子串](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-two-distinct-characters) 🔒 | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Medium | -| 158 | [用 Read4 读取 N 个字符 II](https://github.com/openset/leetcode/tree/master/problems/read-n-characters-given-read4-ii-call-multiple-times) 🔒 | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 157 | [用 Read4 读取 N 个字符](https://github.com/openset/leetcode/tree/master/problems/read-n-characters-given-read4) 🔒 | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 151 | [翻转字符串里的单词](https://github.com/openset/leetcode/tree/master/problems/reverse-words-in-a-string) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 126 | [单词接龙 II](https://github.com/openset/leetcode/tree/master/problems/word-ladder-ii) | [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | -| 125 | [验证回文串](https://github.com/openset/leetcode/tree/master/problems/valid-palindrome) | [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 115 | [不同的子序列](https://github.com/openset/leetcode/tree/master/problems/distinct-subsequences) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 97 | [交错字符串](https://github.com/openset/leetcode/tree/master/problems/interleaving-string) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 93 | [复原IP地址](https://github.com/openset/leetcode/tree/master/problems/restore-ip-addresses) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 91 | [解码方法](https://github.com/openset/leetcode/tree/master/problems/decode-ways) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 87 | [扰乱字符串](https://github.com/openset/leetcode/tree/master/problems/scramble-string) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 76 | [最小覆盖子串](https://github.com/openset/leetcode/tree/master/problems/minimum-window-substring) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Hard | -| 72 | [编辑距离](https://github.com/openset/leetcode/tree/master/problems/edit-distance) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 71 | [简化路径](https://github.com/openset/leetcode/tree/master/problems/simplify-path) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 68 | [文本左右对齐](https://github.com/openset/leetcode/tree/master/problems/text-justification) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 67 | [二进制求和](https://github.com/openset/leetcode/tree/master/problems/add-binary) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 65 | [有效数字](https://github.com/openset/leetcode/tree/master/problems/valid-number) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 58 | [最后一个单词的长度](https://github.com/openset/leetcode/tree/master/problems/length-of-last-word) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 49 | [字母异位词分组](https://github.com/openset/leetcode/tree/master/problems/group-anagrams) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 44 | [通配符匹配](https://github.com/openset/leetcode/tree/master/problems/wildcard-matching) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | -| 43 | [字符串相乘](https://github.com/openset/leetcode/tree/master/problems/multiply-strings) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 38 | [报数](https://github.com/openset/leetcode/tree/master/problems/count-and-say) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 32 | [最长有效括号](https://github.com/openset/leetcode/tree/master/problems/longest-valid-parentheses) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 30 | [串联所有单词的子串](https://github.com/openset/leetcode/tree/master/problems/substring-with-concatenation-of-all-words) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 28 | [实现 strStr()](https://github.com/openset/leetcode/tree/master/problems/implement-strstr) | [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 22 | [括号生成](https://github.com/openset/leetcode/tree/master/problems/generate-parentheses) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 20 | [有效的括号](https://github.com/openset/leetcode/tree/master/problems/valid-parentheses) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 17 | [电话号码的字母组合](https://github.com/openset/leetcode/tree/master/problems/letter-combinations-of-a-phone-number) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 14 | [最长公共前缀](https://github.com/openset/leetcode/tree/master/problems/longest-common-prefix) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 13 | [罗马数字转整数](https://github.com/openset/leetcode/tree/master/problems/roman-to-integer) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 12 | [整数转罗马数字](https://github.com/openset/leetcode/tree/master/problems/integer-to-roman) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 10 | [正则表达式匹配](https://github.com/openset/leetcode/tree/master/problems/regular-expression-matching) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | -| 8 | [字符串转换整数 (atoi)](https://github.com/openset/leetcode/tree/master/problems/string-to-integer-atoi) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 6 | [Z 字形变换](https://github.com/openset/leetcode/tree/master/problems/zigzag-conversion) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 5 | [最长回文子串](https://github.com/openset/leetcode/tree/master/problems/longest-palindromic-substring) | [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 3 | [无重复字符的最长子串](https://github.com/openset/leetcode/tree/master/problems/longest-substring-without-repeating-characters) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Medium | +| 1271 | [十六进制魔术数字](../../problems/hexspeak) 🔒 | [[数学](../math/README.md)] [[字符串](../string/README.md)] | Easy | +| 1268 | [搜索推荐系统](../../problems/search-suggestions-system) | [[字符串](../string/README.md)] | Medium | +| 1249 | [移除无效的括号](../../problems/minimum-remove-to-make-valid-parentheses) | [[栈](../stack/README.md)] [[字符串](../string/README.md)] | Medium | +| 1247 | [交换字符使得字符串相同](../../problems/minimum-swaps-to-make-strings-equal) | [[贪心算法](../greedy/README.md)] [[字符串](../string/README.md)] | Medium | +| 1234 | [替换子串得到平衡字符串](../../problems/replace-the-substring-for-balanced-string) | [[双指针](../two-pointers/README.md)] [[字符串](../string/README.md)] | Medium | +| 1233 | [删除子文件夹](../../problems/remove-sub-folders-from-the-filesystem) | [[数组](../array/README.md)] [[字符串](../string/README.md)] | Medium | +| 1221 | [分割平衡字符串](../../problems/split-a-string-in-balanced-strings) | [[贪心算法](../greedy/README.md)] [[字符串](../string/README.md)] | Easy | +| 1216 | [验证回文字符串 III](../../problems/valid-palindrome-iii) 🔒 | [[字符串](../string/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 1189 | [“气球” 的最大数量](../../problems/maximum-number-of-balloons) | [[哈希表](../hash-table/README.md)] [[字符串](../string/README.md)] | Easy | +| 1181 | [前后拼接](../../problems/before-and-after-puzzle) 🔒 | [[字符串](../string/README.md)] | Medium | +| 1180 | [统计只含单一字母的子串](../../problems/count-substrings-with-only-one-distinct-letter) 🔒 | [[数学](../math/README.md)] [[字符串](../string/README.md)] | Easy | +| 1177 | [构建回文串检测](../../problems/can-make-palindrome-from-substring) | [[数组](../array/README.md)] [[字符串](../string/README.md)] | Medium | +| 1170 | [比较字符串最小字母出现频次](../../problems/compare-strings-by-frequency-of-the-smallest-character) | [[数组](../array/README.md)] [[字符串](../string/README.md)] | Easy | +| 1169 | [查询无效交易](../../problems/invalid-transactions) | [[数组](../array/README.md)] [[字符串](../string/README.md)] | Medium | +| 1165 | [单行键盘](../../problems/single-row-keyboard) 🔒 | [[字符串](../string/README.md)] | Easy | +| 1163 | [按字典序排在最后的子串](../../problems/last-substring-in-lexicographical-order) | [[字符串](../string/README.md)] | Hard | +| 1156 | [单字符重复子串的最大长度](../../problems/swap-for-longest-repeated-character-substring) | [[字符串](../string/README.md)] | Medium | +| 1138 | [字母板上的路径](../../problems/alphabet-board-path) | [[哈希表](../hash-table/README.md)] [[字符串](../string/README.md)] | Medium | +| 1119 | [删去字符串中的元音](../../problems/remove-vowels-from-a-string) 🔒 | [[字符串](../string/README.md)] | Easy | +| 1108 | [IP 地址无效化](../../problems/defanging-an-ip-address) | [[字符串](../string/README.md)] | Easy | +| 1106 | [解析布尔表达式](../../problems/parsing-a-boolean-expression) | [[字符串](../string/README.md)] | Hard | +| 1100 | [长度为 K 的无重复字符子串](../../problems/find-k-length-substrings-with-no-repeated-characters) 🔒 | [[字符串](../string/README.md)] [[Sliding Window](../sliding-window/README.md)] | Medium | +| 1096 | [花括号展开 II](../../problems/brace-expansion-ii) | [[字符串](../string/README.md)] | Hard | +| 1081 | [不同字符的最小子序列](../../problems/smallest-subsequence-of-distinct-characters) | [[字符串](../string/README.md)] | Medium | +| 1071 | [字符串的最大公因子](../../problems/greatest-common-divisor-of-strings) | [[字符串](../string/README.md)] | Easy | +| 1065 | [字符串的索引对](../../problems/index-pairs-of-a-string) 🔒 | [[字典树](../trie/README.md)] [[字符串](../string/README.md)] | Easy | +| 1062 | [最长重复子串](../../problems/longest-repeating-substring) 🔒 | [[字符串](../string/README.md)] | Medium | +| 1023 | [驼峰式匹配](../../problems/camelcase-matching) | [[字典树](../trie/README.md)] [[字符串](../string/README.md)] | Medium | +| 1016 | [子串能表示从 1 到 N 数字的二进制串](../../problems/binary-string-with-substrings-representing-1-to-n) | [[字符串](../string/README.md)] | Medium | +| 1003 | [检查替换后的词是否有效](../../problems/check-if-word-is-valid-after-substitutions) | [[栈](../stack/README.md)] [[字符串](../string/README.md)] | Medium | +| 966 | [元音拼写检查器](../../problems/vowel-spellchecker) | [[哈希表](../hash-table/README.md)] [[字符串](../string/README.md)] | Medium | +| 937 | [重新排列日志文件](../../problems/reorder-data-in-log-files) | [[字符串](../string/README.md)] | Easy | +| 936 | [戳印序列](../../problems/stamping-the-sequence) | [[贪心算法](../greedy/README.md)] [[字符串](../string/README.md)] | Hard | +| 929 | [独特的电子邮件地址](../../problems/unique-email-addresses) | [[字符串](../string/README.md)] | Easy | +| 925 | [长按键入](../../problems/long-pressed-name) | [[双指针](../two-pointers/README.md)] [[字符串](../string/README.md)] | Easy | +| 917 | [仅仅反转字母](../../problems/reverse-only-letters) | [[字符串](../string/README.md)] | Easy | +| 916 | [单词子集](../../problems/word-subsets) | [[字符串](../string/README.md)] | Medium | +| 899 | [有序队列](../../problems/orderly-queue) | [[数学](../math/README.md)] [[字符串](../string/README.md)] | Hard | +| 893 | [特殊等价字符串组](../../problems/groups-of-special-equivalent-strings) | [[字符串](../string/README.md)] | Easy | +| 890 | [查找和替换模式](../../problems/find-and-replace-pattern) | [[字符串](../string/README.md)] | Medium | +| 859 | [亲密字符串](../../problems/buddy-strings) | [[字符串](../string/README.md)] | Easy | +| 856 | [括号的分数](../../problems/score-of-parentheses) | [[栈](../stack/README.md)] [[字符串](../string/README.md)] | Medium | +| 848 | [字母移位](../../problems/shifting-letters) | [[字符串](../string/README.md)] | Medium | +| 842 | [将数组拆分成斐波那契序列](../../problems/split-array-into-fibonacci-sequence) | [[贪心算法](../greedy/README.md)] [[字符串](../string/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 833 | [字符串中的查找与替换](../../problems/find-and-replace-in-string) | [[字符串](../string/README.md)] | Medium | +| 831 | [隐藏个人信息](../../problems/masking-personal-information) | [[字符串](../string/README.md)] | Medium | +| 824 | [山羊拉丁文](../../problems/goat-latin) | [[字符串](../string/README.md)] | Easy | +| 819 | [最常见的单词](../../problems/most-common-word) | [[字符串](../string/README.md)] | Easy | +| 816 | [模糊坐标](../../problems/ambiguous-coordinates) | [[字符串](../string/README.md)] | Medium | +| 809 | [情感丰富的文字](../../problems/expressive-words) | [[字符串](../string/README.md)] | Medium | +| 804 | [唯一摩尔斯密码词](../../problems/unique-morse-code-words) | [[字符串](../string/README.md)] | Easy | +| 800 | [相似 RGB 颜色](../../problems/similar-rgb-color) 🔒 | [[数学](../math/README.md)] [[字符串](../string/README.md)] | Easy | +| 791 | [自定义字符串排序](../../problems/custom-sort-string) | [[字符串](../string/README.md)] | Medium | +| 788 | [旋转数字](../../problems/rotated-digits) | [[字符串](../string/README.md)] | Easy | +| 772 | [基本计算器 III](../../problems/basic-calculator-iii) 🔒 | [[栈](../stack/README.md)] [[字符串](../string/README.md)] | Hard | +| 770 | [基本计算器 IV](../../problems/basic-calculator-iv) | [[栈](../stack/README.md)] [[哈希表](../hash-table/README.md)] [[字符串](../string/README.md)] | Hard | +| 767 | [重构字符串](../../problems/reorganize-string) | [[堆](../heap/README.md)] [[贪心算法](../greedy/README.md)] [[排序](../sort/README.md)] [[字符串](../string/README.md)] | Medium | +| 761 | [特殊的二进制序列](../../problems/special-binary-string) | [[递归](../recursion/README.md)] [[字符串](../string/README.md)] | Hard | +| 758 | [字符串中的加粗单词](../../problems/bold-words-in-string) 🔒 | [[字符串](../string/README.md)] | Easy | +| 736 | [Lisp 语法解析](../../problems/parse-lisp-expression) | [[字符串](../string/README.md)] | Hard | +| 730 | [统计不同回文子字符串](../../problems/count-different-palindromic-subsequences) | [[字符串](../string/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 722 | [删除注释](../../problems/remove-comments) | [[字符串](../string/README.md)] | Medium | +| 709 | [转换成小写字母](../../problems/to-lower-case) | [[字符串](../string/README.md)] | Easy | +| 696 | [计数二进制子串](../../problems/count-binary-substrings) | [[字符串](../string/README.md)] | Easy | +| 686 | [重复叠加字符串匹配](../../problems/repeated-string-match) | [[字符串](../string/README.md)] | Easy | +| 681 | [最近时刻](../../problems/next-closest-time) 🔒 | [[字符串](../string/README.md)] | Medium | +| 680 | [验证回文字符串 Ⅱ](../../problems/valid-palindrome-ii) | [[字符串](../string/README.md)] | Easy | +| 678 | [有效的括号字符串](../../problems/valid-parenthesis-string) | [[字符串](../string/README.md)] | Medium | +| 657 | [机器人能否返回原点](../../problems/robot-return-to-origin) | [[字符串](../string/README.md)] | Easy | +| 647 | [回文子串](../../problems/palindromic-substrings) | [[字符串](../string/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 635 | [设计日志存储系统](../../problems/design-log-storage-system) 🔒 | [[设计](../design/README.md)] [[字符串](../string/README.md)] | Medium | +| 632 | [最小区间](../../problems/smallest-range-covering-elements-from-k-lists) | [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] [[字符串](../string/README.md)] | Hard | +| 616 | [给字符串添加加粗标签](../../problems/add-bold-tag-in-string) 🔒 | [[字符串](../string/README.md)] | Medium | +| 609 | [在系统中查找重复文件](../../problems/find-duplicate-file-in-system) | [[哈希表](../hash-table/README.md)] [[字符串](../string/README.md)] | Medium | +| 606 | [根据二叉树创建字符串](../../problems/construct-string-from-binary-tree) | [[树](../tree/README.md)] [[字符串](../string/README.md)] | Easy | +| 591 | [标签验证器](../../problems/tag-validator) | [[栈](../stack/README.md)] [[字符串](../string/README.md)] | Hard | +| 583 | [两个字符串的删除操作](../../problems/delete-operation-for-two-strings) | [[字符串](../string/README.md)] | Medium | +| 564 | [寻找最近的回文数](../../problems/find-the-closest-palindrome) | [[字符串](../string/README.md)] | Hard | +| 557 | [反转字符串中的单词 III](../../problems/reverse-words-in-a-string-iii) | [[字符串](../string/README.md)] | Easy | +| 556 | [下一个更大元素 III](../../problems/next-greater-element-iii) | [[字符串](../string/README.md)] | Medium | +| 555 | [分割连接字符串](../../problems/split-concatenated-strings) 🔒 | [[字符串](../string/README.md)] | Medium | +| 553 | [最优除法](../../problems/optimal-division) | [[数学](../math/README.md)] [[字符串](../string/README.md)] | Medium | +| 551 | [学生出勤记录 I](../../problems/student-attendance-record-i) | [[字符串](../string/README.md)] | Easy | +| 544 | [输出比赛匹配对](../../problems/output-contest-matches) 🔒 | [[递归](../recursion/README.md)] [[字符串](../string/README.md)] | Medium | +| 541 | [反转字符串 II](../../problems/reverse-string-ii) | [[字符串](../string/README.md)] | Easy | +| 539 | [最小时间差](../../problems/minimum-time-difference) | [[字符串](../string/README.md)] | Medium | +| 537 | [复数乘法](../../problems/complex-number-multiplication) | [[数学](../math/README.md)] [[字符串](../string/README.md)] | Medium | +| 536 | [从字符串生成二叉树](../../problems/construct-binary-tree-from-string) 🔒 | [[树](../tree/README.md)] [[字符串](../string/README.md)] | Medium | +| 527 | [单词缩写](../../problems/word-abbreviation) 🔒 | [[排序](../sort/README.md)] [[字符串](../string/README.md)] | Hard | +| 522 | [最长特殊序列 II](../../problems/longest-uncommon-subsequence-ii) | [[字符串](../string/README.md)] | Medium | +| 521 | [最长特殊序列 Ⅰ](../../problems/longest-uncommon-subsequence-i) | [[字符串](../string/README.md)] | Easy | +| 520 | [检测大写字母](../../problems/detect-capital) | [[字符串](../string/README.md)] | Easy | +| 468 | [验证IP地址](../../problems/validate-ip-address) | [[字符串](../string/README.md)] | Medium | +| 459 | [重复的子字符串](../../problems/repeated-substring-pattern) | [[字符串](../string/README.md)] | Easy | +| 443 | [压缩字符串](../../problems/string-compression) | [[字符串](../string/README.md)] | Easy | +| 434 | [字符串中的单词数](../../problems/number-of-segments-in-a-string) | [[字符串](../string/README.md)] | Easy | +| 415 | [字符串相加](../../problems/add-strings) | [[字符串](../string/README.md)] | Easy | +| 408 | [有效单词缩写](../../problems/valid-word-abbreviation) 🔒 | [[字符串](../string/README.md)] | Easy | +| 387 | [字符串中的第一个唯一字符](../../problems/first-unique-character-in-a-string) | [[哈希表](../hash-table/README.md)] [[字符串](../string/README.md)] | Easy | +| 385 | [迷你语法分析器](../../problems/mini-parser) | [[栈](../stack/README.md)] [[字符串](../string/README.md)] | Medium | +| 383 | [赎金信](../../problems/ransom-note) | [[字符串](../string/README.md)] | Easy | +| 345 | [反转字符串中的元音字母](../../problems/reverse-vowels-of-a-string) | [[双指针](../two-pointers/README.md)] [[字符串](../string/README.md)] | Easy | +| 344 | [反转字符串](../../problems/reverse-string) | [[双指针](../two-pointers/README.md)] [[字符串](../string/README.md)] | Easy | +| 340 | [至多包含 K 个不同字符的最长子串](../../problems/longest-substring-with-at-most-k-distinct-characters) 🔒 | [[哈希表](../hash-table/README.md)] [[字符串](../string/README.md)] [[Sliding Window](../sliding-window/README.md)] | Hard | +| 336 | [回文对](../../problems/palindrome-pairs) | [[字典树](../trie/README.md)] [[哈希表](../hash-table/README.md)] [[字符串](../string/README.md)] | Hard | +| 293 | [翻转游戏](../../problems/flip-game) 🔒 | [[字符串](../string/README.md)] | Easy | +| 273 | [整数转换英文表示](../../problems/integer-to-english-words) | [[数学](../math/README.md)] [[字符串](../string/README.md)] | Hard | +| 271 | [字符串的编码与解码](../../problems/encode-and-decode-strings) 🔒 | [[字符串](../string/README.md)] | Medium | +| 249 | [移位字符串分组](../../problems/group-shifted-strings) 🔒 | [[哈希表](../hash-table/README.md)] [[字符串](../string/README.md)] | Medium | +| 227 | [基本计算器 II](../../problems/basic-calculator-ii) | [[字符串](../string/README.md)] | Medium | +| 214 | [最短回文串](../../problems/shortest-palindrome) | [[字符串](../string/README.md)] | Hard | +| 186 | [翻转字符串里的单词 II](../../problems/reverse-words-in-a-string-ii) 🔒 | [[字符串](../string/README.md)] | Medium | +| 165 | [比较版本号](../../problems/compare-version-numbers) | [[字符串](../string/README.md)] | Medium | +| 161 | [相隔为 1 的编辑距离](../../problems/one-edit-distance) 🔒 | [[字符串](../string/README.md)] | Medium | +| 159 | [至多包含两个不同字符的最长子串](../../problems/longest-substring-with-at-most-two-distinct-characters) 🔒 | [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] [[字符串](../string/README.md)] [[Sliding Window](../sliding-window/README.md)] | Medium | +| 158 | [用 Read4 读取 N 个字符 II](../../problems/read-n-characters-given-read4-ii-call-multiple-times) 🔒 | [[字符串](../string/README.md)] | Hard | +| 157 | [用 Read4 读取 N 个字符](../../problems/read-n-characters-given-read4) 🔒 | [[字符串](../string/README.md)] | Easy | +| 151 | [翻转字符串里的单词](../../problems/reverse-words-in-a-string) | [[字符串](../string/README.md)] | Medium | +| 126 | [单词接龙 II](../../problems/word-ladder-ii) | [[广度优先搜索](../breadth-first-search/README.md)] [[数组](../array/README.md)] [[字符串](../string/README.md)] [[回溯算法](../backtracking/README.md)] | Hard | +| 125 | [验证回文串](../../problems/valid-palindrome) | [[双指针](../two-pointers/README.md)] [[字符串](../string/README.md)] | Easy | +| 115 | [不同的子序列](../../problems/distinct-subsequences) | [[字符串](../string/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 97 | [交错字符串](../../problems/interleaving-string) | [[字符串](../string/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 93 | [复原IP地址](../../problems/restore-ip-addresses) | [[字符串](../string/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 91 | [解码方法](../../problems/decode-ways) | [[字符串](../string/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 87 | [扰乱字符串](../../problems/scramble-string) | [[字符串](../string/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 76 | [最小覆盖子串](../../problems/minimum-window-substring) | [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] [[字符串](../string/README.md)] [[Sliding Window](../sliding-window/README.md)] | Hard | +| 72 | [编辑距离](../../problems/edit-distance) | [[字符串](../string/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 71 | [简化路径](../../problems/simplify-path) | [[栈](../stack/README.md)] [[字符串](../string/README.md)] | Medium | +| 68 | [文本左右对齐](../../problems/text-justification) | [[字符串](../string/README.md)] | Hard | +| 67 | [二进制求和](../../problems/add-binary) | [[数学](../math/README.md)] [[字符串](../string/README.md)] | Easy | +| 65 | [有效数字](../../problems/valid-number) | [[数学](../math/README.md)] [[字符串](../string/README.md)] | Hard | +| 58 | [最后一个单词的长度](../../problems/length-of-last-word) | [[字符串](../string/README.md)] | Easy | +| 49 | [字母异位词分组](../../problems/group-anagrams) | [[哈希表](../hash-table/README.md)] [[字符串](../string/README.md)] | Medium | +| 44 | [通配符匹配](../../problems/wildcard-matching) | [[贪心算法](../greedy/README.md)] [[字符串](../string/README.md)] [[动态规划](../dynamic-programming/README.md)] [[回溯算法](../backtracking/README.md)] | Hard | +| 43 | [字符串相乘](../../problems/multiply-strings) | [[数学](../math/README.md)] [[字符串](../string/README.md)] | Medium | +| 38 | [报数](../../problems/count-and-say) | [[字符串](../string/README.md)] | Easy | +| 32 | [最长有效括号](../../problems/longest-valid-parentheses) | [[字符串](../string/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 30 | [串联所有单词的子串](../../problems/substring-with-concatenation-of-all-words) | [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] [[字符串](../string/README.md)] | Hard | +| 28 | [实现 strStr()](../../problems/implement-strstr) | [[双指针](../two-pointers/README.md)] [[字符串](../string/README.md)] | Easy | +| 22 | [括号生成](../../problems/generate-parentheses) | [[字符串](../string/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 20 | [有效的括号](../../problems/valid-parentheses) | [[栈](../stack/README.md)] [[字符串](../string/README.md)] | Easy | +| 17 | [电话号码的字母组合](../../problems/letter-combinations-of-a-phone-number) | [[字符串](../string/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 14 | [最长公共前缀](../../problems/longest-common-prefix) | [[字符串](../string/README.md)] | Easy | +| 13 | [罗马数字转整数](../../problems/roman-to-integer) | [[数学](../math/README.md)] [[字符串](../string/README.md)] | Easy | +| 12 | [整数转罗马数字](../../problems/integer-to-roman) | [[数学](../math/README.md)] [[字符串](../string/README.md)] | Medium | +| 10 | [正则表达式匹配](../../problems/regular-expression-matching) | [[字符串](../string/README.md)] [[动态规划](../dynamic-programming/README.md)] [[回溯算法](../backtracking/README.md)] | Hard | +| 8 | [字符串转换整数 (atoi)](../../problems/string-to-integer-atoi) | [[数学](../math/README.md)] [[字符串](../string/README.md)] | Medium | +| 6 | [Z 字形变换](../../problems/zigzag-conversion) | [[字符串](../string/README.md)] | Medium | +| 5 | [最长回文子串](../../problems/longest-palindromic-substring) | [[字符串](../string/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 3 | [无重复字符的最长子串](../../problems/longest-substring-without-repeating-characters) | [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] [[字符串](../string/README.md)] [[Sliding Window](../sliding-window/README.md)] | Medium | diff --git a/tag/suffix-array/README.md b/tag/suffix-array/README.md index 51a0cc1aa..b419d4047 100644 --- a/tag/suffix-array/README.md +++ b/tag/suffix-array/README.md @@ -5,7 +5,7 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > Suffix Array +## [话题分类](../README.md) > Suffix Array | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | diff --git a/tag/topological-sort/README.md b/tag/topological-sort/README.md index 1fd7cff97..7231dfe39 100644 --- a/tag/topological-sort/README.md +++ b/tag/topological-sort/README.md @@ -5,13 +5,13 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > 拓扑排序 +## [话题分类](../README.md) > 拓扑排序 | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 1203 | [项目管理](https://github.com/openset/leetcode/tree/master/problems/sort-items-by-groups-respecting-dependencies) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] [[拓扑排序](https://github.com/openset/leetcode/tree/master/tag/topological-sort/README.md)] | Hard | -| 444 | [序列重建](https://github.com/openset/leetcode/tree/master/problems/sequence-reconstruction) 🔒 | [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] [[拓扑排序](https://github.com/openset/leetcode/tree/master/tag/topological-sort/README.md)] | Medium | -| 329 | [矩阵中的最长递增路径](https://github.com/openset/leetcode/tree/master/problems/longest-increasing-path-in-a-matrix) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[拓扑排序](https://github.com/openset/leetcode/tree/master/tag/topological-sort/README.md)] [[记忆化](https://github.com/openset/leetcode/tree/master/tag/memoization/README.md)] | Hard | -| 269 | [火星词典](https://github.com/openset/leetcode/tree/master/problems/alien-dictionary) 🔒 | [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] [[拓扑排序](https://github.com/openset/leetcode/tree/master/tag/topological-sort/README.md)] | Hard | -| 210 | [课程表 II](https://github.com/openset/leetcode/tree/master/problems/course-schedule-ii) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] [[拓扑排序](https://github.com/openset/leetcode/tree/master/tag/topological-sort/README.md)] | Medium | -| 207 | [课程表](https://github.com/openset/leetcode/tree/master/problems/course-schedule) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] [[拓扑排序](https://github.com/openset/leetcode/tree/master/tag/topological-sort/README.md)] | Medium | +| 1203 | [项目管理](../../problems/sort-items-by-groups-respecting-dependencies) | [[深度优先搜索](../depth-first-search/README.md)] [[图](../graph/README.md)] [[拓扑排序](../topological-sort/README.md)] | Hard | +| 444 | [序列重建](../../problems/sequence-reconstruction) 🔒 | [[图](../graph/README.md)] [[拓扑排序](../topological-sort/README.md)] | Medium | +| 329 | [矩阵中的最长递增路径](../../problems/longest-increasing-path-in-a-matrix) | [[深度优先搜索](../depth-first-search/README.md)] [[拓扑排序](../topological-sort/README.md)] [[记忆化](../memoization/README.md)] | Hard | +| 269 | [火星词典](../../problems/alien-dictionary) 🔒 | [[图](../graph/README.md)] [[拓扑排序](../topological-sort/README.md)] | Hard | +| 210 | [课程表 II](../../problems/course-schedule-ii) | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[图](../graph/README.md)] [[拓扑排序](../topological-sort/README.md)] | Medium | +| 207 | [课程表](../../problems/course-schedule) | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[图](../graph/README.md)] [[拓扑排序](../topological-sort/README.md)] | Medium | diff --git a/tag/tree/README.md b/tag/tree/README.md index 7a19ae58c..97fd5f73a 100644 --- a/tag/tree/README.md +++ b/tag/tree/README.md @@ -5,130 +5,130 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > 树 +## [话题分类](../README.md) > 树 | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 1261 | [在受污染的二叉树中查找元素](https://github.com/openset/leetcode/tree/master/problems/find-elements-in-a-contaminated-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 1257 | [最小公共区域](https://github.com/openset/leetcode/tree/master/problems/smallest-common-region) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Medium | -| 1245 | [树的直径](https://github.com/openset/leetcode/tree/master/problems/tree-diameter) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 1145 | [二叉树着色游戏](https://github.com/openset/leetcode/tree/master/problems/binary-tree-coloring-game) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 1130 | [叶值的最小代价生成树](https://github.com/openset/leetcode/tree/master/problems/minimum-cost-tree-from-leaf-values) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 1123 | [最深叶节点的最近公共祖先](https://github.com/openset/leetcode/tree/master/problems/lowest-common-ancestor-of-deepest-leaves) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 1120 | [子树的最大平均值](https://github.com/openset/leetcode/tree/master/problems/maximum-average-subtree) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Medium | -| 1110 | [删点成林](https://github.com/openset/leetcode/tree/master/problems/delete-nodes-and-return-forest) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 1104 | [二叉树寻路](https://github.com/openset/leetcode/tree/master/problems/path-in-zigzag-labelled-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Medium | -| 1028 | [从先序遍历还原二叉树](https://github.com/openset/leetcode/tree/master/problems/recover-a-tree-from-preorder-traversal) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Hard | -| 1026 | [节点与其祖先之间的最大差值](https://github.com/openset/leetcode/tree/master/problems/maximum-difference-between-node-and-ancestor) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 1022 | [从根到叶的二进制数之和](https://github.com/openset/leetcode/tree/master/problems/sum-of-root-to-leaf-binary-numbers) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Easy | -| 1008 | [先序遍历构造二叉树](https://github.com/openset/leetcode/tree/master/problems/construct-binary-search-tree-from-preorder-traversal) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Medium | -| 998 | [最大二叉树 II](https://github.com/openset/leetcode/tree/master/problems/maximum-binary-tree-ii) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Medium | -| 993 | [二叉树的堂兄弟节点](https://github.com/openset/leetcode/tree/master/problems/cousins-in-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Easy | -| 988 | [从叶结点开始的最小字符串](https://github.com/openset/leetcode/tree/master/problems/smallest-string-starting-from-leaf) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 987 | [二叉树的垂序遍历](https://github.com/openset/leetcode/tree/master/problems/vertical-order-traversal-of-a-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 979 | [在二叉树中分配硬币](https://github.com/openset/leetcode/tree/master/problems/distribute-coins-in-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 971 | [翻转二叉树以匹配先序遍历](https://github.com/openset/leetcode/tree/master/problems/flip-binary-tree-to-match-preorder-traversal) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 968 | [监控二叉树](https://github.com/openset/leetcode/tree/master/problems/binary-tree-cameras) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 965 | [单值二叉树](https://github.com/openset/leetcode/tree/master/problems/univalued-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Easy | -| 958 | [二叉树的完全性检验](https://github.com/openset/leetcode/tree/master/problems/check-completeness-of-a-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Medium | -| 951 | [翻转等价二叉树](https://github.com/openset/leetcode/tree/master/problems/flip-equivalent-binary-trees) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Medium | -| 938 | [二叉搜索树的范围和](https://github.com/openset/leetcode/tree/master/problems/range-sum-of-bst) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] | Easy | -| 919 | [完全二叉树插入器](https://github.com/openset/leetcode/tree/master/problems/complete-binary-tree-inserter) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Medium | -| 897 | [递增顺序查找树](https://github.com/openset/leetcode/tree/master/problems/increasing-order-search-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Easy | -| 894 | [所有可能的满二叉树](https://github.com/openset/leetcode/tree/master/problems/all-possible-full-binary-trees) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] | Medium | -| 889 | [根据前序和后序遍历构造二叉树](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-preorder-and-postorder-traversal) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Medium | -| 872 | [叶子相似的树](https://github.com/openset/leetcode/tree/master/problems/leaf-similar-trees) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Easy | -| 865 | [具有所有最深结点的最小子树](https://github.com/openset/leetcode/tree/master/problems/smallest-subtree-with-all-the-deepest-nodes) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Medium | -| 863 | [二叉树中所有距离为 K 的结点](https://github.com/openset/leetcode/tree/master/problems/all-nodes-distance-k-in-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 834 | [树中距离之和](https://github.com/openset/leetcode/tree/master/problems/sum-of-distances-in-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Hard | -| 814 | [二叉树剪枝](https://github.com/openset/leetcode/tree/master/problems/binary-tree-pruning) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Medium | -| 783 | [二叉搜索树结点最小距离](https://github.com/openset/leetcode/tree/master/problems/minimum-distance-between-bst-nodes) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] | Easy | -| 776 | [拆分二叉搜索树](https://github.com/openset/leetcode/tree/master/problems/split-bst) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] | Medium | -| 742 | [二叉树最近的叶节点](https://github.com/openset/leetcode/tree/master/problems/closest-leaf-in-a-binary-tree) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Medium | -| 701 | [二叉搜索树中的插入操作](https://github.com/openset/leetcode/tree/master/problems/insert-into-a-binary-search-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Medium | -| 700 | [二叉搜索树中的搜索](https://github.com/openset/leetcode/tree/master/problems/search-in-a-binary-search-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Easy | -| 687 | [最长同值路径](https://github.com/openset/leetcode/tree/master/problems/longest-univalue-path) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[递归](https://github.com/openset/leetcode/tree/master/tag/recursion/README.md)] | Easy | -| 685 | [冗余连接 II](https://github.com/openset/leetcode/tree/master/problems/redundant-connection-ii) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Hard | -| 684 | [冗余连接](https://github.com/openset/leetcode/tree/master/problems/redundant-connection) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 671 | [二叉树中第二小的节点](https://github.com/openset/leetcode/tree/master/problems/second-minimum-node-in-a-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Easy | -| 669 | [修剪二叉搜索树](https://github.com/openset/leetcode/tree/master/problems/trim-a-binary-search-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Easy | -| 666 | [路径和 IV](https://github.com/openset/leetcode/tree/master/problems/path-sum-iv) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Medium | -| 663 | [均匀树划分](https://github.com/openset/leetcode/tree/master/problems/equal-tree-partition) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Medium | -| 662 | [二叉树最大宽度](https://github.com/openset/leetcode/tree/master/problems/maximum-width-of-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Medium | -| 655 | [输出二叉树](https://github.com/openset/leetcode/tree/master/problems/print-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Medium | -| 654 | [最大二叉树](https://github.com/openset/leetcode/tree/master/problems/maximum-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Medium | -| 653 | [两数之和 IV - 输入 BST](https://github.com/openset/leetcode/tree/master/problems/two-sum-iv-input-is-a-bst) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Easy | -| 652 | [寻找重复的子树](https://github.com/openset/leetcode/tree/master/problems/find-duplicate-subtrees) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Medium | -| 637 | [二叉树的层平均值](https://github.com/openset/leetcode/tree/master/problems/average-of-levels-in-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Easy | -| 623 | [在二叉树中增加一行](https://github.com/openset/leetcode/tree/master/problems/add-one-row-to-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Medium | -| 617 | [合并二叉树](https://github.com/openset/leetcode/tree/master/problems/merge-two-binary-trees) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Easy | -| 606 | [根据二叉树创建字符串](https://github.com/openset/leetcode/tree/master/problems/construct-string-from-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 590 | [N叉树的后序遍历](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-postorder-traversal) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Easy | -| 589 | [N叉树的前序遍历](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-preorder-traversal) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Easy | -| 582 | [杀死进程](https://github.com/openset/leetcode/tree/master/problems/kill-process) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[队列](https://github.com/openset/leetcode/tree/master/tag/queue/README.md)] | Medium | -| 572 | [另一个树的子树](https://github.com/openset/leetcode/tree/master/problems/subtree-of-another-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Easy | -| 563 | [二叉树的坡度](https://github.com/openset/leetcode/tree/master/problems/binary-tree-tilt) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Easy | -| 559 | [N叉树的最大深度](https://github.com/openset/leetcode/tree/master/problems/maximum-depth-of-n-ary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Easy | -| 549 | [二叉树中最长的连续序列](https://github.com/openset/leetcode/tree/master/problems/binary-tree-longest-consecutive-sequence-ii) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Medium | -| 545 | [二叉树的边界](https://github.com/openset/leetcode/tree/master/problems/boundary-of-binary-tree) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Medium | -| 543 | [二叉树的直径](https://github.com/openset/leetcode/tree/master/problems/diameter-of-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Easy | -| 538 | [把二叉搜索树转换为累加树](https://github.com/openset/leetcode/tree/master/problems/convert-bst-to-greater-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Easy | -| 536 | [从字符串生成二叉树](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-string) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 530 | [二叉搜索树的最小绝对差](https://github.com/openset/leetcode/tree/master/problems/minimum-absolute-difference-in-bst) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Easy | -| 515 | [在每个树行中找最大值](https://github.com/openset/leetcode/tree/master/problems/find-largest-value-in-each-tree-row) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 513 | [找树左下角的值](https://github.com/openset/leetcode/tree/master/problems/find-bottom-left-tree-value) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 510 | [二叉搜索树中的中序后继 II](https://github.com/openset/leetcode/tree/master/problems/inorder-successor-in-bst-ii) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Medium | -| 508 | [出现次数最多的子树元素和](https://github.com/openset/leetcode/tree/master/problems/most-frequent-subtree-sum) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 501 | [二叉搜索树中的众数](https://github.com/openset/leetcode/tree/master/problems/find-mode-in-binary-search-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Easy | -| 450 | [删除二叉搜索树中的节点](https://github.com/openset/leetcode/tree/master/problems/delete-node-in-a-bst) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Medium | -| 449 | [序列化和反序列化二叉搜索树](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-bst) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Medium | -| 437 | [路径总和 III](https://github.com/openset/leetcode/tree/master/problems/path-sum-iii) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Easy | -| 431 | [将 N 叉树编码为二叉树](https://github.com/openset/leetcode/tree/master/problems/encode-n-ary-tree-to-binary-tree) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Hard | -| 429 | [N叉树的层序遍历](https://github.com/openset/leetcode/tree/master/problems/n-ary-tree-level-order-traversal) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 428 | [序列化和反序列化 N 叉树](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-n-ary-tree) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Hard | -| 426 | [将二叉搜索树转化为排序的双向链表](https://github.com/openset/leetcode/tree/master/problems/convert-binary-search-tree-to-sorted-doubly-linked-list) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] [[分治算法](https://github.com/openset/leetcode/tree/master/tag/divide-and-conquer/README.md)] | Medium | -| 404 | [左叶子之和](https://github.com/openset/leetcode/tree/master/problems/sum-of-left-leaves) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Easy | -| 366 | [寻找完全二叉树的叶子节点](https://github.com/openset/leetcode/tree/master/problems/find-leaves-of-binary-tree) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 337 | [打家劫舍 III](https://github.com/openset/leetcode/tree/master/problems/house-robber-iii) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 333 | [最大 BST 子树](https://github.com/openset/leetcode/tree/master/problems/largest-bst-subtree) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Medium | -| 298 | [二叉树最长连续序列](https://github.com/openset/leetcode/tree/master/problems/binary-tree-longest-consecutive-sequence) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Medium | -| 297 | [二叉树的序列化与反序列化](https://github.com/openset/leetcode/tree/master/problems/serialize-and-deserialize-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] | Hard | -| 285 | [二叉搜索树中的顺序后继](https://github.com/openset/leetcode/tree/master/problems/inorder-successor-in-bst) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Medium | -| 272 | [最接近的二叉搜索树值 II](https://github.com/openset/leetcode/tree/master/problems/closest-binary-search-tree-value-ii) 🔒 | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Hard | -| 270 | [最接近的二叉搜索树值](https://github.com/openset/leetcode/tree/master/problems/closest-binary-search-tree-value) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Easy | -| 257 | [二叉树的所有路径](https://github.com/openset/leetcode/tree/master/problems/binary-tree-paths) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Easy | -| 255 | [验证前序遍历序列二叉搜索树](https://github.com/openset/leetcode/tree/master/problems/verify-preorder-sequence-in-binary-search-tree) 🔒 | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Medium | -| 250 | [统计同值子树](https://github.com/openset/leetcode/tree/master/problems/count-univalue-subtrees) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Medium | -| 236 | [二叉树的最近公共祖先](https://github.com/openset/leetcode/tree/master/problems/lowest-common-ancestor-of-a-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Medium | -| 235 | [二叉搜索树的最近公共祖先](https://github.com/openset/leetcode/tree/master/problems/lowest-common-ancestor-of-a-binary-search-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Easy | -| 230 | [二叉搜索树中第K小的元素](https://github.com/openset/leetcode/tree/master/problems/kth-smallest-element-in-a-bst) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 226 | [翻转二叉树](https://github.com/openset/leetcode/tree/master/problems/invert-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Easy | -| 222 | [完全二叉树的节点个数](https://github.com/openset/leetcode/tree/master/problems/count-complete-tree-nodes) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 199 | [二叉树的右视图](https://github.com/openset/leetcode/tree/master/problems/binary-tree-right-side-view) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 173 | [二叉搜索树迭代器](https://github.com/openset/leetcode/tree/master/problems/binary-search-tree-iterator) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] | Medium | -| 156 | [上下翻转二叉树](https://github.com/openset/leetcode/tree/master/problems/binary-tree-upside-down) 🔒 | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Medium | -| 145 | [二叉树的后序遍历](https://github.com/openset/leetcode/tree/master/problems/binary-tree-postorder-traversal) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Hard | -| 144 | [二叉树的前序遍历](https://github.com/openset/leetcode/tree/master/problems/binary-tree-preorder-traversal) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] | Medium | -| 129 | [求根到叶子节点数字之和](https://github.com/openset/leetcode/tree/master/problems/sum-root-to-leaf-numbers) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 124 | [二叉树中的最大路径和](https://github.com/openset/leetcode/tree/master/problems/binary-tree-maximum-path-sum) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Hard | -| 117 | [填充每个节点的下一个右侧节点指针 II](https://github.com/openset/leetcode/tree/master/problems/populating-next-right-pointers-in-each-node-ii) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 116 | [填充每个节点的下一个右侧节点指针](https://github.com/openset/leetcode/tree/master/problems/populating-next-right-pointers-in-each-node) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 114 | [二叉树展开为链表](https://github.com/openset/leetcode/tree/master/problems/flatten-binary-tree-to-linked-list) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 113 | [路径总和 II](https://github.com/openset/leetcode/tree/master/problems/path-sum-ii) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 112 | [路径总和](https://github.com/openset/leetcode/tree/master/problems/path-sum) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Easy | -| 111 | [二叉树的最小深度](https://github.com/openset/leetcode/tree/master/problems/minimum-depth-of-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Easy | -| 110 | [平衡二叉树](https://github.com/openset/leetcode/tree/master/problems/balanced-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Easy | -| 108 | [将有序数组转换为二叉搜索树](https://github.com/openset/leetcode/tree/master/problems/convert-sorted-array-to-binary-search-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Easy | -| 107 | [二叉树的层次遍历 II](https://github.com/openset/leetcode/tree/master/problems/binary-tree-level-order-traversal-ii) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Easy | -| 106 | [从中序与后序遍历序列构造二叉树](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-inorder-and-postorder-traversal) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 105 | [从前序与中序遍历序列构造二叉树](https://github.com/openset/leetcode/tree/master/problems/construct-binary-tree-from-preorder-and-inorder-traversal) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 104 | [二叉树的最大深度](https://github.com/openset/leetcode/tree/master/problems/maximum-depth-of-binary-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Easy | -| 103 | [二叉树的锯齿形层次遍历](https://github.com/openset/leetcode/tree/master/problems/binary-tree-zigzag-level-order-traversal) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 102 | [二叉树的层次遍历](https://github.com/openset/leetcode/tree/master/problems/binary-tree-level-order-traversal) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Medium | -| 101 | [对称二叉树](https://github.com/openset/leetcode/tree/master/problems/symmetric-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] | Easy | -| 100 | [相同的树](https://github.com/openset/leetcode/tree/master/problems/same-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Easy | -| 99 | [恢复二叉搜索树](https://github.com/openset/leetcode/tree/master/problems/recover-binary-search-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Hard | -| 98 | [验证二叉搜索树](https://github.com/openset/leetcode/tree/master/problems/validate-binary-search-tree) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] | Medium | -| 96 | [不同的二叉搜索树](https://github.com/openset/leetcode/tree/master/problems/unique-binary-search-trees) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 95 | [不同的二叉搜索树 II](https://github.com/openset/leetcode/tree/master/problems/unique-binary-search-trees-ii) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 94 | [二叉树的中序遍历](https://github.com/openset/leetcode/tree/master/problems/binary-tree-inorder-traversal) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | +| 1261 | [在受污染的二叉树中查找元素](../../problems/find-elements-in-a-contaminated-binary-tree) | [[树](../tree/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 1257 | [最小公共区域](../../problems/smallest-common-region) 🔒 | [[树](../tree/README.md)] | Medium | +| 1245 | [树的直径](../../problems/tree-diameter) 🔒 | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 1145 | [二叉树着色游戏](../../problems/binary-tree-coloring-game) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 1130 | [叶值的最小代价生成树](../../problems/minimum-cost-tree-from-leaf-values) | [[栈](../stack/README.md)] [[树](../tree/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 1123 | [最深叶节点的最近公共祖先](../../problems/lowest-common-ancestor-of-deepest-leaves) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 1120 | [子树的最大平均值](../../problems/maximum-average-subtree) 🔒 | [[树](../tree/README.md)] | Medium | +| 1110 | [删点成林](../../problems/delete-nodes-and-return-forest) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 1104 | [二叉树寻路](../../problems/path-in-zigzag-labelled-binary-tree) | [[树](../tree/README.md)] [[数学](../math/README.md)] | Medium | +| 1028 | [从先序遍历还原二叉树](../../problems/recover-a-tree-from-preorder-traversal) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Hard | +| 1026 | [节点与其祖先之间的最大差值](../../problems/maximum-difference-between-node-and-ancestor) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 1022 | [从根到叶的二进制数之和](../../problems/sum-of-root-to-leaf-binary-numbers) | [[树](../tree/README.md)] | Easy | +| 1008 | [先序遍历构造二叉树](../../problems/construct-binary-search-tree-from-preorder-traversal) | [[树](../tree/README.md)] | Medium | +| 998 | [最大二叉树 II](../../problems/maximum-binary-tree-ii) | [[树](../tree/README.md)] | Medium | +| 993 | [二叉树的堂兄弟节点](../../problems/cousins-in-binary-tree) | [[树](../tree/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Easy | +| 988 | [从叶结点开始的最小字符串](../../problems/smallest-string-starting-from-leaf) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 987 | [二叉树的垂序遍历](../../problems/vertical-order-traversal-of-a-binary-tree) | [[树](../tree/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 979 | [在二叉树中分配硬币](../../problems/distribute-coins-in-binary-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 971 | [翻转二叉树以匹配先序遍历](../../problems/flip-binary-tree-to-match-preorder-traversal) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 968 | [监控二叉树](../../problems/binary-tree-cameras) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 965 | [单值二叉树](../../problems/univalued-binary-tree) | [[树](../tree/README.md)] | Easy | +| 958 | [二叉树的完全性检验](../../problems/check-completeness-of-a-binary-tree) | [[树](../tree/README.md)] | Medium | +| 951 | [翻转等价二叉树](../../problems/flip-equivalent-binary-trees) | [[树](../tree/README.md)] | Medium | +| 938 | [二叉搜索树的范围和](../../problems/range-sum-of-bst) | [[树](../tree/README.md)] [[递归](../recursion/README.md)] | Easy | +| 919 | [完全二叉树插入器](../../problems/complete-binary-tree-inserter) | [[树](../tree/README.md)] | Medium | +| 897 | [递增顺序查找树](../../problems/increasing-order-search-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Easy | +| 894 | [所有可能的满二叉树](../../problems/all-possible-full-binary-trees) | [[树](../tree/README.md)] [[递归](../recursion/README.md)] | Medium | +| 889 | [根据前序和后序遍历构造二叉树](../../problems/construct-binary-tree-from-preorder-and-postorder-traversal) | [[树](../tree/README.md)] | Medium | +| 872 | [叶子相似的树](../../problems/leaf-similar-trees) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Easy | +| 865 | [具有所有最深结点的最小子树](../../problems/smallest-subtree-with-all-the-deepest-nodes) | [[树](../tree/README.md)] | Medium | +| 863 | [二叉树中所有距离为 K 的结点](../../problems/all-nodes-distance-k-in-binary-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 834 | [树中距离之和](../../problems/sum-of-distances-in-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Hard | +| 814 | [二叉树剪枝](../../problems/binary-tree-pruning) | [[树](../tree/README.md)] | Medium | +| 783 | [二叉搜索树结点最小距离](../../problems/minimum-distance-between-bst-nodes) | [[树](../tree/README.md)] [[递归](../recursion/README.md)] | Easy | +| 776 | [拆分二叉搜索树](../../problems/split-bst) 🔒 | [[树](../tree/README.md)] [[递归](../recursion/README.md)] | Medium | +| 742 | [二叉树最近的叶节点](../../problems/closest-leaf-in-a-binary-tree) 🔒 | [[树](../tree/README.md)] | Medium | +| 701 | [二叉搜索树中的插入操作](../../problems/insert-into-a-binary-search-tree) | [[树](../tree/README.md)] | Medium | +| 700 | [二叉搜索树中的搜索](../../problems/search-in-a-binary-search-tree) | [[树](../tree/README.md)] | Easy | +| 687 | [最长同值路径](../../problems/longest-univalue-path) | [[树](../tree/README.md)] [[递归](../recursion/README.md)] | Easy | +| 685 | [冗余连接 II](../../problems/redundant-connection-ii) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Hard | +| 684 | [冗余连接](../../problems/redundant-connection) | [[树](../tree/README.md)] [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Medium | +| 671 | [二叉树中第二小的节点](../../problems/second-minimum-node-in-a-binary-tree) | [[树](../tree/README.md)] | Easy | +| 669 | [修剪二叉搜索树](../../problems/trim-a-binary-search-tree) | [[树](../tree/README.md)] | Easy | +| 666 | [路径和 IV](../../problems/path-sum-iv) 🔒 | [[树](../tree/README.md)] | Medium | +| 663 | [均匀树划分](../../problems/equal-tree-partition) 🔒 | [[树](../tree/README.md)] | Medium | +| 662 | [二叉树最大宽度](../../problems/maximum-width-of-binary-tree) | [[树](../tree/README.md)] | Medium | +| 655 | [输出二叉树](../../problems/print-binary-tree) | [[树](../tree/README.md)] | Medium | +| 654 | [最大二叉树](../../problems/maximum-binary-tree) | [[树](../tree/README.md)] | Medium | +| 653 | [两数之和 IV - 输入 BST](../../problems/two-sum-iv-input-is-a-bst) | [[树](../tree/README.md)] | Easy | +| 652 | [寻找重复的子树](../../problems/find-duplicate-subtrees) | [[树](../tree/README.md)] | Medium | +| 637 | [二叉树的层平均值](../../problems/average-of-levels-in-binary-tree) | [[树](../tree/README.md)] | Easy | +| 623 | [在二叉树中增加一行](../../problems/add-one-row-to-tree) | [[树](../tree/README.md)] | Medium | +| 617 | [合并二叉树](../../problems/merge-two-binary-trees) | [[树](../tree/README.md)] | Easy | +| 606 | [根据二叉树创建字符串](../../problems/construct-string-from-binary-tree) | [[树](../tree/README.md)] [[字符串](../string/README.md)] | Easy | +| 590 | [N叉树的后序遍历](../../problems/n-ary-tree-postorder-traversal) | [[树](../tree/README.md)] | Easy | +| 589 | [N叉树的前序遍历](../../problems/n-ary-tree-preorder-traversal) | [[树](../tree/README.md)] | Easy | +| 582 | [杀死进程](../../problems/kill-process) 🔒 | [[树](../tree/README.md)] [[队列](../queue/README.md)] | Medium | +| 572 | [另一个树的子树](../../problems/subtree-of-another-tree) | [[树](../tree/README.md)] | Easy | +| 563 | [二叉树的坡度](../../problems/binary-tree-tilt) | [[树](../tree/README.md)] | Easy | +| 559 | [N叉树的最大深度](../../problems/maximum-depth-of-n-ary-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Easy | +| 549 | [二叉树中最长的连续序列](../../problems/binary-tree-longest-consecutive-sequence-ii) 🔒 | [[树](../tree/README.md)] | Medium | +| 545 | [二叉树的边界](../../problems/boundary-of-binary-tree) 🔒 | [[树](../tree/README.md)] | Medium | +| 543 | [二叉树的直径](../../problems/diameter-of-binary-tree) | [[树](../tree/README.md)] | Easy | +| 538 | [把二叉搜索树转换为累加树](../../problems/convert-bst-to-greater-tree) | [[树](../tree/README.md)] | Easy | +| 536 | [从字符串生成二叉树](../../problems/construct-binary-tree-from-string) 🔒 | [[树](../tree/README.md)] [[字符串](../string/README.md)] | Medium | +| 530 | [二叉搜索树的最小绝对差](../../problems/minimum-absolute-difference-in-bst) | [[树](../tree/README.md)] | Easy | +| 515 | [在每个树行中找最大值](../../problems/find-largest-value-in-each-tree-row) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 513 | [找树左下角的值](../../problems/find-bottom-left-tree-value) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 510 | [二叉搜索树中的中序后继 II](../../problems/inorder-successor-in-bst-ii) 🔒 | [[树](../tree/README.md)] | Medium | +| 508 | [出现次数最多的子树元素和](../../problems/most-frequent-subtree-sum) | [[树](../tree/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 501 | [二叉搜索树中的众数](../../problems/find-mode-in-binary-search-tree) | [[树](../tree/README.md)] | Easy | +| 450 | [删除二叉搜索树中的节点](../../problems/delete-node-in-a-bst) | [[树](../tree/README.md)] | Medium | +| 449 | [序列化和反序列化二叉搜索树](../../problems/serialize-and-deserialize-bst) | [[树](../tree/README.md)] | Medium | +| 437 | [路径总和 III](../../problems/path-sum-iii) | [[树](../tree/README.md)] | Easy | +| 431 | [将 N 叉树编码为二叉树](../../problems/encode-n-ary-tree-to-binary-tree) 🔒 | [[树](../tree/README.md)] | Hard | +| 429 | [N叉树的层序遍历](../../problems/n-ary-tree-level-order-traversal) | [[树](../tree/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 428 | [序列化和反序列化 N 叉树](../../problems/serialize-and-deserialize-n-ary-tree) 🔒 | [[树](../tree/README.md)] | Hard | +| 426 | [将二叉搜索树转化为排序的双向链表](../../problems/convert-binary-search-tree-to-sorted-doubly-linked-list) 🔒 | [[树](../tree/README.md)] [[链表](../linked-list/README.md)] [[分治算法](../divide-and-conquer/README.md)] | Medium | +| 404 | [左叶子之和](../../problems/sum-of-left-leaves) | [[树](../tree/README.md)] | Easy | +| 366 | [寻找完全二叉树的叶子节点](../../problems/find-leaves-of-binary-tree) 🔒 | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 337 | [打家劫舍 III](../../problems/house-robber-iii) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 333 | [最大 BST 子树](../../problems/largest-bst-subtree) 🔒 | [[树](../tree/README.md)] | Medium | +| 298 | [二叉树最长连续序列](../../problems/binary-tree-longest-consecutive-sequence) 🔒 | [[树](../tree/README.md)] | Medium | +| 297 | [二叉树的序列化与反序列化](../../problems/serialize-and-deserialize-binary-tree) | [[树](../tree/README.md)] [[设计](../design/README.md)] | Hard | +| 285 | [二叉搜索树中的顺序后继](../../problems/inorder-successor-in-bst) 🔒 | [[树](../tree/README.md)] | Medium | +| 272 | [最接近的二叉搜索树值 II](../../problems/closest-binary-search-tree-value-ii) 🔒 | [[栈](../stack/README.md)] [[树](../tree/README.md)] | Hard | +| 270 | [最接近的二叉搜索树值](../../problems/closest-binary-search-tree-value) 🔒 | [[树](../tree/README.md)] [[二分查找](../binary-search/README.md)] | Easy | +| 257 | [二叉树的所有路径](../../problems/binary-tree-paths) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Easy | +| 255 | [验证前序遍历序列二叉搜索树](../../problems/verify-preorder-sequence-in-binary-search-tree) 🔒 | [[栈](../stack/README.md)] [[树](../tree/README.md)] | Medium | +| 250 | [统计同值子树](../../problems/count-univalue-subtrees) 🔒 | [[树](../tree/README.md)] | Medium | +| 236 | [二叉树的最近公共祖先](../../problems/lowest-common-ancestor-of-a-binary-tree) | [[树](../tree/README.md)] | Medium | +| 235 | [二叉搜索树的最近公共祖先](../../problems/lowest-common-ancestor-of-a-binary-search-tree) | [[树](../tree/README.md)] | Easy | +| 230 | [二叉搜索树中第K小的元素](../../problems/kth-smallest-element-in-a-bst) | [[树](../tree/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 226 | [翻转二叉树](../../problems/invert-binary-tree) | [[树](../tree/README.md)] | Easy | +| 222 | [完全二叉树的节点个数](../../problems/count-complete-tree-nodes) | [[树](../tree/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 199 | [二叉树的右视图](../../problems/binary-tree-right-side-view) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 173 | [二叉搜索树迭代器](../../problems/binary-search-tree-iterator) | [[栈](../stack/README.md)] [[树](../tree/README.md)] [[设计](../design/README.md)] | Medium | +| 156 | [上下翻转二叉树](../../problems/binary-tree-upside-down) 🔒 | [[树](../tree/README.md)] | Medium | +| 145 | [二叉树的后序遍历](../../problems/binary-tree-postorder-traversal) | [[栈](../stack/README.md)] [[树](../tree/README.md)] | Hard | +| 144 | [二叉树的前序遍历](../../problems/binary-tree-preorder-traversal) | [[栈](../stack/README.md)] [[树](../tree/README.md)] | Medium | +| 129 | [求根到叶子节点数字之和](../../problems/sum-root-to-leaf-numbers) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 124 | [二叉树中的最大路径和](../../problems/binary-tree-maximum-path-sum) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Hard | +| 117 | [填充每个节点的下一个右侧节点指针 II](../../problems/populating-next-right-pointers-in-each-node-ii) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 116 | [填充每个节点的下一个右侧节点指针](../../problems/populating-next-right-pointers-in-each-node) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 114 | [二叉树展开为链表](../../problems/flatten-binary-tree-to-linked-list) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 113 | [路径总和 II](../../problems/path-sum-ii) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 112 | [路径总和](../../problems/path-sum) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Easy | +| 111 | [二叉树的最小深度](../../problems/minimum-depth-of-binary-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Easy | +| 110 | [平衡二叉树](../../problems/balanced-binary-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Easy | +| 108 | [将有序数组转换为二叉搜索树](../../problems/convert-sorted-array-to-binary-search-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Easy | +| 107 | [二叉树的层次遍历 II](../../problems/binary-tree-level-order-traversal-ii) | [[树](../tree/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Easy | +| 106 | [从中序与后序遍历序列构造二叉树](../../problems/construct-binary-tree-from-inorder-and-postorder-traversal) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[数组](../array/README.md)] | Medium | +| 105 | [从前序与中序遍历序列构造二叉树](../../problems/construct-binary-tree-from-preorder-and-inorder-traversal) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[数组](../array/README.md)] | Medium | +| 104 | [二叉树的最大深度](../../problems/maximum-depth-of-binary-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Easy | +| 103 | [二叉树的锯齿形层次遍历](../../problems/binary-tree-zigzag-level-order-traversal) | [[栈](../stack/README.md)] [[树](../tree/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 102 | [二叉树的层次遍历](../../problems/binary-tree-level-order-traversal) | [[树](../tree/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Medium | +| 101 | [对称二叉树](../../problems/symmetric-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] | Easy | +| 100 | [相同的树](../../problems/same-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Easy | +| 99 | [恢复二叉搜索树](../../problems/recover-binary-search-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Hard | +| 98 | [验证二叉搜索树](../../problems/validate-binary-search-tree) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] | Medium | +| 96 | [不同的二叉搜索树](../../problems/unique-binary-search-trees) | [[树](../tree/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 95 | [不同的二叉搜索树 II](../../problems/unique-binary-search-trees-ii) | [[树](../tree/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 94 | [二叉树的中序遍历](../../problems/binary-tree-inorder-traversal) | [[栈](../stack/README.md)] [[树](../tree/README.md)] [[哈希表](../hash-table/README.md)] | Medium | diff --git a/tag/trie/README.md b/tag/trie/README.md index 133d06798..593289190 100644 --- a/tag/trie/README.md +++ b/tag/trie/README.md @@ -5,24 +5,24 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > 字典树 +## [话题分类](../README.md) > 字典树 | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 1065 | [字符串的索引对](https://github.com/openset/leetcode/tree/master/problems/index-pairs-of-a-string) 🔒 | [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 1032 | [字符流](https://github.com/openset/leetcode/tree/master/problems/stream-of-characters) | [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] | Hard | -| 1023 | [驼峰式匹配](https://github.com/openset/leetcode/tree/master/problems/camelcase-matching) | [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 745 | [前缀和后缀搜索](https://github.com/openset/leetcode/tree/master/problems/prefix-and-suffix-search) | [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] | Hard | -| 720 | [词典中最长的单词](https://github.com/openset/leetcode/tree/master/problems/longest-word-in-dictionary) | [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Easy | -| 692 | [前K个高频单词](https://github.com/openset/leetcode/tree/master/problems/top-k-frequent-words) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 677 | [键值映射](https://github.com/openset/leetcode/tree/master/problems/map-sum-pairs) | [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] | Medium | -| 676 | [实现一个魔法字典](https://github.com/openset/leetcode/tree/master/problems/implement-magic-dictionary) | [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 648 | [单词替换](https://github.com/openset/leetcode/tree/master/problems/replace-words) | [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] | Medium | -| 642 | [设计搜索自动补全系统](https://github.com/openset/leetcode/tree/master/problems/design-search-autocomplete-system) 🔒 | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] | Hard | -| 472 | [连接词](https://github.com/openset/leetcode/tree/master/problems/concatenated-words) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Hard | -| 425 | [单词方块](https://github.com/openset/leetcode/tree/master/problems/word-squares) 🔒 | [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | -| 421 | [数组中两个数的最大异或值](https://github.com/openset/leetcode/tree/master/problems/maximum-xor-of-two-numbers-in-an-array) | [[位运算](https://github.com/openset/leetcode/tree/master/tag/bit-manipulation/README.md)] [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] | Medium | -| 336 | [回文对](https://github.com/openset/leetcode/tree/master/problems/palindrome-pairs) | [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 212 | [单词搜索 II](https://github.com/openset/leetcode/tree/master/problems/word-search-ii) | [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Hard | -| 211 | [添加与搜索单词 - 数据结构设计](https://github.com/openset/leetcode/tree/master/problems/add-and-search-word-data-structure-design) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] [[回溯算法](https://github.com/openset/leetcode/tree/master/tag/backtracking/README.md)] | Medium | -| 208 | [实现 Trie (前缀树)](https://github.com/openset/leetcode/tree/master/problems/implement-trie-prefix-tree) | [[设计](https://github.com/openset/leetcode/tree/master/tag/design/README.md)] [[字典树](https://github.com/openset/leetcode/tree/master/tag/trie/README.md)] | Medium | +| 1065 | [字符串的索引对](../../problems/index-pairs-of-a-string) 🔒 | [[字典树](../trie/README.md)] [[字符串](../string/README.md)] | Easy | +| 1032 | [字符流](../../problems/stream-of-characters) | [[字典树](../trie/README.md)] | Hard | +| 1023 | [驼峰式匹配](../../problems/camelcase-matching) | [[字典树](../trie/README.md)] [[字符串](../string/README.md)] | Medium | +| 745 | [前缀和后缀搜索](../../problems/prefix-and-suffix-search) | [[字典树](../trie/README.md)] | Hard | +| 720 | [词典中最长的单词](../../problems/longest-word-in-dictionary) | [[字典树](../trie/README.md)] [[哈希表](../hash-table/README.md)] | Easy | +| 692 | [前K个高频单词](../../problems/top-k-frequent-words) | [[堆](../heap/README.md)] [[字典树](../trie/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 677 | [键值映射](../../problems/map-sum-pairs) | [[字典树](../trie/README.md)] | Medium | +| 676 | [实现一个魔法字典](../../problems/implement-magic-dictionary) | [[字典树](../trie/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 648 | [单词替换](../../problems/replace-words) | [[字典树](../trie/README.md)] [[哈希表](../hash-table/README.md)] | Medium | +| 642 | [设计搜索自动补全系统](../../problems/design-search-autocomplete-system) 🔒 | [[设计](../design/README.md)] [[字典树](../trie/README.md)] | Hard | +| 472 | [连接词](../../problems/concatenated-words) | [[深度优先搜索](../depth-first-search/README.md)] [[字典树](../trie/README.md)] [[动态规划](../dynamic-programming/README.md)] | Hard | +| 425 | [单词方块](../../problems/word-squares) 🔒 | [[字典树](../trie/README.md)] [[回溯算法](../backtracking/README.md)] | Hard | +| 421 | [数组中两个数的最大异或值](../../problems/maximum-xor-of-two-numbers-in-an-array) | [[位运算](../bit-manipulation/README.md)] [[字典树](../trie/README.md)] | Medium | +| 336 | [回文对](../../problems/palindrome-pairs) | [[字典树](../trie/README.md)] [[哈希表](../hash-table/README.md)] [[字符串](../string/README.md)] | Hard | +| 212 | [单词搜索 II](../../problems/word-search-ii) | [[字典树](../trie/README.md)] [[回溯算法](../backtracking/README.md)] | Hard | +| 211 | [添加与搜索单词 - 数据结构设计](../../problems/add-and-search-word-data-structure-design) | [[设计](../design/README.md)] [[字典树](../trie/README.md)] [[回溯算法](../backtracking/README.md)] | Medium | +| 208 | [实现 Trie (前缀树)](../../problems/implement-trie-prefix-tree) | [[设计](../design/README.md)] [[字典树](../trie/README.md)] | Medium | diff --git a/tag/two-pointers/README.md b/tag/two-pointers/README.md index 8e1982275..73027ba12 100644 --- a/tag/two-pointers/README.md +++ b/tag/two-pointers/README.md @@ -5,67 +5,67 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > 双指针 +## [话题分类](../README.md) > 双指针 | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 1248 | [统计「优美子数组」](https://github.com/openset/leetcode/tree/master/problems/count-number-of-nice-subarrays) | [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 1234 | [替换子串得到平衡字符串](https://github.com/openset/leetcode/tree/master/problems/replace-the-substring-for-balanced-string) | [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Medium | -| 1213 | [三个有序数组的交集](https://github.com/openset/leetcode/tree/master/problems/intersection-of-three-sorted-arrays) 🔒 | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Easy | -| 1093 | [大样本统计](https://github.com/openset/leetcode/tree/master/problems/statistics-from-a-large-sample) | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 1004 | [最大连续1的个数 III](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones-iii) | [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Medium | -| 992 | [K 个不同整数的子数组](https://github.com/openset/leetcode/tree/master/problems/subarrays-with-k-different-integers) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Hard | -| 986 | [区间列表的交集](https://github.com/openset/leetcode/tree/master/problems/interval-list-intersections) | [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 977 | [有序数组的平方](https://github.com/openset/leetcode/tree/master/problems/squares-of-a-sorted-array) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Easy | -| 930 | [和相同的二元子数组](https://github.com/openset/leetcode/tree/master/problems/binary-subarrays-with-sum) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 925 | [长按键入](https://github.com/openset/leetcode/tree/master/problems/long-pressed-name) | [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 923 | [三数之和的多种可能](https://github.com/openset/leetcode/tree/master/problems/3sum-with-multiplicity) | [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 904 | [水果成篮](https://github.com/openset/leetcode/tree/master/problems/fruit-into-baskets) | [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 881 | [救生艇](https://github.com/openset/leetcode/tree/master/problems/boats-to-save-people) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 845 | [数组中的最长山脉](https://github.com/openset/leetcode/tree/master/problems/longest-mountain-in-array) | [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 844 | [比较含退格的字符串](https://github.com/openset/leetcode/tree/master/problems/backspace-string-compare) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Easy | -| 838 | [推多米诺](https://github.com/openset/leetcode/tree/master/problems/push-dominoes) | [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[动态规划](https://github.com/openset/leetcode/tree/master/tag/dynamic-programming/README.md)] | Medium | -| 828 | [独特字符串](https://github.com/openset/leetcode/tree/master/problems/unique-letter-string) | [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Hard | -| 826 | [安排工作以达到最大收益](https://github.com/openset/leetcode/tree/master/problems/most-profit-assigning-work) | [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 763 | [划分字母区间](https://github.com/openset/leetcode/tree/master/problems/partition-labels) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 723 | [粉碎糖果](https://github.com/openset/leetcode/tree/master/problems/candy-crush) 🔒 | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 713 | [乘积小于K的子数组](https://github.com/openset/leetcode/tree/master/problems/subarray-product-less-than-k) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 632 | [最小区间](https://github.com/openset/leetcode/tree/master/problems/smallest-range-covering-elements-from-k-lists) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 567 | [字符串的排列](https://github.com/openset/leetcode/tree/master/problems/permutation-in-string) | [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Medium | -| 532 | [数组中的K-diff数对](https://github.com/openset/leetcode/tree/master/problems/k-diff-pairs-in-an-array) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Easy | -| 524 | [通过删除字母匹配到字典里最长单词](https://github.com/openset/leetcode/tree/master/problems/longest-word-in-dictionary-through-deleting) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 487 | [最大连续1的个数 II](https://github.com/openset/leetcode/tree/master/problems/max-consecutive-ones-ii) 🔒 | [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 457 | [环形数组循环](https://github.com/openset/leetcode/tree/master/problems/circular-array-loop) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 424 | [替换后的最长重复字符](https://github.com/openset/leetcode/tree/master/problems/longest-repeating-character-replacement) | [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Medium | -| 360 | [有序转化数组](https://github.com/openset/leetcode/tree/master/problems/sort-transformed-array) 🔒 | [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 350 | [两个数组的交集 II](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-arrays-ii) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Easy | -| 349 | [两个数组的交集](https://github.com/openset/leetcode/tree/master/problems/intersection-of-two-arrays) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Easy | -| 345 | [反转字符串中的元音字母](https://github.com/openset/leetcode/tree/master/problems/reverse-vowels-of-a-string) | [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 344 | [反转字符串](https://github.com/openset/leetcode/tree/master/problems/reverse-string) | [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 287 | [寻找重复数](https://github.com/openset/leetcode/tree/master/problems/find-the-duplicate-number) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 283 | [移动零](https://github.com/openset/leetcode/tree/master/problems/move-zeroes) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Easy | -| 259 | [较小的三数之和](https://github.com/openset/leetcode/tree/master/problems/3sum-smaller) 🔒 | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 234 | [回文链表](https://github.com/openset/leetcode/tree/master/problems/palindrome-linked-list) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Easy | -| 209 | [长度最小的子数组](https://github.com/openset/leetcode/tree/master/problems/minimum-size-subarray-sum) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Medium | -| 167 | [两数之和 II - 输入有序数组](https://github.com/openset/leetcode/tree/master/problems/two-sum-ii-input-array-is-sorted) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Easy | -| 159 | [至多包含两个不同字符的最长子串](https://github.com/openset/leetcode/tree/master/problems/longest-substring-with-at-most-two-distinct-characters) 🔒 | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Medium | -| 142 | [环形链表 II](https://github.com/openset/leetcode/tree/master/problems/linked-list-cycle-ii) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 141 | [环形链表](https://github.com/openset/leetcode/tree/master/problems/linked-list-cycle) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Easy | -| 125 | [验证回文串](https://github.com/openset/leetcode/tree/master/problems/valid-palindrome) | [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 88 | [合并两个有序数组](https://github.com/openset/leetcode/tree/master/problems/merge-sorted-array) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Easy | -| 86 | [分隔链表](https://github.com/openset/leetcode/tree/master/problems/partition-list) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 80 | [删除排序数组中的重复项 II](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-array-ii) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 76 | [最小覆盖子串](https://github.com/openset/leetcode/tree/master/problems/minimum-window-substring) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Hard | -| 75 | [颜色分类](https://github.com/openset/leetcode/tree/master/problems/sort-colors) | [[排序](https://github.com/openset/leetcode/tree/master/tag/sort/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 61 | [旋转链表](https://github.com/openset/leetcode/tree/master/problems/rotate-list) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 42 | [接雨水](https://github.com/openset/leetcode/tree/master/problems/trapping-rain-water) | [[栈](https://github.com/openset/leetcode/tree/master/tag/stack/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Hard | -| 30 | [串联所有单词的子串](https://github.com/openset/leetcode/tree/master/problems/substring-with-concatenation-of-all-words) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Hard | -| 28 | [实现 strStr()](https://github.com/openset/leetcode/tree/master/problems/implement-strstr) | [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] | Easy | -| 27 | [移除元素](https://github.com/openset/leetcode/tree/master/problems/remove-element) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Easy | -| 26 | [删除排序数组中的重复项](https://github.com/openset/leetcode/tree/master/problems/remove-duplicates-from-sorted-array) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Easy | -| 19 | [删除链表的倒数第N个节点](https://github.com/openset/leetcode/tree/master/problems/remove-nth-node-from-end-of-list) | [[链表](https://github.com/openset/leetcode/tree/master/tag/linked-list/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 18 | [四数之和](https://github.com/openset/leetcode/tree/master/problems/4sum) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 16 | [最接近的三数之和](https://github.com/openset/leetcode/tree/master/problems/3sum-closest) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 15 | [三数之和](https://github.com/openset/leetcode/tree/master/problems/3sum) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 11 | [盛最多水的容器](https://github.com/openset/leetcode/tree/master/problems/container-with-most-water) | [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] | Medium | -| 3 | [无重复字符的最长子串](https://github.com/openset/leetcode/tree/master/problems/longest-substring-without-repeating-characters) | [[哈希表](https://github.com/openset/leetcode/tree/master/tag/hash-table/README.md)] [[双指针](https://github.com/openset/leetcode/tree/master/tag/two-pointers/README.md)] [[字符串](https://github.com/openset/leetcode/tree/master/tag/string/README.md)] [[Sliding Window](https://github.com/openset/leetcode/tree/master/tag/sliding-window/README.md)] | Medium | +| 1248 | [统计「优美子数组」](../../problems/count-number-of-nice-subarrays) | [[双指针](../two-pointers/README.md)] | Medium | +| 1234 | [替换子串得到平衡字符串](../../problems/replace-the-substring-for-balanced-string) | [[双指针](../two-pointers/README.md)] [[字符串](../string/README.md)] | Medium | +| 1213 | [三个有序数组的交集](../../problems/intersection-of-three-sorted-arrays) 🔒 | [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] | Easy | +| 1093 | [大样本统计](../../problems/statistics-from-a-large-sample) | [[数学](../math/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 1004 | [最大连续1的个数 III](../../problems/max-consecutive-ones-iii) | [[双指针](../two-pointers/README.md)] [[Sliding Window](../sliding-window/README.md)] | Medium | +| 992 | [K 个不同整数的子数组](../../problems/subarrays-with-k-different-integers) | [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] [[Sliding Window](../sliding-window/README.md)] | Hard | +| 986 | [区间列表的交集](../../problems/interval-list-intersections) | [[双指针](../two-pointers/README.md)] | Medium | +| 977 | [有序数组的平方](../../problems/squares-of-a-sorted-array) | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] | Easy | +| 930 | [和相同的二元子数组](../../problems/binary-subarrays-with-sum) | [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 925 | [长按键入](../../problems/long-pressed-name) | [[双指针](../two-pointers/README.md)] [[字符串](../string/README.md)] | Easy | +| 923 | [三数之和的多种可能](../../problems/3sum-with-multiplicity) | [[双指针](../two-pointers/README.md)] | Medium | +| 904 | [水果成篮](../../problems/fruit-into-baskets) | [[双指针](../two-pointers/README.md)] | Medium | +| 881 | [救生艇](../../problems/boats-to-save-people) | [[贪心算法](../greedy/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 845 | [数组中的最长山脉](../../problems/longest-mountain-in-array) | [[双指针](../two-pointers/README.md)] | Medium | +| 844 | [比较含退格的字符串](../../problems/backspace-string-compare) | [[栈](../stack/README.md)] [[双指针](../two-pointers/README.md)] | Easy | +| 838 | [推多米诺](../../problems/push-dominoes) | [[双指针](../two-pointers/README.md)] [[动态规划](../dynamic-programming/README.md)] | Medium | +| 828 | [独特字符串](../../problems/unique-letter-string) | [[双指针](../two-pointers/README.md)] | Hard | +| 826 | [安排工作以达到最大收益](../../problems/most-profit-assigning-work) | [[双指针](../two-pointers/README.md)] | Medium | +| 763 | [划分字母区间](../../problems/partition-labels) | [[贪心算法](../greedy/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 723 | [粉碎糖果](../../problems/candy-crush) 🔒 | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 713 | [乘积小于K的子数组](../../problems/subarray-product-less-than-k) | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 632 | [最小区间](../../problems/smallest-range-covering-elements-from-k-lists) | [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] [[字符串](../string/README.md)] | Hard | +| 567 | [字符串的排列](../../problems/permutation-in-string) | [[双指针](../two-pointers/README.md)] [[Sliding Window](../sliding-window/README.md)] | Medium | +| 532 | [数组中的K-diff数对](../../problems/k-diff-pairs-in-an-array) | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] | Easy | +| 524 | [通过删除字母匹配到字典里最长单词](../../problems/longest-word-in-dictionary-through-deleting) | [[排序](../sort/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 487 | [最大连续1的个数 II](../../problems/max-consecutive-ones-ii) 🔒 | [[双指针](../two-pointers/README.md)] | Medium | +| 457 | [环形数组循环](../../problems/circular-array-loop) | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 424 | [替换后的最长重复字符](../../problems/longest-repeating-character-replacement) | [[双指针](../two-pointers/README.md)] [[Sliding Window](../sliding-window/README.md)] | Medium | +| 360 | [有序转化数组](../../problems/sort-transformed-array) 🔒 | [[数学](../math/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 350 | [两个数组的交集 II](../../problems/intersection-of-two-arrays-ii) | [[排序](../sort/README.md)] [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] [[二分查找](../binary-search/README.md)] | Easy | +| 349 | [两个数组的交集](../../problems/intersection-of-two-arrays) | [[排序](../sort/README.md)] [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] [[二分查找](../binary-search/README.md)] | Easy | +| 345 | [反转字符串中的元音字母](../../problems/reverse-vowels-of-a-string) | [[双指针](../two-pointers/README.md)] [[字符串](../string/README.md)] | Easy | +| 344 | [反转字符串](../../problems/reverse-string) | [[双指针](../two-pointers/README.md)] [[字符串](../string/README.md)] | Easy | +| 287 | [寻找重复数](../../problems/find-the-duplicate-number) | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 283 | [移动零](../../problems/move-zeroes) | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] | Easy | +| 259 | [较小的三数之和](../../problems/3sum-smaller) 🔒 | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 234 | [回文链表](../../problems/palindrome-linked-list) | [[链表](../linked-list/README.md)] [[双指针](../two-pointers/README.md)] | Easy | +| 209 | [长度最小的子数组](../../problems/minimum-size-subarray-sum) | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] [[二分查找](../binary-search/README.md)] | Medium | +| 167 | [两数之和 II - 输入有序数组](../../problems/two-sum-ii-input-array-is-sorted) | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] [[二分查找](../binary-search/README.md)] | Easy | +| 159 | [至多包含两个不同字符的最长子串](../../problems/longest-substring-with-at-most-two-distinct-characters) 🔒 | [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] [[字符串](../string/README.md)] [[Sliding Window](../sliding-window/README.md)] | Medium | +| 142 | [环形链表 II](../../problems/linked-list-cycle-ii) | [[链表](../linked-list/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 141 | [环形链表](../../problems/linked-list-cycle) | [[链表](../linked-list/README.md)] [[双指针](../two-pointers/README.md)] | Easy | +| 125 | [验证回文串](../../problems/valid-palindrome) | [[双指针](../two-pointers/README.md)] [[字符串](../string/README.md)] | Easy | +| 88 | [合并两个有序数组](../../problems/merge-sorted-array) | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] | Easy | +| 86 | [分隔链表](../../problems/partition-list) | [[链表](../linked-list/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 80 | [删除排序数组中的重复项 II](../../problems/remove-duplicates-from-sorted-array-ii) | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 76 | [最小覆盖子串](../../problems/minimum-window-substring) | [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] [[字符串](../string/README.md)] [[Sliding Window](../sliding-window/README.md)] | Hard | +| 75 | [颜色分类](../../problems/sort-colors) | [[排序](../sort/README.md)] [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 61 | [旋转链表](../../problems/rotate-list) | [[链表](../linked-list/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 42 | [接雨水](../../problems/trapping-rain-water) | [[栈](../stack/README.md)] [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] | Hard | +| 30 | [串联所有单词的子串](../../problems/substring-with-concatenation-of-all-words) | [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] [[字符串](../string/README.md)] | Hard | +| 28 | [实现 strStr()](../../problems/implement-strstr) | [[双指针](../two-pointers/README.md)] [[字符串](../string/README.md)] | Easy | +| 27 | [移除元素](../../problems/remove-element) | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] | Easy | +| 26 | [删除排序数组中的重复项](../../problems/remove-duplicates-from-sorted-array) | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] | Easy | +| 19 | [删除链表的倒数第N个节点](../../problems/remove-nth-node-from-end-of-list) | [[链表](../linked-list/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 18 | [四数之和](../../problems/4sum) | [[数组](../array/README.md)] [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 16 | [最接近的三数之和](../../problems/3sum-closest) | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 15 | [三数之和](../../problems/3sum) | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 11 | [盛最多水的容器](../../problems/container-with-most-water) | [[数组](../array/README.md)] [[双指针](../two-pointers/README.md)] | Medium | +| 3 | [无重复字符的最长子串](../../problems/longest-substring-without-repeating-characters) | [[哈希表](../hash-table/README.md)] [[双指针](../two-pointers/README.md)] [[字符串](../string/README.md)] [[Sliding Window](../sliding-window/README.md)] | Medium | diff --git a/tag/union-find/README.md b/tag/union-find/README.md index 835928141..22c143e20 100644 --- a/tag/union-find/README.md +++ b/tag/union-find/README.md @@ -5,35 +5,35 @@ -## [话题分类](https://github.com/openset/leetcode/blob/master/tag/README.md) > 并查集 +## [话题分类](../README.md) > 并查集 | # | 题名 | 标签 | 难度 | | :-: | - | - | :-: | -| 1202 | [交换字符串中的元素](https://github.com/openset/leetcode/tree/master/problems/smallest-string-with-swaps) | [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Medium | -| 1168 | [水资源分配优化](https://github.com/openset/leetcode/tree/master/problems/optimize-water-distribution-in-a-village) 🔒 | [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Hard | -| 1135 | [最低成本联通所有城市](https://github.com/openset/leetcode/tree/master/problems/connecting-cities-with-minimum-cost) 🔒 | [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 1102 | [得分最高的路径](https://github.com/openset/leetcode/tree/master/problems/path-with-maximum-minimum-value) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 1101 | [彼此熟识的最早时间](https://github.com/openset/leetcode/tree/master/problems/the-earliest-moment-when-everyone-become-friends) 🔒 | [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] | Medium | -| 1061 | [按字典序排列最小的等效字符串](https://github.com/openset/leetcode/tree/master/problems/lexicographically-smallest-equivalent-string) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] | Medium | -| 990 | [等式方程的可满足性](https://github.com/openset/leetcode/tree/master/problems/satisfiability-of-equality-equations) | [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 959 | [由斜杠划分区域](https://github.com/openset/leetcode/tree/master/problems/regions-cut-by-slashes) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 952 | [按公因数计算最大组件大小](https://github.com/openset/leetcode/tree/master/problems/largest-component-size-by-common-factor) | [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[数学](https://github.com/openset/leetcode/tree/master/tag/math/README.md)] | Hard | -| 947 | [移除最多的同行或同列石头](https://github.com/openset/leetcode/tree/master/problems/most-stones-removed-with-same-row-or-column) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] | Medium | -| 928 | [尽量减少恶意软件的传播 II](https://github.com/openset/leetcode/tree/master/problems/minimize-malware-spread-ii) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Hard | -| 924 | [尽量减少恶意软件的传播](https://github.com/openset/leetcode/tree/master/problems/minimize-malware-spread) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] | Hard | -| 839 | [相似字符串组](https://github.com/openset/leetcode/tree/master/problems/similar-string-groups) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Hard | -| 803 | [打砖块](https://github.com/openset/leetcode/tree/master/problems/bricks-falling-when-hit) | [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] | Hard | -| 778 | [水位上升的泳池中游泳](https://github.com/openset/leetcode/tree/master/problems/swim-in-rising-water) | [[堆](https://github.com/openset/leetcode/tree/master/tag/heap/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[二分查找](https://github.com/openset/leetcode/tree/master/tag/binary-search/README.md)] | Hard | -| 765 | [情侣牵手](https://github.com/openset/leetcode/tree/master/problems/couples-holding-hands) | [[贪心算法](https://github.com/openset/leetcode/tree/master/tag/greedy/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Hard | -| 737 | [句子相似性 II](https://github.com/openset/leetcode/tree/master/problems/sentence-similarity-ii) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] | Medium | -| 721 | [账户合并](https://github.com/openset/leetcode/tree/master/problems/accounts-merge) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] | Medium | -| 685 | [冗余连接 II](https://github.com/openset/leetcode/tree/master/problems/redundant-connection-ii) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Hard | -| 684 | [冗余连接](https://github.com/openset/leetcode/tree/master/problems/redundant-connection) | [[树](https://github.com/openset/leetcode/tree/master/tag/tree/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 547 | [朋友圈](https://github.com/openset/leetcode/tree/master/problems/friend-circles) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] | Medium | -| 399 | [除法求值](https://github.com/openset/leetcode/tree/master/problems/evaluate-division) | [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 323 | [无向图中连通分量的数目](https://github.com/openset/leetcode/tree/master/problems/number-of-connected-components-in-an-undirected-graph) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 305 | [岛屿数量 II](https://github.com/openset/leetcode/tree/master/problems/number-of-islands-ii) 🔒 | [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] | Hard | -| 261 | [以图判树](https://github.com/openset/leetcode/tree/master/problems/graph-valid-tree) 🔒 | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[图](https://github.com/openset/leetcode/tree/master/tag/graph/README.md)] | Medium | -| 200 | [岛屿数量](https://github.com/openset/leetcode/tree/master/problems/number-of-islands) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] | Medium | -| 130 | [被围绕的区域](https://github.com/openset/leetcode/tree/master/problems/surrounded-regions) | [[深度优先搜索](https://github.com/openset/leetcode/tree/master/tag/depth-first-search/README.md)] [[广度优先搜索](https://github.com/openset/leetcode/tree/master/tag/breadth-first-search/README.md)] [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] | Medium | -| 128 | [最长连续序列](https://github.com/openset/leetcode/tree/master/problems/longest-consecutive-sequence) | [[并查集](https://github.com/openset/leetcode/tree/master/tag/union-find/README.md)] [[数组](https://github.com/openset/leetcode/tree/master/tag/array/README.md)] | Hard | +| 1202 | [交换字符串中的元素](../../problems/smallest-string-with-swaps) | [[并查集](../union-find/README.md)] [[数组](../array/README.md)] | Medium | +| 1168 | [水资源分配优化](../../problems/optimize-water-distribution-in-a-village) 🔒 | [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Hard | +| 1135 | [最低成本联通所有城市](../../problems/connecting-cities-with-minimum-cost) 🔒 | [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Medium | +| 1102 | [得分最高的路径](../../problems/path-with-maximum-minimum-value) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Medium | +| 1101 | [彼此熟识的最早时间](../../problems/the-earliest-moment-when-everyone-become-friends) 🔒 | [[并查集](../union-find/README.md)] | Medium | +| 1061 | [按字典序排列最小的等效字符串](../../problems/lexicographically-smallest-equivalent-string) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[并查集](../union-find/README.md)] | Medium | +| 990 | [等式方程的可满足性](../../problems/satisfiability-of-equality-equations) | [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Medium | +| 959 | [由斜杠划分区域](../../problems/regions-cut-by-slashes) | [[深度优先搜索](../depth-first-search/README.md)] [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Medium | +| 952 | [按公因数计算最大组件大小](../../problems/largest-component-size-by-common-factor) | [[并查集](../union-find/README.md)] [[数学](../math/README.md)] | Hard | +| 947 | [移除最多的同行或同列石头](../../problems/most-stones-removed-with-same-row-or-column) | [[深度优先搜索](../depth-first-search/README.md)] [[并查集](../union-find/README.md)] | Medium | +| 928 | [尽量减少恶意软件的传播 II](../../problems/minimize-malware-spread-ii) | [[深度优先搜索](../depth-first-search/README.md)] [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Hard | +| 924 | [尽量减少恶意软件的传播](../../problems/minimize-malware-spread) | [[深度优先搜索](../depth-first-search/README.md)] [[并查集](../union-find/README.md)] | Hard | +| 839 | [相似字符串组](../../problems/similar-string-groups) | [[深度优先搜索](../depth-first-search/README.md)] [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Hard | +| 803 | [打砖块](../../problems/bricks-falling-when-hit) | [[并查集](../union-find/README.md)] | Hard | +| 778 | [水位上升的泳池中游泳](../../problems/swim-in-rising-water) | [[堆](../heap/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[并查集](../union-find/README.md)] [[二分查找](../binary-search/README.md)] | Hard | +| 765 | [情侣牵手](../../problems/couples-holding-hands) | [[贪心算法](../greedy/README.md)] [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Hard | +| 737 | [句子相似性 II](../../problems/sentence-similarity-ii) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[并查集](../union-find/README.md)] | Medium | +| 721 | [账户合并](../../problems/accounts-merge) | [[深度优先搜索](../depth-first-search/README.md)] [[并查集](../union-find/README.md)] | Medium | +| 685 | [冗余连接 II](../../problems/redundant-connection-ii) | [[树](../tree/README.md)] [[深度优先搜索](../depth-first-search/README.md)] [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Hard | +| 684 | [冗余连接](../../problems/redundant-connection) | [[树](../tree/README.md)] [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Medium | +| 547 | [朋友圈](../../problems/friend-circles) | [[深度优先搜索](../depth-first-search/README.md)] [[并查集](../union-find/README.md)] | Medium | +| 399 | [除法求值](../../problems/evaluate-division) | [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Medium | +| 323 | [无向图中连通分量的数目](../../problems/number-of-connected-components-in-an-undirected-graph) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Medium | +| 305 | [岛屿数量 II](../../problems/number-of-islands-ii) 🔒 | [[并查集](../union-find/README.md)] | Hard | +| 261 | [以图判树](../../problems/graph-valid-tree) 🔒 | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[并查集](../union-find/README.md)] [[图](../graph/README.md)] | Medium | +| 200 | [岛屿数量](../../problems/number-of-islands) | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[并查集](../union-find/README.md)] | Medium | +| 130 | [被围绕的区域](../../problems/surrounded-regions) | [[深度优先搜索](../depth-first-search/README.md)] [[广度优先搜索](../breadth-first-search/README.md)] [[并查集](../union-find/README.md)] | Medium | +| 128 | [最长连续序列](../../problems/longest-consecutive-sequence) | [[并查集](../union-find/README.md)] [[数组](../array/README.md)] | Hard |