diff --git a/README.md b/README.md index acda29da..44fd00b6 100755 --- a/README.md +++ b/README.md @@ -125,1304 +125,1304 @@ | | Easy | Medium | Hard | Total | |:--------:|:--------:|:--------:|:--------:|:--------:| -|Optimizing|38|45|15|98| -|Accepted|**251**|**321**|**96**|**668**| -|Total|461|908|370|1739| -|Perfection Rate|84.9%|86.0%|84.4%|85.3%| -|Completion Rate|54.4%|35.4%|25.9%|38.4%| +|Optimizing|39|49|18|106| +|Accepted|**251**|**326**|**99**|**676**| +|Total|461|921|373|1755| +|Perfection Rate|84.5%|85.0%|81.8%|84.3%| +|Completion Rate|54.4%|35.4%|26.5%|38.5%| |------------|----------------------------|----------------------------|----------------------------|----------------------------| ## 二. 目录 -以下已经收录了 570 道题的题解,还有 13 道题在尝试优化到 beats 100% +以下已经收录了 570 道题的题解,还有 10 道题在尝试优化到 beats 100% | No. | Title | Solution | Acceptance | Difficulty | Frequency | |:--------:|:--------------------------------------------------------------|:--------:|:--------:|:--------:|:--------:| -|0001|Two Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0001.Two-Sum)|46.3%|Easy|| -|0002|Add Two Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0002.Add-Two-Numbers)|35.2%|Medium|| -|0003|Longest Substring Without Repeating Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0003.Longest-Substring-Without-Repeating-Characters)|31.3%|Medium|| -|0004|Median of Two Sorted Arrays|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0004.Median-of-Two-Sorted-Arrays)|30.8%|Hard|| +|0001|Two Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0001.Two-Sum)|46.4%|Easy|| +|0002|Add Two Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0002.Add-Two-Numbers)|35.3%|Medium|| +|0003|Longest Substring Without Repeating Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0003.Longest-Substring-Without-Repeating-Characters)|31.4%|Medium|| +|0004|Median of Two Sorted Arrays|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0004.Median-of-Two-Sorted-Arrays)|30.9%|Hard|| |0005|Longest Palindromic Substring||30.4%|Medium|| -|0006|ZigZag Conversion||37.7%|Medium|| +|0006|ZigZag Conversion||37.8%|Medium|| |0007|Reverse Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0007.Reverse-Integer)|25.9%|Easy|| |0008|String to Integer (atoi)||15.6%|Medium|| -|0009|Palindrome Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0009.Palindrome-Number)|49.5%|Easy|| +|0009|Palindrome Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0009.Palindrome-Number)|49.6%|Easy|| |0010|Regular Expression Matching||27.3%|Hard|| -|0011|Container With Most Water|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0011.Container-With-Most-Water)|52.2%|Medium|| -|0012|Integer to Roman||56.0%|Medium|| -|0013|Roman to Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0013.Roman-to-Integer)|56.4%|Easy|| -|0014|Longest Common Prefix||36.0%|Easy|| -|0015|3Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0015.3Sum)|27.8%|Medium|| +|0011|Container With Most Water|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0011.Container-With-Most-Water)|52.3%|Medium|| +|0012|Integer to Roman||56.1%|Medium|| +|0013|Roman to Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0013.Roman-to-Integer)|56.5%|Easy|| +|0014|Longest Common Prefix||36.1%|Easy|| +|0015|3Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0015.3Sum)|27.9%|Medium|| |0016|3Sum Closest|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0016.3Sum-Closest)|46.3%|Medium|| -|0017|Letter Combinations of a Phone Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0017.Letter-Combinations-of-a-Phone-Number)|48.8%|Medium|| -|0018|4Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0018.4Sum)|34.7%|Medium|| -|0019|Remove Nth Node From End of List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0019.Remove-Nth-Node-From-End-of-List)|35.6%|Medium|| +|0017|Letter Combinations of a Phone Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0017.Letter-Combinations-of-a-Phone-Number)|48.9%|Medium|| +|0018|4Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0018.4Sum)|34.8%|Medium|| +|0019|Remove Nth Node From End of List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0019.Remove-Nth-Node-From-End-of-List)|35.7%|Medium|| |0020|Valid Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0020.Valid-Parentheses)|39.8%|Easy|| -|0021|Merge Two Sorted Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0021.Merge-Two-Sorted-Lists)|55.7%|Easy|| -|0022|Generate Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0022.Generate-Parentheses)|64.9%|Medium|| -|0023|Merge k Sorted Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0023.Merge-k-Sorted-Lists)|42.4%|Hard|| -|0024|Swap Nodes in Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0024.Swap-Nodes-in-Pairs)|52.7%|Medium|| -|0025|Reverse Nodes in k-Group|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0025.Reverse-Nodes-in-k-Group)|44.4%|Hard|| -|0026|Remove Duplicates from Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0026.Remove-Duplicates-from-Sorted-Array)|46.4%|Easy|| -|0027|Remove Element|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0027.Remove-Element)|49.1%|Easy|| +|0021|Merge Two Sorted Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0021.Merge-Two-Sorted-Lists)|55.9%|Easy|| +|0022|Generate Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0022.Generate-Parentheses)|65.1%|Medium|| +|0023|Merge k Sorted Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0023.Merge-k-Sorted-Lists)|42.5%|Hard|| +|0024|Swap Nodes in Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0024.Swap-Nodes-in-Pairs)|52.9%|Medium|| +|0025|Reverse Nodes in k-Group|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0025.Reverse-Nodes-in-k-Group)|44.6%|Hard|| +|0026|Remove Duplicates from Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0026.Remove-Duplicates-from-Sorted-Array)|46.5%|Easy|| +|0027|Remove Element|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0027.Remove-Element)|49.2%|Easy|| |0028|Implement strStr()|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0028.Implement-strStr())|35.1%|Easy|| |0029|Divide Two Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0029.Divide-Two-Integers)|16.6%|Medium|| |0030|Substring with Concatenation of All Words|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0030.Substring-with-Concatenation-of-All-Words)|26.1%|Hard|| -|0031|Next Permutation||33.3%|Medium|| +|0031|Next Permutation||33.7%|Medium|| |0032|Longest Valid Parentheses||29.2%|Hard|| -|0033|Search in Rotated Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0033.Search-in-Rotated-Sorted-Array)|35.7%|Medium|| -|0034|Find First and Last Position of Element in Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array)|37.1%|Medium|| +|0033|Search in Rotated Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0033.Search-in-Rotated-Sorted-Array)|35.8%|Medium|| +|0034|Find First and Last Position of Element in Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array)|37.2%|Medium|| |0035|Search Insert Position|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0035.Search-Insert-Position)|42.8%|Easy|| -|0036|Valid Sudoku|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0036.Valid-Sudoku)|50.3%|Medium|| -|0037|Sudoku Solver|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0037.Sudoku-Solver)|46.1%|Hard|| +|0036|Valid Sudoku|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0036.Valid-Sudoku)|50.4%|Medium|| +|0037|Sudoku Solver|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0037.Sudoku-Solver)|46.3%|Hard|| |0038|Count and Say||45.9%|Easy|| -|0039|Combination Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0039.Combination-Sum)|58.9%|Medium|| -|0040|Combination Sum II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0040.Combination-Sum-II)|49.9%|Medium|| -|0041|First Missing Positive|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0041.First-Missing-Positive)|33.5%|Hard|| -|0042|Trapping Rain Water|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0042.Trapping-Rain-Water)|50.8%|Hard|| -|0043|Multiply Strings||34.8%|Medium|| -|0044|Wildcard Matching||25.3%|Hard|| -|0045|Jump Game II||31.3%|Hard|| -|0046|Permutations|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0046.Permutations)|66.2%|Medium|| -|0047|Permutations II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0047.Permutations-II)|49.1%|Medium|| -|0048|Rotate Image|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0048.Rotate-Image)|59.5%|Medium|| -|0049|Group Anagrams|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0049.Group-Anagrams)|58.9%|Medium|| -|0050|Pow(x, n)|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0050.Pow(x,-n))|30.8%|Medium|| -|0051|N-Queens|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0051.N-Queens)|49.2%|Hard|| -|0052|N-Queens II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0052.N-Queens-II)|59.8%|Hard|| -|0053|Maximum Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0053.Maximum-Subarray)|47.6%|Easy|| -|0054|Spiral Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0054.Spiral-Matrix)|35.6%|Medium|| +|0039|Combination Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0039.Combination-Sum)|59.0%|Medium|| +|0040|Combination Sum II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0040.Combination-Sum-II)|50.0%|Medium|| +|0041|First Missing Positive|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0041.First-Missing-Positive)|33.6%|Hard|| +|0042|Trapping Rain Water|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0042.Trapping-Rain-Water)|51.0%|Hard|| +|0043|Multiply Strings||34.9%|Medium|| +|0044|Wildcard Matching||25.4%|Hard|| +|0045|Jump Game II||31.4%|Hard|| +|0046|Permutations|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0046.Permutations)|66.4%|Medium|| +|0047|Permutations II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0047.Permutations-II)|49.2%|Medium|| +|0048|Rotate Image|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0048.Rotate-Image)|59.7%|Medium|| +|0049|Group Anagrams|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0049.Group-Anagrams)|59.1%|Medium|| +|0050|Pow(x, n)|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0050.Pow(x,-n))|30.9%|Medium|| +|0051|N-Queens|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0051.N-Queens)|49.4%|Hard|| +|0052|N-Queens II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0052.N-Queens-II)|59.9%|Hard|| +|0053|Maximum Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0053.Maximum-Subarray)|47.7%|Easy|| +|0054|Spiral Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0054.Spiral-Matrix)|35.8%|Medium|| |0055|Jump Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0055.Jump-Game)|35.1%|Medium|| -|0056|Merge Intervals|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0056.Merge-Intervals)|40.7%|Medium|| -|0057|Insert Interval|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0057.Insert-Interval)|34.9%|Medium|| -|0058|Length of Last Word||33.4%|Easy|| -|0059|Spiral Matrix II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0059.Spiral-Matrix-II)|57.5%|Medium|| -|0060|Permutation Sequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0060.Permutation-Sequence)|39.2%|Hard|| -|0061|Rotate List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0061.Rotate-List)|31.6%|Medium|| -|0062|Unique Paths|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0062.Unique-Paths)|55.7%|Medium|| +|0056|Merge Intervals|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0056.Merge-Intervals)|40.9%|Medium|| +|0057|Insert Interval|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0057.Insert-Interval)|35.0%|Medium|| +|0058|Length of Last Word||33.5%|Easy|| +|0059|Spiral Matrix II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0059.Spiral-Matrix-II)|57.6%|Medium|| +|0060|Permutation Sequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0060.Permutation-Sequence)|39.3%|Hard|| +|0061|Rotate List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0061.Rotate-List)|31.7%|Medium|| +|0062|Unique Paths|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0062.Unique-Paths)|55.8%|Medium|| |0063|Unique Paths II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0063.Unique-Paths-II)|35.2%|Medium|| -|0064|Minimum Path Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0064.Minimum-Path-Sum)|56.0%|Medium|| +|0064|Minimum Path Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0064.Minimum-Path-Sum)|56.1%|Medium|| |0065|Valid Number||15.8%|Hard|| |0066|Plus One|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0066.Plus-One)|42.4%|Easy|| -|0067|Add Binary|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0067.Add-Binary)|46.7%|Easy|| -|0068|Text Justification||29.3%|Hard|| -|0069|Sqrt(x)|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0069.Sqrt(x))|34.9%|Easy|| -|0070|Climbing Stairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0070.Climbing-Stairs)|48.5%|Easy|| -|0071|Simplify Path|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0071.Simplify-Path)|33.6%|Medium|| -|0072|Edit Distance||46.5%|Hard|| -|0073|Set Matrix Zeroes||44.1%|Medium|| -|0074|Search a 2D Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0074.Search-a-2D-Matrix)|37.5%|Medium|| -|0075|Sort Colors|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0075.Sort-Colors)|49.0%|Medium|| -|0076|Minimum Window Substring|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0076.Minimum-Window-Substring)|35.8%|Hard|| -|0077|Combinations|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0077.Combinations)|57.1%|Medium|| -|0078|Subsets|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0078.Subsets)|64.6%|Medium|| -|0079|Word Search|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0079.Word-Search)|36.6%|Medium|| -|0080|Remove Duplicates from Sorted Array II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0080.Remove-Duplicates-from-Sorted-Array-II)|45.9%|Medium|| +|0067|Add Binary|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0067.Add-Binary)|46.8%|Easy|| +|0068|Text Justification||29.5%|Hard|| +|0069|Sqrt(x)|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0069.Sqrt(x))|35.0%|Easy|| +|0070|Climbing Stairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0070.Climbing-Stairs)|48.6%|Easy|| +|0071|Simplify Path|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0071.Simplify-Path)|34.6%|Medium|| +|0072|Edit Distance||46.6%|Hard|| +|0073|Set Matrix Zeroes||44.2%|Medium|| +|0074|Search a 2D Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0074.Search-a-2D-Matrix)|37.6%|Medium|| +|0075|Sort Colors|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0075.Sort-Colors)|49.2%|Medium|| +|0076|Minimum Window Substring|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0076.Minimum-Window-Substring)|35.9%|Hard|| +|0077|Combinations|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0077.Combinations)|57.2%|Medium|| +|0078|Subsets|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0078.Subsets)|64.8%|Medium|| +|0079|Word Search|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0079.Word-Search)|36.7%|Medium|| +|0080|Remove Duplicates from Sorted Array II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0080.Remove-Duplicates-from-Sorted-Array-II)|46.0%|Medium|| |0081|Search in Rotated Sorted Array II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0081.Search-in-Rotated-Sorted-Array-II)|33.5%|Medium|| -|0082|Remove Duplicates from Sorted List II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0082.Remove-Duplicates-from-Sorted-List-II)|39.0%|Medium|| -|0083|Remove Duplicates from Sorted List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0083.Remove-Duplicates-from-Sorted-List)|46.3%|Easy|| -|0084|Largest Rectangle in Histogram|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0084.Largest-Rectangle-in-Histogram)|36.9%|Hard|| +|0082|Remove Duplicates from Sorted List II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0082.Remove-Duplicates-from-Sorted-List-II)|39.1%|Medium|| +|0083|Remove Duplicates from Sorted List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0083.Remove-Duplicates-from-Sorted-List)|46.4%|Easy|| +|0084|Largest Rectangle in Histogram|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0084.Largest-Rectangle-in-Histogram)|37.0%|Hard|| |0085|Maximal Rectangle||39.3%|Hard|| -|0086|Partition List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0086.Partition-List)|43.1%|Medium|| -|0087|Scramble String||34.5%|Hard|| -|0088|Merge Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0088.Merge-Sorted-Array)|40.6%|Easy|| -|0089|Gray Code|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0089.Gray-Code)|50.1%|Medium|| -|0090|Subsets II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0090.Subsets-II)|48.6%|Medium|| -|0091|Decode Ways|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0091.Decode-Ways)|26.3%|Medium|| -|0092|Reverse Linked List II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0092.Reverse-Linked-List-II)|40.3%|Medium|| -|0093|Restore IP Addresses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0093.Restore-IP-Addresses)|37.3%|Medium|| -|0094|Binary Tree Inorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0094.Binary-Tree-Inorder-Traversal)|65.5%|Medium|| -|0095|Unique Binary Search Trees II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0095.Unique-Binary-Search-Trees-II)|42.2%|Medium|| -|0096|Unique Binary Search Trees|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0096.Unique-Binary-Search-Trees)|54.2%|Medium|| -|0097|Interleaving String||32.4%|Hard|| -|0098|Validate Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0098.Validate-Binary-Search-Tree)|28.6%|Medium|| -|0099|Recover Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0099.Recover-Binary-Search-Tree)|42.2%|Hard|| -|0100|Same Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0100.Same-Tree)|54.0%|Easy|| -|0101|Symmetric Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0101.Symmetric-Tree)|47.9%|Easy|| -|0102|Binary Tree Level Order Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0102.Binary-Tree-Level-Order-Traversal)|56.3%|Medium|| -|0103|Binary Tree Zigzag Level Order Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0103.Binary-Tree-Zigzag-Level-Order-Traversal)|49.8%|Medium|| -|0104|Maximum Depth of Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0104.Maximum-Depth-of-Binary-Tree)|67.8%|Easy|| -|0105|Construct Binary Tree from Preorder and Inorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal)|51.4%|Medium|| -|0106|Construct Binary Tree from Inorder and Postorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal)|49.3%|Medium|| -|0107|Binary Tree Level Order Traversal II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0107.Binary-Tree-Level-Order-Traversal-II)|54.9%|Easy|| -|0108|Convert Sorted Array to Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0108.Convert-Sorted-Array-to-Binary-Search-Tree)|60.1%|Easy|| -|0109|Convert Sorted List to Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree)|49.9%|Medium|| -|0110|Balanced Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0110.Balanced-Binary-Tree)|44.6%|Easy|| -|0111|Minimum Depth of Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0111.Minimum-Depth-of-Binary-Tree)|39.3%|Easy|| -|0112|Path Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0112.Path-Sum)|42.2%|Easy|| -|0113|Path Sum II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0113.Path-Sum-II)|48.7%|Medium|| -|0114|Flatten Binary Tree to Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0114.Flatten-Binary-Tree-to-Linked-List)|51.5%|Medium|| -|0115|Distinct Subsequences||39.5%|Hard|| -|0116|Populating Next Right Pointers in Each Node||48.6%|Medium|| -|0117|Populating Next Right Pointers in Each Node II||41.8%|Medium|| -|0118|Pascal's Triangle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0118.Pascal's-Triangle)|54.5%|Easy|| -|0119|Pascal's Triangle II||51.9%|Easy|| -|0120|Triangle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0120.Triangle)|45.5%|Medium|| -|0121|Best Time to Buy and Sell Stock|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0121.Best-Time-to-Buy-and-Sell-Stock)|51.3%|Easy|| -|0122|Best Time to Buy and Sell Stock II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0122.Best-Time-to-Buy-and-Sell-Stock-II)|58.3%|Easy|| -|0123|Best Time to Buy and Sell Stock III||39.7%|Hard|| -|0124|Binary Tree Maximum Path Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0124.Binary-Tree-Maximum-Path-Sum)|35.3%|Hard|| -|0125|Valid Palindrome|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0125.Valid-Palindrome)|38.0%|Easy|| -|0126|Word Ladder II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0126.Word-Ladder-II)|23.5%|Hard|| -|0127|Word Ladder|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0127.Word-Ladder)|31.5%|Hard|| -|0128|Longest Consecutive Sequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0128.Longest-Consecutive-Sequence)|46.1%|Hard|| -|0129|Sum Root to Leaf Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0129.Sum-Root-to-Leaf-Numbers)|50.6%|Medium|| -|0130|Surrounded Regions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0130.Surrounded-Regions)|29.2%|Medium|| -|0131|Palindrome Partitioning|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0131.Palindrome-Partitioning)|51.5%|Medium|| +|0086|Partition List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0086.Partition-List)|43.2%|Medium|| +|0087|Scramble String||34.6%|Hard|| +|0088|Merge Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0088.Merge-Sorted-Array)|40.7%|Easy|| +|0089|Gray Code|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0089.Gray-Code)|50.3%|Medium|| +|0090|Subsets II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0090.Subsets-II)|48.7%|Medium|| +|0091|Decode Ways|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0091.Decode-Ways)|26.4%|Medium|| +|0092|Reverse Linked List II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0092.Reverse-Linked-List-II)|40.4%|Medium|| +|0093|Restore IP Addresses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0093.Restore-IP-Addresses)|37.4%|Medium|| +|0094|Binary Tree Inorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0094.Binary-Tree-Inorder-Traversal)|65.7%|Medium|| +|0095|Unique Binary Search Trees II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0095.Unique-Binary-Search-Trees-II)|42.3%|Medium|| +|0096|Unique Binary Search Trees|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0096.Unique-Binary-Search-Trees)|54.3%|Medium|| +|0097|Interleaving String||32.5%|Hard|| +|0098|Validate Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0098.Validate-Binary-Search-Tree)|28.7%|Medium|| +|0099|Recover Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0099.Recover-Binary-Search-Tree)|42.3%|Hard|| +|0100|Same Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0100.Same-Tree)|54.1%|Easy|| +|0101|Symmetric Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0101.Symmetric-Tree)|48.0%|Easy|| +|0102|Binary Tree Level Order Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0102.Binary-Tree-Level-Order-Traversal)|56.4%|Medium|| +|0103|Binary Tree Zigzag Level Order Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0103.Binary-Tree-Zigzag-Level-Order-Traversal)|50.0%|Medium|| +|0104|Maximum Depth of Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0104.Maximum-Depth-of-Binary-Tree)|67.9%|Easy|| +|0105|Construct Binary Tree from Preorder and Inorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal)|51.5%|Medium|| +|0106|Construct Binary Tree from Inorder and Postorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal)|49.4%|Medium|| +|0107|Binary Tree Level Order Traversal II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0107.Binary-Tree-Level-Order-Traversal-II)|55.1%|Easy|| +|0108|Convert Sorted Array to Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0108.Convert-Sorted-Array-to-Binary-Search-Tree)|60.2%|Easy|| +|0109|Convert Sorted List to Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0109.Convert-Sorted-List-to-Binary-Search-Tree)|50.0%|Medium|| +|0110|Balanced Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0110.Balanced-Binary-Tree)|44.7%|Easy|| +|0111|Minimum Depth of Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0111.Minimum-Depth-of-Binary-Tree)|39.4%|Easy|| +|0112|Path Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0112.Path-Sum)|42.3%|Easy|| +|0113|Path Sum II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0113.Path-Sum-II)|48.9%|Medium|| +|0114|Flatten Binary Tree to Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0114.Flatten-Binary-Tree-to-Linked-List)|51.7%|Medium|| +|0115|Distinct Subsequences||39.6%|Hard|| +|0116|Populating Next Right Pointers in Each Node||48.8%|Medium|| +|0117|Populating Next Right Pointers in Each Node II||41.9%|Medium|| +|0118|Pascal's Triangle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0118.Pascal's-Triangle)|54.6%|Easy|| +|0119|Pascal's Triangle II||52.0%|Easy|| +|0120|Triangle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0120.Triangle)|45.6%|Medium|| +|0121|Best Time to Buy and Sell Stock|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0121.Best-Time-to-Buy-and-Sell-Stock)|51.5%|Easy|| +|0122|Best Time to Buy and Sell Stock II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0122.Best-Time-to-Buy-and-Sell-Stock-II)|58.4%|Easy|| +|0123|Best Time to Buy and Sell Stock III||39.8%|Hard|| +|0124|Binary Tree Maximum Path Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0124.Binary-Tree-Maximum-Path-Sum)|35.4%|Hard|| +|0125|Valid Palindrome|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0125.Valid-Palindrome)|38.1%|Easy|| +|0126|Word Ladder II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0126.Word-Ladder-II)|23.6%|Hard|| +|0127|Word Ladder|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0127.Word-Ladder)|31.6%|Hard|| +|0128|Longest Consecutive Sequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0128.Longest-Consecutive-Sequence)|46.2%|Hard|| +|0129|Sum Root to Leaf Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0129.Sum-Root-to-Leaf-Numbers)|50.8%|Medium|| +|0130|Surrounded Regions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0130.Surrounded-Regions)|29.3%|Medium|| +|0131|Palindrome Partitioning|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0131.Palindrome-Partitioning)|51.7%|Medium|| |0132|Palindrome Partitioning II||31.1%|Hard|| -|0133|Clone Graph||38.7%|Medium|| -|0134|Gas Station||41.0%|Medium|| -|0135|Candy||32.8%|Hard|| -|0136|Single Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0136.Single-Number)|66.4%|Easy|| -|0137|Single Number II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0137.Single-Number-II)|53.6%|Medium|| -|0138|Copy List with Random Pointer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0138.Copy-List-with-Random-Pointer)|39.6%|Medium|| -|0139|Word Break||41.5%|Medium|| -|0140|Word Break II||34.4%|Hard|| -|0141|Linked List Cycle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0141.Linked-List-Cycle)|42.3%|Easy|| -|0142|Linked List Cycle II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0142.Linked-List-Cycle-II)|39.4%|Medium|| -|0143|Reorder List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0143.Reorder-List)|40.3%|Medium|| -|0144|Binary Tree Preorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0144.Binary-Tree-Preorder-Traversal)|57.2%|Medium|| -|0145|Binary Tree Postorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0145.Binary-Tree-Postorder-Traversal)|57.2%|Medium|| -|0146|LRU Cache|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0146.LRU-Cache)|35.3%|Medium|| -|0147|Insertion Sort List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0147.Insertion-Sort-List)|44.2%|Medium|| -|0148|Sort List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0148.Sort-List)|45.9%|Medium|| +|0133|Clone Graph||38.9%|Medium|| +|0134|Gas Station||41.1%|Medium|| +|0135|Candy||32.9%|Hard|| +|0136|Single Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0136.Single-Number)|66.5%|Easy|| +|0137|Single Number II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0137.Single-Number-II)|53.7%|Medium|| +|0138|Copy List with Random Pointer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0138.Copy-List-with-Random-Pointer)|39.9%|Medium|| +|0139|Word Break||41.6%|Medium|| +|0140|Word Break II||34.5%|Hard|| +|0141|Linked List Cycle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0141.Linked-List-Cycle)|42.8%|Easy|| +|0142|Linked List Cycle II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0142.Linked-List-Cycle-II)|39.5%|Medium|| +|0143|Reorder List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0143.Reorder-List)|40.4%|Medium|| +|0144|Binary Tree Preorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0144.Binary-Tree-Preorder-Traversal)|57.3%|Medium|| +|0145|Binary Tree Postorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0145.Binary-Tree-Postorder-Traversal)|57.4%|Medium|| +|0146|LRU Cache|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0146.LRU-Cache)|35.5%|Medium|| +|0147|Insertion Sort List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0147.Insertion-Sort-List)|44.3%|Medium|| +|0148|Sort List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0148.Sort-List)|46.1%|Medium|| |0149|Max Points on a Line||17.3%|Hard|| -|0150|Evaluate Reverse Polish Notation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0150.Evaluate-Reverse-Polish-Notation)|37.6%|Medium|| -|0151|Reverse Words in a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0151.Reverse-Words-in-a-String)|23.4%|Medium|| +|0150|Evaluate Reverse Polish Notation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0150.Evaluate-Reverse-Polish-Notation)|37.8%|Medium|| +|0151|Reverse Words in a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0151.Reverse-Words-in-a-String)|23.5%|Medium|| |0152|Maximum Product Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0152.Maximum-Product-Subarray)|32.7%|Medium|| |0153|Find Minimum in Rotated Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0153.Find-Minimum-in-Rotated-Sorted-Array)|46.0%|Medium|| -|0154|Find Minimum in Rotated Sorted Array II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0154.Find-Minimum-in-Rotated-Sorted-Array-II)|41.9%|Hard|| -|0155|Min Stack|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0155.Min-Stack)|46.1%|Easy|| -|0156|Binary Tree Upside Down||56.2%|Medium|| -|0157|Read N Characters Given Read4||37.0%|Easy|| -|0158|Read N Characters Given Read4 II - Call multiple times||36.4%|Hard|| -|0159|Longest Substring with At Most Two Distinct Characters||50.3%|Medium|| -|0160|Intersection of Two Linked Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0160.Intersection-of-Two-Linked-Lists)|42.8%|Easy|| +|0154|Find Minimum in Rotated Sorted Array II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0154.Find-Minimum-in-Rotated-Sorted-Array-II)|42.0%|Hard|| +|0155|Min Stack|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0155.Min-Stack)|46.2%|Easy|| +|0156|Binary Tree Upside Down||56.3%|Medium|| +|0157|Read N Characters Given Read4||37.1%|Easy|| +|0158|Read N Characters Given Read4 II - Call multiple times||36.6%|Hard|| +|0159|Longest Substring with At Most Two Distinct Characters||50.4%|Medium|| +|0160|Intersection of Two Linked Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0160.Intersection-of-Two-Linked-Lists)|42.9%|Easy|| |0161|One Edit Distance||33.0%|Medium|| |0162|Find Peak Element|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0162.Find-Peak-Element)|43.9%|Medium|| -|0163|Missing Ranges||26.5%|Easy|| -|0164|Maximum Gap|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0164.Maximum-Gap)|36.6%|Hard|| -|0165|Compare Version Numbers||30.2%|Medium|| +|0163|Missing Ranges||26.7%|Easy|| +|0164|Maximum Gap|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0164.Maximum-Gap)|36.7%|Hard|| +|0165|Compare Version Numbers||30.3%|Medium|| |0166|Fraction to Recurring Decimal||22.2%|Medium|| -|0167|Two Sum II - Input array is sorted|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0167.Two-Sum-II---Input-array-is-sorted)|55.4%|Easy|| -|0168|Excel Sheet Column Title|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0168.Excel-Sheet-Column-Title)|31.6%|Easy|| -|0169|Majority Element|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0169.Majority-Element)|59.9%|Easy|| +|0167|Two Sum II - Input array is sorted|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0167.Two-Sum-II---Input-array-is-sorted)|55.5%|Easy|| +|0168|Excel Sheet Column Title|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0168.Excel-Sheet-Column-Title)|31.7%|Easy|| +|0169|Majority Element|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0169.Majority-Element)|60.0%|Easy|| |0170|Two Sum III - Data structure design||34.8%|Easy|| |0171|Excel Sheet Column Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0171.Excel-Sheet-Column-Number)|56.8%|Easy|| -|0172|Factorial Trailing Zeroes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0172.Factorial-Trailing-Zeroes)|38.4%|Easy|| -|0173|Binary Search Tree Iterator|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0173.Binary-Search-Tree-Iterator)|59.7%|Medium|| +|0172|Factorial Trailing Zeroes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0172.Factorial-Trailing-Zeroes)|38.5%|Easy|| +|0173|Binary Search Tree Iterator|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0173.Binary-Search-Tree-Iterator)|59.9%|Medium|| |0174|Dungeon Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0174.Dungeon-Game)|33.2%|Hard|| -|0175|Combine Two Tables||63.6%|Easy|| -|0176|Second Highest Salary||33.0%|Easy|| -|0177|Nth Highest Salary||33.0%|Medium|| -|0178|Rank Scores||49.5%|Medium|| -|0179|Largest Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0179.Largest-Number)|30.5%|Medium|| -|0180|Consecutive Numbers||41.8%|Medium|| -|0181|Employees Earning More Than Their Managers||59.8%|Easy|| -|0182|Duplicate Emails||64.2%|Easy|| -|0183|Customers Who Never Order||56.3%|Easy|| -|0184|Department Highest Salary||39.5%|Medium|| -|0185|Department Top Three Salaries||38.2%|Hard|| -|0186|Reverse Words in a String II||45.2%|Medium|| -|0187|Repeated DNA Sequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0187.Repeated-DNA-Sequences)|41.3%|Medium|| -|0188|Best Time to Buy and Sell Stock IV||29.4%|Hard|| -|0189|Rotate Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0189.Rotate-Array)|36.4%|Medium|| -|0190|Reverse Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0190.Reverse-Bits)|41.7%|Easy|| -|0191|Number of 1 Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0191.Number-of-1-Bits)|52.0%|Easy|| +|0175|Combine Two Tables||63.8%|Easy|| +|0176|Second Highest Salary||33.1%|Easy|| +|0177|Nth Highest Salary||33.1%|Medium|| +|0178|Rank Scores||49.7%|Medium|| +|0179|Largest Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0179.Largest-Number)|30.6%|Medium|| +|0180|Consecutive Numbers||42.0%|Medium|| +|0181|Employees Earning More Than Their Managers||60.0%|Easy|| +|0182|Duplicate Emails||64.4%|Easy|| +|0183|Customers Who Never Order||56.5%|Easy|| +|0184|Department Highest Salary||39.8%|Medium|| +|0185|Department Top Three Salaries||38.5%|Hard|| +|0186|Reverse Words in a String II||45.3%|Medium|| +|0187|Repeated DNA Sequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0187.Repeated-DNA-Sequences)|41.4%|Medium|| +|0188|Best Time to Buy and Sell Stock IV||29.5%|Hard|| +|0189|Rotate Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0189.Rotate-Array)|36.5%|Medium|| +|0190|Reverse Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0190.Reverse-Bits)|41.9%|Easy|| +|0191|Number of 1 Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0191.Number-of-1-Bits)|53.5%|Easy|| |0192|Word Frequency||25.8%|Medium|| -|0193|Valid Phone Numbers||25.4%|Easy|| +|0193|Valid Phone Numbers||25.3%|Easy|| |0194|Transpose File||24.4%|Medium|| |0195|Tenth Line||32.9%|Easy|| -|0196|Delete Duplicate Emails||44.6%|Easy|| -|0197|Rising Temperature||39.7%|Easy|| +|0196|Delete Duplicate Emails||44.8%|Easy|| +|0197|Rising Temperature||39.8%|Easy|| |0198|House Robber|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0198.House-Robber)|42.8%|Medium|| -|0199|Binary Tree Right Side View|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0199.Binary-Tree-Right-Side-View)|55.8%|Medium|| -|0200|Number of Islands|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0200.Number-of-Islands)|48.7%|Medium|| +|0199|Binary Tree Right Side View|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0199.Binary-Tree-Right-Side-View)|56.2%|Medium|| +|0200|Number of Islands|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0200.Number-of-Islands)|48.9%|Medium|| |0201|Bitwise AND of Numbers Range|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0201.Bitwise-AND-of-Numbers-Range)|39.6%|Medium|| -|0202|Happy Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0202.Happy-Number)|51.1%|Easy|| +|0202|Happy Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0202.Happy-Number)|51.2%|Easy|| |0203|Remove Linked List Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0203.Remove-Linked-List-Elements)|39.1%|Easy|| -|0204|Count Primes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0204.Count-Primes)|32.1%|Easy|| +|0204|Count Primes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0204.Count-Primes)|32.2%|Easy|| |0205|Isomorphic Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0205.Isomorphic-Strings)|40.4%|Easy|| -|0206|Reverse Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0206.Reverse-Linked-List)|64.9%|Easy|| +|0206|Reverse Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0206.Reverse-Linked-List)|65.0%|Easy|| |0207|Course Schedule|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0207.Course-Schedule)|44.3%|Medium|| -|0208|Implement Trie (Prefix Tree)|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0208.Implement-Trie-(Prefix-Tree))|51.6%|Medium|| -|0209|Minimum Size Subarray Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0209.Minimum-Size-Subarray-Sum)|39.2%|Medium|| -|0210|Course Schedule II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0210.Course-Schedule-II)|42.3%|Medium|| -|0211|Design Add and Search Words Data Structure|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0211.Design-Add-and-Search-Words-Data-Structure)|39.9%|Medium|| -|0212|Word Search II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0212.Word-Search-II)|36.7%|Hard|| -|0213|House Robber II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0213.House-Robber-II)|37.4%|Medium|| -|0214|Shortest Palindrome||30.5%|Hard|| -|0215|Kth Largest Element in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0215.Kth-Largest-Element-in-an-Array)|58.1%|Medium|| -|0216|Combination Sum III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0216.Combination-Sum-III)|60.0%|Medium|| -|0217|Contains Duplicate|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0217.Contains-Duplicate)|56.5%|Easy|| +|0208|Implement Trie (Prefix Tree)|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0208.Implement-Trie-(Prefix-Tree))|51.8%|Medium|| +|0209|Minimum Size Subarray Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0209.Minimum-Size-Subarray-Sum)|39.3%|Medium|| +|0210|Course Schedule II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0210.Course-Schedule-II)|42.4%|Medium|| +|0211|Design Add and Search Words Data Structure|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0211.Design-Add-and-Search-Words-Data-Structure)|40.0%|Medium|| +|0212|Word Search II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0212.Word-Search-II)|36.8%|Hard|| +|0213|House Robber II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0213.House-Robber-II)|37.5%|Medium|| +|0214|Shortest Palindrome||30.6%|Hard|| +|0215|Kth Largest Element in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0215.Kth-Largest-Element-in-an-Array)|58.2%|Medium|| +|0216|Combination Sum III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0216.Combination-Sum-III)|60.1%|Medium|| +|0217|Contains Duplicate|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0217.Contains-Duplicate)|56.6%|Easy|| |0218|The Skyline Problem|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0218.The-Skyline-Problem)|36.2%|Hard|| -|0219|Contains Duplicate II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0219.Contains-Duplicate-II)|38.5%|Easy|| +|0219|Contains Duplicate II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0219.Contains-Duplicate-II)|38.6%|Easy|| |0220|Contains Duplicate III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0220.Contains-Duplicate-III)|21.3%|Medium|| -|0221|Maximal Square||38.8%|Medium|| -|0222|Count Complete Tree Nodes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0222.Count-Complete-Tree-Nodes)|48.9%|Medium|| -|0223|Rectangle Area|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0223.Rectangle-Area)|38.1%|Medium|| -|0224|Basic Calculator|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0224.Basic-Calculator)|38.0%|Hard|| -|0225|Implement Stack using Queues|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0225.Implement-Stack-using-Queues)|47.0%|Easy|| -|0226|Invert Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0226.Invert-Binary-Tree)|66.7%|Easy|| +|0221|Maximal Square||39.0%|Medium|| +|0222|Count Complete Tree Nodes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0222.Count-Complete-Tree-Nodes)|49.1%|Medium|| +|0223|Rectangle Area|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0223.Rectangle-Area)|38.2%|Medium|| +|0224|Basic Calculator|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0224.Basic-Calculator)|38.1%|Hard|| +|0225|Implement Stack using Queues|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0225.Implement-Stack-using-Queues)|47.1%|Easy|| +|0226|Invert Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0226.Invert-Binary-Tree)|66.8%|Easy|| |0227|Basic Calculator II||38.4%|Medium|| -|0228|Summary Ranges|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0228.Summary-Ranges)|42.2%|Easy|| -|0229|Majority Element II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0229.Majority-Element-II)|38.6%|Medium|| -|0230|Kth Smallest Element in a BST|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0230.Kth-Smallest-Element-in-a-BST)|62.2%|Medium|| +|0228|Summary Ranges|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0228.Summary-Ranges)|42.3%|Easy|| +|0229|Majority Element II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0229.Majority-Element-II)|38.7%|Medium|| +|0230|Kth Smallest Element in a BST|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0230.Kth-Smallest-Element-in-a-BST)|62.4%|Medium|| |0231|Power of Two|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0231.Power-of-Two)|43.8%|Easy|| -|0232|Implement Queue using Stacks|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0232.Implement-Queue-using-Stacks)|51.7%|Easy|| +|0232|Implement Queue using Stacks|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0232.Implement-Queue-using-Stacks)|51.9%|Easy|| |0233|Number of Digit One||31.7%|Hard|| -|0234|Palindrome Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0234.Palindrome-Linked-List)|40.3%|Easy|| -|0235|Lowest Common Ancestor of a Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree)|51.5%|Easy|| -|0236|Lowest Common Ancestor of a Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0236.Lowest-Common-Ancestor-of-a-Binary-Tree)|48.2%|Medium|| -|0237|Delete Node in a Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0237.Delete-Node-in-a-Linked-List)|66.4%|Easy|| +|0234|Palindrome Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0234.Palindrome-Linked-List)|40.4%|Easy|| +|0235|Lowest Common Ancestor of a Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree)|51.6%|Easy|| +|0236|Lowest Common Ancestor of a Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0236.Lowest-Common-Ancestor-of-a-Binary-Tree)|48.5%|Medium|| +|0237|Delete Node in a Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0237.Delete-Node-in-a-Linked-List)|66.6%|Easy|| |0238|Product of Array Except Self||61.3%|Medium|| -|0239|Sliding Window Maximum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0239.Sliding-Window-Maximum)|44.5%|Hard|| -|0240|Search a 2D Matrix II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0240.Search-a-2D-Matrix-II)|44.2%|Medium|| -|0241|Different Ways to Add Parentheses||57.0%|Medium|| -|0242|Valid Anagram|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0242.Valid-Anagram)|58.0%|Easy|| -|0243|Shortest Word Distance||61.8%|Easy|| -|0244|Shortest Word Distance II||53.6%|Medium|| -|0245|Shortest Word Distance III||55.8%|Medium|| -|0246|Strobogrammatic Number||45.7%|Easy|| +|0239|Sliding Window Maximum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0239.Sliding-Window-Maximum)|44.6%|Hard|| +|0240|Search a 2D Matrix II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0240.Search-a-2D-Matrix-II)|44.4%|Medium|| +|0241|Different Ways to Add Parentheses||57.1%|Medium|| +|0242|Valid Anagram|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0242.Valid-Anagram)|58.1%|Easy|| +|0243|Shortest Word Distance||61.9%|Easy|| +|0244|Shortest Word Distance II||53.8%|Medium|| +|0245|Shortest Word Distance III||55.9%|Medium|| +|0246|Strobogrammatic Number||45.8%|Easy|| |0247|Strobogrammatic Number II||48.4%|Medium|| |0248|Strobogrammatic Number III||40.1%|Hard|| -|0249|Group Shifted Strings||57.7%|Medium|| -|0250|Count Univalue Subtrees||53.2%|Medium|| +|0249|Group Shifted Strings||57.9%|Medium|| +|0250|Count Univalue Subtrees||53.3%|Medium|| |0251|Flatten 2D Vector||46.3%|Medium|| |0252|Meeting Rooms||55.3%|Easy|| -|0253|Meeting Rooms II||46.6%|Medium|| +|0253|Meeting Rooms II||46.7%|Medium|| |0254|Factor Combinations||47.3%|Medium|| |0255|Verify Preorder Sequence in Binary Search Tree||46.1%|Medium|| -|0256|Paint House||53.3%|Medium|| -|0257|Binary Tree Paths|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0257.Binary-Tree-Paths)|53.3%|Easy|| +|0256|Paint House||53.4%|Medium|| +|0257|Binary Tree Paths|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0257.Binary-Tree-Paths)|53.4%|Easy|| |0258|Add Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0258.Add-Digits)|58.4%|Easy|| -|0259|3Sum Smaller||48.8%|Medium|| +|0259|3Sum Smaller||48.9%|Medium|| |0260|Single Number III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0260.Single-Number-III)|65.3%|Medium|| -|0261|Graph Valid Tree||43.0%|Medium|| -|0262|Trips and Users||35.6%|Hard|| +|0261|Graph Valid Tree||43.1%|Medium|| +|0262|Trips and Users||35.4%|Hard|| |0263|Ugly Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0263.Ugly-Number)|41.7%|Easy|| |0264|Ugly Number II||42.8%|Medium|| -|0265|Paint House II||45.5%|Hard|| -|0266|Palindrome Permutation||62.3%|Easy|| -|0267|Palindrome Permutation II||37.3%|Medium|| -|0268|Missing Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0268.Missing-Number)|53.5%|Easy|| -|0269|Alien Dictionary||33.6%|Hard|| -|0270|Closest Binary Search Tree Value||49.7%|Easy|| -|0271|Encode and Decode Strings||32.5%|Medium|| -|0272|Closest Binary Search Tree Value II||52.0%|Hard|| +|0265|Paint House II||45.6%|Hard|| +|0266|Palindrome Permutation||62.4%|Easy|| +|0267|Palindrome Permutation II||37.4%|Medium|| +|0268|Missing Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0268.Missing-Number)|53.7%|Easy|| +|0269|Alien Dictionary||33.7%|Hard|| +|0270|Closest Binary Search Tree Value||49.8%|Easy|| +|0271|Encode and Decode Strings||32.6%|Medium|| +|0272|Closest Binary Search Tree Value II||52.1%|Hard|| |0273|Integer to English Words||28.0%|Hard|| |0274|H-Index|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0274.H-Index)|36.3%|Medium|| |0275|H-Index II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0275.H-Index-II)|36.2%|Medium|| |0276|Paint Fence||39.0%|Easy|| -|0277|Find the Celebrity||43.2%|Medium|| -|0278|First Bad Version||37.2%|Easy|| -|0279|Perfect Squares||48.7%|Medium|| -|0280|Wiggle Sort||64.5%|Medium|| +|0277|Find the Celebrity||43.3%|Medium|| +|0278|First Bad Version||37.3%|Easy|| +|0279|Perfect Squares||48.8%|Medium|| +|0280|Wiggle Sort||64.6%|Medium|| |0281|Zigzag Iterator||59.3%|Medium|| -|0282|Expression Add Operators||36.6%|Hard|| +|0282|Expression Add Operators||36.7%|Hard|| |0283|Move Zeroes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0283.Move-Zeroes)|58.5%|Easy|| -|0284|Peeking Iterator||47.5%|Medium|| -|0285|Inorder Successor in BST||42.5%|Medium|| -|0286|Walls and Gates||56.1%|Medium|| -|0287|Find the Duplicate Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0287.Find-the-Duplicate-Number)|57.2%|Medium|| +|0284|Peeking Iterator||47.6%|Medium|| +|0285|Inorder Successor in BST||42.7%|Medium|| +|0286|Walls and Gates||56.3%|Medium|| +|0287|Find the Duplicate Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0287.Find-the-Duplicate-Number)|57.4%|Medium|| |0288|Unique Word Abbreviation||22.9%|Medium|| -|0289|Game of Life||57.8%|Medium|| +|0289|Game of Life||58.0%|Medium|| |0290|Word Pattern|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0290.Word-Pattern)|38.3%|Easy|| -|0291|Word Pattern II||44.1%|Hard|| +|0291|Word Pattern II||44.1%|Medium|| |0292|Nim Game||55.0%|Easy|| -|0293|Flip Game||61.2%|Easy|| -|0294|Flip Game II||50.5%|Medium|| -|0295|Find Median from Data Stream||46.5%|Hard|| +|0293|Flip Game||61.3%|Easy|| +|0294|Flip Game II||50.6%|Medium|| +|0295|Find Median from Data Stream||46.7%|Hard|| |0296|Best Meeting Point||58.1%|Hard|| -|0297|Serialize and Deserialize Binary Tree||49.5%|Hard|| +|0297|Serialize and Deserialize Binary Tree||49.6%|Hard|| |0298|Binary Tree Longest Consecutive Sequence||47.9%|Medium|| -|0299|Bulls and Cows||44.3%|Medium|| -|0300|Longest Increasing Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0300.Longest-Increasing-Subsequence)|43.7%|Medium|| +|0299|Bulls and Cows||44.4%|Medium|| +|0300|Longest Increasing Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0300.Longest-Increasing-Subsequence)|43.9%|Medium|| |0301|Remove Invalid Parentheses||44.5%|Hard|| -|0302|Smallest Rectangle Enclosing Black Pixels||52.3%|Hard|| -|0303|Range Sum Query - Immutable|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0303.Range-Sum-Query---Immutable)|47.2%|Easy|| -|0304|Range Sum Query 2D - Immutable||40.3%|Medium|| -|0305|Number of Islands II||39.8%|Hard|| +|0302|Smallest Rectangle Enclosing Black Pixels||52.4%|Hard|| +|0303|Range Sum Query - Immutable|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0303.Range-Sum-Query---Immutable)|47.4%|Easy|| +|0304|Range Sum Query 2D - Immutable||40.4%|Medium|| +|0305|Number of Islands II||39.7%|Hard|| |0306|Additive Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0306.Additive-Number)|29.6%|Medium|| |0307|Range Sum Query - Mutable|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0307.Range-Sum-Query---Mutable)|36.6%|Medium|| -|0308|Range Sum Query 2D - Mutable||37.3%|Hard|| +|0308|Range Sum Query 2D - Mutable||37.4%|Hard|| |0309|Best Time to Buy and Sell Stock with Cooldown|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown)|48.1%|Medium|| |0310|Minimum Height Trees||34.6%|Medium|| -|0311|Sparse Matrix Multiplication||63.7%|Medium|| +|0311|Sparse Matrix Multiplication||63.8%|Medium|| |0312|Burst Balloons||53.7%|Hard|| -|0313|Super Ugly Number||46.0%|Medium|| -|0314|Binary Tree Vertical Order Traversal||46.7%|Medium|| +|0313|Super Ugly Number||46.1%|Medium|| +|0314|Binary Tree Vertical Order Traversal||46.9%|Medium|| |0315|Count of Smaller Numbers After Self|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0315.Count-of-Smaller-Numbers-After-Self)|42.6%|Hard|| -|0316|Remove Duplicate Letters||38.9%|Medium|| -|0317|Shortest Distance from All Buildings||42.5%|Hard|| -|0318|Maximum Product of Word Lengths|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0318.Maximum-Product-of-Word-Lengths)|52.1%|Medium|| +|0316|Remove Duplicate Letters||39.0%|Medium|| +|0317|Shortest Distance from All Buildings||42.6%|Hard|| +|0318|Maximum Product of Word Lengths|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0318.Maximum-Product-of-Word-Lengths)|52.2%|Medium|| |0319|Bulb Switcher||45.3%|Medium|| -|0320|Generalized Abbreviation||53.5%|Medium|| -|0321|Create Maximum Number||27.4%|Hard|| -|0322|Coin Change|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0322.Coin-Change)|37.0%|Medium|| -|0323|Number of Connected Components in an Undirected Graph||57.5%|Medium|| +|0320|Generalized Abbreviation||53.6%|Medium|| +|0321|Create Maximum Number||27.5%|Hard|| +|0322|Coin Change|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0322.Coin-Change)|37.1%|Medium|| +|0323|Number of Connected Components in an Undirected Graph||57.6%|Medium|| |0324|Wiggle Sort II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0324.Wiggle-Sort-II)|30.6%|Medium|| |0325|Maximum Size Subarray Sum Equals k||47.3%|Medium|| |0326|Power of Three|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0326.Power-of-Three)|42.1%|Easy|| -|0327|Count of Range Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0327.Count-of-Range-Sum)|35.9%|Hard|| -|0328|Odd Even Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0328.Odd-Even-Linked-List)|56.9%|Medium|| -|0329|Longest Increasing Path in a Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0329.Longest-Increasing-Path-in-a-Matrix)|44.5%|Hard|| +|0327|Count of Range Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0327.Count-of-Range-Sum)|36.0%|Hard|| +|0328|Odd Even Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0328.Odd-Even-Linked-List)|57.0%|Medium|| +|0329|Longest Increasing Path in a Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0329.Longest-Increasing-Path-in-a-Matrix)|44.7%|Hard|| |0330|Patching Array||34.9%|Hard|| |0331|Verify Preorder Serialization of a Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0331.Verify-Preorder-Serialization-of-a-Binary-Tree)|40.9%|Medium|| -|0332|Reconstruct Itinerary||37.7%|Medium|| -|0333|Largest BST Subtree||37.5%|Medium|| -|0334|Increasing Triplet Subsequence||40.6%|Medium|| +|0332|Reconstruct Itinerary||37.8%|Medium|| +|0333|Largest BST Subtree||37.6%|Medium|| +|0334|Increasing Triplet Subsequence||40.7%|Medium|| |0335|Self Crossing||28.6%|Hard|| |0336|Palindrome Pairs||34.5%|Hard|| -|0337|House Robber III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0337.House-Robber-III)|51.7%|Medium|| +|0337|House Robber III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0337.House-Robber-III)|51.8%|Medium|| |0338|Counting Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0338.Counting-Bits)|70.3%|Medium|| -|0339|Nested List Weight Sum||76.2%|Easy|| -|0340|Longest Substring with At Most K Distinct Characters||45.3%|Medium|| -|0341|Flatten Nested List Iterator||54.3%|Medium|| -|0342|Power of Four|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0342.Power-of-Four)|41.6%|Easy|| +|0339|Nested List Weight Sum||76.3%|Medium|| +|0340|Longest Substring with At Most K Distinct Characters||45.4%|Medium|| +|0341|Flatten Nested List Iterator||54.4%|Medium|| +|0342|Power of Four|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0342.Power-of-Four)|41.7%|Easy|| |0343|Integer Break|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0343.Integer-Break)|51.1%|Medium|| -|0344|Reverse String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0344.Reverse-String)|70.1%|Easy|| -|0345|Reverse Vowels of a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0345.Reverse-Vowels-of-a-String)|44.9%|Easy|| -|0346|Moving Average from Data Stream||72.9%|Easy|| -|0347|Top K Frequent Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0347.Top-K-Frequent-Elements)|62.2%|Medium|| -|0348|Design Tic-Tac-Toe||55.4%|Medium|| -|0349|Intersection of Two Arrays|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0349.Intersection-of-Two-Arrays)|64.5%|Easy|| +|0344|Reverse String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0344.Reverse-String)|70.2%|Easy|| +|0345|Reverse Vowels of a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0345.Reverse-Vowels-of-a-String)|45.0%|Easy|| +|0346|Moving Average from Data Stream||73.0%|Easy|| +|0347|Top K Frequent Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0347.Top-K-Frequent-Elements)|62.3%|Medium|| +|0348|Design Tic-Tac-Toe||55.5%|Medium|| +|0349|Intersection of Two Arrays|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0349.Intersection-of-Two-Arrays)|64.6%|Easy|| |0350|Intersection of Two Arrays II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0350.Intersection-of-Two-Arrays-II)|51.9%|Easy|| |0351|Android Unlock Patterns||49.5%|Medium|| |0352|Data Stream as Disjoint Intervals||48.5%|Hard|| -|0353|Design Snake Game||35.2%|Medium|| -|0354|Russian Doll Envelopes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0354.Russian-Doll-Envelopes)|36.1%|Hard|| -|0355|Design Twitter||31.2%|Medium|| -|0356|Line Reflection||32.7%|Medium|| +|0353|Design Snake Game||35.7%|Medium|| +|0354|Russian Doll Envelopes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0354.Russian-Doll-Envelopes)|36.2%|Hard|| +|0355|Design Twitter||31.3%|Medium|| +|0356|Line Reflection||32.8%|Medium|| |0357|Count Numbers with Unique Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0357.Count-Numbers-with-Unique-Digits)|48.8%|Medium|| |0358|Rearrange String k Distance Apart||35.6%|Hard|| -|0359|Logger Rate Limiter||72.0%|Easy|| -|0360|Sort Transformed Array||49.5%|Medium|| +|0359|Logger Rate Limiter||72.1%|Easy|| +|0360|Sort Transformed Array||49.6%|Medium|| |0361|Bomb Enemy||46.6%|Medium|| -|0362|Design Hit Counter||65.0%|Medium|| +|0362|Design Hit Counter||65.1%|Medium|| |0363|Max Sum of Rectangle No Larger Than K||38.4%|Hard|| -|0364|Nested List Weight Sum II||63.5%|Medium|| +|0364|Nested List Weight Sum II||63.6%|Medium|| |0365|Water and Jug Problem||31.0%|Medium|| |0366|Find Leaves of Binary Tree||71.7%|Medium|| |0367|Valid Perfect Square|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0367.Valid-Perfect-Square)|42.0%|Easy|| -|0368|Largest Divisible Subset||38.2%|Medium|| -|0369|Plus One Linked List||59.4%|Medium|| -|0370|Range Addition||63.4%|Medium|| +|0368|Largest Divisible Subset||38.3%|Medium|| +|0369|Plus One Linked List||59.5%|Medium|| +|0370|Range Addition||63.5%|Medium|| |0371|Sum of Two Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0371.Sum-of-Two-Integers)|50.6%|Medium|| -|0372|Super Pow|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0372.Super-Pow)|36.6%|Medium|| -|0373|Find K Pairs with Smallest Sums|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0373.Find-K-Pairs-with-Smallest-Sums)|37.5%|Medium|| -|0374|Guess Number Higher or Lower||44.4%|Easy|| -|0375|Guess Number Higher or Lower II||41.9%|Medium|| -|0376|Wiggle Subsequence||40.1%|Medium|| -|0377|Combination Sum IV||45.9%|Medium|| -|0378|Kth Smallest Element in a Sorted Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0378.Kth-Smallest-Element-in-a-Sorted-Matrix)|55.9%|Medium|| -|0379|Design Phone Directory||47.8%|Medium|| +|0372|Super Pow|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0372.Super-Pow)|36.7%|Medium|| +|0373|Find K Pairs with Smallest Sums|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0373.Find-K-Pairs-with-Smallest-Sums)|37.6%|Medium|| +|0374|Guess Number Higher or Lower||44.5%|Easy|| +|0375|Guess Number Higher or Lower II||42.1%|Medium|| +|0376|Wiggle Subsequence||40.2%|Medium|| +|0377|Combination Sum IV||46.0%|Medium|| +|0378|Kth Smallest Element in a Sorted Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0378.Kth-Smallest-Element-in-a-Sorted-Matrix)|56.0%|Medium|| +|0379|Design Phone Directory||47.9%|Medium|| |0380|Insert Delete GetRandom O(1)||48.7%|Medium|| -|0381|Insert Delete GetRandom O(1) - Duplicates allowed||34.7%|Hard|| +|0381|Insert Delete GetRandom O(1) - Duplicates allowed||34.8%|Hard|| |0382|Linked List Random Node||54.0%|Medium|| -|0383|Ransom Note||53.2%|Easy|| +|0383|Ransom Note||53.3%|Easy|| |0384|Shuffle an Array||53.9%|Medium|| -|0385|Mini Parser|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0385.Mini-Parser)|34.3%|Medium|| -|0386|Lexicographical Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0386.Lexicographical-Numbers)|53.8%|Medium|| -|0387|First Unique Character in a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0387.First-Unique-Character-in-a-String)|53.7%|Easy|| -|0388|Longest Absolute File Path||42.6%|Medium|| +|0385|Mini Parser|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0385.Mini-Parser)|34.5%|Medium|| +|0386|Lexicographical Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0386.Lexicographical-Numbers)|53.9%|Medium|| +|0387|First Unique Character in a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0387.First-Unique-Character-in-a-String)|53.8%|Easy|| +|0388|Longest Absolute File Path||42.7%|Medium|| |0389|Find the Difference|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0389.Find-the-Difference)|57.7%|Easy|| |0390|Elimination Game||44.9%|Medium|| |0391|Perfect Rectangle||31.0%|Hard|| |0392|Is Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0392.Is-Subsequence)|49.5%|Easy|| |0393|UTF-8 Validation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0393.UTF-8-Validation)|38.0%|Medium|| -|0394|Decode String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0394.Decode-String)|52.4%|Medium|| +|0394|Decode String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0394.Decode-String)|52.5%|Medium|| |0395|Longest Substring with At Least K Repeating Characters||43.4%|Medium|| |0396|Rotate Function||36.7%|Medium|| |0397|Integer Replacement|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0397.Integer-Replacement)|33.4%|Medium|| -|0398|Random Pick Index||57.6%|Medium|| -|0399|Evaluate Division|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0399.Evaluate-Division)|54.1%|Medium|| -|0400|Nth Digit||32.3%|Medium|| -|0401|Binary Watch|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0401.Binary-Watch)|48.3%|Easy|| +|0398|Random Pick Index||57.8%|Medium|| +|0399|Evaluate Division|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0399.Evaluate-Division)|54.2%|Medium|| +|0400|Nth Digit||32.4%|Medium|| +|0401|Binary Watch|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0401.Binary-Watch)|48.4%|Easy|| |0402|Remove K Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0402.Remove-K-Digits)|28.6%|Medium|| -|0403|Frog Jump||41.2%|Hard|| +|0403|Frog Jump||41.3%|Hard|| |0404|Sum of Left Leaves|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0404.Sum-of-Left-Leaves)|52.2%|Easy|| |0405|Convert a Number to Hexadecimal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0405.Convert-a-Number-to-Hexadecimal)|44.4%|Easy|| -|0406|Queue Reconstruction by Height||68.2%|Medium|| -|0407|Trapping Rain Water II||43.9%|Hard|| +|0406|Queue Reconstruction by Height||68.3%|Medium|| +|0407|Trapping Rain Water II||44.0%|Hard|| |0408|Valid Word Abbreviation||31.3%|Easy|| |0409|Longest Palindrome|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0409.Longest-Palindrome)|52.2%|Easy|| -|0410|Split Array Largest Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0410.Split-Array-Largest-Sum)|46.1%|Hard|| +|0410|Split Array Largest Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0410.Split-Array-Largest-Sum)|46.2%|Hard|| |0411|Minimum Unique Word Abbreviation||37.1%|Hard|| |0412|Fizz Buzz|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0412.Fizz-Buzz)|63.5%|Easy|| -|0413|Arithmetic Slices||58.5%|Medium|| -|0414|Third Maximum Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0414.Third-Maximum-Number)|30.6%|Easy|| -|0415|Add Strings||48.1%|Easy|| +|0413|Arithmetic Slices||58.6%|Medium|| +|0414|Third Maximum Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0414.Third-Maximum-Number)|30.7%|Easy|| +|0415|Add Strings||48.2%|Easy|| |0416|Partition Equal Subset Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0416.Partition-Equal-Subset-Sum)|44.8%|Medium|| -|0417|Pacific Atlantic Water Flow||42.4%|Medium|| +|0417|Pacific Atlantic Water Flow||42.5%|Medium|| |0418|Sentence Screen Fitting||33.0%|Medium|| -|0419|Battleships in a Board||70.9%|Medium|| -|0420|Strong Password Checker||13.8%|Hard|| +|0419|Battleships in a Board||71.0%|Medium|| +|0420|Strong Password Checker||13.9%|Hard|| |0421|Maximum XOR of Two Numbers in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0421.Maximum-XOR-of-Two-Numbers-in-an-Array)|54.0%|Medium|| -|0422|Valid Word Square||38.0%|Easy|| +|0422|Valid Word Square||38.1%|Easy|| |0423|Reconstruct Original Digits from English||47.4%|Medium|| -|0424|Longest Repeating Character Replacement|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0424.Longest-Repeating-Character-Replacement)|48.0%|Medium|| +|0424|Longest Repeating Character Replacement|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0424.Longest-Repeating-Character-Replacement)|48.1%|Medium|| |0425|Word Squares||50.0%|Hard|| -|0426|Convert Binary Search Tree to Sorted Doubly Linked List||60.9%|Medium|| +|0426|Convert Binary Search Tree to Sorted Doubly Linked List||61.0%|Medium|| |0427|Construct Quad Tree||62.5%|Medium|| -|0428|Serialize and Deserialize N-ary Tree||61.2%|Hard|| -|0429|N-ary Tree Level Order Traversal||66.4%|Medium|| +|0428|Serialize and Deserialize N-ary Tree||61.3%|Hard|| +|0429|N-ary Tree Level Order Traversal||66.6%|Medium|| |0430|Flatten a Multilevel Doubly Linked List||56.7%|Medium|| |0431|Encode N-ary Tree to Binary Tree||74.5%|Hard|| |0432|All O`one Data Structure||33.1%|Hard|| -|0433|Minimum Genetic Mutation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0433.Minimum-Genetic-Mutation)|43.1%|Medium|| +|0433|Minimum Genetic Mutation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0433.Minimum-Genetic-Mutation)|43.2%|Medium|| |0434|Number of Segments in a String||37.8%|Easy|| |0435|Non-overlapping Intervals|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0435.Non-overlapping-Intervals)|43.9%|Medium|| -|0436|Find Right Interval|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0436.Find-Right-Interval)|48.4%|Medium|| +|0436|Find Right Interval|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0436.Find-Right-Interval)|48.5%|Medium|| |0437|Path Sum III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0437.Path-Sum-III)|48.0%|Medium|| -|0438|Find All Anagrams in a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0438.Find-All-Anagrams-in-a-String)|44.7%|Medium|| -|0439|Ternary Expression Parser||56.6%|Medium|| -|0440|K-th Smallest in Lexicographical Order||29.7%|Hard|| +|0438|Find All Anagrams in a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0438.Find-All-Anagrams-in-a-String)|44.8%|Medium|| +|0439|Ternary Expression Parser||56.7%|Medium|| +|0440|K-th Smallest in Lexicographical Order||29.8%|Hard|| |0441|Arranging Coins|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0441.Arranging-Coins)|42.3%|Easy|| |0442|Find All Duplicates in an Array||68.8%|Medium|| -|0443|String Compression||43.2%|Medium|| +|0443|String Compression||43.4%|Medium|| |0444|Sequence Reconstruction||23.5%|Medium|| -|0445|Add Two Numbers II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0445.Add-Two-Numbers-II)|56.1%|Medium|| +|0445|Add Two Numbers II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0445.Add-Two-Numbers-II)|56.2%|Medium|| |0446|Arithmetic Slices II - Subsequence||33.3%|Hard|| |0447|Number of Boomerangs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0447.Number-of-Boomerangs)|52.4%|Medium|| |0448|Find All Numbers Disappeared in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0448.Find-All-Numbers-Disappeared-in-an-Array)|56.1%|Easy|| -|0449|Serialize and Deserialize BST||53.8%|Medium|| +|0449|Serialize and Deserialize BST||53.9%|Medium|| |0450|Delete Node in a BST||45.2%|Medium|| -|0451|Sort Characters By Frequency|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0451.Sort-Characters-By-Frequency)|64.2%|Medium|| -|0452|Minimum Number of Arrows to Burst Balloons||49.7%|Medium|| -|0453|Minimum Moves to Equal Array Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0453.Minimum-Moves-to-Equal-Array-Elements)|50.7%|Easy|| -|0454|4Sum II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0454.4Sum-II)|54.5%|Medium|| +|0451|Sort Characters By Frequency|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0451.Sort-Characters-By-Frequency)|64.3%|Medium|| +|0452|Minimum Number of Arrows to Burst Balloons||49.8%|Medium|| +|0453|Minimum Moves to Equal Array Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0453.Minimum-Moves-to-Equal-Array-Elements)|50.8%|Easy|| +|0454|4Sum II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0454.4Sum-II)|54.6%|Medium|| |0455|Assign Cookies|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0455.Assign-Cookies)|50.4%|Easy|| |0456|132 Pattern|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0456.132-Pattern)|30.6%|Medium|| |0457|Circular Array Loop|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0457.Circular-Array-Loop)|30.0%|Medium|| |0458|Poor Pigs||54.5%|Hard|| |0459|Repeated Substring Pattern||43.3%|Easy|| -|0460|LFU Cache|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0460.LFU-Cache)|35.8%|Hard|| -|0461|Hamming Distance|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0461.Hamming-Distance)|73.1%|Easy|| +|0460|LFU Cache|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0460.LFU-Cache)|35.9%|Hard|| +|0461|Hamming Distance|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0461.Hamming-Distance)|73.2%|Easy|| |0462|Minimum Moves to Equal Array Elements II||54.3%|Medium|| |0463|Island Perimeter|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0463.Island-Perimeter)|66.6%|Easy|| |0464|Can I Win||29.6%|Medium|| |0465|Optimal Account Balancing||48.2%|Hard|| -|0466|Count The Repetitions||28.6%|Hard|| +|0466|Count The Repetitions||28.5%|Hard|| |0467|Unique Substrings in Wraparound String||36.0%|Medium|| -|0468|Validate IP Address||24.8%|Medium|| +|0468|Validate IP Address||24.9%|Medium|| |0469|Convex Polygon||37.4%|Medium|| |0470|Implement Rand10() Using Rand7()|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0470.Implement-Rand10()-Using-Rand7())|46.0%|Medium|| -|0471|Encode String with Shortest Length||49.0%|Hard|| -|0472|Concatenated Words||44.5%|Hard|| +|0471|Encode String with Shortest Length||49.1%|Hard|| +|0472|Concatenated Words||44.3%|Hard|| |0473|Matchsticks to Square||38.2%|Medium|| -|0474|Ones and Zeroes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0474.Ones-and-Zeroes)|43.5%|Medium|| +|0474|Ones and Zeroes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0474.Ones-and-Zeroes)|43.6%|Medium|| |0475|Heaters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0475.Heaters)|33.6%|Medium|| |0476|Number Complement|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0476.Number-Complement)|65.1%|Easy|| |0477|Total Hamming Distance|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0477.Total-Hamming-Distance)|50.6%|Medium|| |0478|Generate Random Point in a Circle||39.0%|Medium|| |0479|Largest Palindrome Product||29.5%|Hard|| -|0480|Sliding Window Median|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0480.Sliding-Window-Median)|38.5%|Hard|| -|0481|Magical String||48.0%|Medium|| +|0480|Sliding Window Median|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0480.Sliding-Window-Median)|38.6%|Hard|| +|0481|Magical String||48.1%|Medium|| |0482|License Key Formatting||43.1%|Easy|| |0483|Smallest Good Base|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0483.Smallest-Good-Base)|36.2%|Hard|| -|0484|Find Permutation||64.1%|Medium|| +|0484|Find Permutation||64.2%|Medium|| |0485|Max Consecutive Ones|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0485.Max-Consecutive-Ones)|53.1%|Easy|| -|0486|Predict the Winner||48.4%|Medium|| +|0486|Predict the Winner||48.5%|Medium|| |0487|Max Consecutive Ones II||47.9%|Medium|| |0488|Zuma Game||38.5%|Hard|| -|0489|Robot Room Cleaner||72.2%|Hard|| +|0489|Robot Room Cleaner||72.3%|Hard|| |0490|The Maze||52.6%|Medium|| -|0491|Increasing Subsequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0491.Increasing-Subsequences)|47.4%|Medium|| -|0492|Construct the Rectangle||50.2%|Easy|| -|0493|Reverse Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0493.Reverse-Pairs)|26.6%|Hard|| +|0491|Increasing Subsequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0491.Increasing-Subsequences)|47.5%|Medium|| +|0492|Construct the Rectangle||50.3%|Easy|| +|0493|Reverse Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0493.Reverse-Pairs)|26.7%|Hard|| |0494|Target Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0494.Target-Sum)|45.8%|Medium|| |0495|Teemo Attacking||56.1%|Medium|| -|0496|Next Greater Element I|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0496.Next-Greater-Element-I)|65.2%|Easy|| +|0496|Next Greater Element I|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0496.Next-Greater-Element-I)|65.3%|Easy|| |0497|Random Point in Non-overlapping Rectangles|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0497.Random-Point-in-Non-overlapping-Rectangles)|39.1%|Medium|| -|0498|Diagonal Traverse|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0498.Diagonal-Traverse)|50.1%|Medium|| -|0499|The Maze III||42.3%|Hard|| -|0500|Keyboard Row|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0500.Keyboard-Row)|65.5%|Easy|| -|0501|Find Mode in Binary Search Tree||43.3%|Easy|| -|0502|IPO||41.3%|Hard|| -|0503|Next Greater Element II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0503.Next-Greater-Element-II)|58.2%|Medium|| -|0504|Base 7||46.4%|Easy|| +|0498|Diagonal Traverse|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0498.Diagonal-Traverse)|50.2%|Medium|| +|0499|The Maze III||42.4%|Hard|| +|0500|Keyboard Row|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0500.Keyboard-Row)|65.6%|Easy|| +|0501|Find Mode in Binary Search Tree||43.4%|Easy|| +|0502|IPO||41.4%|Hard|| +|0503|Next Greater Element II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0503.Next-Greater-Element-II)|58.3%|Medium|| +|0504|Base 7||46.5%|Easy|| |0505|The Maze II||48.4%|Medium|| -|0506|Relative Ranks||51.1%|Easy|| -|0507|Perfect Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0507.Perfect-Number)|36.0%|Easy|| -|0508|Most Frequent Subtree Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0508.Most-Frequent-Subtree-Sum)|58.9%|Medium|| -|0509|Fibonacci Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0509.Fibonacci-Number)|67.3%|Easy|| +|0506|Relative Ranks||51.2%|Easy|| +|0507|Perfect Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0507.Perfect-Number)|36.1%|Easy|| +|0508|Most Frequent Subtree Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0508.Most-Frequent-Subtree-Sum)|59.0%|Medium|| +|0509|Fibonacci Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0509.Fibonacci-Number)|67.4%|Easy|| |0510|Inorder Successor in BST II||59.9%|Medium|| |0511|Game Play Analysis I||81.2%|Easy|| |0512|Game Play Analysis II||55.9%|Easy|| |0513|Find Bottom Left Tree Value|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0513.Find-Bottom-Left-Tree-Value)|62.4%|Medium|| -|0514|Freedom Trail||44.8%|Hard|| +|0514|Freedom Trail||44.9%|Hard|| |0515|Find Largest Value in Each Tree Row|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0515.Find-Largest-Value-in-Each-Tree-Row)|62.1%|Medium|| -|0516|Longest Palindromic Subsequence||55.0%|Medium|| -|0517|Super Washing Machines||38.5%|Hard|| -|0518|Coin Change 2||51.5%|Medium|| +|0516|Longest Palindromic Subsequence||55.2%|Medium|| +|0517|Super Washing Machines||38.6%|Hard|| +|0518|Coin Change 2||51.6%|Medium|| |0519|Random Flip Matrix||37.7%|Medium|| |0520|Detect Capital||53.9%|Easy|| |0521|Longest Uncommon Subsequence I||58.4%|Easy|| |0522|Longest Uncommon Subsequence II||34.1%|Medium|| |0523|Continuous Subarray Sum||24.7%|Medium|| -|0524|Longest Word in Dictionary through Deleting|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0524.Longest-Word-in-Dictionary-through-Deleting)|48.9%|Medium|| +|0524|Longest Word in Dictionary through Deleting|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0524.Longest-Word-in-Dictionary-through-Deleting)|49.0%|Medium|| |0525|Contiguous Array||43.4%|Medium|| -|0526|Beautiful Arrangement|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0526.Beautiful-Arrangement)|61.7%|Medium|| -|0527|Word Abbreviation||56.0%|Hard|| -|0528|Random Pick with Weight|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0528.Random-Pick-with-Weight)|44.5%|Medium|| -|0529|Minesweeper|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0529.Minesweeper)|60.8%|Medium|| -|0530|Minimum Absolute Difference in BST||54.7%|Easy|| +|0526|Beautiful Arrangement|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0526.Beautiful-Arrangement)|61.8%|Medium|| +|0527|Word Abbreviation||56.2%|Hard|| +|0528|Random Pick with Weight|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0528.Random-Pick-with-Weight)|44.6%|Medium|| +|0529|Minesweeper|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0529.Minesweeper)|61.0%|Medium|| +|0530|Minimum Absolute Difference in BST||54.8%|Easy|| |0531|Lonely Pixel I||59.4%|Medium|| -|0532|K-diff Pairs in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0532.K-diff-Pairs-in-an-Array)|35.0%|Medium|| +|0532|K-diff Pairs in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0532.K-diff-Pairs-in-an-Array)|35.1%|Medium|| |0533|Lonely Pixel II||48.1%|Medium|| -|0534|Game Play Analysis III||78.8%|Medium|| -|0535|Encode and Decode TinyURL||80.8%|Medium|| -|0536|Construct Binary Tree from String||50.4%|Medium|| +|0534|Game Play Analysis III||79.1%|Medium|| +|0535|Encode and Decode TinyURL||80.9%|Medium|| +|0536|Construct Binary Tree from String||50.6%|Medium|| |0537|Complex Number Multiplication|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0537.Complex-Number-Multiplication)|68.3%|Medium|| -|0538|Convert BST to Greater Tree||56.6%|Medium|| -|0539|Minimum Time Difference||52.2%|Medium|| +|0538|Convert BST to Greater Tree||56.8%|Medium|| +|0539|Minimum Time Difference||52.3%|Medium|| |0540|Single Element in a Sorted Array||57.9%|Medium|| -|0541|Reverse String II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0541.Reverse-String-II)|49.0%|Easy|| -|0542|01 Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0542.01-Matrix)|40.7%|Medium|| +|0541|Reverse String II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0541.Reverse-String-II)|49.1%|Easy|| +|0542|01 Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0542.01-Matrix)|40.8%|Medium|| |0543|Diameter of Binary Tree||49.1%|Easy|| |0544|Output Contest Matches||75.7%|Medium|| -|0545|Boundary of Binary Tree||39.5%|Medium|| +|0545|Boundary of Binary Tree||39.6%|Medium|| |0546|Remove Boxes||44.2%|Hard|| -|0547|Number of Provinces|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0547.Number-of-Provinces)|60.2%|Medium|| -|0548|Split Array with Equal Sum||47.7%|Medium|| +|0547|Number of Provinces|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0547.Number-of-Provinces)|60.3%|Medium|| +|0548|Split Array with Equal Sum||47.8%|Medium|| |0549|Binary Tree Longest Consecutive Sequence II||47.2%|Medium|| -|0550|Game Play Analysis IV||45.9%|Medium|| -|0551|Student Attendance Record I||46.1%|Easy|| -|0552|Student Attendance Record II||37.2%|Hard|| -|0553|Optimal Division||57.3%|Medium|| +|0550|Game Play Analysis IV||45.7%|Medium|| +|0551|Student Attendance Record I||46.0%|Easy|| +|0552|Student Attendance Record II||37.3%|Hard|| +|0553|Optimal Division||57.4%|Medium|| |0554|Brick Wall||50.6%|Medium|| |0555|Split Concatenated Strings||42.8%|Medium|| |0556|Next Greater Element III||33.5%|Medium|| -|0557|Reverse Words in a String III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0557.Reverse-Words-in-a-String-III)|71.6%|Easy|| +|0557|Reverse Words in a String III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0557.Reverse-Words-in-a-String-III)|71.7%|Easy|| |0558|Logical OR of Two Binary Grids Represented as Quad-Trees||45.5%|Medium|| -|0559|Maximum Depth of N-ary Tree||69.4%|Easy|| +|0559|Maximum Depth of N-ary Tree||69.5%|Easy|| |0560|Subarray Sum Equals K||43.8%|Medium|| -|0561|Array Partition I|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0561.Array-Partition-I)|73.0%|Easy|| +|0561|Array Partition I|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0561.Array-Partition-I)|73.1%|Easy|| |0562|Longest Line of Consecutive One in Matrix||46.2%|Medium|| -|0563|Binary Tree Tilt|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0563.Binary-Tree-Tilt)|52.7%|Easy|| +|0563|Binary Tree Tilt|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0563.Binary-Tree-Tilt)|52.8%|Easy|| |0564|Find the Closest Palindrome||20.3%|Hard|| |0565|Array Nesting||55.9%|Medium|| |0566|Reshape the Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0566.Reshape-the-Matrix)|61.0%|Easy|| |0567|Permutation in String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0567.Permutation-in-String)|44.6%|Medium|| -|0568|Maximum Vacation Days||41.4%|Hard|| -|0569|Median Employee Salary||61.1%|Hard|| -|0570|Managers with at Least 5 Direct Reports||66.7%|Medium|| +|0568|Maximum Vacation Days||41.5%|Hard|| +|0569|Median Employee Salary||61.3%|Hard|| +|0570|Managers with at Least 5 Direct Reports||66.8%|Medium|| |0571|Find Median Given Frequency of Numbers||45.6%|Hard|| |0572|Subtree of Another Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0572.Subtree-of-Another-Tree)|44.5%|Easy|| -|0573|Squirrel Simulation||56.0%|Medium|| -|0574|Winning Candidate||51.4%|Medium|| -|0575|Distribute Candies|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0575.Distribute-Candies)|61.9%|Easy|| +|0573|Squirrel Simulation||54.4%|Medium|| +|0574|Winning Candidate||51.6%|Medium|| +|0575|Distribute Candies|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0575.Distribute-Candies)|62.0%|Easy|| |0576|Out of Boundary Paths||35.8%|Medium|| -|0577|Employee Bonus||71.0%|Easy|| -|0578|Get Highest Answer Rate Question||41.4%|Medium|| -|0579|Find Cumulative Salary of an Employee||38.1%|Hard|| -|0580|Count Student Number in Departments||51.2%|Medium|| +|0577|Employee Bonus||71.2%|Easy|| +|0578|Get Highest Answer Rate Question||41.5%|Medium|| +|0579|Find Cumulative Salary of an Employee||38.2%|Hard|| +|0580|Count Student Number in Departments||51.4%|Medium|| |0581|Shortest Unsorted Continuous Subarray||31.7%|Medium|| -|0582|Kill Process||62.4%|Medium|| -|0583|Delete Operation for Two Strings||49.8%|Medium|| -|0584|Find Customer Referee||73.8%|Easy|| -|0585|Investments in 2016||56.5%|Medium|| -|0586|Customer Placing the Largest Number of Orders||75.1%|Easy|| -|0587|Erect the Fence||36.3%|Hard|| -|0588|Design In-Memory File System||46.5%|Hard|| +|0582|Kill Process||62.6%|Medium|| +|0583|Delete Operation for Two Strings||49.9%|Medium|| +|0584|Find Customer Referee||73.9%|Easy|| +|0585|Investments in 2016||56.7%|Medium|| +|0586|Customer Placing the Largest Number of Orders||75.2%|Easy|| +|0587|Erect the Fence||36.4%|Hard|| +|0588|Design In-Memory File System||46.6%|Hard|| |0589|N-ary Tree Preorder Traversal||73.2%|Easy|| -|0590|N-ary Tree Postorder Traversal||73.2%|Easy|| +|0590|N-ary Tree Postorder Traversal||73.3%|Easy|| |0591|Tag Validator||34.6%|Hard|| -|0592|Fraction Addition and Subtraction||50.1%|Medium|| +|0592|Fraction Addition and Subtraction||50.2%|Medium|| |0593|Valid Square||43.3%|Medium|| -|0594|Longest Harmonious Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0594.Longest-Harmonious-Subsequence)|47.8%|Easy|| -|0595|Big Countries||78.3%|Easy|| +|0594|Longest Harmonious Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0594.Longest-Harmonious-Subsequence)|51.2%|Easy|| +|0595|Big Countries||78.4%|Easy|| |0596|Classes More Than 5 Students||38.7%|Easy|| -|0597|Friend Requests I: Overall Acceptance Rate||41.7%|Easy|| -|0598|Range Addition II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0598.Range-Addition-II)|50.0%|Easy|| -|0599|Minimum Index Sum of Two Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0599.Minimum-Index-Sum-of-Two-Lists)|51.5%|Easy|| -|0600|Non-negative Integers without Consecutive Ones||34.6%|Hard|| -|0601|Human Traffic of Stadium||44.5%|Hard|| -|0602|Friend Requests II: Who Has the Most Friends||56.8%|Medium|| -|0603|Consecutive Available Seats||65.8%|Easy|| +|0597|Friend Requests I: Overall Acceptance Rate||41.8%|Easy|| +|0598|Range Addition II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0598.Range-Addition-II)|50.1%|Easy|| +|0599|Minimum Index Sum of Two Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0599.Minimum-Index-Sum-of-Two-Lists)|51.6%|Easy|| +|0600|Non-negative Integers without Consecutive Ones||34.7%|Hard|| +|0601|Human Traffic of Stadium||44.8%|Hard|| +|0602|Friend Requests II: Who Has the Most Friends||57.0%|Medium|| +|0603|Consecutive Available Seats||66.0%|Easy|| |0604|Design Compressed String Iterator||38.1%|Easy|| -|0605|Can Place Flowers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0605.Can-Place-Flowers)|31.9%|Easy|| -|0606|Construct String from Binary Tree||55.0%|Easy|| -|0607|Sales Person||64.8%|Easy|| -|0608|Tree Node||69.1%|Medium|| -|0609|Find Duplicate File in System||60.9%|Medium|| -|0610|Triangle Judgement||68.1%|Easy|| -|0611|Valid Triangle Number||49.1%|Medium|| -|0612|Shortest Distance in a Plane||61.0%|Medium|| -|0613|Shortest Distance in a Line||79.3%|Easy|| -|0614|Second Degree Follower||32.3%|Medium|| -|0615|Average Salary: Departments VS Company||51.7%|Hard|| -|0616|Add Bold Tag in String||44.5%|Medium|| +|0605|Can Place Flowers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0605.Can-Place-Flowers)|31.8%|Easy|| +|0606|Construct String from Binary Tree||55.1%|Easy|| +|0607|Sales Person||64.9%|Easy|| +|0608|Tree Node||69.3%|Medium|| +|0609|Find Duplicate File in System||61.0%|Medium|| +|0610|Triangle Judgement||68.3%|Easy|| +|0611|Valid Triangle Number||49.2%|Medium|| +|0612|Shortest Distance in a Plane||61.1%|Medium|| +|0613|Shortest Distance in a Line||79.4%|Easy|| +|0614|Second Degree Follower||32.4%|Medium|| +|0615|Average Salary: Departments VS Company||51.9%|Hard|| +|0616|Add Bold Tag in String||44.6%|Medium|| |0617|Merge Two Binary Trees||75.2%|Easy|| -|0618|Students Report By Geography||59.1%|Hard|| -|0619|Biggest Single Number||44.7%|Easy|| -|0620|Not Boring Movies||69.5%|Easy|| -|0621|Task Scheduler||51.6%|Medium|| -|0622|Design Circular Queue||45.1%|Medium|| +|0618|Students Report By Geography||59.4%|Hard|| +|0619|Biggest Single Number||44.8%|Easy|| +|0620|Not Boring Movies||69.6%|Easy|| +|0621|Task Scheduler||51.7%|Medium|| +|0622|Design Circular Queue||45.2%|Medium|| |0623|Add One Row to Tree||50.3%|Medium|| -|0624|Maximum Distance in Arrays||39.4%|Medium|| +|0624|Maximum Distance in Arrays||39.5%|Medium|| |0625|Minimum Factorization||32.9%|Medium|| -|0626|Exchange Seats||65.1%|Medium|| -|0627|Swap Salary||77.3%|Easy|| -|0628|Maximum Product of Three Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0628.Maximum-Product-of-Three-Numbers)|47.0%|Easy|| +|0626|Exchange Seats||65.3%|Medium|| +|0627|Swap Salary||77.4%|Easy|| +|0628|Maximum Product of Three Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0628.Maximum-Product-of-Three-Numbers)|46.9%|Easy|| |0629|K Inverse Pairs Array||31.6%|Hard|| -|0630|Course Schedule III||33.7%|Hard|| +|0630|Course Schedule III||33.8%|Hard|| |0631|Design Excel Sum Formula||32.1%|Hard|| -|0632|Smallest Range Covering Elements from K Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0632.Smallest-Range-Covering-Elements-from-K-Lists)|54.0%|Hard|| +|0632|Smallest Range Covering Elements from K Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0632.Smallest-Range-Covering-Elements-from-K-Lists)|54.1%|Hard|| |0633|Sum of Square Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0633.Sum-of-Square-Numbers)|32.5%|Medium|| -|0634|Find the Derangement of An Array||40.4%|Medium|| -|0635|Design Log Storage System||59.5%|Medium|| -|0636|Exclusive Time of Functions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0636.Exclusive-Time-of-Functions)|54.0%|Medium|| -|0637|Average of Levels in Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0637.Average-of-Levels-in-Binary-Tree)|64.6%|Easy|| -|0638|Shopping Offers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0638.Shopping-Offers)|52.7%|Medium|| -|0639|Decode Ways II||27.5%|Hard|| -|0640|Solve the Equation||42.6%|Medium|| +|0634|Find the Derangement of An Array||40.5%|Medium|| +|0635|Design Log Storage System||59.6%|Medium|| +|0636|Exclusive Time of Functions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0636.Exclusive-Time-of-Functions)|54.2%|Medium|| +|0637|Average of Levels in Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0637.Average-of-Levels-in-Binary-Tree)|64.7%|Easy|| +|0638|Shopping Offers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0638.Shopping-Offers)|52.8%|Medium|| +|0639|Decode Ways II||27.6%|Hard|| +|0640|Solve the Equation||42.7%|Medium|| |0641|Design Circular Deque||54.6%|Medium|| -|0642|Design Search Autocomplete System||46.0%|Hard|| +|0642|Design Search Autocomplete System||46.1%|Hard|| |0643|Maximum Average Subarray I||42.0%|Easy|| -|0644|Maximum Average Subarray II||33.9%|Hard|| +|0644|Maximum Average Subarray II||34.0%|Hard|| |0645|Set Mismatch|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0645.Set-Mismatch)|42.5%|Easy|| -|0646|Maximum Length of Pair Chain||52.7%|Medium|| -|0647|Palindromic Substrings||61.7%|Medium|| -|0648|Replace Words|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0648.Replace-Words)|58.3%|Medium|| +|0646|Maximum Length of Pair Chain||52.8%|Medium|| +|0647|Palindromic Substrings||61.8%|Medium|| +|0648|Replace Words|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0648.Replace-Words)|58.4%|Medium|| |0649|Dota2 Senate||39.4%|Medium|| -|0650|2 Keys Keyboard||49.9%|Medium|| -|0651|4 Keys Keyboard||52.9%|Medium|| -|0652|Find Duplicate Subtrees||52.1%|Medium|| +|0650|2 Keys Keyboard||50.0%|Medium|| +|0651|4 Keys Keyboard||53.0%|Medium|| +|0652|Find Duplicate Subtrees||52.3%|Medium|| |0653|Two Sum IV - Input is a BST|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0653.Two-Sum-IV---Input-is-a-BST)|56.2%|Easy|| -|0654|Maximum Binary Tree||80.9%|Medium|| -|0655|Print Binary Tree||55.9%|Medium|| +|0654|Maximum Binary Tree||81.0%|Medium|| +|0655|Print Binary Tree||56.0%|Medium|| |0656|Coin Path||29.6%|Hard|| |0657|Robot Return to Origin||73.7%|Easy|| -|0658|Find K Closest Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0658.Find-K-Closest-Elements)|41.8%|Medium|| +|0658|Find K Closest Elements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0658.Find-K-Closest-Elements)|41.9%|Medium|| |0659|Split Array into Consecutive Subsequences||44.3%|Medium|| -|0660|Remove 9||54.1%|Hard|| +|0660|Remove 9||54.2%|Hard|| |0661|Image Smoother|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0661.Image-Smoother)|52.2%|Easy|| |0662|Maximum Width of Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0662.Maximum-Width-of-Binary-Tree)|40.0%|Medium|| |0663|Equal Tree Partition||39.7%|Medium|| |0664|Strange Printer||41.3%|Hard|| -|0665|Non-decreasing Array||19.6%|Easy|| -|0666|Path Sum IV||55.7%|Medium|| -|0667|Beautiful Arrangement II||55.0%|Medium|| +|0665|Non-decreasing Array||19.7%|Medium|| +|0666|Path Sum IV||55.9%|Medium|| +|0667|Beautiful Arrangement II||55.1%|Medium|| |0668|Kth Smallest Number in Multiplication Table|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0668.Kth-Smallest-Number-in-Multiplication-Table)|47.7%|Hard|| -|0669|Trim a Binary Search Tree||63.3%|Easy|| -|0670|Maximum Swap||44.9%|Medium|| +|0669|Trim a Binary Search Tree||64.5%|Medium|| +|0670|Maximum Swap||45.0%|Medium|| |0671|Second Minimum Node In a Binary Tree||42.8%|Easy|| |0672|Bulb Switcher II||51.1%|Medium|| |0673|Number of Longest Increasing Subsequence||38.4%|Medium|| -|0674|Longest Continuous Increasing Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0674.Longest-Continuous-Increasing-Subsequence)|46.0%|Easy|| +|0674|Longest Continuous Increasing Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0674.Longest-Continuous-Increasing-Subsequence)|46.1%|Easy|| |0675|Cut Off Trees for Golf Event||35.2%|Hard|| |0676|Implement Magic Dictionary|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0676.Implement-Magic-Dictionary)|55.2%|Medium|| -|0677|Map Sum Pairs||53.9%|Medium|| -|0678|Valid Parenthesis String||31.5%|Medium|| -|0679|24 Game||47.1%|Hard|| -|0680|Valid Palindrome II||37.0%|Easy|| -|0681|Next Closest Time||45.8%|Medium|| -|0682|Baseball Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0682.Baseball-Game)|66.2%|Easy|| -|0683|K Empty Slots||35.9%|Hard|| -|0684|Redundant Connection|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0684.Redundant-Connection)|58.8%|Medium|| +|0677|Map Sum Pairs||54.0%|Medium|| +|0678|Valid Parenthesis String||31.6%|Medium|| +|0679|24 Game||47.2%|Hard|| +|0680|Valid Palindrome II||37.1%|Easy|| +|0681|Next Closest Time||45.9%|Medium|| +|0682|Baseball Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0682.Baseball-Game)|66.5%|Easy|| +|0683|K Empty Slots||36.0%|Hard|| +|0684|Redundant Connection|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0684.Redundant-Connection)|58.9%|Medium|| |0685|Redundant Connection II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0685.Redundant-Connection-II)|32.9%|Hard|| |0686|Repeated String Match||32.8%|Medium|| -|0687|Longest Univalue Path||37.1%|Medium|| -|0688|Knight Probability in Chessboard||49.9%|Medium|| +|0687|Longest Univalue Path||37.2%|Medium|| +|0688|Knight Probability in Chessboard||50.0%|Medium|| |0689|Maximum Sum of 3 Non-Overlapping Subarrays||47.2%|Hard|| -|0690|Employee Importance||58.5%|Easy|| +|0690|Employee Importance||58.6%|Easy|| |0691|Stickers to Spell Word||44.4%|Hard|| -|0692|Top K Frequent Words||52.9%|Medium|| +|0692|Top K Frequent Words||53.0%|Medium|| |0693|Binary Number with Alternating Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0693.Binary-Number-with-Alternating-Bits)|59.8%|Easy|| -|0694|Number of Distinct Islands||57.4%|Medium|| -|0695|Max Area of Island|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0695.Max-Area-of-Island)|64.4%|Medium|| -|0696|Count Binary Substrings||57.3%|Easy|| +|0694|Number of Distinct Islands||57.5%|Medium|| +|0695|Max Area of Island|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0695.Max-Area-of-Island)|64.6%|Medium|| +|0696|Count Binary Substrings||57.4%|Easy|| |0697|Degree of an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0697.Degree-of-an-Array)|54.4%|Easy|| |0698|Partition to K Equal Sum Subsets||45.6%|Medium|| -|0699|Falling Squares|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0699.Falling-Squares)|42.4%|Hard|| +|0699|Falling Squares|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0699.Falling-Squares)|42.5%|Hard|| |0700|Search in a Binary Search Tree||73.4%|Easy|| -|0701|Insert into a Binary Search Tree||75.9%|Medium|| -|0702|Search in a Sorted Array of Unknown Size||68.5%|Medium|| +|0701|Insert into a Binary Search Tree||75.8%|Medium|| +|0702|Search in a Sorted Array of Unknown Size||68.7%|Medium|| |0703|Kth Largest Element in a Stream||50.6%|Easy|| |0704|Binary Search|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0704.Binary-Search)|54.0%|Easy|| -|0705|Design HashSet|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0705.Design-HashSet)|64.6%|Easy|| -|0706|Design HashMap|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0706.Design-HashMap)|62.6%|Easy|| +|0705|Design HashSet|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0705.Design-HashSet)|64.7%|Easy|| +|0706|Design HashMap|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0706.Design-HashMap)|62.7%|Easy|| |0707|Design Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0707.Design-Linked-List)|25.8%|Medium|| -|0708|Insert into a Sorted Circular Linked List||32.4%|Medium|| +|0708|Insert into a Sorted Circular Linked List||32.5%|Medium|| |0709|To Lower Case||80.0%|Easy|| -|0710|Random Pick with Blacklist|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0710.Random-Pick-with-Blacklist)|32.6%|Hard|| +|0710|Random Pick with Blacklist|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0710.Random-Pick-with-Blacklist)|32.7%|Hard|| |0711|Number of Distinct Islands II||49.1%|Hard|| |0712|Minimum ASCII Delete Sum for Two Strings||59.4%|Medium|| -|0713|Subarray Product Less Than K|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0713.Subarray-Product-Less-Than-K)|40.4%|Medium|| -|0714|Best Time to Buy and Sell Stock with Transaction Fee|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee)|55.9%|Medium|| -|0715|Range Module|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0715.Range-Module)|40.1%|Hard|| -|0716|Max Stack||42.9%|Easy|| -|0717|1-bit and 2-bit Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0717.1-bit-and-2-bit-Characters)|47.5%|Easy|| -|0718|Maximum Length of Repeated Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0718.Maximum-Length-of-Repeated-Subarray)|50.2%|Medium|| +|0713|Subarray Product Less Than K|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0713.Subarray-Product-Less-Than-K)|40.5%|Medium|| +|0714|Best Time to Buy and Sell Stock with Transaction Fee|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee)|56.0%|Medium|| +|0715|Range Module|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0715.Range-Module)|40.2%|Hard|| +|0716|Max Stack||43.0%|Easy|| +|0717|1-bit and 2-bit Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0717.1-bit-and-2-bit-Characters)|47.4%|Easy|| +|0718|Maximum Length of Repeated Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0718.Maximum-Length-of-Repeated-Subarray)|50.3%|Medium|| |0719|Find K-th Smallest Pair Distance|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0719.Find-K-th-Smallest-Pair-Distance)|32.5%|Hard|| |0720|Longest Word in Dictionary|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0720.Longest-Word-in-Dictionary)|49.1%|Easy|| -|0721|Accounts Merge|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0721.Accounts-Merge)|51.3%|Medium|| -|0722|Remove Comments||35.9%|Medium|| -|0723|Candy Crush||72.5%|Medium|| -|0724|Find Pivot Index|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0724.Find-Pivot-Index)|45.1%|Easy|| -|0725|Split Linked List in Parts|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0725.Split-Linked-List-in-Parts)|52.8%|Medium|| -|0726|Number of Atoms|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0726.Number-of-Atoms)|51.0%|Hard|| +|0721|Accounts Merge|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0721.Accounts-Merge)|51.6%|Medium|| +|0722|Remove Comments||36.0%|Medium|| +|0723|Candy Crush||72.6%|Medium|| +|0724|Find Pivot Index|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0724.Find-Pivot-Index)|45.2%|Easy|| +|0725|Split Linked List in Parts|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0725.Split-Linked-List-in-Parts)|52.9%|Medium|| +|0726|Number of Atoms|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0726.Number-of-Atoms)|51.1%|Hard|| |0727|Minimum Window Subsequence||42.1%|Hard|| -|0728|Self Dividing Numbers||75.3%|Easy|| +|0728|Self Dividing Numbers||75.4%|Easy|| |0729|My Calendar I|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0729.My-Calendar-I)|53.2%|Medium|| |0730|Count Different Palindromic Subsequences||43.4%|Hard|| -|0731|My Calendar II||50.3%|Medium|| -|0732|My Calendar III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0732.My-Calendar-III)|61.5%|Hard|| -|0733|Flood Fill|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0733.Flood-Fill)|55.8%|Easy|| -|0734|Sentence Similarity||42.3%|Easy|| +|0731|My Calendar II||50.4%|Medium|| +|0732|My Calendar III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0732.My-Calendar-III)|61.6%|Hard|| +|0733|Flood Fill|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0733.Flood-Fill)|55.9%|Easy|| +|0734|Sentence Similarity||42.4%|Easy|| |0735|Asteroid Collision|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0735.Asteroid-Collision)|43.2%|Medium|| -|0736|Parse Lisp Expression||49.9%|Hard|| +|0736|Parse Lisp Expression||49.8%|Hard|| |0737|Sentence Similarity II||46.5%|Medium|| -|0738|Monotone Increasing Digits||45.5%|Medium|| -|0739|Daily Temperatures|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0739.Daily-Temperatures)|64.4%|Medium|| +|0738|Monotone Increasing Digits||45.6%|Medium|| +|0739|Daily Temperatures|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0739.Daily-Temperatures)|64.5%|Medium|| |0740|Delete and Earn||49.2%|Medium|| -|0741|Cherry Pickup||35.0%|Hard|| -|0742|Closest Leaf in a Binary Tree||44.2%|Medium|| -|0743|Network Delay Time||45.3%|Medium|| +|0741|Cherry Pickup||35.1%|Hard|| +|0742|Closest Leaf in a Binary Tree||44.3%|Medium|| +|0743|Network Delay Time||45.4%|Medium|| |0744|Find Smallest Letter Greater Than Target|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0744.Find-Smallest-Letter-Greater-Than-Target)|45.6%|Easy|| -|0745|Prefix and Suffix Search|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0745.Prefix-and-Suffix-Search)|35.1%|Hard|| +|0745|Prefix and Suffix Search|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0745.Prefix-and-Suffix-Search)|35.2%|Hard|| |0746|Min Cost Climbing Stairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0746.Min-Cost-Climbing-Stairs)|50.9%|Easy|| |0747|Largest Number At Least Twice of Others||42.9%|Easy|| -|0748|Shortest Completing Word|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0748.Shortest-Completing-Word)|57.4%|Easy|| -|0749|Contain Virus||47.9%|Hard|| -|0750|Number Of Corner Rectangles||66.7%|Medium|| -|0751|IP to CIDR||60.0%|Medium|| -|0752|Open the Lock||52.6%|Medium|| -|0753|Cracking the Safe|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0753.Cracking-the-Safe)|52.1%|Hard|| +|0748|Shortest Completing Word|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0748.Shortest-Completing-Word)|57.5%|Easy|| +|0749|Contain Virus||48.1%|Hard|| +|0750|Number Of Corner Rectangles||67.1%|Medium|| +|0751|IP to CIDR||59.8%|Medium|| +|0752|Open the Lock||52.7%|Medium|| +|0753|Cracking the Safe|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0753.Cracking-the-Safe)|52.2%|Hard|| |0754|Reach a Number||40.5%|Medium|| -|0755|Pour Water||44.0%|Medium|| -|0756|Pyramid Transition Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0756.Pyramid-Transition-Matrix)|55.4%|Medium|| -|0757|Set Intersection Size At Least Two||42.2%|Hard|| -|0758|Bold Words in String||47.2%|Easy|| -|0759|Employee Free Time||67.9%|Hard|| -|0760|Find Anagram Mappings||81.7%|Easy|| +|0755|Pour Water||44.1%|Medium|| +|0756|Pyramid Transition Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0756.Pyramid-Transition-Matrix)|55.5%|Medium|| +|0757|Set Intersection Size At Least Two||42.1%|Hard|| +|0758|Bold Words in String||47.3%|Easy|| +|0759|Employee Free Time||68.1%|Hard|| +|0760|Find Anagram Mappings||81.8%|Easy|| |0761|Special Binary String||58.6%|Hard|| -|0762|Prime Number of Set Bits in Binary Representation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0762.Prime-Number-of-Set-Bits-in-Binary-Representation)|64.2%|Easy|| -|0763|Partition Labels|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0763.Partition-Labels)|77.9%|Medium|| -|0764|Largest Plus Sign||46.4%|Medium|| +|0762|Prime Number of Set Bits in Binary Representation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0762.Prime-Number-of-Set-Bits-in-Binary-Representation)|64.3%|Easy|| +|0763|Partition Labels|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0763.Partition-Labels)|78.0%|Medium|| +|0764|Largest Plus Sign||46.5%|Medium|| |0765|Couples Holding Hands|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0765.Couples-Holding-Hands)|55.4%|Hard|| |0766|Toeplitz Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0766.Toeplitz-Matrix)|65.8%|Easy|| -|0767|Reorganize String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0767.Reorganize-String)|49.9%|Medium|| +|0767|Reorganize String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0767.Reorganize-String)|50.0%|Medium|| |0768|Max Chunks To Make Sorted II||49.7%|Hard|| |0769|Max Chunks To Make Sorted||55.5%|Medium|| -|0770|Basic Calculator IV||54.4%|Hard|| +|0770|Basic Calculator IV||54.1%|Hard|| |0771|Jewels and Stones|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0771.Jewels-and-Stones)|86.9%|Easy|| -|0772|Basic Calculator III||43.3%|Hard|| -|0773|Sliding Puzzle||60.6%|Hard|| -|0774|Minimize Max Distance to Gas Station||48.1%|Hard|| +|0772|Basic Calculator III||43.4%|Hard|| +|0773|Sliding Puzzle||60.7%|Hard|| +|0774|Minimize Max Distance to Gas Station||48.2%|Hard|| |0775|Global and Local Inversions||42.5%|Medium|| -|0776|Split BST||56.5%|Medium|| -|0777|Swap Adjacent in LR String||35.5%|Medium|| -|0778|Swim in Rising Water|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0778.Swim-in-Rising-Water)|54.5%|Hard|| +|0776|Split BST||56.6%|Medium|| +|0777|Swap Adjacent in LR String||35.6%|Medium|| +|0778|Swim in Rising Water|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0778.Swim-in-Rising-Water)|54.8%|Hard|| |0779|K-th Symbol in Grammar||38.5%|Medium|| |0780|Reaching Points||30.3%|Hard|| |0781|Rabbits in Forest|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0781.Rabbits-in-Forest)|55.4%|Medium|| -|0782|Transform to Chessboard||46.8%|Hard|| -|0783|Minimum Distance Between BST Nodes||53.7%|Easy|| -|0784|Letter Case Permutation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0784.Letter-Case-Permutation)|66.3%|Medium|| -|0785|Is Graph Bipartite?|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0785.Is-Graph-Bipartite?)|48.2%|Medium|| -|0786|K-th Smallest Prime Fraction|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0786.K-th-Smallest-Prime-Fraction)|41.9%|Hard|| +|0782|Transform to Chessboard||47.0%|Hard|| +|0783|Minimum Distance Between BST Nodes||53.8%|Easy|| +|0784|Letter Case Permutation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0784.Letter-Case-Permutation)|66.4%|Medium|| +|0785|Is Graph Bipartite?|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0785.Is-Graph-Bipartite?)|48.3%|Medium|| +|0786|K-th Smallest Prime Fraction|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0786.K-th-Smallest-Prime-Fraction)|42.2%|Hard|| |0787|Cheapest Flights Within K Stops||39.5%|Medium|| |0788|Rotated Digits||57.2%|Easy|| -|0789|Escape The Ghosts||58.2%|Medium|| +|0789|Escape The Ghosts||58.3%|Medium|| |0790|Domino and Tromino Tiling||40.0%|Medium|| |0791|Custom Sort String||65.9%|Medium|| |0792|Number of Matching Subsequences||48.1%|Medium|| |0793|Preimage Size of Factorial Zeroes Function|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0793.Preimage-Size-of-Factorial-Zeroes-Function)|40.7%|Hard|| -|0794|Valid Tic-Tac-Toe State||33.6%|Medium|| -|0795|Number of Subarrays with Bounded Maximum||47.4%|Medium|| +|0794|Valid Tic-Tac-Toe State||33.7%|Medium|| +|0795|Number of Subarrays with Bounded Maximum||47.5%|Medium|| |0796|Rotate String||49.3%|Easy|| -|0797|All Paths From Source to Target||78.4%|Medium|| +|0797|All Paths From Source to Target||78.5%|Medium|| |0798|Smallest Rotation with Highest Score||44.8%|Hard|| -|0799|Champagne Tower||44.0%|Medium|| +|0799|Champagne Tower||44.1%|Medium|| |0800|Similar RGB Color||62.2%|Easy|| |0801|Minimum Swaps To Make Sequences Increasing||39.0%|Medium|| -|0802|Find Eventual Safe States|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0802.Find-Eventual-Safe-States)|49.7%|Medium|| -|0803|Bricks Falling When Hit|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0803.Bricks-Falling-When-Hit)|31.3%|Hard|| +|0802|Find Eventual Safe States|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0802.Find-Eventual-Safe-States)|49.8%|Medium|| +|0803|Bricks Falling When Hit|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0803.Bricks-Falling-When-Hit)|31.4%|Hard|| |0804|Unique Morse Code Words||78.8%|Easy|| |0805|Split Array With Same Average||26.7%|Hard|| |0806|Number of Lines To Write String||65.5%|Easy|| |0807|Max Increase to Keep City Skyline||84.3%|Medium|| -|0808|Soup Servings||40.9%|Medium|| +|0808|Soup Servings||41.0%|Medium|| |0809|Expressive Words||46.5%|Medium|| -|0810|Chalkboard XOR Game||49.4%|Hard|| -|0811|Subdomain Visit Count|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0811.Subdomain-Visit-Count)|71.2%|Easy|| +|0810|Chalkboard XOR Game||49.5%|Hard|| +|0811|Subdomain Visit Count|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0811.Subdomain-Visit-Count)|71.4%|Easy|| |0812|Largest Triangle Area|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0812.Largest-Triangle-Area)|58.9%|Easy|| |0813|Largest Sum of Averages||51.0%|Medium|| -|0814|Binary Tree Pruning||72.8%|Medium|| +|0814|Binary Tree Pruning||72.7%|Medium|| |0815|Bus Routes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0815.Bus-Routes)|43.3%|Hard|| -|0816|Ambiguous Coordinates||47.9%|Medium|| -|0817|Linked List Components|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0817.Linked-List-Components)|57.6%|Medium|| -|0818|Race Car||39.7%|Hard|| -|0819|Most Common Word|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0819.Most-Common-Word)|45.4%|Easy|| -|0820|Short Encoding of Words||51.4%|Medium|| -|0821|Shortest Distance to a Character||67.8%|Easy|| +|0816|Ambiguous Coordinates||48.0%|Medium|| +|0817|Linked List Components|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0817.Linked-List-Components)|57.7%|Medium|| +|0818|Race Car||39.8%|Hard|| +|0819|Most Common Word|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0819.Most-Common-Word)|45.5%|Easy|| +|0820|Short Encoding of Words||51.5%|Medium|| +|0821|Shortest Distance to a Character||68.0%|Easy|| |0822|Card Flipping Game||43.6%|Medium|| -|0823|Binary Trees With Factors||36.4%|Medium|| -|0824|Goat Latin||66.3%|Easy|| +|0823|Binary Trees With Factors||36.5%|Medium|| +|0824|Goat Latin||66.4%|Easy|| |0825|Friends Of Appropriate Ages||43.9%|Medium|| |0826|Most Profit Assigning Work|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0826.Most-Profit-Assigning-Work)|39.0%|Medium|| -|0827|Making A Large Island||47.1%|Hard|| -|0828|Count Unique Characters of All Substrings of a Given String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String)|46.7%|Hard|| +|0827|Making A Large Island||47.2%|Hard|| +|0828|Count Unique Characters of All Substrings of a Given String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String)|46.8%|Hard|| |0829|Consecutive Numbers Sum||39.3%|Hard|| |0830|Positions of Large Groups|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0830.Positions-of-Large-Groups)|50.3%|Easy|| -|0831|Masking Personal Information||44.7%|Medium|| -|0832|Flipping an Image|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0832.Flipping-an-Image)|78.0%|Easy|| -|0833|Find And Replace in String||51.3%|Medium|| -|0834|Sum of Distances in Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0834.Sum-of-Distances-in-Tree)|45.6%|Hard|| +|0831|Masking Personal Information||44.8%|Medium|| +|0832|Flipping an Image|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0832.Flipping-an-Image)|78.1%|Easy|| +|0833|Find And Replace in String||51.4%|Medium|| +|0834|Sum of Distances in Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0834.Sum-of-Distances-in-Tree)|45.8%|Hard|| |0835|Image Overlap||61.8%|Medium|| -|0836|Rectangle Overlap|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0836.Rectangle-Overlap)|45.0%|Easy|| +|0836|Rectangle Overlap|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0836.Rectangle-Overlap)|44.8%|Easy|| |0837|New 21 Game||35.3%|Medium|| |0838|Push Dominoes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0838.Push-Dominoes)|49.7%|Medium|| -|0839|Similar String Groups|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0839.Similar-String-Groups)|40.2%|Hard|| +|0839|Similar String Groups|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0839.Similar-String-Groups)|40.4%|Hard|| |0840|Magic Squares In Grid||37.8%|Medium|| -|0841|Keys and Rooms|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0841.Keys-and-Rooms)|65.3%|Medium|| -|0842|Split Array into Fibonacci Sequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0842.Split-Array-into-Fibonacci-Sequence)|36.7%|Medium|| +|0841|Keys and Rooms|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0841.Keys-and-Rooms)|65.4%|Medium|| +|0842|Split Array into Fibonacci Sequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0842.Split-Array-into-Fibonacci-Sequence)|36.8%|Medium|| |0843|Guess the Word||46.4%|Hard|| -|0844|Backspace String Compare|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0844.Backspace-String-Compare)|46.8%|Easy|| +|0844|Backspace String Compare|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0844.Backspace-String-Compare)|46.9%|Easy|| |0845|Longest Mountain in Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0845.Longest-Mountain-in-Array)|38.5%|Medium|| |0846|Hand of Straights||55.3%|Medium|| -|0847|Shortest Path Visiting All Nodes||53.3%|Hard|| -|0848|Shifting Letters||45.1%|Medium|| +|0847|Shortest Path Visiting All Nodes||53.4%|Hard|| +|0848|Shifting Letters||45.2%|Medium|| |0849|Maximize Distance to Closest Person||44.5%|Medium|| |0850|Rectangle Area II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0850.Rectangle-Area-II)|48.3%|Hard|| -|0851|Loud and Rich|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0851.Loud-and-Rich)|52.5%|Medium|| -|0852|Peak Index in a Mountain Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0852.Peak-Index-in-a-Mountain-Array)|71.8%|Easy|| -|0853|Car Fleet|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0853.Car-Fleet)|43.6%|Medium|| +|0851|Loud and Rich|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0851.Loud-and-Rich)|52.6%|Medium|| +|0852|Peak Index in a Mountain Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0852.Peak-Index-in-a-Mountain-Array)|71.7%|Easy|| +|0853|Car Fleet|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0853.Car-Fleet)|43.7%|Medium|| |0854|K-Similar Strings||38.7%|Hard|| |0855|Exam Room||43.4%|Medium|| |0856|Score of Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0856.Score-of-Parentheses)|62.3%|Medium|| -|0857|Minimum Cost to Hire K Workers||50.3%|Hard|| -|0858|Mirror Reflection||59.5%|Medium|| -|0859|Buddy Strings||29.6%|Easy|| +|0857|Minimum Cost to Hire K Workers||50.4%|Hard|| +|0858|Mirror Reflection||59.6%|Medium|| +|0859|Buddy Strings||29.5%|Easy|| |0860|Lemonade Change||51.9%|Easy|| -|0861|Score After Flipping Matrix||73.5%|Medium|| +|0861|Score After Flipping Matrix||73.6%|Medium|| |0862|Shortest Subarray with Sum at Least K|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0862.Shortest-Subarray-with-Sum-at-Least-K)|25.2%|Hard|| -|0863|All Nodes Distance K in Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0863.All-Nodes-Distance-K-in-Binary-Tree)|57.6%|Medium|| -|0864|Shortest Path to Get All Keys|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0864.Shortest-Path-to-Get-All-Keys)|41.6%|Hard|| -|0865|Smallest Subtree with all the Deepest Nodes||64.7%|Medium|| +|0863|All Nodes Distance K in Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0863.All-Nodes-Distance-K-in-Binary-Tree)|57.8%|Medium|| +|0864|Shortest Path to Get All Keys|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0864.Shortest-Path-to-Get-All-Keys)|41.8%|Hard|| +|0865|Smallest Subtree with all the Deepest Nodes||64.8%|Medium|| |0866|Prime Palindrome||25.1%|Medium|| -|0867|Transpose Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0867.Transpose-Matrix)|62.2%|Easy|| -|0868|Binary Gap||60.8%|Easy|| +|0867|Transpose Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0867.Transpose-Matrix)|62.1%|Easy|| +|0868|Binary Gap||60.9%|Easy|| |0869|Reordered Power of 2||54.1%|Medium|| |0870|Advantage Shuffle||46.7%|Medium|| -|0871|Minimum Number of Refueling Stops||32.2%|Hard|| +|0871|Minimum Number of Refueling Stops||32.3%|Hard|| |0872|Leaf-Similar Trees|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0872.Leaf-Similar-Trees)|64.6%|Easy|| |0873|Length of Longest Fibonacci Subsequence||48.1%|Medium|| |0874|Walking Robot Simulation||36.7%|Easy|| |0875|Koko Eating Bananas|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0875.Koko-Eating-Bananas)|53.4%|Medium|| -|0876|Middle of the Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0876.Middle-of-the-Linked-List)|68.9%|Easy|| +|0876|Middle of the Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0876.Middle-of-the-Linked-List)|69.0%|Easy|| |0877|Stone Game||66.4%|Medium|| |0878|Nth Magical Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0878.Nth-Magical-Number)|28.9%|Hard|| -|0879|Profitable Schemes||40.1%|Hard|| +|0879|Profitable Schemes||40.0%|Hard|| |0880|Decoded String at Index|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0880.Decoded-String-at-Index)|28.3%|Medium|| -|0881|Boats to Save People|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0881.Boats-to-Save-People)|48.7%|Medium|| -|0882|Reachable Nodes In Subdivided Graph||42.3%|Hard|| -|0883|Projection Area of 3D Shapes||68.1%|Easy|| +|0881|Boats to Save People|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0881.Boats-to-Save-People)|48.8%|Medium|| +|0882|Reachable Nodes In Subdivided Graph||42.5%|Hard|| +|0883|Projection Area of 3D Shapes||68.2%|Easy|| |0884|Uncommon Words from Two Sentences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0884.Uncommon-Words-from-Two-Sentences)|64.0%|Easy|| -|0885|Spiral Matrix III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0885.Spiral-Matrix-III)|70.6%|Medium|| -|0886|Possible Bipartition||45.0%|Medium|| +|0885|Spiral Matrix III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0885.Spiral-Matrix-III)|70.7%|Medium|| +|0886|Possible Bipartition||45.1%|Medium|| |0887|Super Egg Drop|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0887.Super-Egg-Drop)|27.0%|Hard|| |0888|Fair Candy Swap|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0888.Fair-Candy-Swap)|58.9%|Easy|| |0889|Construct Binary Tree from Preorder and Postorder Traversal||67.4%|Medium|| |0890|Find and Replace Pattern||74.1%|Medium|| |0891|Sum of Subsequence Widths|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0891.Sum-of-Subsequence-Widths)|32.9%|Hard|| -|0892|Surface Area of 3D Shapes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0892.Surface-Area-of-3D-Shapes)|59.6%|Easy|| -|0893|Groups of Special-Equivalent Strings||68.2%|Easy|| +|0892|Surface Area of 3D Shapes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0892.Surface-Area-of-3D-Shapes)|59.7%|Easy|| +|0893|Groups of Special-Equivalent Strings||68.4%|Easy|| |0894|All Possible Full Binary Trees||77.0%|Medium|| |0895|Maximum Frequency Stack|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0895.Maximum-Frequency-Stack)|62.2%|Hard|| |0896|Monotonic Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0896.Monotonic-Array)|58.0%|Easy|| -|0897|Increasing Order Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0897.Increasing-Order-Search-Tree)|74.4%|Easy|| -|0898|Bitwise ORs of Subarrays|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0898.Bitwise-ORs-of-Subarrays)|34.0%|Medium|| +|0897|Increasing Order Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0897.Increasing-Order-Search-Tree)|74.5%|Easy|| +|0898|Bitwise ORs of Subarrays|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0898.Bitwise-ORs-of-Subarrays)|34.1%|Medium|| |0899|Orderly Queue||53.0%|Hard|| |0900|RLE Iterator||55.2%|Medium|| -|0901|Online Stock Span|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0901.Online-Stock-Span)|61.2%|Medium|| +|0901|Online Stock Span|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0901.Online-Stock-Span)|61.3%|Medium|| |0902|Numbers At Most N Given Digit Set||36.1%|Hard|| |0903|Valid Permutations for DI Sequence||54.1%|Hard|| -|0904|Fruit Into Baskets|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0904.Fruit-Into-Baskets)|42.9%|Medium|| +|0904|Fruit Into Baskets|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0904.Fruit-Into-Baskets)|43.0%|Medium|| |0905|Sort Array By Parity||75.0%|Easy|| |0906|Super Palindromes||32.8%|Hard|| -|0907|Sum of Subarray Minimums|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0907.Sum-of-Subarray-Minimums)|33.2%|Medium|| +|0907|Sum of Subarray Minimums|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0907.Sum-of-Subarray-Minimums)|33.1%|Medium|| |0908|Smallest Range I||66.4%|Easy|| |0909|Snakes and Ladders||39.2%|Medium|| -|0910|Smallest Range II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0910.Smallest-Range-II)|31.2%|Medium|| +|0910|Smallest Range II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0910.Smallest-Range-II)|31.3%|Medium|| |0911|Online Election|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0911.Online-Election)|51.2%|Medium|| |0912|Sort an Array||64.5%|Medium|| -|0913|Cat and Mouse||34.6%|Hard|| +|0913|Cat and Mouse||34.7%|Hard|| |0914|X of a Kind in a Deck of Cards|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0914.X-of-a-Kind-in-a-Deck-of-Cards)|34.3%|Easy|| -|0915|Partition Array into Disjoint Intervals||46.0%|Medium|| -|0916|Word Subsets||48.1%|Medium|| -|0917|Reverse Only Letters||58.6%|Easy|| +|0915|Partition Array into Disjoint Intervals||46.1%|Medium|| +|0916|Word Subsets||48.2%|Medium|| +|0917|Reverse Only Letters||58.7%|Easy|| |0918|Maximum Sum Circular Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0918.Maximum-Sum-Circular-Subarray)|34.1%|Medium|| -|0919|Complete Binary Tree Inserter||58.6%|Medium|| +|0919|Complete Binary Tree Inserter||58.7%|Medium|| |0920|Number of Music Playlists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0920.Number-of-Music-Playlists)|47.7%|Hard|| |0921|Minimum Add to Make Parentheses Valid|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0921.Minimum-Add-to-Make-Parentheses-Valid)|74.7%|Medium|| -|0922|Sort Array By Parity II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0922.Sort-Array-By-Parity-II)|70.4%|Easy|| -|0923|3Sum With Multiplicity|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0923.3Sum-With-Multiplicity)|36.1%|Medium|| +|0922|Sort Array By Parity II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0922.Sort-Array-By-Parity-II)|70.5%|Easy|| +|0923|3Sum With Multiplicity|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0923.3Sum-With-Multiplicity)|36.2%|Medium|| |0924|Minimize Malware Spread|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0924.Minimize-Malware-Spread)|41.8%|Hard|| -|0925|Long Pressed Name|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0925.Long-Pressed-Name)|38.3%|Easy|| -|0926|Flip String to Monotone Increasing||53.0%|Medium|| -|0927|Three Equal Parts|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0927.Three-Equal-Parts)|34.5%|Hard|| +|0925|Long Pressed Name|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0925.Long-Pressed-Name)|38.2%|Easy|| +|0926|Flip String to Monotone Increasing||53.1%|Medium|| +|0927|Three Equal Parts|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0927.Three-Equal-Parts)|34.6%|Hard|| |0928|Minimize Malware Spread II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0928.Minimize-Malware-Spread-II)|41.2%|Hard|| |0929|Unique Email Addresses||67.1%|Easy|| -|0930|Binary Subarrays With Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0930.Binary-Subarrays-With-Sum)|44.3%|Medium|| -|0931|Minimum Falling Path Sum||63.2%|Medium|| +|0930|Binary Subarrays With Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0930.Binary-Subarrays-With-Sum)|44.5%|Medium|| +|0931|Minimum Falling Path Sum||63.3%|Medium|| |0932|Beautiful Array||61.1%|Medium|| |0933|Number of Recent Calls|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0933.Number-of-Recent-Calls)|72.0%|Easy|| -|0934|Shortest Bridge||49.4%|Medium|| +|0934|Shortest Bridge||49.5%|Medium|| |0935|Knight Dialer||46.3%|Medium|| -|0936|Stamping The Sequence||47.2%|Hard|| +|0936|Stamping The Sequence||47.3%|Hard|| |0937|Reorder Data in Log Files||54.4%|Easy|| |0938|Range Sum of BST||82.9%|Easy|| |0939|Minimum Area Rectangle||51.9%|Medium|| |0940|Distinct Subsequences II||41.6%|Hard|| |0941|Valid Mountain Array||33.4%|Easy|| -|0942|DI String Match|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0942.DI-String-Match)|73.4%|Easy|| -|0943|Find the Shortest Superstring||43.5%|Hard|| +|0942|DI String Match|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0942.DI-String-Match)|73.5%|Easy|| +|0943|Find the Shortest Superstring||43.4%|Hard|| |0944|Delete Columns to Make Sorted||71.1%|Easy|| |0945|Minimum Increment to Make Array Unique||46.7%|Medium|| -|0946|Validate Stack Sequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0946.Validate-Stack-Sequences)|63.5%|Medium|| +|0946|Validate Stack Sequences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0946.Validate-Stack-Sequences)|63.6%|Medium|| |0947|Most Stones Removed with Same Row or Column|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0947.Most-Stones-Removed-with-Same-Row-or-Column)|55.5%|Medium|| |0948|Bag of Tokens||46.1%|Medium|| |0949|Largest Time for Given Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0949.Largest-Time-for-Given-Digits)|36.2%|Medium|| |0950|Reveal Cards In Increasing Order||75.3%|Medium|| -|0951|Flip Equivalent Binary Trees||65.6%|Medium|| +|0951|Flip Equivalent Binary Trees||65.7%|Medium|| |0952|Largest Component Size by Common Factor|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0952.Largest-Component-Size-by-Common-Factor)|36.1%|Hard|| -|0953|Verifying an Alien Dictionary|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0953.Verifying-an-Alien-Dictionary)|52.4%|Easy|| -|0954|Array of Doubled Pairs||35.3%|Medium|| -|0955|Delete Columns to Make Sorted II||33.7%|Medium|| -|0956|Tallest Billboard||39.8%|Hard|| +|0953|Verifying an Alien Dictionary|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0953.Verifying-an-Alien-Dictionary)|52.3%|Easy|| +|0954|Array of Doubled Pairs||35.2%|Medium|| +|0955|Delete Columns to Make Sorted II||33.8%|Medium|| +|0956|Tallest Billboard||40.0%|Hard|| |0957|Prison Cells After N Days||40.2%|Medium|| -|0958|Check Completeness of a Binary Tree||52.4%|Medium|| -|0959|Regions Cut By Slashes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0959.Regions-Cut-By-Slashes)|66.9%|Medium|| -|0960|Delete Columns to Make Sorted III||54.7%|Hard|| +|0958|Check Completeness of a Binary Tree||52.5%|Medium|| +|0959|Regions Cut By Slashes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0959.Regions-Cut-By-Slashes)|67.0%|Medium|| +|0960|Delete Columns to Make Sorted III||54.8%|Hard|| |0961|N-Repeated Element in Size 2N Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0961.N-Repeated-Element-in-Size-2N-Array)|74.4%|Easy|| -|0962|Maximum Width Ramp||46.4%|Medium|| -|0963|Minimum Area Rectangle II||51.7%|Medium|| +|0962|Maximum Width Ramp||46.5%|Medium|| +|0963|Minimum Area Rectangle II||51.8%|Medium|| |0964|Least Operators to Express Number||44.9%|Hard|| |0965|Univalued Binary Tree||67.8%|Easy|| -|0966|Vowel Spellchecker||47.7%|Medium|| -|0967|Numbers With Same Consecutive Differences||44.6%|Medium|| -|0968|Binary Tree Cameras|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0968.Binary-Tree-Cameras)|38.5%|Hard|| +|0966|Vowel Spellchecker||47.9%|Medium|| +|0967|Numbers With Same Consecutive Differences||44.7%|Medium|| +|0968|Binary Tree Cameras|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0968.Binary-Tree-Cameras)|38.6%|Hard|| |0969|Pancake Sorting|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0969.Pancake-Sorting)|68.6%|Medium|| -|0970|Powerful Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0970.Powerful-Integers)|39.9%|Easy|| +|0970|Powerful Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0970.Powerful-Integers)|39.9%|Medium|| |0971|Flip Binary Tree To Match Preorder Traversal||46.2%|Medium|| -|0972|Equal Rational Numbers||41.9%|Hard|| -|0973|K Closest Points to Origin|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0973.K-Closest-Points-to-Origin)|64.5%|Medium|| -|0974|Subarray Sums Divisible by K||50.6%|Medium|| -|0975|Odd Even Jump||41.6%|Hard|| +|0972|Equal Rational Numbers||42.1%|Hard|| +|0973|K Closest Points to Origin|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0973.K-Closest-Points-to-Origin)|64.6%|Medium|| +|0974|Subarray Sums Divisible by K||50.7%|Medium|| +|0975|Odd Even Jump||41.5%|Hard|| |0976|Largest Perimeter Triangle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0976.Largest-Perimeter-Triangle)|58.5%|Easy|| |0977|Squares of a Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0977.Squares-of-a-Sorted-Array)|72.2%|Easy|| |0978|Longest Turbulent Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0978.Longest-Turbulent-Subarray)|46.6%|Medium|| -|0979|Distribute Coins in Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0979.Distribute-Coins-in-Binary-Tree)|69.5%|Medium|| -|0980|Unique Paths III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0980.Unique-Paths-III)|77.2%|Hard|| -|0981|Time Based Key-Value Store|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0981.Time-Based-Key-Value-Store)|54.0%|Medium|| +|0979|Distribute Coins in Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0979.Distribute-Coins-in-Binary-Tree)|69.6%|Medium|| +|0980|Unique Paths III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0980.Unique-Paths-III)|77.1%|Hard|| +|0981|Time Based Key-Value Store|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0981.Time-Based-Key-Value-Store)|54.1%|Medium|| |0982|Triples with Bitwise AND Equal To Zero||56.2%|Hard|| |0983|Minimum Cost For Tickets||62.7%|Medium|| -|0984|String Without AAA or BBB|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0984.String-Without-AAA-or-BBB)|38.5%|Medium|| +|0984|String Without AAA or BBB|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0984.String-Without-AAA-or-BBB)|38.6%|Medium|| |0985|Sum of Even Numbers After Queries|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0985.Sum-of-Even-Numbers-After-Queries)|60.7%|Easy|| -|0986|Interval List Intersections|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0986.Interval-List-Intersections)|68.1%|Medium|| -|0987|Vertical Order Traversal of a Binary Tree||37.7%|Medium|| +|0986|Interval List Intersections|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0986.Interval-List-Intersections)|68.3%|Medium|| +|0987|Vertical Order Traversal of a Binary Tree||38.7%|Hard|| |0988|Smallest String Starting From Leaf||46.7%|Medium|| -|0989|Add to Array-Form of Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0989.Add-to-Array-Form-of-Integer)|44.7%|Easy|| -|0990|Satisfiability of Equality Equations|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0990.Satisfiability-of-Equality-Equations)|46.6%|Medium|| +|0989|Add to Array-Form of Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0989.Add-to-Array-Form-of-Integer)|44.8%|Easy|| +|0990|Satisfiability of Equality Equations|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0990.Satisfiability-of-Equality-Equations)|46.7%|Medium|| |0991|Broken Calculator||46.4%|Medium|| -|0992|Subarrays with K Different Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0992.Subarrays-with-K-Different-Integers)|50.5%|Hard|| +|0992|Subarrays with K Different Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0992.Subarrays-with-K-Different-Integers)|50.6%|Hard|| |0993|Cousins in Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0993.Cousins-in-Binary-Tree)|52.3%|Easy|| |0994|Rotting Oranges||49.6%|Medium|| -|0995|Minimum Number of K Consecutive Bit Flips|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0995.Minimum-Number-of-K-Consecutive-Bit-Flips)|49.6%|Hard|| -|0996|Number of Squareful Arrays|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0996.Number-of-Squareful-Arrays)|48.0%|Hard|| +|0995|Minimum Number of K Consecutive Bit Flips|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0995.Minimum-Number-of-K-Consecutive-Bit-Flips)|49.7%|Hard|| +|0996|Number of Squareful Arrays|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0996.Number-of-Squareful-Arrays)|48.3%|Hard|| |0997|Find the Town Judge||49.8%|Easy|| -|0998|Maximum Binary Tree II||63.7%|Medium|| -|0999|Available Captures for Rook|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0999.Available-Captures-for-Rook)|67.1%|Easy|| +|0998|Maximum Binary Tree II||63.8%|Medium|| +|0999|Available Captures for Rook|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0999.Available-Captures-for-Rook)|67.7%|Easy|| |1000|Minimum Cost to Merge Stones||40.4%|Hard|| -|1001|Grid Illumination||36.6%|Hard|| -|1002|Find Common Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1002.Find-Common-Characters)|68.2%|Easy|| -|1003|Check If Word Is Valid After Substitutions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1003.Check-If-Word-Is-Valid-After-Substitutions)|56.2%|Medium|| -|1004|Max Consecutive Ones III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1004.Max-Consecutive-Ones-III)|60.6%|Medium|| +|1001|Grid Illumination||36.8%|Hard|| +|1002|Find Common Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1002.Find-Common-Characters)|68.5%|Easy|| +|1003|Check If Word Is Valid After Substitutions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1003.Check-If-Word-Is-Valid-After-Substitutions)|56.3%|Medium|| +|1004|Max Consecutive Ones III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1004.Max-Consecutive-Ones-III)|60.7%|Medium|| |1005|Maximize Sum Of Array After K Negations|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1005.Maximize-Sum-Of-Array-After-K-Negations)|52.3%|Easy|| |1006|Clumsy Factorial||53.7%|Medium|| |1007|Minimum Domino Rotations For Equal Row||50.9%|Medium|| -|1008|Construct Binary Search Tree from Preorder Traversal||78.7%|Medium|| +|1008|Construct Binary Search Tree from Preorder Traversal||78.8%|Medium|| |1009|Complement of Base 10 Integer||61.5%|Easy|| -|1010|Pairs of Songs With Total Durations Divisible by 60||49.9%|Medium|| -|1011|Capacity To Ship Packages Within D Days|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1011.Capacity-To-Ship-Packages-Within-D-Days)|59.6%|Medium|| +|1010|Pairs of Songs With Total Durations Divisible by 60||50.1%|Medium|| +|1011|Capacity To Ship Packages Within D Days|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1011.Capacity-To-Ship-Packages-Within-D-Days)|59.7%|Medium|| |1012|Numbers With Repeated Digits||37.7%|Hard|| -|1013|Partition Array Into Three Parts With Equal Sum||49.2%|Easy|| -|1014|Best Sightseeing Pair||52.8%|Medium|| +|1013|Partition Array Into Three Parts With Equal Sum||49.1%|Easy|| +|1014|Best Sightseeing Pair||52.9%|Medium|| |1015|Smallest Integer Divisible by K||41.8%|Medium|| |1016|Binary String With Substrings Representing 1 To N||59.0%|Medium|| |1017|Convert to Base -2|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1017.Convert-to-Base--2)|59.6%|Medium|| |1018|Binary Prefix Divisible By 5|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1018.Binary-Prefix-Divisible-By-5)|47.8%|Easy|| |1019|Next Greater Node In Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1019.Next-Greater-Node-In-Linked-List)|58.2%|Medium|| -|1020|Number of Enclaves|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1020.Number-of-Enclaves)|58.7%|Medium|| -|1021|Remove Outermost Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1021.Remove-Outermost-Parentheses)|78.7%|Easy|| +|1020|Number of Enclaves|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1020.Number-of-Enclaves)|58.9%|Medium|| +|1021|Remove Outermost Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1021.Remove-Outermost-Parentheses)|78.8%|Easy|| |1022|Sum of Root To Leaf Binary Numbers||71.5%|Easy|| |1023|Camelcase Matching||57.4%|Medium|| |1024|Video Stitching||49.0%|Medium|| |1025|Divisor Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1025.Divisor-Game)|66.2%|Easy|| -|1026|Maximum Difference Between Node and Ancestor|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1026.Maximum-Difference-Between-Node-and-Ancestor)|69.2%|Medium|| -|1027|Longest Arithmetic Subsequence||49.9%|Medium|| -|1028|Recover a Tree From Preorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1028.Recover-a-Tree-From-Preorder-Traversal)|70.8%|Hard|| -|1029|Two City Scheduling||57.7%|Medium|| +|1026|Maximum Difference Between Node and Ancestor|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1026.Maximum-Difference-Between-Node-and-Ancestor)|69.3%|Medium|| +|1027|Longest Arithmetic Subsequence||49.8%|Medium|| +|1028|Recover a Tree From Preorder Traversal|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1028.Recover-a-Tree-From-Preorder-Traversal)|70.9%|Hard|| +|1029|Two City Scheduling||57.8%|Medium|| |1030|Matrix Cells in Distance Order|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1030.Matrix-Cells-in-Distance-Order)|66.9%|Easy|| -|1031|Maximum Sum of Two Non-Overlapping Subarrays||58.8%|Medium|| -|1032|Stream of Characters||48.6%|Hard|| -|1033|Moving Stones Until Consecutive||43.0%|Easy|| -|1034|Coloring A Border||45.5%|Medium|| +|1031|Maximum Sum of Two Non-Overlapping Subarrays||58.9%|Medium|| +|1032|Stream of Characters||48.7%|Hard|| +|1033|Moving Stones Until Consecutive||43.1%|Easy|| +|1034|Coloring A Border||45.6%|Medium|| |1035|Uncrossed Lines||56.0%|Medium|| |1036|Escape a Large Maze||34.8%|Hard|| -|1037|Valid Boomerang|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1037.Valid-Boomerang)|37.9%|Easy|| -|1038|Binary Search Tree to Greater Sum Tree||82.0%|Medium|| -|1039|Minimum Score Triangulation of Polygon||50.1%|Medium|| -|1040|Moving Stones Until Consecutive II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1040.Moving-Stones-Until-Consecutive-II)|53.9%|Medium|| -|1041|Robot Bounded In Circle||54.8%|Medium|| +|1037|Valid Boomerang|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1037.Valid-Boomerang)|37.8%|Easy|| +|1038|Binary Search Tree to Greater Sum Tree||82.1%|Medium|| +|1039|Minimum Score Triangulation of Polygon||50.0%|Medium|| +|1040|Moving Stones Until Consecutive II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1040.Moving-Stones-Until-Consecutive-II)|54.1%|Medium|| +|1041|Robot Bounded In Circle||55.0%|Medium|| |1042|Flower Planting With No Adjacent||48.7%|Medium|| -|1043|Partition Array for Maximum Sum||66.6%|Medium|| -|1044|Longest Duplicate Substring||31.5%|Hard|| -|1045|Customers Who Bought All Products||68.3%|Medium|| +|1043|Partition Array for Maximum Sum||66.8%|Medium|| +|1044|Longest Duplicate Substring||31.4%|Hard|| +|1045|Customers Who Bought All Products||68.4%|Medium|| |1046|Last Stone Weight||62.4%|Easy|| -|1047|Remove All Adjacent Duplicates In String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1047.Remove-All-Adjacent-Duplicates-In-String)|70.3%|Easy|| -|1048|Longest String Chain||55.3%|Medium|| -|1049|Last Stone Weight II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1049.Last-Stone-Weight-II)|45.0%|Medium|| -|1050|Actors and Directors Who Cooperated At Least Three Times||72.3%|Easy|| -|1051|Height Checker|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1051.Height-Checker)|72.0%|Easy|| -|1052|Grumpy Bookstore Owner|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1052.Grumpy-Bookstore-Owner)|55.7%|Medium|| -|1053|Previous Permutation With One Swap||50.8%|Medium|| +|1047|Remove All Adjacent Duplicates In String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1047.Remove-All-Adjacent-Duplicates-In-String)|70.5%|Easy|| +|1048|Longest String Chain||55.4%|Medium|| +|1049|Last Stone Weight II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1049.Last-Stone-Weight-II)|45.2%|Medium|| +|1050|Actors and Directors Who Cooperated At Least Three Times||72.2%|Easy|| +|1051|Height Checker|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1051.Height-Checker)|72.2%|Easy|| +|1052|Grumpy Bookstore Owner|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1052.Grumpy-Bookstore-Owner)|55.8%|Medium|| +|1053|Previous Permutation With One Swap||51.0%|Medium|| |1054|Distant Barcodes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1054.Distant-Barcodes)|44.2%|Medium|| |1055|Shortest Way to Form String||57.1%|Medium|| |1056|Confusing Number||47.1%|Easy|| |1057|Campus Bikes||57.6%|Medium|| -|1058|Minimize Rounding Error to Meet Target||43.2%|Medium|| +|1058|Minimize Rounding Error to Meet Target||43.0%|Medium|| |1059|All Paths from Source Lead to Destination||43.2%|Medium|| |1060|Missing Element in Sorted Array||54.7%|Medium|| |1061|Lexicographically Smallest Equivalent String||66.8%|Medium|| -|1062|Longest Repeating Substring||58.0%|Medium|| -|1063|Number of Valid Subarrays||72.2%|Hard|| -|1064|Fixed Point||65.4%|Easy|| +|1062|Longest Repeating Substring||58.2%|Medium|| +|1063|Number of Valid Subarrays||72.1%|Hard|| +|1064|Fixed Point||65.3%|Easy|| |1065|Index Pairs of a String||60.9%|Easy|| |1066|Campus Bikes II||54.1%|Medium|| |1067|Digit Count in Range||41.1%|Hard|| |1068|Product Sales Analysis I||82.3%|Easy|| |1069|Product Sales Analysis II||83.3%|Easy|| |1070|Product Sales Analysis III||49.8%|Medium|| -|1071|Greatest Common Divisor of Strings||51.4%|Easy|| -|1072|Flip Columns For Maximum Number of Equal Rows||61.2%|Medium|| +|1071|Greatest Common Divisor of Strings||51.3%|Easy|| +|1072|Flip Columns For Maximum Number of Equal Rows||61.3%|Medium|| |1073|Adding Two Negabinary Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1073.Adding-Two-Negabinary-Numbers)|34.8%|Medium|| -|1074|Number of Submatrices That Sum to Target|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1074.Number-of-Submatrices-That-Sum-to-Target)|61.5%|Hard|| +|1074|Number of Submatrices That Sum to Target|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1074.Number-of-Submatrices-That-Sum-to-Target)|61.7%|Hard|| |1075|Project Employees I||66.1%|Easy|| -|1076|Project Employees II||53.2%|Easy|| +|1076|Project Employees II||53.1%|Easy|| |1077|Project Employees III||77.4%|Medium|| -|1078|Occurrences After Bigram|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1078.Occurrences-After-Bigram)|64.8%|Easy|| -|1079|Letter Tile Possibilities|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1079.Letter-Tile-Possibilities)|75.8%|Medium|| +|1078|Occurrences After Bigram|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1078.Occurrences-After-Bigram)|64.9%|Easy|| +|1079|Letter Tile Possibilities|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1079.Letter-Tile-Possibilities)|75.9%|Medium|| |1080|Insufficient Nodes in Root to Leaf Paths||49.8%|Medium|| -|1081|Smallest Subsequence of Distinct Characters||53.5%|Medium|| -|1082|Sales Analysis I||73.4%|Easy|| +|1081|Smallest Subsequence of Distinct Characters||53.4%|Medium|| +|1082|Sales Analysis I||73.5%|Easy|| |1083|Sales Analysis II||50.8%|Easy|| -|1084|Sales Analysis III||54.6%|Easy|| +|1084|Sales Analysis III||54.7%|Easy|| |1085|Sum of Digits in the Minimum Number||75.1%|Easy|| -|1086|High Five||78.6%|Easy|| -|1087|Brace Expansion||62.9%|Medium|| -|1088|Confusing Number II||45.2%|Hard|| +|1086|High Five||78.3%|Easy|| +|1087|Brace Expansion||63.0%|Medium|| +|1088|Confusing Number II||45.4%|Hard|| |1089|Duplicate Zeros|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1089.Duplicate-Zeros)|52.0%|Easy|| |1090|Largest Values From Labels||60.0%|Medium|| -|1091|Shortest Path in Binary Matrix||39.0%|Medium|| +|1091|Shortest Path in Binary Matrix||39.1%|Medium|| |1092|Shortest Common Supersequence ||52.9%|Hard|| |1093|Statistics from a Large Sample|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1093.Statistics-from-a-Large-Sample)|49.4%|Medium|| |1094|Car Pooling||59.1%|Medium|| -|1095|Find in Mountain Array||36.0%|Hard|| +|1095|Find in Mountain Array||36.1%|Hard|| |1096|Brace Expansion II||62.5%|Hard|| -|1097|Game Play Analysis V||56.3%|Hard|| +|1097|Game Play Analysis V||56.2%|Hard|| |1098|Unpopular Books||45.5%|Medium|| |1099|Two Sum Less Than K||60.8%|Easy|| -|1100|Find K-Length Substrings With No Repeated Characters||73.2%|Medium|| -|1101|The Earliest Moment When Everyone Become Friends||67.6%|Medium|| -|1102|Path With Maximum Minimum Value||50.2%|Medium|| -|1103|Distribute Candies to People||63.6%|Easy|| -|1104|Path In Zigzag Labelled Binary Tree||73.0%|Medium|| -|1105|Filling Bookcase Shelves|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1105.Filling-Bookcase-Shelves)|57.7%|Medium|| +|1100|Find K-Length Substrings With No Repeated Characters||73.3%|Medium|| +|1101|The Earliest Moment When Everyone Become Friends||67.9%|Medium|| +|1102|Path With Maximum Minimum Value||50.3%|Medium|| +|1103|Distribute Candies to People||63.5%|Easy|| +|1104|Path In Zigzag Labelled Binary Tree||73.1%|Medium|| +|1105|Filling Bookcase Shelves|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1105.Filling-Bookcase-Shelves)|57.5%|Medium|| |1106|Parsing A Boolean Expression||59.2%|Hard|| |1107|New Users Daily Count||45.8%|Medium|| |1108|Defanging an IP Address|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1108.Defanging-an-IP-Address)|88.5%|Easy|| -|1109|Corporate Flight Bookings||54.2%|Medium|| -|1110|Delete Nodes And Return Forest|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1110.Delete-Nodes-And-Return-Forest)|67.6%|Medium|| -|1111|Maximum Nesting Depth of Two Valid Parentheses Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings)|72.5%|Medium|| +|1109|Corporate Flight Bookings||54.3%|Medium|| +|1110|Delete Nodes And Return Forest|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1110.Delete-Nodes-And-Return-Forest)|67.7%|Medium|| +|1111|Maximum Nesting Depth of Two Valid Parentheses Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings)|72.7%|Medium|| |1112|Highest Grade For Each Student||71.9%|Medium|| -|1113|Reported Posts||65.5%|Easy|| +|1113|Reported Posts||65.7%|Easy|| |1114|Print in Order||67.0%|Easy|| -|1115|Print FooBar Alternately||59.1%|Medium|| -|1116|Print Zero Even Odd||57.6%|Medium|| +|1115|Print FooBar Alternately||59.0%|Medium|| +|1116|Print Zero Even Odd||57.7%|Medium|| |1117|Building H2O||53.1%|Medium|| |1118|Number of Days in a Month||57.6%|Easy|| |1119|Remove Vowels from a String||90.5%|Easy|| -|1120|Maximum Average Subtree||63.5%|Medium|| +|1120|Maximum Average Subtree||63.6%|Medium|| |1121|Divide Array Into Increasing Sequences||58.0%|Hard|| -|1122|Relative Sort Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1122.Relative-Sort-Array)|67.9%|Easy|| +|1122|Relative Sort Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1122.Relative-Sort-Array)|68.1%|Easy|| |1123|Lowest Common Ancestor of Deepest Leaves|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1123.Lowest-Common-Ancestor-of-Deepest-Leaves)|67.9%|Medium|| |1124|Longest Well-Performing Interval||33.3%|Medium|| -|1125|Smallest Sufficient Team||46.9%|Hard|| -|1126|Active Businesses||68.7%|Medium|| -|1127|User Purchase Platform||50.3%|Hard|| +|1125|Smallest Sufficient Team||47.0%|Hard|| +|1126|Active Businesses||68.6%|Medium|| +|1127|User Purchase Platform||50.2%|Hard|| |1128|Number of Equivalent Domino Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1128.Number-of-Equivalent-Domino-Pairs)|46.6%|Easy|| -|1129|Shortest Path with Alternating Colors||40.1%|Medium|| -|1130|Minimum Cost Tree From Leaf Values||67.2%|Medium|| +|1129|Shortest Path with Alternating Colors||40.2%|Medium|| +|1130|Minimum Cost Tree From Leaf Values||67.3%|Medium|| |1131|Maximum of Absolute Value Expression||52.1%|Medium|| |1132|Reported Posts II||34.6%|Medium|| |1133|Largest Unique Number||67.2%|Easy|| -|1134|Armstrong Number||78.2%|Easy|| -|1135|Connecting Cities With Minimum Cost||59.1%|Medium|| +|1134|Armstrong Number||78.3%|Easy|| +|1135|Connecting Cities With Minimum Cost||59.3%|Medium|| |1136|Parallel Courses||61.2%|Hard|| -|1137|N-th Tribonacci Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1137.N-th-Tribonacci-Number)|56.1%|Easy|| -|1138|Alphabet Board Path||50.7%|Medium|| +|1137|N-th Tribonacci Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1137.N-th-Tribonacci-Number)|56.0%|Easy|| +|1138|Alphabet Board Path||50.9%|Medium|| |1139|Largest 1-Bordered Square||48.5%|Medium|| -|1140|Stone Game II||64.7%|Medium|| +|1140|Stone Game II||64.8%|Medium|| |1141|User Activity for the Past 30 Days I||54.4%|Easy|| -|1142|User Activity for the Past 30 Days II||35.3%|Easy|| +|1142|User Activity for the Past 30 Days II||35.4%|Easy|| |1143|Longest Common Subsequence||58.6%|Medium|| |1144|Decrease Elements To Make Array Zigzag||46.1%|Medium|| |1145|Binary Tree Coloring Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1145.Binary-Tree-Coloring-Game)|51.4%|Medium|| |1146|Snapshot Array||36.9%|Medium|| -|1147|Longest Chunked Palindrome Decomposition||59.4%|Hard|| +|1147|Longest Chunked Palindrome Decomposition||59.5%|Hard|| |1148|Article Views I||77.0%|Easy|| -|1149|Article Views II||48.4%|Medium|| -|1150|Check If a Number Is Majority Element in a Sorted Array||57.8%|Easy|| -|1151|Minimum Swaps to Group All 1's Together||58.3%|Medium|| -|1152|Analyze User Website Visit Pattern||43.2%|Medium|| -|1153|String Transforms Into Another String||35.9%|Hard|| +|1149|Article Views II||48.3%|Medium|| +|1150|Check If a Number Is Majority Element in a Sorted Array||57.6%|Easy|| +|1151|Minimum Swaps to Group All 1's Together||58.5%|Medium|| +|1152|Analyze User Website Visit Pattern||43.4%|Medium|| +|1153|String Transforms Into Another String||36.0%|Hard|| |1154|Day of the Year|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1154.Day-of-the-Year)|49.3%|Easy|| |1155|Number of Dice Rolls With Target Sum||47.5%|Medium|| -|1156|Swap For Longest Repeated Character Substring||47.4%|Medium|| +|1156|Swap For Longest Repeated Character Substring||47.3%|Medium|| |1157|Online Majority Element In Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1157.Online-Majority-Element-In-Subarray)|39.6%|Hard|| -|1158|Market Analysis I||63.6%|Medium|| -|1159|Market Analysis II||55.1%|Hard|| -|1160|Find Words That Can Be Formed by Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1160.Find-Words-That-Can-Be-Formed-by-Characters)|67.6%|Easy|| -|1161|Maximum Level Sum of a Binary Tree||69.9%|Medium|| -|1162|As Far from Land as Possible||45.0%|Medium|| +|1158|Market Analysis I||63.9%|Medium|| +|1159|Market Analysis II||55.2%|Hard|| +|1160|Find Words That Can Be Formed by Characters|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1160.Find-Words-That-Can-Be-Formed-by-Characters)|67.9%|Easy|| +|1161|Maximum Level Sum of a Binary Tree||69.8%|Medium|| +|1162|As Far from Land as Possible||45.1%|Medium|| |1163|Last Substring in Lexicographical Order||36.2%|Hard|| -|1164|Product Price at a Given Date||68.2%|Medium|| +|1164|Product Price at a Given Date||68.4%|Medium|| |1165|Single-Row Keyboard||84.8%|Easy|| -|1166|Design File System||58.3%|Medium|| -|1167|Minimum Cost to Connect Sticks||64.2%|Medium|| -|1168|Optimize Water Distribution in a Village||61.7%|Hard|| -|1169|Invalid Transactions||31.4%|Medium|| +|1166|Design File System||58.5%|Medium|| +|1167|Minimum Cost to Connect Sticks||64.4%|Medium|| +|1168|Optimize Water Distribution in a Village||61.4%|Hard|| +|1169|Invalid Transactions||31.2%|Medium|| |1170|Compare Strings by Frequency of the Smallest Character|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character)|59.5%|Medium|| -|1171|Remove Zero Sum Consecutive Nodes from Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List)|41.4%|Medium|| +|1171|Remove Zero Sum Consecutive Nodes from Linked List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List)|41.5%|Medium|| |1172|Dinner Plate Stacks||37.9%|Hard|| |1173|Immediate Food Delivery I||82.3%|Easy|| -|1174|Immediate Food Delivery II||61.3%|Medium|| -|1175|Prime Arrangements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1175.Prime-Arrangements)|51.9%|Easy|| +|1174|Immediate Food Delivery II||61.6%|Medium|| +|1175|Prime Arrangements|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1175.Prime-Arrangements)|52.0%|Easy|| |1176|Diet Plan Performance||54.1%|Easy|| |1177|Can Make Palindrome from Substring||36.1%|Medium|| -|1178|Number of Valid Words for Each Puzzle||38.6%|Hard|| -|1179|Reformat Department Table||82.0%|Easy|| -|1180|Count Substrings with Only One Distinct Letter||77.6%|Easy|| +|1178|Number of Valid Words for Each Puzzle||38.8%|Hard|| +|1179|Reformat Department Table||81.9%|Easy|| +|1180|Count Substrings with Only One Distinct Letter||77.7%|Easy|| |1181|Before and After Puzzle||44.5%|Medium|| -|1182|Shortest Distance to Target Color||53.3%|Medium|| -|1183|Maximum Number of Ones||57.0%|Hard|| +|1182|Shortest Distance to Target Color||53.4%|Medium|| +|1183|Maximum Number of Ones||57.2%|Hard|| |1184|Distance Between Bus Stops|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1184.Distance-Between-Bus-Stops)|54.1%|Easy|| -|1185|Day of the Week|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1185.Day-of-the-Week)|61.8%|Easy|| -|1186|Maximum Subarray Sum with One Deletion||38.5%|Medium|| -|1187|Make Array Strictly Increasing||41.7%|Hard|| -|1188|Design Bounded Blocking Queue||72.6%|Medium|| +|1185|Day of the Week|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1185.Day-of-the-Week)|61.7%|Easy|| +|1186|Maximum Subarray Sum with One Deletion||38.6%|Medium|| +|1187|Make Array Strictly Increasing||41.8%|Hard|| +|1188|Design Bounded Blocking Queue||72.7%|Medium|| |1189|Maximum Number of Balloons|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1189.Maximum-Number-of-Balloons)|61.7%|Easy|| -|1190|Reverse Substrings Between Each Pair of Parentheses||64.1%|Medium|| -|1191|K-Concatenation Maximum Sum||25.4%|Medium|| -|1192|Critical Connections in a Network||49.9%|Hard|| -|1193|Monthly Transactions I||69.2%|Medium|| -|1194|Tournament Winners||51.7%|Hard|| -|1195|Fizz Buzz Multithreaded||70.5%|Medium|| +|1190|Reverse Substrings Between Each Pair of Parentheses||64.0%|Medium|| +|1191|K-Concatenation Maximum Sum||25.3%|Medium|| +|1192|Critical Connections in a Network||50.0%|Hard|| +|1193|Monthly Transactions I||69.3%|Medium|| +|1194|Tournament Winners||51.9%|Hard|| +|1195|Fizz Buzz Multithreaded||70.6%|Medium|| |1196|How Many Apples Can You Put into the Basket||68.1%|Easy|| |1197|Minimum Knight Moves||37.1%|Medium|| -|1198|Find Smallest Common Element in All Rows||75.3%|Medium|| -|1199|Minimum Time to Build Blocks||38.5%|Hard|| -|1200|Minimum Absolute Difference|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1200.Minimum-Absolute-Difference)|66.8%|Easy|| +|1198|Find Smallest Common Element in All Rows||75.2%|Medium|| +|1199|Minimum Time to Build Blocks||38.6%|Hard|| +|1200|Minimum Absolute Difference|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1200.Minimum-Absolute-Difference)|66.9%|Easy|| |1201|Ugly Number III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1201.Ugly-Number-III)|26.4%|Medium|| -|1202|Smallest String With Swaps|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1202.Smallest-String-With-Swaps)|48.5%|Medium|| -|1203|Sort Items by Groups Respecting Dependencies|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1203.Sort-Items-by-Groups-Respecting-Dependencies)|49.1%|Hard|| +|1202|Smallest String With Swaps|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1202.Smallest-String-With-Swaps)|48.6%|Medium|| +|1203|Sort Items by Groups Respecting Dependencies|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1203.Sort-Items-by-Groups-Respecting-Dependencies)|48.9%|Hard|| |1204|Last Person to Fit in the Elevator||71.5%|Medium|| -|1205|Monthly Transactions II||45.9%|Medium|| -|1206|Design Skiplist||58.9%|Hard|| -|1207|Unique Number of Occurrences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1207.Unique-Number-of-Occurrences)|71.6%|Easy|| -|1208|Get Equal Substrings Within Budget|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1208.Get-Equal-Substrings-Within-Budget)|43.7%|Medium|| -|1209|Remove All Adjacent Duplicates in String II||57.3%|Medium|| -|1210|Minimum Moves to Reach Target with Rotations||46.2%|Hard|| -|1211|Queries Quality and Percentage||69.7%|Easy|| +|1205|Monthly Transactions II||45.8%|Medium|| +|1206|Design Skiplist||59.0%|Hard|| +|1207|Unique Number of Occurrences|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1207.Unique-Number-of-Occurrences)|71.7%|Easy|| +|1208|Get Equal Substrings Within Budget|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1208.Get-Equal-Substrings-Within-Budget)|43.8%|Medium|| +|1209|Remove All Adjacent Duplicates in String II||57.5%|Medium|| +|1210|Minimum Moves to Reach Target with Rotations||46.3%|Hard|| +|1211|Queries Quality and Percentage||69.9%|Easy|| |1212|Team Scores in Football Tournament||56.7%|Medium|| |1213|Intersection of Three Sorted Arrays||79.3%|Easy|| -|1214|Two Sum BSTs||67.8%|Medium|| -|1215|Stepping Numbers||43.1%|Medium|| -|1216|Valid Palindrome III||49.5%|Hard|| +|1214|Two Sum BSTs||67.7%|Medium|| +|1215|Stepping Numbers||43.3%|Medium|| +|1216|Valid Palindrome III||49.7%|Hard|| |1217|Minimum Cost to Move Chips to The Same Position|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position)|71.2%|Easy|| |1218|Longest Arithmetic Subsequence of Given Difference||46.5%|Medium|| -|1219|Path with Maximum Gold||65.6%|Medium|| -|1220|Count Vowels Permutation||54.3%|Hard|| +|1219|Path with Maximum Gold||65.7%|Medium|| +|1220|Count Vowels Permutation||54.2%|Hard|| |1221|Split a String in Balanced Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1221.Split-a-String-in-Balanced-Strings)|84.1%|Easy|| -|1222|Queens That Can Attack the King||69.4%|Medium|| -|1223|Dice Roll Simulation||46.7%|Hard|| -|1224|Maximum Equal Frequency||34.5%|Hard|| +|1222|Queens That Can Attack the King||69.5%|Medium|| +|1223|Dice Roll Simulation||46.6%|Hard|| +|1224|Maximum Equal Frequency||34.4%|Hard|| |1225|Report Contiguous Dates||62.6%|Hard|| -|1226|The Dining Philosophers||59.8%|Medium|| -|1227|Airplane Seat Assignment Probability||62.0%|Medium|| -|1228|Missing Number In Arithmetic Progression||51.6%|Easy|| -|1229|Meeting Scheduler||54.3%|Medium|| -|1230|Toss Strange Coins||49.8%|Medium|| -|1231|Divide Chocolate||53.3%|Hard|| -|1232|Check If It Is a Straight Line|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1232.Check-If-It-Is-a-Straight-Line)|43.8%|Easy|| -|1233|Remove Sub-Folders from the Filesystem||61.7%|Medium|| -|1234|Replace the Substring for Balanced String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1234.Replace-the-Substring-for-Balanced-String)|34.4%|Medium|| -|1235|Maximum Profit in Job Scheduling|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1235.Maximum-Profit-in-Job-Scheduling)|47.0%|Hard|| -|1236|Web Crawler||64.6%|Medium|| +|1226|The Dining Philosophers||59.7%|Medium|| +|1227|Airplane Seat Assignment Probability||62.1%|Medium|| +|1228|Missing Number In Arithmetic Progression||51.5%|Easy|| +|1229|Meeting Scheduler||54.4%|Medium|| +|1230|Toss Strange Coins||49.9%|Medium|| +|1231|Divide Chocolate||53.5%|Hard|| +|1232|Check If It Is a Straight Line|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1232.Check-If-It-Is-a-Straight-Line)|43.7%|Easy|| +|1233|Remove Sub-Folders from the Filesystem||61.9%|Medium|| +|1234|Replace the Substring for Balanced String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1234.Replace-the-Substring-for-Balanced-String)|34.3%|Medium|| +|1235|Maximum Profit in Job Scheduling|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1235.Maximum-Profit-in-Job-Scheduling)|47.3%|Hard|| +|1236|Web Crawler||64.7%|Medium|| |1237|Find Positive Integer Solution for a Given Equation||69.6%|Medium|| -|1238|Circular Permutation in Binary Representation||65.9%|Medium|| -|1239|Maximum Length of a Concatenated String with Unique Characters||49.4%|Medium|| -|1240|Tiling a Rectangle with the Fewest Squares||52.3%|Hard|| -|1241|Number of Comments per Post||67.6%|Easy|| -|1242|Web Crawler Multithreaded||47.9%|Medium|| +|1238|Circular Permutation in Binary Representation||66.1%|Medium|| +|1239|Maximum Length of a Concatenated String with Unique Characters||49.5%|Medium|| +|1240|Tiling a Rectangle with the Fewest Squares||52.4%|Hard|| +|1241|Number of Comments per Post||67.8%|Easy|| +|1242|Web Crawler Multithreaded||47.7%|Medium|| |1243|Array Transformation||50.2%|Easy|| |1244|Design A Leaderboard||65.7%|Medium|| -|1245|Tree Diameter||61.2%|Medium|| +|1245|Tree Diameter||61.3%|Medium|| |1246|Palindrome Removal||45.8%|Hard|| -|1247|Minimum Swaps to Make Strings Equal||62.3%|Medium|| +|1247|Minimum Swaps to Make Strings Equal||62.4%|Medium|| |1248|Count Number of Nice Subarrays||56.2%|Medium|| -|1249|Minimum Remove to Make Valid Parentheses||63.6%|Medium|| -|1250|Check If It Is a Good Array||56.3%|Hard|| -|1251|Average Selling Price||82.5%|Easy|| +|1249|Minimum Remove to Make Valid Parentheses||63.7%|Medium|| +|1250|Check If It Is a Good Array||56.2%|Hard|| +|1251|Average Selling Price||82.4%|Easy|| |1252|Cells with Odd Values in a Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1252.Cells-with-Odd-Values-in-a-Matrix)|78.8%|Easy|| -|1253|Reconstruct a 2-Row Binary Matrix||41.4%|Medium|| +|1253|Reconstruct a 2-Row Binary Matrix||41.5%|Medium|| |1254|Number of Closed Islands|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1254.Number-of-Closed-Islands)|61.5%|Medium|| -|1255|Maximum Score Words Formed by Letters||69.7%|Hard|| -|1256|Encode Number||67.5%|Medium|| -|1257|Smallest Common Region||60.5%|Medium|| -|1258|Synonymous Sentences||64.4%|Medium|| -|1259|Handshakes That Don't Cross||54.1%|Hard|| +|1255|Maximum Score Words Formed by Letters||69.8%|Hard|| +|1256|Encode Number||67.6%|Medium|| +|1257|Smallest Common Region||60.7%|Medium|| +|1258|Synonymous Sentences||64.0%|Medium|| +|1259|Handshakes That Don't Cross||54.2%|Hard|| |1260|Shift 2D Grid|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1260.Shift-2D-Grid)|61.8%|Easy|| -|1261|Find Elements in a Contaminated Binary Tree||74.5%|Medium|| -|1262|Greatest Sum Divisible by Three||49.3%|Medium|| -|1263|Minimum Moves to Move a Box to Their Target Location||43.1%|Hard|| -|1264|Page Recommendations||69.1%|Medium|| +|1261|Find Elements in a Contaminated Binary Tree||74.6%|Medium|| +|1262|Greatest Sum Divisible by Three||49.5%|Medium|| +|1263|Minimum Moves to Move a Box to Their Target Location||43.2%|Hard|| +|1264|Page Recommendations||69.2%|Medium|| |1265|Print Immutable Linked List in Reverse||94.4%|Medium|| -|1266|Minimum Time Visiting All Points|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1266.Minimum-Time-Visiting-All-Points)|79.4%|Easy|| +|1266|Minimum Time Visiting All Points|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1266.Minimum-Time-Visiting-All-Points)|79.5%|Easy|| |1267|Count Servers that Communicate||57.8%|Medium|| -|1268|Search Suggestions System||64.5%|Medium|| +|1268|Search Suggestions System||64.6%|Medium|| |1269|Number of Ways to Stay in the Same Place After Some Steps||43.3%|Hard|| |1270|All People Report to the Given Manager||88.2%|Medium|| |1271|Hexspeak||55.4%|Easy|| |1272|Remove Interval||57.9%|Medium|| |1273|Delete Tree Nodes||62.4%|Medium|| -|1274|Number of Ships in a Rectangle||66.3%|Hard|| -|1275|Find Winner on a Tic Tac Toe Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1275.Find-Winner-on-a-Tic-Tac-Toe-Game)|53.0%|Easy|| +|1274|Number of Ships in a Rectangle||66.2%|Hard|| +|1275|Find Winner on a Tic Tac Toe Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1275.Find-Winner-on-a-Tic-Tac-Toe-Game)|52.9%|Easy|| |1276|Number of Burgers with No Waste of Ingredients||50.0%|Medium|| |1277|Count Square Submatrices with All Ones||72.9%|Medium|| -|1278|Palindrome Partitioning III||60.7%|Hard|| -|1279|Traffic Light Controlled Intersection||75.7%|Easy|| -|1280|Students and Examinations||74.3%|Easy|| +|1278|Palindrome Partitioning III||60.9%|Hard|| +|1279|Traffic Light Controlled Intersection||75.6%|Easy|| +|1280|Students and Examinations||74.6%|Easy|| |1281|Subtract the Product and Sum of Digits of an Integer|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer)|85.6%|Easy|| |1282|Group the People Given the Group Size They Belong To||84.3%|Medium|| -|1283|Find the Smallest Divisor Given a Threshold|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1283.Find-the-Smallest-Divisor-Given-a-Threshold)|49.3%|Medium|| -|1284|Minimum Number of Flips to Convert Binary Matrix to Zero Matrix||70.2%|Hard|| -|1285|Find the Start and End Number of Continuous Ranges||87.0%|Medium|| +|1283|Find the Smallest Divisor Given a Threshold|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1283.Find-the-Smallest-Divisor-Given-a-Threshold)|49.4%|Medium|| +|1284|Minimum Number of Flips to Convert Binary Matrix to Zero Matrix||70.3%|Hard|| +|1285|Find the Start and End Number of Continuous Ranges||87.2%|Medium|| |1286|Iterator for Combination||70.9%|Medium|| |1287|Element Appearing More Than 25% In Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1287.Element-Appearing-More-Than-25%-In-Sorted-Array)|60.2%|Easy|| |1288|Remove Covered Intervals||57.2%|Medium|| @@ -1431,452 +1431,468 @@ |1291|Sequential Digits||57.4%|Medium|| |1292|Maximum Side Length of a Square with Sum Less than or Equal to Threshold||50.5%|Medium|| |1293|Shortest Path in a Grid with Obstacles Elimination||42.9%|Hard|| -|1294|Weather Type in Each Country||66.3%|Easy|| -|1295|Find Numbers with Even Number of Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1295.Find-Numbers-with-Even-Number-of-Digits)|79.3%|Easy|| -|1296|Divide Array in Sets of K Consecutive Numbers||55.3%|Medium|| -|1297|Maximum Number of Occurrences of a Substring||49.4%|Medium|| +|1294|Weather Type in Each Country||66.7%|Easy|| +|1295|Find Numbers with Even Number of Digits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1295.Find-Numbers-with-Even-Number-of-Digits)|79.2%|Easy|| +|1296|Divide Array in Sets of K Consecutive Numbers||55.4%|Medium|| +|1297|Maximum Number of Occurrences of a Substring||49.7%|Medium|| |1298|Maximum Candies You Can Get from Boxes||59.7%|Hard|| -|1299|Replace Elements with Greatest Element on Right Side|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1299.Replace-Elements-with-Greatest-Element-on-Right-Side)|74.4%|Easy|| -|1300|Sum of Mutated Array Closest to Target|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1300.Sum-of-Mutated-Array-Closest-to-Target)|43.2%|Medium|| +|1299|Replace Elements with Greatest Element on Right Side|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1299.Replace-Elements-with-Greatest-Element-on-Right-Side)|74.5%|Easy|| +|1300|Sum of Mutated Array Closest to Target|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1300.Sum-of-Mutated-Array-Closest-to-Target)|43.1%|Medium|| |1301|Number of Paths with Max Score||38.1%|Hard|| -|1302|Deepest Leaves Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1302.Deepest-Leaves-Sum)|84.1%|Medium|| -|1303|Find the Team Size||89.5%|Easy|| -|1304|Find N Unique Integers Sum up to Zero|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1304.Find-N-Unique-Integers-Sum-up-to-Zero)|76.8%|Easy|| +|1302|Deepest Leaves Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1302.Deepest-Leaves-Sum)|84.2%|Medium|| +|1303|Find the Team Size||89.6%|Easy|| +|1304|Find N Unique Integers Sum up to Zero|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1304.Find-N-Unique-Integers-Sum-up-to-Zero)|76.9%|Easy|| |1305|All Elements in Two Binary Search Trees|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1305.All-Elements-in-Two-Binary-Search-Trees)|77.8%|Medium|| |1306|Jump Game III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1306.Jump-Game-III)|62.6%|Medium|| -|1307|Verbal Arithmetic Puzzle||37.0%|Hard|| -|1308|Running Total for Different Genders||87.2%|Medium|| -|1309|Decrypt String from Alphabet to Integer Mapping||77.2%|Easy|| +|1307|Verbal Arithmetic Puzzle||36.9%|Hard|| +|1308|Running Total for Different Genders||87.4%|Medium|| +|1309|Decrypt String from Alphabet to Integer Mapping||77.3%|Easy|| |1310|XOR Queries of a Subarray||69.2%|Medium|| -|1311|Get Watched Videos by Your Friends||44.1%|Medium|| -|1312|Minimum Insertion Steps to Make a String Palindrome||59.4%|Hard|| +|1311|Get Watched Videos by Your Friends||44.2%|Medium|| +|1312|Minimum Insertion Steps to Make a String Palindrome||59.5%|Hard|| |1313|Decompress Run-Length Encoded List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1313.Decompress-Run-Length-Encoded-List)|85.4%|Easy|| -|1314|Matrix Block Sum||73.7%|Medium|| +|1314|Matrix Block Sum||73.6%|Medium|| |1315|Sum of Nodes with Even-Valued Grandparent||84.2%|Medium|| -|1316|Distinct Echo Substrings||49.7%|Hard|| +|1316|Distinct Echo Substrings||49.6%|Hard|| |1317|Convert Integer to the Sum of Two No-Zero Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers)|56.8%|Easy|| -|1318|Minimum Flips to Make a OR b Equal to c||63.8%|Medium|| -|1319|Number of Operations to Make Network Connected|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1319.Number-of-Operations-to-Make-Network-Connected)|55.1%|Medium|| -|1320|Minimum Distance to Type a Word Using Two Fingers||62.8%|Hard|| -|1321|Restaurant Growth||70.8%|Medium|| -|1322|Ads Performance||57.7%|Easy|| -|1323|Maximum 69 Number||78.0%|Easy|| -|1324|Print Words Vertically||58.7%|Medium|| -|1325|Delete Leaves With a Given Value||73.6%|Medium|| -|1326|Minimum Number of Taps to Open to Water a Garden||46.3%|Hard|| +|1318|Minimum Flips to Make a OR b Equal to c||63.9%|Medium|| +|1319|Number of Operations to Make Network Connected|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1319.Number-of-Operations-to-Make-Network-Connected)|55.2%|Medium|| +|1320|Minimum Distance to Type a Word Using Two Fingers||62.1%|Hard|| +|1321|Restaurant Growth||70.9%|Medium|| +|1322|Ads Performance||58.0%|Easy|| +|1323|Maximum 69 Number||77.9%|Easy|| +|1324|Print Words Vertically||58.8%|Medium|| +|1325|Delete Leaves With a Given Value||73.7%|Medium|| +|1326|Minimum Number of Taps to Open to Water a Garden||46.4%|Hard|| |1327|List the Products Ordered in a Period||77.4%|Easy|| -|1328|Break a Palindrome||45.8%|Medium|| +|1328|Break a Palindrome||46.0%|Medium|| |1329|Sort the Matrix Diagonally|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1329.Sort-the-Matrix-Diagonally)|81.8%|Medium|| -|1330|Reverse Subarray To Maximize Array Value||36.6%|Hard|| +|1330|Reverse Subarray To Maximize Array Value||36.5%|Hard|| |1331|Rank Transform of an Array||57.6%|Easy|| -|1332|Remove Palindromic Subsequences||62.8%|Easy|| -|1333|Filter Restaurants by Vegan-Friendly, Price and Distance||57.0%|Medium|| -|1334|Find the City With the Smallest Number of Neighbors at a Threshold Distance||46.6%|Medium|| -|1335|Minimum Difficulty of a Job Schedule||57.1%|Hard|| -|1336|Number of Transactions per Visit||47.5%|Hard|| -|1337|The K Weakest Rows in a Matrix||69.9%|Easy|| +|1332|Remove Palindromic Subsequences||62.7%|Easy|| +|1333|Filter Restaurants by Vegan-Friendly, Price and Distance||57.1%|Medium|| +|1334|Find the City With the Smallest Number of Neighbors at a Threshold Distance||46.7%|Medium|| +|1335|Minimum Difficulty of a Job Schedule||57.0%|Hard|| +|1336|Number of Transactions per Visit||47.8%|Hard|| +|1337|The K Weakest Rows in a Matrix||70.4%|Easy|| |1338|Reduce Array Size to The Half||66.8%|Medium|| -|1339|Maximum Product of Splitted Binary Tree||38.2%|Medium|| -|1340|Jump Game V||59.0%|Hard|| +|1339|Maximum Product of Splitted Binary Tree||38.3%|Medium|| +|1340|Jump Game V||59.1%|Hard|| |1341|Movie Rating||58.5%|Medium|| -|1342|Number of Steps to Reduce a Number to Zero||85.7%|Easy|| -|1343|Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold||64.6%|Medium|| -|1344|Angle Between Hands of a Clock||61.2%|Medium|| +|1342|Number of Steps to Reduce a Number to Zero||85.6%|Easy|| +|1343|Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold||64.7%|Medium|| +|1344|Angle Between Hands of a Clock||61.3%|Medium|| |1345|Jump Game IV||41.9%|Hard|| |1346|Check If N and Its Double Exist||36.4%|Easy|| -|1347|Minimum Number of Steps to Make Two Strings Anagram||75.3%|Medium|| -|1348|Tweet Counts Per Frequency||34.5%|Medium|| -|1349|Maximum Students Taking Exam||44.1%|Hard|| -|1350|Students With Invalid Departments||90.7%|Easy|| +|1347|Minimum Number of Steps to Make Two Strings Anagram||75.2%|Medium|| +|1348|Tweet Counts Per Frequency||35.2%|Medium|| +|1349|Maximum Students Taking Exam||44.2%|Hard|| +|1350|Students With Invalid Departments||90.4%|Easy|| |1351|Count Negative Numbers in a Sorted Matrix||76.0%|Easy|| -|1352|Product of the Last K Numbers||44.0%|Medium|| -|1353|Maximum Number of Events That Can Be Attended||30.1%|Medium|| +|1352|Product of the Last K Numbers||44.2%|Medium|| +|1353|Maximum Number of Events That Can Be Attended||30.4%|Medium|| |1354|Construct Target Array With Multiple Sums||31.3%|Hard|| -|1355|Activity Participants||74.2%|Medium|| -|1356|Sort Integers by The Number of 1 Bits||69.6%|Easy|| -|1357|Apply Discount Every n Orders||66.6%|Medium|| -|1358|Number of Substrings Containing All Three Characters||60.4%|Medium|| -|1359|Count All Valid Pickup and Delivery Options||56.7%|Hard|| +|1355|Activity Participants||74.4%|Medium|| +|1356|Sort Integers by The Number of 1 Bits||69.7%|Easy|| +|1357|Apply Discount Every n Orders||66.7%|Medium|| +|1358|Number of Substrings Containing All Three Characters||60.5%|Medium|| +|1359|Count All Valid Pickup and Delivery Options||56.6%|Hard|| |1360|Number of Days Between Two Dates||46.9%|Easy|| -|1361|Validate Binary Tree Nodes||44.2%|Medium|| -|1362|Closest Divisors||57.6%|Medium|| -|1363|Largest Multiple of Three||34.0%|Hard|| -|1364|Number of Trusted Contacts of a Customer||78.2%|Medium|| +|1361|Validate Binary Tree Nodes||44.0%|Medium|| +|1362|Closest Divisors||57.7%|Medium|| +|1363|Largest Multiple of Three||34.1%|Hard|| +|1364|Number of Trusted Contacts of a Customer||78.5%|Medium|| |1365|How Many Numbers Are Smaller Than the Current Number||86.0%|Easy|| -|1366|Rank Teams by Votes||55.0%|Medium|| +|1366|Rank Teams by Votes||55.1%|Medium|| |1367|Linked List in Binary Tree||41.1%|Medium|| |1368|Minimum Cost to Make at Least One Valid Path in a Grid||57.0%|Hard|| -|1369|Get the Second Most Recent Activity||68.6%|Hard|| -|1370|Increasing Decreasing String||76.5%|Easy|| -|1371|Find the Longest Substring Containing Vowels in Even Counts||61.1%|Medium|| -|1372|Longest ZigZag Path in a Binary Tree||54.6%|Medium|| -|1373|Maximum Sum BST in Binary Tree||37.5%|Hard|| +|1369|Get the Second Most Recent Activity||68.7%|Hard|| +|1370|Increasing Decreasing String||76.6%|Easy|| +|1371|Find the Longest Substring Containing Vowels in Even Counts||61.0%|Medium|| +|1372|Longest ZigZag Path in a Binary Tree||54.8%|Medium|| +|1373|Maximum Sum BST in Binary Tree||37.4%|Hard|| |1374|Generate a String With Characters That Have Odd Counts||76.2%|Easy|| -|1375|Bulb Switcher III||64.1%|Medium|| -|1376|Time Needed to Inform All Employees||56.3%|Medium|| -|1377|Frog Position After T Seconds||34.9%|Hard|| -|1378|Replace Employee ID With The Unique Identifier||89.9%|Easy|| -|1379|Find a Corresponding Node of a Binary Tree in a Clone of That Tree||84.9%|Medium|| +|1375|Bulb Switcher III||64.2%|Medium|| +|1376|Time Needed to Inform All Employees||56.4%|Medium|| +|1377|Frog Position After T Seconds||35.2%|Hard|| +|1378|Replace Employee ID With The Unique Identifier||90.0%|Easy|| +|1379|Find a Corresponding Node of a Binary Tree in a Clone of That Tree||84.7%|Medium|| |1380|Lucky Numbers in a Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1380.Lucky-Numbers-in-a-Matrix)|70.8%|Easy|| -|1381|Design a Stack With Increment Operation||75.8%|Medium|| +|1381|Design a Stack With Increment Operation||76.1%|Medium|| |1382|Balance a Binary Search Tree||76.2%|Medium|| -|1383|Maximum Performance of a Team||35.3%|Hard|| -|1384|Total Sales Amount by Year||64.5%|Hard|| +|1383|Maximum Performance of a Team||35.5%|Hard|| +|1384|Total Sales Amount by Year||64.6%|Hard|| |1385|Find the Distance Value Between Two Arrays|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1385.Find-the-Distance-Value-Between-Two-Arrays)|66.4%|Easy|| |1386|Cinema Seat Allocation||35.6%|Medium|| -|1387|Sort Integers by The Power Value||70.5%|Medium|| -|1388|Pizza With 3n Slices||45.5%|Hard|| +|1387|Sort Integers by The Power Value||70.4%|Medium|| +|1388|Pizza With 3n Slices||45.6%|Hard|| |1389|Create Target Array in the Given Order|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1389.Create-Target-Array-in-the-Given-Order)|84.8%|Easy|| -|1390|Four Divisors||39.0%|Medium|| -|1391|Check if There is a Valid Path in a Grid||45.0%|Medium|| -|1392|Longest Happy Prefix||41.3%|Hard|| -|1393|Capital Gain/Loss||90.5%|Medium|| -|1394|Find Lucky Integer in an Array||63.3%|Easy|| -|1395|Count Number of Teams||80.2%|Medium|| -|1396|Design Underground System||69.1%|Medium|| -|1397|Find All Good Strings||38.2%|Hard|| +|1390|Four Divisors||39.1%|Medium|| +|1391|Check if There is a Valid Path in a Grid||44.9%|Medium|| +|1392|Longest Happy Prefix||41.8%|Hard|| +|1393|Capital Gain/Loss||90.6%|Medium|| +|1394|Find Lucky Integer in an Array||63.2%|Easy|| +|1395|Count Number of Teams||79.1%|Medium|| +|1396|Design Underground System||69.5%|Medium|| +|1397|Find All Good Strings||38.3%|Hard|| |1398|Customers Who Bought Products A and B but Not C||82.0%|Medium|| -|1399|Count Largest Group||65.4%|Easy|| +|1399|Count Largest Group||65.3%|Easy|| |1400|Construct K Palindrome Strings||62.7%|Medium|| |1401|Circle and Rectangle Overlapping||42.4%|Medium|| |1402|Reducing Dishes||72.2%|Hard|| |1403|Minimum Subsequence in Non-Increasing Order||71.1%|Easy|| |1404|Number of Steps to Reduce a Number in Binary Representation to One||49.9%|Medium|| -|1405|Longest Happy String||52.2%|Medium|| -|1406|Stone Game III||57.2%|Hard|| -|1407|Top Travellers||83.6%|Easy|| -|1408|String Matching in an Array||62.8%|Easy|| -|1409|Queries on a Permutation With Key||81.4%|Medium|| +|1405|Longest Happy String||52.3%|Medium|| +|1406|Stone Game III||57.3%|Hard|| +|1407|Top Travellers||83.7%|Easy|| +|1408|String Matching in an Array||62.7%|Easy|| +|1409|Queries on a Permutation With Key||81.5%|Medium|| |1410|HTML Entity Parser||54.4%|Medium|| |1411|Number of Ways to Paint N × 3 Grid||60.4%|Hard|| |1412|Find the Quiet Students in All Exams||65.3%|Hard|| -|1413|Minimum Value to Get Positive Step by Step Sum||65.4%|Easy|| +|1413|Minimum Value to Get Positive Step by Step Sum||65.5%|Easy|| |1414|Find the Minimum Number of Fibonacci Numbers Whose Sum Is K||63.1%|Medium|| -|1415|The k-th Lexicographical String of All Happy Strings of Length n||69.8%|Medium|| +|1415|The k-th Lexicographical String of All Happy Strings of Length n||69.9%|Medium|| |1416|Restore The Array||36.3%|Hard|| -|1417|Reformat The String||55.3%|Easy|| -|1418|Display Table of Food Orders in a Restaurant||68.4%|Medium|| +|1417|Reformat The String||55.2%|Easy|| +|1418|Display Table of Food Orders in a Restaurant||68.6%|Medium|| |1419|Minimum Number of Frogs Croaking||47.3%|Medium|| -|1420|Build Array Where You Can Find The Maximum Exactly K Comparisons||64.2%|Hard|| +|1420|Build Array Where You Can Find The Maximum Exactly K Comparisons||64.3%|Hard|| |1421|NPV Queries||82.0%|Medium|| |1422|Maximum Score After Splitting a String||56.0%|Easy|| -|1423|Maximum Points You Can Obtain from Cards||46.4%|Medium|| -|1424|Diagonal Traverse II||45.7%|Medium|| +|1423|Maximum Points You Can Obtain from Cards||46.6%|Medium|| +|1424|Diagonal Traverse II||45.8%|Medium|| |1425|Constrained Subsequence Sum||45.0%|Hard|| -|1426|Counting Elements||59.0%|Easy|| +|1426|Counting Elements||59.1%|Easy|| |1427|Perform String Shifts||53.4%|Easy|| -|1428|Leftmost Column with at Least a One||48.8%|Medium|| -|1429|First Unique Number||49.3%|Medium|| +|1428|Leftmost Column with at Least a One||48.9%|Medium|| +|1429|First Unique Number||49.5%|Medium|| |1430|Check If a String Is a Valid Sequence from Root to Leaves Path in a Binary Tree||45.1%|Medium|| -|1431|Kids With the Greatest Number of Candies||88.5%|Easy|| -|1432|Max Difference You Can Get From Changing an Integer||42.8%|Medium|| -|1433|Check If a String Can Break Another String||66.9%|Medium|| -|1434|Number of Ways to Wear Different Hats to Each Other||39.2%|Hard|| -|1435|Create a Session Bar Chart||77.7%|Easy|| +|1431|Kids With the Greatest Number of Candies||88.4%|Easy|| +|1432|Max Difference You Can Get From Changing an Integer||42.9%|Medium|| +|1433|Check If a String Can Break Another String||67.3%|Medium|| +|1434|Number of Ways to Wear Different Hats to Each Other||39.3%|Hard|| +|1435|Create a Session Bar Chart||77.8%|Easy|| |1436|Destination City||77.0%|Easy|| -|1437|Check If All 1's Are at Least Length K Places Away|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1437.Check-If-All-1's-Are-at-Least-Length-K-Places-Away)|63.0%|Easy|| -|1438|Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit||44.1%|Medium|| -|1439|Find the Kth Smallest Sum of a Matrix With Sorted Rows||59.9%|Hard|| -|1440|Evaluate Boolean Expression||74.5%|Medium|| -|1441|Build an Array With Stack Operations||69.1%|Easy|| -|1442|Count Triplets That Can Form Two Arrays of Equal XOR||71.1%|Medium|| -|1443|Minimum Time to Collect All Apples in a Tree||54.6%|Medium|| -|1444|Number of Ways of Cutting a Pizza||53.7%|Hard|| -|1445|Apples & Oranges||90.8%|Medium|| +|1437|Check If All 1's Are at Least Length K Places Away|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1437.Check-If-All-1's-Are-at-Least-Length-K-Places-Away)|62.8%|Easy|| +|1438|Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit||44.2%|Medium|| +|1439|Find the Kth Smallest Sum of a Matrix With Sorted Rows||60.1%|Hard|| +|1440|Evaluate Boolean Expression||74.4%|Medium|| +|1441|Build an Array With Stack Operations||69.4%|Easy|| +|1442|Count Triplets That Can Form Two Arrays of Equal XOR||71.3%|Medium|| +|1443|Minimum Time to Collect All Apples in a Tree||54.7%|Medium|| +|1444|Number of Ways of Cutting a Pizza||53.8%|Hard|| +|1445|Apples & Oranges||90.5%|Medium|| |1446|Consecutive Characters||61.0%|Easy|| |1447|Simplified Fractions||62.2%|Medium|| -|1448|Count Good Nodes in Binary Tree||70.3%|Medium|| -|1449|Form Largest Integer With Digits That Add up to Target||43.8%|Hard|| -|1450|Number of Students Doing Homework at a Given Time||77.2%|Easy|| -|1451|Rearrange Words in a Sentence||59.2%|Medium|| -|1452|People Whose List of Favorite Companies Is Not a Subset of Another List||54.9%|Medium|| -|1453|Maximum Number of Darts Inside of a Circular Dartboard||35.2%|Hard|| -|1454|Active Users||38.7%|Medium|| -|1455|Check If a Word Occurs As a Prefix of Any Word in a Sentence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence)|64.6%|Easy|| -|1456|Maximum Number of Vowels in a Substring of Given Length||54.4%|Medium|| -|1457|Pseudo-Palindromic Paths in a Binary Tree||71.1%|Medium|| +|1448|Count Good Nodes in Binary Tree||70.5%|Medium|| +|1449|Form Largest Integer With Digits That Add up to Target||43.9%|Hard|| +|1450|Number of Students Doing Homework at a Given Time||77.3%|Easy|| +|1451|Rearrange Words in a Sentence||59.4%|Medium|| +|1452|People Whose List of Favorite Companies Is Not a Subset of Another List||55.0%|Medium|| +|1453|Maximum Number of Darts Inside of a Circular Dartboard||35.3%|Hard|| +|1454|Active Users||38.8%|Medium|| +|1455|Check If a Word Occurs As a Prefix of Any Word in a Sentence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence)|64.5%|Easy|| +|1456|Maximum Number of Vowels in a Substring of Given Length||54.5%|Medium|| +|1457|Pseudo-Palindromic Paths in a Binary Tree||71.0%|Medium|| |1458|Max Dot Product of Two Subsequences||43.0%|Hard|| |1459|Rectangles Area||64.6%|Medium|| -|1460|Make Two Arrays Equal by Reversing Sub-arrays||72.3%|Easy|| -|1461|Check If a String Contains All Binary Codes of Size K||47.1%|Medium|| -|1462|Course Schedule IV||44.4%|Medium|| +|1460|Make Two Arrays Equal by Reversing Sub-arrays||72.2%|Easy|| +|1461|Check If a String Contains All Binary Codes of Size K||47.2%|Medium|| +|1462|Course Schedule IV||44.6%|Medium|| |1463|Cherry Pickup II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1463.Cherry-Pickup-II)|69.4%|Hard|| -|1464|Maximum Product of Two Elements in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1464.Maximum-Product-of-Two-Elements-in-an-Array)|77.1%|Easy|| -|1465|Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts||31.8%|Medium|| -|1466|Reorder Routes to Make All Paths Lead to the City Zero||61.3%|Medium|| +|1464|Maximum Product of Two Elements in an Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1464.Maximum-Product-of-Two-Elements-in-an-Array)|77.2%|Easy|| +|1465|Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts||32.5%|Medium|| +|1466|Reorder Routes to Make All Paths Lead to the City Zero||61.5%|Medium|| |1467|Probability of a Two Boxes Having The Same Number of Distinct Balls||61.0%|Hard|| -|1468|Calculate Salaries||81.5%|Medium|| -|1469|Find All The Lonely Nodes||80.6%|Easy|| +|1468|Calculate Salaries||81.7%|Medium|| +|1469|Find All The Lonely Nodes||80.7%|Easy|| |1470|Shuffle the Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1470.Shuffle-the-Array)|88.4%|Easy|| |1471|The k Strongest Values in an Array||58.4%|Medium|| -|1472|Design Browser History||70.5%|Medium|| +|1472|Design Browser History||70.9%|Medium|| |1473|Paint House III||48.7%|Hard|| -|1474|Delete N Nodes After M Nodes of a Linked List||74.4%|Easy|| +|1474|Delete N Nodes After M Nodes of a Linked List||74.5%|Easy|| |1475|Final Prices With a Special Discount in a Shop||75.1%|Easy|| -|1476|Subrectangle Queries||88.6%|Medium|| -|1477|Find Two Non-overlapping Sub-arrays Each With Target Sum||34.2%|Medium|| -|1478|Allocate Mailboxes||54.1%|Hard|| -|1479|Sales by Day of the Week||83.6%|Hard|| -|1480|Running Sum of 1d Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1480.Running-Sum-of-1d-Array)|89.5%|Easy|| -|1481|Least Number of Unique Integers after K Removals||55.6%|Medium|| -|1482|Minimum Number of Days to Make m Bouquets||49.9%|Medium|| -|1483|Kth Ancestor of a Tree Node||30.4%|Hard|| -|1484|Group Sold Products By The Date||85.9%|Easy|| +|1476|Subrectangle Queries||88.5%|Medium|| +|1477|Find Two Non-overlapping Sub-arrays Each With Target Sum||34.3%|Medium|| +|1478|Allocate Mailboxes||54.0%|Hard|| +|1479|Sales by Day of the Week||83.7%|Hard|| +|1480|Running Sum of 1d Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1480.Running-Sum-of-1d-Array)|89.3%|Easy|| +|1481|Least Number of Unique Integers after K Removals||55.7%|Medium|| +|1482|Minimum Number of Days to Make m Bouquets||50.0%|Medium|| +|1483|Kth Ancestor of a Tree Node||30.5%|Hard|| +|1484|Group Sold Products By The Date||85.7%|Easy|| |1485|Clone Binary Tree With Random Pointer||79.4%|Medium|| -|1486|XOR Operation in an Array||84.1%|Easy|| -|1487|Making File Names Unique||30.5%|Medium|| -|1488|Avoid Flood in The City||24.7%|Medium|| -|1489|Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree||52.6%|Hard|| -|1490|Clone N-ary Tree||83.5%|Medium|| -|1491|Average Salary Excluding the Minimum and Maximum Salary||68.4%|Easy|| +|1486|XOR Operation in an Array||84.2%|Easy|| +|1487|Making File Names Unique||30.6%|Medium|| +|1488|Avoid Flood in The City||24.6%|Medium|| +|1489|Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree||52.7%|Hard|| +|1490|Clone N-ary Tree||83.4%|Medium|| +|1491|Average Salary Excluding the Minimum and Maximum Salary||68.7%|Easy|| |1492|The kth Factor of n||63.4%|Medium|| -|1493|Longest Subarray of 1's After Deleting One Element||58.1%|Medium|| -|1494|Parallel Courses II||31.5%|Hard|| -|1495|Friendly Movies Streamed Last Month||51.4%|Easy|| -|1496|Path Crossing||55.4%|Easy|| +|1493|Longest Subarray of 1's After Deleting One Element||58.0%|Medium|| +|1494|Parallel Courses II||31.4%|Hard|| +|1495|Friendly Movies Streamed Last Month||51.2%|Easy|| +|1496|Path Crossing||55.3%|Easy|| |1497|Check If Array Pairs Are Divisible by k||40.5%|Medium|| |1498|Number of Subsequences That Satisfy the Given Sum Condition||38.3%|Medium|| |1499|Max Value of Equation||45.3%|Hard|| -|1500|Design a File Sharing System||45.9%|Medium|| -|1501|Countries You Can Safely Invest In||60.2%|Medium|| -|1502|Can Make Arithmetic Progression From Sequence||70.8%|Easy|| +|1500|Design a File Sharing System||46.6%|Medium|| +|1501|Countries You Can Safely Invest In||60.3%|Medium|| +|1502|Can Make Arithmetic Progression From Sequence||71.2%|Easy|| |1503|Last Moment Before All Ants Fall Out of a Plank||53.1%|Medium|| -|1504|Count Submatrices With All Ones||60.9%|Medium|| -|1505|Minimum Possible Integer After at Most K Adjacent Swaps On Digits||36.2%|Hard|| +|1504|Count Submatrices With All Ones||61.0%|Medium|| +|1505|Minimum Possible Integer After at Most K Adjacent Swaps On Digits||36.3%|Hard|| |1506|Find Root of N-Ary Tree||80.5%|Medium|| |1507|Reformat Date||60.2%|Easy|| -|1508|Range Sum of Sorted Subarray Sums||61.7%|Medium|| -|1509|Minimum Difference Between Largest and Smallest Value in Three Moves||51.8%|Medium|| +|1508|Range Sum of Sorted Subarray Sums||61.4%|Medium|| +|1509|Minimum Difference Between Largest and Smallest Value in Three Moves||51.9%|Medium|| |1510|Stone Game IV||58.8%|Hard|| -|1511|Customer Order Frequency||73.3%|Easy|| +|1511|Customer Order Frequency||73.4%|Easy|| |1512|Number of Good Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1512.Number-of-Good-Pairs)|87.8%|Easy|| |1513|Number of Substrings With Only 1s||41.5%|Medium|| -|1514|Path with Maximum Probability||39.6%|Medium|| -|1515|Best Position for a Service Centre||37.0%|Hard|| -|1516|Move Sub-Tree of N-Ary Tree||62.9%|Hard|| +|1514|Path with Maximum Probability||39.8%|Medium|| +|1515|Best Position for a Service Centre||37.1%|Hard|| +|1516|Move Sub-Tree of N-Ary Tree||63.1%|Hard|| |1517|Find Users With Valid E-Mails||71.9%|Easy|| |1518|Water Bottles||60.7%|Easy|| -|1519|Number of Nodes in the Sub-Tree With the Same Label||36.9%|Medium|| -|1520|Maximum Number of Non-Overlapping Substrings||36.0%|Hard|| -|1521|Find a Value of a Mysterious Function Closest to Target||44.4%|Hard|| -|1522|Diameter of N-Ary Tree||69.0%|Medium|| -|1523|Count Odd Numbers in an Interval Range||54.8%|Easy|| -|1524|Number of Sub-arrays With Odd Sum||39.6%|Medium|| -|1525|Number of Good Ways to Split a String||66.4%|Medium|| -|1526|Minimum Number of Increments on Subarrays to Form a Target Array||59.9%|Hard|| -|1527|Patients With a Condition||73.1%|Easy|| +|1519|Number of Nodes in the Sub-Tree With the Same Label||37.0%|Medium|| +|1520|Maximum Number of Non-Overlapping Substrings||36.2%|Hard|| +|1521|Find a Value of a Mysterious Function Closest to Target||44.3%|Hard|| +|1522|Diameter of N-Ary Tree||69.3%|Medium|| +|1523|Count Odd Numbers in an Interval Range||54.7%|Easy|| +|1524|Number of Sub-arrays With Odd Sum||39.8%|Medium|| +|1525|Number of Good Ways to Split a String||66.5%|Medium|| +|1526|Minimum Number of Increments on Subarrays to Form a Target Array||60.0%|Hard|| +|1527|Patients With a Condition||70.1%|Easy|| |1528|Shuffle String||85.8%|Easy|| |1529|Bulb Switcher IV||70.9%|Medium|| -|1530|Number of Good Leaf Nodes Pairs||55.9%|Medium|| -|1531|String Compression II||33.4%|Hard|| -|1532|The Most Recent Three Orders||72.8%|Medium|| -|1533|Find the Index of the Large Integer||54.9%|Medium|| -|1534|Count Good Triplets||80.3%|Easy|| -|1535|Find the Winner of an Array Game||47.3%|Medium|| -|1536|Minimum Swaps to Arrange a Binary Grid||43.2%|Medium|| +|1530|Number of Good Leaf Nodes Pairs||56.1%|Medium|| +|1531|String Compression II||33.8%|Hard|| +|1532|The Most Recent Three Orders||72.7%|Medium|| +|1533|Find the Index of the Large Integer||54.8%|Medium|| +|1534|Count Good Triplets||80.4%|Easy|| +|1535|Find the Winner of an Array Game||47.4%|Medium|| +|1536|Minimum Swaps to Arrange a Binary Grid||43.3%|Medium|| |1537|Get the Maximum Score||36.4%|Hard|| -|1538|Guess the Majority in a Hidden Array||61.7%|Medium|| -|1539|Kth Missing Positive Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1539.Kth-Missing-Positive-Number)|55.2%|Easy|| -|1540|Can Convert String in K Moves||30.6%|Medium|| -|1541|Minimum Insertions to Balance a Parentheses String||42.5%|Medium|| -|1542|Find Longest Awesome Substring||36.4%|Hard|| -|1543|Fix Product Name Format||67.9%|Easy|| -|1544|Make The String Great||55.2%|Easy|| -|1545|Find Kth Bit in Nth Binary String||57.4%|Medium|| +|1538|Guess the Majority in a Hidden Array||61.6%|Medium|| +|1539|Kth Missing Positive Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1539.Kth-Missing-Positive-Number)|55.1%|Easy|| +|1540|Can Convert String in K Moves||30.7%|Medium|| +|1541|Minimum Insertions to Balance a Parentheses String||42.7%|Medium|| +|1542|Find Longest Awesome Substring||36.6%|Hard|| +|1543|Fix Product Name Format||67.5%|Easy|| +|1544|Make The String Great||55.3%|Easy|| +|1545|Find Kth Bit in Nth Binary String||57.5%|Medium|| |1546|Maximum Number of Non-Overlapping Subarrays With Sum Equals Target||43.8%|Medium|| -|1547|Minimum Cost to Cut a Stick||52.2%|Hard|| +|1547|Minimum Cost to Cut a Stick||52.4%|Hard|| |1548|The Most Similar Path in a Graph||54.1%|Hard|| -|1549|The Most Recent Orders for Each Product||66.4%|Medium|| -|1550|Three Consecutive Odds||65.1%|Easy|| -|1551|Minimum Operations to Make Array Equal||77.8%|Medium|| -|1552|Magnetic Force Between Two Balls||48.7%|Medium|| -|1553|Minimum Number of Days to Eat N Oranges||29.3%|Hard|| -|1554|Strings Differ by One Character||63.7%|Medium|| -|1555|Bank Account Summary||52.7%|Medium|| -|1556|Thousand Separator||58.0%|Easy|| -|1557|Minimum Number of Vertices to Reach All Nodes||75.4%|Medium|| -|1558|Minimum Numbers of Function Calls to Make Target Array||62.5%|Medium|| -|1559|Detect Cycles in 2D Grid||44.7%|Hard|| -|1560|Most Visited Sector in a Circular Track||57.0%|Easy|| -|1561|Maximum Number of Coins You Can Get||77.9%|Medium|| -|1562|Find Latest Group of Size M||39.5%|Medium|| +|1549|The Most Recent Orders for Each Product||66.5%|Medium|| +|1550|Three Consecutive Odds||64.9%|Easy|| +|1551|Minimum Operations to Make Array Equal||77.9%|Medium|| +|1552|Magnetic Force Between Two Balls||48.8%|Medium|| +|1553|Minimum Number of Days to Eat N Oranges||29.5%|Hard|| +|1554|Strings Differ by One Character||63.4%|Medium|| +|1555|Bank Account Summary||52.8%|Medium|| +|1556|Thousand Separator||57.9%|Easy|| +|1557|Minimum Number of Vertices to Reach All Nodes||75.5%|Medium|| +|1558|Minimum Numbers of Function Calls to Make Target Array||62.6%|Medium|| +|1559|Detect Cycles in 2D Grid||44.4%|Hard|| +|1560|Most Visited Sector in a Circular Track||56.9%|Easy|| +|1561|Maximum Number of Coins You Can Get||77.7%|Medium|| +|1562|Find Latest Group of Size M||39.6%|Medium|| |1563|Stone Game V||40.1%|Hard|| -|1564|Put Boxes Into the Warehouse I||65.8%|Medium|| -|1565|Unique Orders and Customers Per Month||83.2%|Easy|| +|1564|Put Boxes Into the Warehouse I||66.0%|Medium|| +|1565|Unique Orders and Customers Per Month||82.9%|Easy|| |1566|Detect Pattern of Length M Repeated K or More Times||42.4%|Easy|| -|1567|Maximum Length of Subarray With Positive Product||36.5%|Medium|| +|1567|Maximum Length of Subarray With Positive Product||36.7%|Medium|| |1568|Minimum Number of Days to Disconnect Island||50.3%|Hard|| -|1569|Number of Ways to Reorder Array to Get Same BST||50.0%|Hard|| -|1570|Dot Product of Two Sparse Vectors||91.4%|Medium|| +|1569|Number of Ways to Reorder Array to Get Same BST||50.2%|Hard|| +|1570|Dot Product of Two Sparse Vectors||91.2%|Medium|| |1571|Warehouse Manager||90.1%|Easy|| -|1572|Matrix Diagonal Sum||78.3%|Easy|| -|1573|Number of Ways to Split a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1573.Number-of-Ways-to-Split-a-String)|30.9%|Medium|| -|1574|Shortest Subarray to be Removed to Make Array Sorted||33.0%|Medium|| -|1575|Count All Possible Routes||57.5%|Hard|| -|1576|Replace All ?'s to Avoid Consecutive Repeating Characters||48.2%|Easy|| -|1577|Number of Ways Where Square of Number Is Equal to Product of Two Numbers||37.3%|Medium|| -|1578|Minimum Deletion Cost to Avoid Repeating Letters||60.4%|Medium|| -|1579|Remove Max Number of Edges to Keep Graph Fully Traversable||45.9%|Hard|| +|1572|Matrix Diagonal Sum||78.4%|Easy|| +|1573|Number of Ways to Split a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1573.Number-of-Ways-to-Split-a-String)|31.0%|Medium|| +|1574|Shortest Subarray to be Removed to Make Array Sorted||33.3%|Medium|| +|1575|Count All Possible Routes||57.4%|Hard|| +|1576|Replace All ?'s to Avoid Consecutive Repeating Characters||48.3%|Easy|| +|1577|Number of Ways Where Square of Number Is Equal to Product of Two Numbers||37.4%|Medium|| +|1578|Minimum Deletion Cost to Avoid Repeating Letters||60.5%|Medium|| +|1579|Remove Max Number of Edges to Keep Graph Fully Traversable||46.2%|Hard|| |1580|Put Boxes Into the Warehouse II||62.1%|Medium|| -|1581|Customer Who Visited but Did Not Make Any Transactions||90.3%|Easy|| +|1581|Customer Who Visited but Did Not Make Any Transactions||90.2%|Easy|| |1582|Special Positions in a Binary Matrix||64.3%|Easy|| -|1583|Count Unhappy Friends||54.1%|Medium|| -|1584|Min Cost to Connect All Points||50.9%|Medium|| -|1585|Check If String Is Transformable With Substring Sort Operations||48.1%|Hard|| -|1586|Binary Search Tree Iterator II||66.5%|Medium|| -|1587|Bank Account Summary II||90.4%|Easy|| -|1588|Sum of All Odd Length Subarrays||82.2%|Easy|| +|1583|Count Unhappy Friends||54.2%|Medium|| +|1584|Min Cost to Connect All Points||51.3%|Medium|| +|1585|Check If String Is Transformable With Substring Sort Operations||48.2%|Hard|| +|1586|Binary Search Tree Iterator II||66.6%|Medium|| +|1587|Bank Account Summary II||90.2%|Easy|| +|1588|Sum of All Odd Length Subarrays||82.0%|Easy|| |1589|Maximum Sum Obtained of Any Permutation||34.8%|Medium|| |1590|Make Sum Divisible by P||27.0%|Medium|| -|1591|Strange Printer II||55.5%|Hard|| +|1591|Strange Printer II||55.1%|Hard|| |1592|Rearrange Spaces Between Words||43.8%|Easy|| -|1593|Split a String Into the Max Number of Unique Substrings||48.4%|Medium|| +|1593|Split a String Into the Max Number of Unique Substrings||48.8%|Medium|| |1594|Maximum Non Negative Product in a Matrix||31.9%|Medium|| -|1595|Minimum Cost to Connect Two Groups of Points||42.8%|Hard|| -|1596|The Most Frequently Ordered Products for Each Customer||84.2%|Medium|| -|1597|Build Binary Expression Tree From Infix Expression||66.1%|Hard|| -|1598|Crawler Log Folder||64.2%|Easy|| -|1599|Maximum Profit of Operating a Centennial Wheel||43.5%|Medium|| -|1600|Throne Inheritance||59.9%|Medium|| -|1601|Maximum Number of Achievable Transfer Requests||47.6%|Hard|| -|1602|Find Nearest Right Node in Binary Tree||74.0%|Medium|| -|1603|Design Parking System||86.6%|Easy|| -|1604|Alert Using Same Key-Card Three or More Times in a One Hour Period||42.2%|Medium|| -|1605|Find Valid Matrix Given Row and Column Sums||77.9%|Medium|| +|1595|Minimum Cost to Connect Two Groups of Points||42.9%|Hard|| +|1596|The Most Frequently Ordered Products for Each Customer||84.0%|Medium|| +|1597|Build Binary Expression Tree From Infix Expression||63.7%|Hard|| +|1598|Crawler Log Folder||64.1%|Easy|| +|1599|Maximum Profit of Operating a Centennial Wheel||43.6%|Medium|| +|1600|Throne Inheritance||60.1%|Medium|| +|1601|Maximum Number of Achievable Transfer Requests||47.8%|Hard|| +|1602|Find Nearest Right Node in Binary Tree||73.9%|Medium|| +|1603|Design Parking System||86.5%|Easy|| +|1604|Alert Using Same Key-Card Three or More Times in a One Hour Period||42.3%|Medium|| +|1605|Find Valid Matrix Given Row and Column Sums||77.2%|Medium|| |1606|Find Servers That Handled Most Number of Requests||36.9%|Hard|| -|1607|Sellers With No Sales||55.7%|Easy|| +|1607|Sellers With No Sales||55.6%|Easy|| |1608|Special Array With X Elements Greater Than or Equal X||61.7%|Easy|| -|1609|Even Odd Tree||53.2%|Medium|| -|1610|Maximum Number of Visible Points||28.7%|Hard|| -|1611|Minimum One Bit Operations to Make Integers Zero||57.2%|Hard|| -|1612|Check If Two Expression Trees are Equivalent||69.8%|Medium|| -|1613|Find the Missing IDs||72.6%|Medium|| -|1614|Maximum Nesting Depth of the Parentheses||83.3%|Easy|| -|1615|Maximal Network Rank||51.7%|Medium|| -|1616|Split Two Strings to Make Palindrome||36.4%|Medium|| -|1617|Count Subtrees With Max Distance Between Cities||63.5%|Hard|| +|1609|Even Odd Tree||53.1%|Medium|| +|1610|Maximum Number of Visible Points||28.8%|Hard|| +|1611|Minimum One Bit Operations to Make Integers Zero||57.5%|Hard|| +|1612|Check If Two Expression Trees are Equivalent||70.1%|Medium|| +|1613|Find the Missing IDs||73.3%|Medium|| +|1614|Maximum Nesting Depth of the Parentheses||83.2%|Easy|| +|1615|Maximal Network Rank||51.8%|Medium|| +|1616|Split Two Strings to Make Palindrome||36.3%|Medium|| +|1617|Count Subtrees With Max Distance Between Cities||63.6%|Hard|| |1618|Maximum Font to Fit a Sentence in a Screen||57.8%|Medium|| -|1619|Mean of Array After Removing Some Elements||65.4%|Easy|| -|1620|Coordinate With Maximum Network Quality||37.0%|Medium|| -|1621|Number of Sets of K Non-Overlapping Line Segments||41.2%|Medium|| -|1622|Fancy Sequence||15.5%|Hard|| -|1623|All Valid Triplets That Can Represent a Country||89.0%|Easy|| -|1624|Largest Substring Between Two Equal Characters||59.1%|Easy|| +|1619|Mean of Array After Removing Some Elements||65.1%|Easy|| +|1620|Coordinate With Maximum Network Quality||37.1%|Medium|| +|1621|Number of Sets of K Non-Overlapping Line Segments||41.1%|Medium|| +|1622|Fancy Sequence||15.4%|Hard|| +|1623|All Valid Triplets That Can Represent a Country||88.9%|Easy|| +|1624|Largest Substring Between Two Equal Characters||59.0%|Easy|| |1625|Lexicographically Smallest String After Applying Operations||63.7%|Medium|| -|1626|Best Team With No Conflicts||37.4%|Medium|| -|1627|Graph Connectivity With Threshold||38.2%|Hard|| -|1628|Design an Expression Tree With Evaluate Function||80.0%|Medium|| -|1629|Slowest Key||59.0%|Easy|| -|1630|Arithmetic Subarrays||77.5%|Medium|| -|1631|Path With Minimum Effort||43.5%|Medium|| -|1632|Rank Transform of a Matrix||30.5%|Hard|| -|1633|Percentage of Users Attended a Contest||72.9%|Easy|| -|1634|Add Two Polynomials Represented as Linked Lists||55.9%|Medium|| -|1635|Hopper Company Queries I||56.3%|Hard|| -|1636|Sort Array by Increasing Frequency||66.8%|Easy|| -|1637|Widest Vertical Area Between Two Points Containing No Points||83.7%|Medium|| -|1638|Count Substrings That Differ by One Character||68.3%|Medium|| +|1626|Best Team With No Conflicts||37.7%|Medium|| +|1627|Graph Connectivity With Threshold||38.5%|Hard|| +|1628|Design an Expression Tree With Evaluate Function||80.3%|Medium|| +|1629|Slowest Key||59.3%|Easy|| +|1630|Arithmetic Subarrays||77.7%|Medium|| +|1631|Path With Minimum Effort||50.1%|Medium|| +|1632|Rank Transform of a Matrix||30.7%|Hard|| +|1633|Percentage of Users Attended a Contest||72.4%|Easy|| +|1634|Add Two Polynomials Represented as Linked Lists||55.3%|Medium|| +|1635|Hopper Company Queries I||56.0%|Hard|| +|1636|Sort Array by Increasing Frequency||67.1%|Easy|| +|1637|Widest Vertical Area Between Two Points Containing No Points||84.0%|Medium|| +|1638|Count Substrings That Differ by One Character||68.6%|Medium|| |1639|Number of Ways to Form a Target String Given a Dictionary||39.5%|Hard|| -|1640|Check Array Formation Through Concatenation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1640.Check-Array-Formation-Through-Concatenation)|60.7%|Easy|| -|1641|Count Sorted Vowel Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1641.Count-Sorted-Vowel-Strings)|77.3%|Medium|| -|1642|Furthest Building You Can Reach||50.9%|Medium|| -|1643|Kth Smallest Instructions||43.1%|Hard|| -|1644|Lowest Common Ancestor of a Binary Tree II||57.4%|Medium|| -|1645|Hopper Company Queries II||41.6%|Hard|| +|1640|Check Array Formation Through Concatenation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1640.Check-Array-Formation-Through-Concatenation)|60.2%|Easy|| +|1641|Count Sorted Vowel Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1641.Count-Sorted-Vowel-Strings)|77.0%|Medium|| +|1642|Furthest Building You Can Reach||50.6%|Medium|| +|1643|Kth Smallest Instructions||43.3%|Hard|| +|1644|Lowest Common Ancestor of a Binary Tree II||57.3%|Medium|| +|1645|Hopper Company Queries II||40.0%|Hard|| |1646|Get Maximum in Generated Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1646.Get-Maximum-in-Generated-Array)|53.5%|Easy|| -|1647|Minimum Deletions to Make Character Frequencies Unique|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique)|53.9%|Medium|| -|1648|Sell Diminishing-Valued Colored Balls|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1648.Sell-Diminishing-Valued-Colored-Balls)|30.9%|Medium|| -|1649|Create Sorted Array through Instructions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1649.Create-Sorted-Array-through-Instructions)|36.2%|Hard|| +|1647|Minimum Deletions to Make Character Frequencies Unique|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique)|54.3%|Medium|| +|1648|Sell Diminishing-Valued Colored Balls|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1648.Sell-Diminishing-Valued-Colored-Balls)|30.7%|Medium|| +|1649|Create Sorted Array through Instructions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1649.Create-Sorted-Array-through-Instructions)|36.3%|Hard|| |1650|Lowest Common Ancestor of a Binary Tree III||77.0%|Medium|| -|1651|Hopper Company Queries III||67.0%|Hard|| -|1652|Defuse the Bomb|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1652.Defuse-the-Bomb)|63.6%|Easy|| -|1653|Minimum Deletions to Make String Balanced|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1653.Minimum-Deletions-to-Make-String-Balanced)|50.2%|Medium|| +|1651|Hopper Company Queries III||67.3%|Hard|| +|1652|Defuse the Bomb|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1652.Defuse-the-Bomb)|63.2%|Easy|| +|1653|Minimum Deletions to Make String Balanced|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1653.Minimum-Deletions-to-Make-String-Balanced)|50.6%|Medium|| |1654|Minimum Jumps to Reach Home|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1654.Minimum-Jumps-to-Reach-Home)|26.2%|Medium|| |1655|Distribute Repeating Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1655.Distribute-Repeating-Integers)|40.5%|Hard|| -|1656|Design an Ordered Stream|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1656.Design-an-Ordered-Stream)|82.0%|Easy|| -|1657|Determine if Two Strings Are Close|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1657.Determine-if-Two-Strings-Are-Close)|55.9%|Medium|| +|1656|Design an Ordered Stream|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1656.Design-an-Ordered-Stream)|82.2%|Easy|| +|1657|Determine if Two Strings Are Close|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1657.Determine-if-Two-Strings-Are-Close)|55.4%|Medium|| |1658|Minimum Operations to Reduce X to Zero|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1658.Minimum-Operations-to-Reduce-X-to-Zero)|33.4%|Medium|| -|1659|Maximize Grid Happiness|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1659.Maximize-Grid-Happiness)|35.3%|Hard|| -|1660|Correct a Binary Tree||79.2%|Medium|| -|1661|Average Time of Process per Machine||79.4%|Easy|| -|1662|Check If Two String Arrays are Equivalent|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1662.Check-If-Two-String-Arrays-are-Equivalent)|83.5%|Easy|| -|1663|Smallest String With A Given Numeric Value|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1663.Smallest-String-With-A-Given-Numeric-Value)|60.0%|Medium|| -|1664|Ways to Make a Fair Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1664.Ways-to-Make-a-Fair-Array)|60.7%|Medium|| -|1665|Minimum Initial Energy to Finish Tasks|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1665.Minimum-Initial-Energy-to-Finish-Tasks)|67.4%|Hard|| -|1666|Change the Root of a Binary Tree||68.5%|Medium|| -|1667|Fix Names in a Table||63.9%|Easy|| +|1659|Maximize Grid Happiness|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1659.Maximize-Grid-Happiness)|35.5%|Hard|| +|1660|Correct a Binary Tree||78.7%|Medium|| +|1661|Average Time of Process per Machine||79.3%|Easy|| +|1662|Check If Two String Arrays are Equivalent|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1662.Check-If-Two-String-Arrays-are-Equivalent)|83.4%|Easy|| +|1663|Smallest String With A Given Numeric Value|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1663.Smallest-String-With-A-Given-Numeric-Value)|64.3%|Medium|| +|1664|Ways to Make a Fair Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1664.Ways-to-Make-a-Fair-Array)|60.6%|Medium|| +|1665|Minimum Initial Energy to Finish Tasks|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1665.Minimum-Initial-Energy-to-Finish-Tasks)|66.6%|Hard|| +|1666|Change the Root of a Binary Tree||69.4%|Medium|| +|1667|Fix Names in a Table||63.6%|Easy|| |1668|Maximum Repeating Substring|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1668.Maximum-Repeating-Substring)|38.6%|Easy|| -|1669|Merge In Between Linked Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1669.Merge-In-Between-Linked-Lists)|77.9%|Medium|| +|1669|Merge In Between Linked Lists|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1669.Merge-In-Between-Linked-Lists)|77.3%|Medium|| |1670|Design Front Middle Back Queue|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1670.Design-Front-Middle-Back-Queue)|54.6%|Medium|| -|1671|Minimum Number of Removals to Make Mountain Array||45.8%|Hard|| +|1671|Minimum Number of Removals to Make Mountain Array||45.6%|Hard|| |1672|Richest Customer Wealth|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1672.Richest-Customer-Wealth)|88.4%|Easy|| -|1673|Find the Most Competitive Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1673.Find-the-Most-Competitive-Subsequence)|45.1%|Medium|| +|1673|Find the Most Competitive Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1673.Find-the-Most-Competitive-Subsequence)|45.2%|Medium|| |1674|Minimum Moves to Make Array Complementary|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1674.Minimum-Moves-to-Make-Array-Complementary)|34.6%|Medium|| -|1675|Minimize Deviation in Array||44.6%|Hard|| -|1676|Lowest Common Ancestor of a Binary Tree IV||78.0%|Medium|| -|1677|Product's Worth Over Invoices||74.5%|Easy|| -|1678|Goal Parser Interpretation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1678.Goal-Parser-Interpretation)|86.3%|Easy|| -|1679|Max Number of K-Sum Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1679.Max-Number-of-K-Sum-Pairs)|54.3%|Medium|| -|1680|Concatenation of Consecutive Binary Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1680.Concatenation-of-Consecutive-Binary-Numbers)|45.1%|Medium|| -|1681|Minimum Incompatibility|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1681.Minimum-Incompatibility)|35.2%|Hard|| -|1682|Longest Palindromic Subsequence II||51.4%|Medium|| -|1683|Invalid Tweets||91.2%|Easy|| -|1684|Count the Number of Consistent Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1684.Count-the-Number-of-Consistent-Strings)|83.9%|Easy|| -|1685|Sum of Absolute Differences in a Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array)|61.7%|Medium|| -|1686|Stone Game VI||49.1%|Medium|| +|1675|Minimize Deviation in Array||48.5%|Hard|| +|1676|Lowest Common Ancestor of a Binary Tree IV||78.5%|Medium|| +|1677|Product's Worth Over Invoices||74.0%|Easy|| +|1678|Goal Parser Interpretation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1678.Goal-Parser-Interpretation)|85.9%|Easy|| +|1679|Max Number of K-Sum Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1679.Max-Number-of-K-Sum-Pairs)|54.2%|Medium|| +|1680|Concatenation of Consecutive Binary Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1680.Concatenation-of-Consecutive-Binary-Numbers)|52.4%|Medium|| +|1681|Minimum Incompatibility|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1681.Minimum-Incompatibility)|35.3%|Hard|| +|1682|Longest Palindromic Subsequence II||51.5%|Medium|| +|1683|Invalid Tweets||91.1%|Easy|| +|1684|Count the Number of Consistent Strings|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1684.Count-the-Number-of-Consistent-Strings)|83.5%|Easy|| +|1685|Sum of Absolute Differences in a Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array)|61.8%|Medium|| +|1686|Stone Game VI||48.9%|Medium|| |1687|Delivering Boxes from Storage to Ports||34.6%|Hard|| -|1688|Count of Matches in Tournament|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1688.Count-of-Matches-in-Tournament)|83.0%|Easy|| -|1689|Partitioning Into Minimum Number Of Deci-Binary Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers)|87.9%|Medium|| -|1690|Stone Game VII|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1690.Stone-Game-VII)|47.0%|Medium|| +|1688|Count of Matches in Tournament|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1688.Count-of-Matches-in-Tournament)|82.7%|Easy|| +|1689|Partitioning Into Minimum Number Of Deci-Binary Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers)|87.4%|Medium|| +|1690|Stone Game VII|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1690.Stone-Game-VII)|47.5%|Medium|| |1691|Maximum Height by Stacking Cuboids ||50.0%|Hard|| -|1692|Count Ways to Distribute Candies||61.2%|Hard|| -|1693|Daily Leads and Partners||90.8%|Easy|| -|1694|Reformat Phone Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1694.Reformat-Phone-Number)|66.7%|Easy|| -|1695|Maximum Erasure Value|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1695.Maximum-Erasure-Value)|49.7%|Medium|| -|1696|Jump Game VI|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1696.Jump-Game-VI)|54.7%|Medium|| -|1697|Checking Existence of Edge Length Limited Paths||56.3%|Hard|| -|1698|Number of Distinct Substrings in a String||55.9%|Medium|| -|1699|Number of Calls Between Two Persons||86.0%|Medium|| -|1700|Number of Students Unable to Eat Lunch||69.7%|Easy|| -|1701|Average Waiting Time||61.5%|Medium|| -|1702|Maximum Binary String After Change||61.1%|Medium|| -|1703|Minimum Adjacent Swaps for K Consecutive Ones||40.6%|Hard|| -|1704|Determine if String Halves Are Alike||78.1%|Easy|| -|1705|Maximum Number of Eaten Apples||42.2%|Medium|| -|1706|Where Will the Ball Fall||58.6%|Medium|| -|1707|Maximum XOR With an Element From Array||47.8%|Hard|| -|1708|Largest Subarray Length K||64.6%|Easy|| -|1709|Biggest Window Between Visits||81.8%|Medium|| -|1710|Maximum Units on a Truck||70.8%|Easy|| -|1711|Count Good Meals||25.8%|Medium|| -|1712|Ways to Split Array Into Three Subarrays||29.9%|Medium|| -|1713|Minimum Operations to Make a Subsequence||45.5%|Hard|| -|1714|Sum Of Special Evenly-Spaced Elements In Array||47.9%|Hard|| -|1715|Count Apples and Oranges||78.0%|Medium|| -|1716|Calculate Money in Leetcode Bank||68.5%|Easy|| -|1717|Maximum Score From Removing Substrings||39.2%|Medium|| -|1718|Construct the Lexicographically Largest Valid Sequence||44.1%|Medium|| -|1719|Number Of Ways To Reconstruct A Tree||39.3%|Hard|| -|1720|Decode XORed Array||86.0%|Easy|| -|1721|Swapping Nodes in a Linked List||65.2%|Medium|| -|1722|Minimize Hamming Distance After Swap Operations||55.7%|Medium|| -|1723|Find Minimum Time to Finish All Jobs||44.6%|Hard|| -|1724|Checking Existence of Edge Length Limited Paths II||59.5%|Hard|| -|1725|Number Of Rectangles That Can Form The Largest Square||77.3%|Easy|| -|1726|Tuple with Same Product||54.1%|Medium|| -|1727|Largest Submatrix With Rearrangements||57.8%|Medium|| -|1728|Cat and Mouse II||40.5%|Hard|| -|1729|Find Followers Count||72.9%|Easy|| -|1730|Shortest Path to Get Food||64.4%|Medium|| -|1731|The Number of Employees Which Report to Each Employee||52.2%|Easy|| +|1692|Count Ways to Distribute Candies||62.5%|Hard|| +|1693|Daily Leads and Partners||90.9%|Easy|| +|1694|Reformat Phone Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1694.Reformat-Phone-Number)|66.5%|Easy|| +|1695|Maximum Erasure Value|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1695.Maximum-Erasure-Value)|49.6%|Medium|| +|1696|Jump Game VI|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1696.Jump-Game-VI)|54.1%|Medium|| +|1697|Checking Existence of Edge Length Limited Paths||55.9%|Hard|| +|1698|Number of Distinct Substrings in a String||56.4%|Medium|| +|1699|Number of Calls Between Two Persons||86.5%|Medium|| +|1700|Number of Students Unable to Eat Lunch||69.5%|Easy|| +|1701|Average Waiting Time||61.4%|Medium|| +|1702|Maximum Binary String After Change||60.5%|Medium|| +|1703|Minimum Adjacent Swaps for K Consecutive Ones||40.2%|Hard|| +|1704|Determine if String Halves Are Alike||77.7%|Easy|| +|1705|Maximum Number of Eaten Apples||42.1%|Medium|| +|1706|Where Will the Ball Fall||59.1%|Medium|| +|1707|Maximum XOR With an Element From Array||47.5%|Hard|| +|1708|Largest Subarray Length K||64.1%|Easy|| +|1709|Biggest Window Between Visits||82.0%|Medium|| +|1710|Maximum Units on a Truck||70.7%|Easy|| +|1711|Count Good Meals||26.0%|Medium|| +|1712|Ways to Split Array Into Three Subarrays||29.8%|Medium|| +|1713|Minimum Operations to Make a Subsequence||45.6%|Hard|| +|1714|Sum Of Special Evenly-Spaced Elements In Array||48.2%|Hard|| +|1715|Count Apples and Oranges||79.5%|Medium|| +|1716|Calculate Money in Leetcode Bank||67.6%|Easy|| +|1717|Maximum Score From Removing Substrings||39.6%|Medium|| +|1718|Construct the Lexicographically Largest Valid Sequence||44.3%|Medium|| +|1719|Number Of Ways To Reconstruct A Tree||39.4%|Hard|| +|1720|Decode XORed Array||85.9%|Easy|| +|1721|Swapping Nodes in a Linked List||65.0%|Medium|| +|1722|Minimize Hamming Distance After Swap Operations||55.4%|Medium|| +|1723|Find Minimum Time to Finish All Jobs||44.4%|Hard|| +|1724|Checking Existence of Edge Length Limited Paths II||58.5%|Hard|| +|1725|Number Of Rectangles That Can Form The Largest Square||77.7%|Easy|| +|1726|Tuple with Same Product||55.1%|Medium|| +|1727|Largest Submatrix With Rearrangements||58.2%|Medium|| +|1728|Cat and Mouse II||40.9%|Hard|| +|1729|Find Followers Count||72.2%|Easy|| +|1730|Shortest Path to Get Food||59.4%|Medium|| +|1731|The Number of Employees Which Report to Each Employee||50.2%|Easy|| |1732|Find the Highest Altitude||82.0%|Easy|| -|1733|Minimum Number of People to Teach||33.7%|Medium|| -|1734|Decode XORed Permutation||46.1%|Medium|| -|1735|Count Ways to Make Array With Product||44.7%|Hard|| -|1736|Latest Time by Replacing Hidden Digits||41.4%|Easy|| -|1737|Change Minimum Characters to Satisfy One of Three Conditions||26.0%|Medium|| -|1738|Find Kth Largest XOR Coordinate Value||61.5%|Medium|| -|1739|Building Boxes||46.0%|Hard|| +|1733|Minimum Number of People to Teach||36.4%|Medium|| +|1734|Decode XORed Permutation||50.7%|Medium|| +|1735|Count Ways to Make Array With Product||49.4%|Hard|| +|1736|Latest Time by Replacing Hidden Digits||41.3%|Easy|| +|1737|Change Minimum Characters to Satisfy One of Three Conditions||28.9%|Medium|| +|1738|Find Kth Largest XOR Coordinate Value||62.1%|Medium|| +|1739|Building Boxes||49.3%|Hard|| +|1740|Find Distance in a Binary Tree||70.8%|Medium|| +|1741|Find Total Time Spent by Each Employee||91.7%|Easy|| +|1742|Maximum Number of Balls in a Box||74.9%|Easy|| +|1743|Restore the Array From Adjacent Pairs||61.9%|Medium|| +|1744|Can You Eat Your Favorite Candy on Your Favorite Day?||30.3%|Medium|| +|1745|Palindrome Partitioning IV||48.7%|Hard|| +|1746|Maximum Subarray Sum After One Operation||64.0%|Medium|| +|1747|Leetflex Banned Accounts||69.5%|Medium|| +|1748|Sum of Unique Elements||77.9%|Easy|| +|1749|Maximum Absolute Sum of Any Subarray||45.3%|Medium|| +|1750|Minimum Length of String After Deleting Similar Ends||39.3%|Medium|| +|1751|Maximum Number of Events That Can Be Attended II||42.0%|Hard|| +|1752|Check if Array Is Sorted and Rotated||48.6%|Easy|| +|1753|Maximum Score From Removing Stones||57.3%|Medium|| +|1754|Largest Merge Of Two Strings||32.2%|Medium|| +|1755|Closest Subsequence Sum||23.1%|Hard|| |------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------| ------------------------------------------------------------------ diff --git a/ctl/label.go b/ctl/label.go index 112a721c..6553508e 100644 --- a/ctl/label.go +++ b/ctl/label.go @@ -74,12 +74,12 @@ var ( } ) -func getChapterFourFileOrder() []string { - solutions := util.LoadChapterFourDir() +func getChapterFourFileOrder() ([]string, []int) { + solutions, solutionIds := util.LoadChapterFourDir() chapterFourFileOrder := []string{"_index"} chapterFourFileOrder = append(chapterFourFileOrder, solutions...) - fmt.Printf("ChapterFour 中包括 _index 有 %v 个文件\n", len(chapterFourFileOrder)) - return chapterFourFileOrder + fmt.Printf("ChapterFour 中包括 _index 有 %v 个文件, len(id) = %v\n", len(chapterFourFileOrder), len(solutionIds)) + return chapterFourFileOrder, solutionIds } func newLabelCommand() *cobra.Command { @@ -123,57 +123,75 @@ func newDeletePreNext() *cobra.Command { func addPreNext() { // Chpater one add pre-next - addPreNextLabel(chapterOneFileOrder, []string{}, "", "ChapterOne", "ChapterTwo") + addPreNextLabel(chapterOneFileOrder, []string{}, []int{}, "", "ChapterOne", "ChapterTwo") // Chpater two add pre-next - addPreNextLabel(chapterTwoFileOrder, chapterOneFileOrder, "ChapterOne", "ChapterTwo", "ChapterThree") + addPreNextLabel(chapterTwoFileOrder, chapterOneFileOrder, []int{}, "ChapterOne", "ChapterTwo", "ChapterThree") // Chpater three add pre-next - addPreNextLabel(chapterThreeFileOrder, chapterTwoFileOrder, "ChapterTwo", "ChapterThree", "ChapterFour") + addPreNextLabel(chapterThreeFileOrder, chapterTwoFileOrder, []int{}, "ChapterTwo", "ChapterThree", "ChapterFour") // Chpater four add pre-next //fmt.Printf("%v\n", getChapterFourFileOrder()) - addPreNextLabel(getChapterFourFileOrder(), chapterThreeFileOrder, "ChapterThree", "ChapterFour", "") + chapterFourFileOrder, solutionIds := getChapterFourFileOrder() + addPreNextLabel(chapterFourFileOrder, chapterThreeFileOrder, solutionIds, "ChapterThree", "ChapterFour", "") } -func addPreNextLabel(order, preOrder []string, preChapter, chapter, nextChapter string) { +func addPreNextLabel(order, preOrder []string, chapterFourIds []int, preChapter, chapter, nextChapter string) { var ( exist bool err error res []byte count int ) - for index, v := range order { + for index, path := range order { tmp := "" if index == 0 { if chapter == "ChapterOne" { // 第一页不需要“上一章” tmp = "\n\n" + delLine + fmt.Sprintf("
\n", chapter, order[index+1]) } else { - tmp = "\n\n" + preNextHeader + fmt.Sprintf("\n", preChapter, preOrder[len(preOrder)-1]) + fmt.Sprintf("\n", chapter, order[index+1]) + preNextFotter + if chapter == "ChapterFour" { + tmp = "\n\n" + preNextHeader + fmt.Sprintf("\n", preChapter, preOrder[len(preOrder)-1]) + fmt.Sprintf("\n", chapter, util.GetChpaterFourFileNum(chapterFourIds[(index-1)+1]), order[index+1]) + preNextFotter + } else { + tmp = "\n\n" + preNextHeader + fmt.Sprintf("\n", preChapter, preOrder[len(preOrder)-1]) + fmt.Sprintf("\n", chapter, order[index+1]) + preNextFotter + } } } else if index == len(order)-1 { if chapter == "ChapterFour" { // 最后一页不需要“下一页” - tmp = "\n\n" + delLine + fmt.Sprintf("\n", chapter, order[index-1]) + tmp = "\n\n" + delLine + fmt.Sprintf("\n", chapter, util.GetChpaterFourFileNum(chapterFourIds[(index-1)-1]), order[index-1]) } else { tmp = "\n\n" + preNextHeader + fmt.Sprintf("\n", chapter, order[index-1]) + fmt.Sprintf("\n", nextChapter) + preNextFotter } } else if index == 1 { - tmp = "\n\n" + preNextHeader + fmt.Sprintf("\n", chapter) + fmt.Sprintf("\n", chapter, order[index+1]) + preNextFotter + if chapter == "ChapterFour" { + tmp = "\n\n" + preNextHeader + fmt.Sprintf("\n", chapter) + fmt.Sprintf("\n", chapter, util.GetChpaterFourFileNum(chapterFourIds[(index-1)+1]), order[index+1]) + preNextFotter + } else { + tmp = "\n\n" + preNextHeader + fmt.Sprintf("\n", chapter) + fmt.Sprintf("\n", chapter, order[index+1]) + preNextFotter + } } else { - tmp = "\n\n" + preNextHeader + fmt.Sprintf("\n", chapter, order[index-1]) + fmt.Sprintf("\n", chapter, order[index+1]) + preNextFotter + if chapter == "ChapterFour" { + tmp = "\n\n" + preNextHeader + fmt.Sprintf("\n", chapter, util.GetChpaterFourFileNum(chapterFourIds[(index-1)-1]), order[index-1]) + fmt.Sprintf("\n", chapter, util.GetChpaterFourFileNum(chapterFourIds[(index-1)+1]), order[index+1]) + preNextFotter + } else { + tmp = "\n\n" + preNextHeader + fmt.Sprintf("\n", chapter, order[index-1]) + fmt.Sprintf("\n", chapter, order[index+1]) + preNextFotter + } } - exist, err = needAdd(fmt.Sprintf("../website/content/%v/%v.md", chapter, v)) + + if chapter == "ChapterFour" && index > 0 { + path = fmt.Sprintf("%v/%v", util.GetChpaterFourFileNum(chapterFourIds[(index-1)]), path) + } + + exist, err = needAdd(fmt.Sprintf("../website/content/%v/%v.md", chapter, path)) if err != nil { fmt.Println(err) return } // 当前没有上一页和下一页,才添加 if !exist && err == nil { - res, err = eofAdd(fmt.Sprintf("../website/content/%v/%v.md", chapter, v), tmp) + res, err = eofAdd(fmt.Sprintf("../website/content/%v/%v.md", chapter, path), tmp) if err != nil { fmt.Println(err) return } - util.WriteFile(fmt.Sprintf("../website/content/%v/%v.md", chapter, v), res) + util.WriteFile(fmt.Sprintf("../website/content/%v/%v.md", chapter, path), res) count++ } } @@ -205,30 +223,35 @@ func eofAdd(filePath string, labelString string) ([]byte, error) { func delPreNext() { // Chpater one del pre-next - delPreNextLabel(chapterOneFileOrder, "ChapterOne") + delPreNextLabel(chapterOneFileOrder, []int{}, "ChapterOne") // Chpater two del pre-next - delPreNextLabel(chapterTwoFileOrder, "ChapterTwo") + delPreNextLabel(chapterTwoFileOrder, []int{}, "ChapterTwo") // Chpater three del pre-next - delPreNextLabel(chapterThreeFileOrder, "ChapterThree") + delPreNextLabel(chapterThreeFileOrder, []int{}, "ChapterThree") // Chpater four del pre-next - delPreNextLabel(getChapterFourFileOrder(), "ChapterFour") + chapterFourFileOrder, solutionIds := getChapterFourFileOrder() + delPreNextLabel(chapterFourFileOrder, solutionIds, "ChapterFour") } -func delPreNextLabel(order []string, chapter string) { +func delPreNextLabel(order []string, chapterFourIds []int, chapter string) { count := 0 - for index, v := range order { + for index, path := range order { lineNum := 5 if index == 0 && chapter == "ChapterOne" || index == len(order)-1 && chapter == "ChapterFour" { lineNum = 3 } - exist, err := needAdd(fmt.Sprintf("../website/content/%v/%v.md", chapter, v)) + if chapter == "ChapterFour" && index > 0 { + path = fmt.Sprintf("%v/%v", util.GetChpaterFourFileNum(chapterFourIds[(index-1)]), path) + } + + exist, err := needAdd(fmt.Sprintf("../website/content/%v/%v.md", chapter, path)) if err != nil { fmt.Println(err) return } // 存在才删除 if exist && err == nil { - removeLine(fmt.Sprintf("../website/content/%v/%v.md", chapter, v), lineNum+1) + removeLine(fmt.Sprintf("../website/content/%v/%v.md", chapter, path), lineNum+1) count++ } } diff --git a/ctl/models/tagproblem.go b/ctl/models/tagproblem.go index f5cfbd5b..1adc7e91 100644 --- a/ctl/models/tagproblem.go +++ b/ctl/models/tagproblem.go @@ -130,9 +130,9 @@ func GenerateTagMdRows(solutionIds []int, metaMap map[int]TagList, mdrows []Mdro s6 := strings.Replace(s5, ",", "", -1) s7 := strings.Replace(s6, "?", "", -1) if internal { - tmp.SolutionPath = fmt.Sprintf("[Go]({{< relref \"/ChapterFour/%v.md\" >}})", fmt.Sprintf("%04d.%v", int(row.FrontendQuestionID), s7)) + tmp.SolutionPath = fmt.Sprintf("[Go]({{< relref \"/ChapterFour/%v/%v.md\" >}})", util.GetChpaterFourFileNum(int(row.FrontendQuestionID)), fmt.Sprintf("%04d.%v", int(row.FrontendQuestionID), s7)) } else { - tmp.SolutionPath = fmt.Sprintf("[Go](https://books.halfrost.com/leetcode/ChapterFour/%v)", fmt.Sprintf("%04d.%v", int(row.FrontendQuestionID), s7)) + tmp.SolutionPath = fmt.Sprintf("[Go](https://books.halfrost.com/leetcode/ChapterFour/%v/%v)", util.GetChpaterFourFileNum(int(row.FrontendQuestionID)), fmt.Sprintf("%04d.%v", int(row.FrontendQuestionID), s7)) } tmp.Acceptance = row.Acceptance tmp.Difficulty = row.Difficulty diff --git a/ctl/pdf.go b/ctl/pdf.go index 9c2b432b..34282956 100644 --- a/ctl/pdf.go +++ b/ctl/pdf.go @@ -9,6 +9,7 @@ import ( "io/ioutil" "os" "regexp" + "strconv" "strings" ) @@ -59,7 +60,7 @@ func generatePDF() { // 先删除 pre-next delPreNext() - chapterFourFileOrder := util.LoadChapterFourDir() + chapterFourFileOrder, _ := util.LoadChapterFourDir() totalSolutions = len(chapterFourFileOrder) midVersion = totalSolutions / 100 lastVersion = totalSolutions % 100 @@ -102,7 +103,17 @@ func loadChapter(order []string, path, chapter string) ([]byte, error) { // 清理不支持的特殊 MarkDown 语法 tmp, err = clean(fmt.Sprintf("%v/%v/%v.md", path, chapter, v)) } else { - tmp, err = util.LoadFile(fmt.Sprintf("%v/%v/%v.md", path, chapter, v)) + if chapter == "ChapterFour" { + if v[4] == '.' { + num, err := strconv.Atoi(v[:4]) + if err != nil { + fmt.Println(err) + } + tmp, err = util.LoadFile(fmt.Sprintf("%v/%v/%v/%v.md", path, chapter, util.GetChpaterFourFileNum(num), v)) + } + } else { + tmp, err = util.LoadFile(fmt.Sprintf("%v/%v/%v.md", path, chapter, v)) + } } if err != nil { fmt.Println(err) @@ -126,7 +137,7 @@ func prepare(path string) { fmt.Println(err) } for _, v := range chapterOneFileOrder { - removeHeader(fmt.Sprintf("../website/content/ChapterOne/%v.md", v), fmt.Sprintf("./pdftemp/ChapterOne/%v.md", v), 4) + removeHeader(fmt.Sprintf("../website/content/ChapterOne/%v.md", v), fmt.Sprintf("./pdftemp/ChapterOne/%v.md", v), 5) } err = os.MkdirAll("./pdftemp/ChapterTwo", os.ModePerm) @@ -138,7 +149,7 @@ func prepare(path string) { util.CopyFile("./pdftemp/ChapterTwo/_index.md", "../website/content/ChapterTwo/_index.md") for _, v := range chapterTwoFileOrder { - removeHeader(fmt.Sprintf("./pdftemp/ChapterTwo/%v.md", v), fmt.Sprintf("./pdftemp/ChapterTwo/%v.md", v), 4) + removeHeader(fmt.Sprintf("./pdftemp/ChapterTwo/%v.md", v), fmt.Sprintf("./pdftemp/ChapterTwo/%v.md", v), 5) } err = os.MkdirAll("./pdftemp/ChapterThree", os.ModePerm) @@ -146,14 +157,14 @@ func prepare(path string) { fmt.Println(err) } for _, v := range chapterThreeFileOrder { - removeHeader(fmt.Sprintf("../website/content/ChapterThree/%v.md", v), fmt.Sprintf("./pdftemp/ChapterThree/%v.md", v), 4) + removeHeader(fmt.Sprintf("../website/content/ChapterThree/%v.md", v), fmt.Sprintf("./pdftemp/ChapterThree/%v.md", v), 5) } err = os.MkdirAll("./pdftemp/ChapterFour", os.ModePerm) if err != nil { fmt.Println(err) } - removeHeader(fmt.Sprintf("../website/content/ChapterFour/_index.md"), fmt.Sprintf("./pdftemp/ChapterFour/_index.md"), 4) + removeHeader(fmt.Sprintf("../website/content/ChapterFour/_index.md"), fmt.Sprintf("./pdftemp/ChapterFour/_index.md"), 5) } func clean(filePath string) ([]byte, error) { diff --git a/ctl/refresh.go b/ctl/refresh.go index 9db1784a..501031a6 100644 --- a/ctl/refresh.go +++ b/ctl/refresh.go @@ -18,7 +18,8 @@ func newRefresh() *cobra.Command { } func refresh() { - buildBookMenu() + //buildBookMenu() + copyLackFile() delPreNext() buildREADME() buildChapterTwo(true) diff --git a/ctl/render.go b/ctl/render.go index fe1f375b..cbd4dc46 100644 --- a/ctl/render.go +++ b/ctl/render.go @@ -4,15 +4,16 @@ import ( "bufio" "encoding/json" "fmt" - m "github.com/halfrost/LeetCode-Go/ctl/models" - "github.com/halfrost/LeetCode-Go/ctl/util" - "github.com/spf13/cobra" "io" "os" "regexp" "sort" "strconv" "strings" + + m "github.com/halfrost/LeetCode-Go/ctl/models" + "github.com/halfrost/LeetCode-Go/ctl/util" + "github.com/spf13/cobra" ) var ( @@ -33,7 +34,7 @@ func newBuildCommand() *cobra.Command { mc.AddCommand( newBuildREADME(), newBuildChapterTwo(), - newBuildMenu(), + // newBuildMenu(), ) return mc } @@ -263,24 +264,7 @@ func renderChapterTwo(filePath string, tls m.TagLists) ([]byte, error) { } func buildBookMenu() { - solutionIds, soName, _ := util.LoadSolutionsDir() - ch4Ids, _ := util.LoadChapterFourIds() - - needCopy := []string{} - for i := 0; i < len(solutionIds); i++ { - if util.BinarySearch(ch4Ids, solutionIds[i]) == -1 { - needCopy = append(needCopy, soName[i]) - } - } - if len(needCopy) > 0 { - fmt.Printf("有 %v 道题需要拷贝到第四章中\n", len(needCopy)) - for i := 0; i < len(needCopy); i++ { - util.CopyFile(fmt.Sprintf("../website/content/ChapterFour/%v.md", needCopy[i]), fmt.Sprintf("../leetcode/%v/README.md", needCopy[i])) - } - } else { - fmt.Printf("【第四章没有需要添加的题解,已经完整了】\n") - } - + copyLackFile() // 按照模板重新渲染 Menu res, err := renderBookMenu("./template/menu.md") if err != nil { @@ -291,12 +275,45 @@ func buildBookMenu() { fmt.Println("generate Menu successful") } +// 拷贝 leetcode 目录下的题解 README 文件至第四章对应文件夹中 +func copyLackFile() { + solutionIds, soName, _ := util.LoadSolutionsDir() + _, ch4Ids := util.LoadChapterFourDir() + + needCopy := []string{} + for i := 0; i < len(solutionIds); i++ { + if util.BinarySearch(ch4Ids, solutionIds[i]) == -1 { + needCopy = append(needCopy, soName[i]) + } + } + if len(needCopy) > 0 { + fmt.Printf("有 %v 道题需要拷贝到第四章中\n", len(needCopy)) + for i := 0; i < len(needCopy); i++ { + if needCopy[i][4] == '.' { + tmp, err := strconv.Atoi(needCopy[i][:4]) + if err != nil { + fmt.Println(err) + } + err = os.MkdirAll(fmt.Sprintf("../website/content/ChapterFour/%v", util.GetChpaterFourFileNum(tmp)), os.ModePerm) + if err != nil { + fmt.Println(err) + } + util.CopyFile(fmt.Sprintf("../website/content/ChapterFour/%v/%v.md", util.GetChpaterFourFileNum(tmp), needCopy[i]), fmt.Sprintf("../leetcode/%v/README.md", needCopy[i])) + util.CopyFile(fmt.Sprintf("../website/content/ChapterFour/%v/_index.md", util.GetChpaterFourFileNum(tmp)), "./template/collapseSection.md") + } + } + } else { + fmt.Printf("【第四章没有需要添加的题解,已经完整了】\n") + } +} + func generateMenu() string { res := "" res += menuLine(chapterOneMenuOrder, "ChapterOne") res += menuLine(chapterTwoFileOrder, "ChapterTwo") res += menuLine(chapterThreeFileOrder, "ChapterThree") - res += menuLine(getChapterFourFileOrder(), "ChapterFour") + chapterFourFileOrder, _ := getChapterFourFileOrder() + res += menuLine(chapterFourFileOrder, "ChapterFour") return res } diff --git a/ctl/template/Array.md b/ctl/template/Array.md index 87164757..257fd362 100644 --- a/ctl/template/Array.md +++ b/ctl/template/Array.md @@ -1,6 +1,7 @@ --- -title: Array +title: 2.01 Array type: docs +weight: 1 --- # Array diff --git a/ctl/template/Backtracking.md b/ctl/template/Backtracking.md index abbd8a52..fe1a54e6 100644 --- a/ctl/template/Backtracking.md +++ b/ctl/template/Backtracking.md @@ -1,6 +1,7 @@ --- -title: Backtracking +title: 2.08 ✅ Backtracking type: docs +weight: 8 --- # Backtracking diff --git a/ctl/template/Binary_Indexed_Tree.md b/ctl/template/Binary_Indexed_Tree.md index 0632403a..039b49cc 100644 --- a/ctl/template/Binary_Indexed_Tree.md +++ b/ctl/template/Binary_Indexed_Tree.md @@ -1,6 +1,7 @@ --- -title: Binary Indexed Tree +title: 2.19 ✅ Binary Indexed Tree type: docs +weight: 19 --- # Binary Indexed Tree diff --git a/ctl/template/Binary_Search.md b/ctl/template/Binary_Search.md index 033ca9da..e7a5de3d 100644 --- a/ctl/template/Binary_Search.md +++ b/ctl/template/Binary_Search.md @@ -1,6 +1,7 @@ --- -title: Binary Search +title: 2.11 Binary Search type: docs +weight: 11 --- # Binary Search diff --git a/ctl/template/Bit_Manipulation.md b/ctl/template/Bit_Manipulation.md index 3d568f31..6c643994 100644 --- a/ctl/template/Bit_Manipulation.md +++ b/ctl/template/Bit_Manipulation.md @@ -1,6 +1,7 @@ --- -title: Bit Manipulation +title: 2.15 ✅ Bit Manipulation type: docs +weight: 15 --- # Bit Manipulation diff --git a/ctl/template/Breadth_First_Search.md b/ctl/template/Breadth_First_Search.md index 230a3ea7..64e56acb 100644 --- a/ctl/template/Breadth_First_Search.md +++ b/ctl/template/Breadth_First_Search.md @@ -1,6 +1,7 @@ --- -title: Breadth First Search +title: 2.10 Breadth First Search type: docs +weight: 10 --- # Breadth First Search diff --git a/ctl/template/Depth_First_Search.md b/ctl/template/Depth_First_Search.md index 016d6798..e8fb4415 100644 --- a/ctl/template/Depth_First_Search.md +++ b/ctl/template/Depth_First_Search.md @@ -1,6 +1,7 @@ --- -title: Depth First Search +title: 2.09 Depth First Search type: docs +weight: 9 --- # Depth First Search diff --git a/ctl/template/Dynamic_Programming.md b/ctl/template/Dynamic_Programming.md index d3384ecb..f18015f7 100644 --- a/ctl/template/Dynamic_Programming.md +++ b/ctl/template/Dynamic_Programming.md @@ -1,6 +1,7 @@ --- -title: Dynamic Programming +title: 2.07 Dynamic Programming type: docs +weight: 7 --- # Dynamic Programming diff --git a/ctl/template/Hash_Table.md b/ctl/template/Hash_Table.md index 7677f9bd..03fb07d6 100644 --- a/ctl/template/Hash_Table.md +++ b/ctl/template/Hash_Table.md @@ -1,6 +1,7 @@ --- -title: Hash Table +title: 2.13 Hash Table type: docs +weight: 13 --- # Hash Table diff --git a/ctl/template/Linked_List.md b/ctl/template/Linked_List.md index fd332903..b8673cc3 100644 --- a/ctl/template/Linked_List.md +++ b/ctl/template/Linked_List.md @@ -1,6 +1,7 @@ --- -title: Linked List +title: 2.04 ✅ Linked List type: docs +weight: 4 --- # Linked List diff --git a/ctl/template/Math.md b/ctl/template/Math.md index 8ecedf58..dacbb1ff 100644 --- a/ctl/template/Math.md +++ b/ctl/template/Math.md @@ -1,6 +1,7 @@ --- -title: Math +title: 2.12 Math type: docs +weight: 12 --- # Math diff --git a/ctl/template/Segment_Tree.md b/ctl/template/Segment_Tree.md index 37f04d32..220ac679 100644 --- a/ctl/template/Segment_Tree.md +++ b/ctl/template/Segment_Tree.md @@ -1,6 +1,7 @@ --- -title: Segment Tree +title: 2.18 ✅ Segment Tree type: docs +weight: 18 --- # Segment Tree diff --git a/ctl/template/Sliding_Window.md b/ctl/template/Sliding_Window.md index a4fdca5c..117e5022 100644 --- a/ctl/template/Sliding_Window.md +++ b/ctl/template/Sliding_Window.md @@ -1,6 +1,7 @@ --- -title: Sliding Window +title: 2.17 ✅ Sliding Window type: docs +weight: 17 --- # Sliding Window diff --git a/ctl/template/Sort.md b/ctl/template/Sort.md index 9e68d7dd..00ded106 100644 --- a/ctl/template/Sort.md +++ b/ctl/template/Sort.md @@ -1,6 +1,7 @@ --- -title: Sort +title: 2.14 ✅ Sort type: docs +weight: 14 --- # Sort diff --git a/ctl/template/Stack.md b/ctl/template/Stack.md index 3f1658e4..0cc1f39b 100644 --- a/ctl/template/Stack.md +++ b/ctl/template/Stack.md @@ -1,6 +1,7 @@ --- -title: Stack +title: 2.05 ✅ Stack type: docs +weight: 5 --- # Stack diff --git a/ctl/template/String.md b/ctl/template/String.md index 87afd108..e0505e33 100644 --- a/ctl/template/String.md +++ b/ctl/template/String.md @@ -1,6 +1,7 @@ --- -title: String +title: 2.02 String type: docs +weight: 2 --- # String diff --git a/ctl/template/Tree.md b/ctl/template/Tree.md index c62c5398..19bdee6b 100644 --- a/ctl/template/Tree.md +++ b/ctl/template/Tree.md @@ -1,6 +1,7 @@ --- -title: Tree +title: 2.06 Tree type: docs +weight: 6 --- # Tree diff --git a/ctl/template/Two_Pointers.md b/ctl/template/Two_Pointers.md index 80af5330..e25406e0 100644 --- a/ctl/template/Two_Pointers.md +++ b/ctl/template/Two_Pointers.md @@ -1,6 +1,7 @@ --- -title: Two Pointers +title: 2.03 ✅ Two Pointers type: docs +weight: 3 --- # Two Pointers diff --git a/ctl/template/Union_Find.md b/ctl/template/Union_Find.md index 752a5727..0b23116f 100644 --- a/ctl/template/Union_Find.md +++ b/ctl/template/Union_Find.md @@ -1,6 +1,7 @@ --- -title: Union Find +title: 2.16 ✅ Union Find type: docs +weight: 16 --- # Union Find diff --git a/ctl/template/collapseSection.md b/ctl/template/collapseSection.md new file mode 100644 index 00000000..e954f087 --- /dev/null +++ b/ctl/template/collapseSection.md @@ -0,0 +1,4 @@ +--- +bookCollapseSection: true +weight: 20 +--- diff --git a/ctl/util/util.go b/ctl/util/util.go index 21226991..4fcf5b02 100644 --- a/ctl/util/util.go +++ b/ctl/util/util.go @@ -19,13 +19,6 @@ func LoadSolutionsDir() ([]int, []string, int) { return solutionIds, soNames, total - len(solutionIds) } -// LoadChapterFourIds define -func LoadChapterFourIds() ([]int, []string) { - solutionIds, soNames, _ := loadFile("../website/content/ChapterFour/") - fmt.Printf("读取了第四章 %v 道题的题解\n", len(solutionIds)) - return solutionIds, soNames -} - func loadFile(path string) ([]int, []string, int) { files, err := ioutil.ReadDir(path) if err != nil { @@ -51,22 +44,38 @@ func loadFile(path string) ([]int, []string, int) { return solutionIds, soNames, len(files) } +// GetAllFile define +func GetAllFile(pathname string, fileList *[]string) ([]string, error) { + rd, err := ioutil.ReadDir(pathname) + for _, fi := range rd { + if fi.IsDir() { + //fmt.Printf("[%s]\n", pathname+"\\"+fi.Name()) + GetAllFile(pathname+fi.Name()+"/", fileList) + } else { + //fmt.Println(fi.Name()) + *fileList = append(*fileList, fi.Name()) + } + } + return *fileList, err +} + // LoadChapterFourDir define -func LoadChapterFourDir() []string { - files, err := ioutil.ReadDir("../website/content/ChapterFour/") +func LoadChapterFourDir() ([]string, []int) { + files, err := GetAllFile("../website/content/ChapterFour/", &[]string{}) + // files, err := ioutil.ReadDir("../website/content/ChapterFour/") if err != nil { fmt.Println(err) } solutions, solutionIds, solutionsMap := []string{}, []int{}, map[int]string{} for _, f := range files { - if f.Name()[4] == '.' { - tmp, err := strconv.Atoi(f.Name()[:4]) + if f[4] == '.' { + tmp, err := strconv.Atoi(f[:4]) if err != nil { fmt.Println(err) } solutionIds = append(solutionIds, tmp) // len(f.Name())-3 = 文件名去掉 .md 后缀 - solutionsMap[tmp] = f.Name()[:len(f.Name())-3] + solutionsMap[tmp] = f[:len(f)-3] } } sort.Ints(solutionIds) @@ -76,7 +85,7 @@ func LoadChapterFourDir() []string { solutions = append(solutions, name) } } - return solutions + return solutions, solutionIds } // WriteFile define @@ -166,3 +175,11 @@ func BinarySearch(nums []int, target int) int { } return -1 } + +// GetChpaterFourFileNum define +func GetChpaterFourFileNum(num int) string { + if num < 100 { + return fmt.Sprintf("%04d~%04d", (num/100)*100+1, (num/100)*100+99) + } + return fmt.Sprintf("%04d~%04d", (num/100)*100, (num/100)*100+99) +} diff --git a/website/config.toml b/website/config.toml index ce6e14c2..11ae9401 100644 --- a/website/config.toml +++ b/website/config.toml @@ -73,6 +73,10 @@ disablePathToLower = true # weight = 30 [params] + # (Optional, default light) Sets color theme: light, dark or auto. + # Theme 'auto' switches between dark and light modes based on browser/os preferences + BookTheme = 'light' + # (Optional, default true) Controls table of contents visibility on right side of pages. # Start and end levels can be controlled with markup.tableOfContents setting. # You can also specify this parameter per page in front matter. @@ -84,11 +88,11 @@ disablePathToLower = true # (Optional, default none) Set leaf bundle to render as side menu # When not specified file structure and weights will be used - BookMenuBundle = '/menu' + # BookMenuBundle = '/menu' # (Optional, default docs) Specify section of content to render as menu # You can also set value to '*' to render all sections to menu - BookSection = 'docs' + BookSection = '*' # Set source repository location. # Used for 'Last Modified' and 'Edit this page' links. @@ -126,6 +130,10 @@ disablePathToLower = true # (Optional, experimental, default false) Enables service worker that caches visited pages and resources for offline use. BookServiceWorker = true + # /!\ This is an experimental feature, might be removed or changed at any time + # (Optional, experimental, default false) Enables a drop-down menu for translations only if a translation is present. + BookTranslatedOnly = false + [params.gitalk] clientID = "75d9d747f200c623a0e6" # Your client ID clientSecret = "e3cc2ff8d8f6ae3c894a827f226188de0d26f37e" # Your client secret diff --git a/website/content/ChapterFour/0001.Two-Sum.md b/website/content/ChapterFour/0001~0099/0001.Two-Sum.md similarity index 92% rename from website/content/ChapterFour/0001.Two-Sum.md rename to website/content/ChapterFour/0001~0099/0001.Two-Sum.md index a45c6f51..d84bc7af 100644 --- a/website/content/ChapterFour/0001.Two-Sum.md +++ b/website/content/ChapterFour/0001~0099/0001.Two-Sum.md @@ -53,5 +53,5 @@ func twoSum(nums []int, target int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0002.Add-Two-Numbers.md b/website/content/ChapterFour/0001~0099/0002.Add-Two-Numbers.md similarity index 91% rename from website/content/ChapterFour/0002.Add-Two-Numbers.md rename to website/content/ChapterFour/0001~0099/0002.Add-Two-Numbers.md index 090c9379..a64c6a30 100644 --- a/website/content/ChapterFour/0002.Add-Two-Numbers.md +++ b/website/content/ChapterFour/0001~0099/0002.Add-Two-Numbers.md @@ -80,6 +80,6 @@ func addTwoNumbers(l1 *ListNode, l2 *ListNode) *ListNode { ---------------------------------------------- diff --git a/website/content/ChapterFour/0003.Longest-Substring-Without-Repeating-Characters.md b/website/content/ChapterFour/0001~0099/0003.Longest-Substring-Without-Repeating-Characters.md similarity index 90% rename from website/content/ChapterFour/0003.Longest-Substring-Without-Repeating-Characters.md rename to website/content/ChapterFour/0001~0099/0003.Longest-Substring-Without-Repeating-Characters.md index 19d3329b..d5406eff 100644 --- a/website/content/ChapterFour/0003.Longest-Substring-Without-Repeating-Characters.md +++ b/website/content/ChapterFour/0001~0099/0003.Longest-Substring-Without-Repeating-Characters.md @@ -126,6 +126,6 @@ func max(a int, b int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0004.Median-of-Two-Sorted-Arrays.md b/website/content/ChapterFour/0001~0099/0004.Median-of-Two-Sorted-Arrays.md similarity index 94% rename from website/content/ChapterFour/0004.Median-of-Two-Sorted-Arrays.md rename to website/content/ChapterFour/0001~0099/0004.Median-of-Two-Sorted-Arrays.md index e8821397..828b60c5 100755 --- a/website/content/ChapterFour/0004.Median-of-Two-Sorted-Arrays.md +++ b/website/content/ChapterFour/0001~0099/0004.Median-of-Two-Sorted-Arrays.md @@ -100,6 +100,6 @@ func findMedianSortedArrays(nums1 []int, nums2 []int) float64 { ---------------------------------------------- diff --git a/website/content/ChapterFour/0007.Reverse-Integer.md b/website/content/ChapterFour/0001~0099/0007.Reverse-Integer.md similarity index 85% rename from website/content/ChapterFour/0007.Reverse-Integer.md rename to website/content/ChapterFour/0001~0099/0007.Reverse-Integer.md index 6f8273ec..e1b82b46 100755 --- a/website/content/ChapterFour/0007.Reverse-Integer.md +++ b/website/content/ChapterFour/0001~0099/0007.Reverse-Integer.md @@ -57,6 +57,6 @@ func reverse7(x int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0009.Palindrome-Number.md b/website/content/ChapterFour/0001~0099/0009.Palindrome-Number.md similarity index 85% rename from website/content/ChapterFour/0009.Palindrome-Number.md rename to website/content/ChapterFour/0001~0099/0009.Palindrome-Number.md index b74c69ef..4941d13c 100644 --- a/website/content/ChapterFour/0009.Palindrome-Number.md +++ b/website/content/ChapterFour/0001~0099/0009.Palindrome-Number.md @@ -71,6 +71,6 @@ func isPalindrome(x int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0011.Container-With-Most-Water.md b/website/content/ChapterFour/0001~0099/0011.Container-With-Most-Water.md similarity index 87% rename from website/content/ChapterFour/0011.Container-With-Most-Water.md rename to website/content/ChapterFour/0001~0099/0011.Container-With-Most-Water.md index 9591c9ef..7c40c781 100644 --- a/website/content/ChapterFour/0011.Container-With-Most-Water.md +++ b/website/content/ChapterFour/0001~0099/0011.Container-With-Most-Water.md @@ -61,6 +61,6 @@ func maxArea(height []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0013.Roman-to-Integer.md b/website/content/ChapterFour/0001~0099/0013.Roman-to-Integer.md similarity index 93% rename from website/content/ChapterFour/0013.Roman-to-Integer.md rename to website/content/ChapterFour/0001~0099/0013.Roman-to-Integer.md index 5e5ece59..fd652aea 100644 --- a/website/content/ChapterFour/0013.Roman-to-Integer.md +++ b/website/content/ChapterFour/0001~0099/0013.Roman-to-Integer.md @@ -134,6 +134,6 @@ func romanToInt(s string) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0015.3Sum.md b/website/content/ChapterFour/0001~0099/0015.3Sum.md similarity index 93% rename from website/content/ChapterFour/0015.3Sum.md rename to website/content/ChapterFour/0001~0099/0015.3Sum.md index 46dc2b4c..6de46982 100644 --- a/website/content/ChapterFour/0015.3Sum.md +++ b/website/content/ChapterFour/0001~0099/0015.3Sum.md @@ -120,6 +120,6 @@ func threeSum1(nums []int) [][]int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0016.3Sum-Closest.md b/website/content/ChapterFour/0001~0099/0016.3Sum-Closest.md similarity index 91% rename from website/content/ChapterFour/0016.3Sum-Closest.md rename to website/content/ChapterFour/0001~0099/0016.3Sum-Closest.md index 117a1935..447778b9 100644 --- a/website/content/ChapterFour/0016.3Sum-Closest.md +++ b/website/content/ChapterFour/0001~0099/0016.3Sum-Closest.md @@ -91,6 +91,6 @@ func abs(a int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0017.Letter-Combinations-of-a-Phone-Number.md b/website/content/ChapterFour/0001~0099/0017.Letter-Combinations-of-a-Phone-Number.md similarity index 93% rename from website/content/ChapterFour/0017.Letter-Combinations-of-a-Phone-Number.md rename to website/content/ChapterFour/0001~0099/0017.Letter-Combinations-of-a-Phone-Number.md index e6cc6cf4..4bb0f769 100755 --- a/website/content/ChapterFour/0017.Letter-Combinations-of-a-Phone-Number.md +++ b/website/content/ChapterFour/0001~0099/0017.Letter-Combinations-of-a-Phone-Number.md @@ -146,6 +146,6 @@ func letterFunc(res string, digits string) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0018.4Sum.md b/website/content/ChapterFour/0001~0099/0018.4Sum.md similarity index 92% rename from website/content/ChapterFour/0018.4Sum.md rename to website/content/ChapterFour/0001~0099/0018.4Sum.md index 59682039..80186154 100644 --- a/website/content/ChapterFour/0018.4Sum.md +++ b/website/content/ChapterFour/0001~0099/0018.4Sum.md @@ -99,6 +99,6 @@ func fourSum(nums []int, target int) [][]int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0019.Remove-Nth-Node-From-End-of-List.md b/website/content/ChapterFour/0001~0099/0019.Remove-Nth-Node-From-End-of-List.md similarity index 90% rename from website/content/ChapterFour/0019.Remove-Nth-Node-From-End-of-List.md rename to website/content/ChapterFour/0001~0099/0019.Remove-Nth-Node-From-End-of-List.md index 28fe564c..0df460da 100644 --- a/website/content/ChapterFour/0019.Remove-Nth-Node-From-End-of-List.md +++ b/website/content/ChapterFour/0001~0099/0019.Remove-Nth-Node-From-End-of-List.md @@ -102,6 +102,6 @@ func removeNthFromEnd1(head *ListNode, n int) *ListNode { ---------------------------------------------- diff --git a/website/content/ChapterFour/0020.Valid-Parentheses.md b/website/content/ChapterFour/0001~0099/0020.Valid-Parentheses.md similarity index 86% rename from website/content/ChapterFour/0020.Valid-Parentheses.md rename to website/content/ChapterFour/0001~0099/0020.Valid-Parentheses.md index 77b1b83b..f1a6faa2 100644 --- a/website/content/ChapterFour/0020.Valid-Parentheses.md +++ b/website/content/ChapterFour/0001~0099/0020.Valid-Parentheses.md @@ -98,6 +98,6 @@ func isValid(s string) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0021.Merge-Two-Sorted-Lists.md b/website/content/ChapterFour/0001~0099/0021.Merge-Two-Sorted-Lists.md similarity index 79% rename from website/content/ChapterFour/0021.Merge-Two-Sorted-Lists.md rename to website/content/ChapterFour/0001~0099/0021.Merge-Two-Sorted-Lists.md index dd007fe2..76cdbff7 100644 --- a/website/content/ChapterFour/0021.Merge-Two-Sorted-Lists.md +++ b/website/content/ChapterFour/0001~0099/0021.Merge-Two-Sorted-Lists.md @@ -55,6 +55,6 @@ func mergeTwoLists(l1 *ListNode, l2 *ListNode) *ListNode { ---------------------------------------------- diff --git a/website/content/ChapterFour/0022.Generate-Parentheses.md b/website/content/ChapterFour/0001~0099/0022.Generate-Parentheses.md similarity index 85% rename from website/content/ChapterFour/0022.Generate-Parentheses.md rename to website/content/ChapterFour/0001~0099/0022.Generate-Parentheses.md index 2188ce03..882fdd4b 100755 --- a/website/content/ChapterFour/0022.Generate-Parentheses.md +++ b/website/content/ChapterFour/0001~0099/0022.Generate-Parentheses.md @@ -62,6 +62,6 @@ func findGenerateParenthesis(lindex, rindex int, str string, res *[]string) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0023.Merge-k-Sorted-Lists.md b/website/content/ChapterFour/0001~0099/0023.Merge-k-Sorted-Lists.md similarity index 83% rename from website/content/ChapterFour/0023.Merge-k-Sorted-Lists.md rename to website/content/ChapterFour/0001~0099/0023.Merge-k-Sorted-Lists.md index 78a8c5e9..d6c5ef8d 100644 --- a/website/content/ChapterFour/0023.Merge-k-Sorted-Lists.md +++ b/website/content/ChapterFour/0001~0099/0023.Merge-k-Sorted-Lists.md @@ -76,6 +76,6 @@ func mergeTwoLists1(l1 *ListNode, l2 *ListNode) *ListNode { ---------------------------------------------- diff --git a/website/content/ChapterFour/0024.Swap-Nodes-in-Pairs.md b/website/content/ChapterFour/0001~0099/0024.Swap-Nodes-in-Pairs.md similarity index 83% rename from website/content/ChapterFour/0024.Swap-Nodes-in-Pairs.md rename to website/content/ChapterFour/0001~0099/0024.Swap-Nodes-in-Pairs.md index 7df959d3..3283b4a9 100644 --- a/website/content/ChapterFour/0024.Swap-Nodes-in-Pairs.md +++ b/website/content/ChapterFour/0001~0099/0024.Swap-Nodes-in-Pairs.md @@ -73,6 +73,6 @@ func swapPairs(head *ListNode) *ListNode { ---------------------------------------------- diff --git a/website/content/ChapterFour/0025.Reverse-Nodes-in-k-Group.md b/website/content/ChapterFour/0001~0099/0025.Reverse-Nodes-in-k-Group.md similarity index 87% rename from website/content/ChapterFour/0025.Reverse-Nodes-in-k-Group.md rename to website/content/ChapterFour/0001~0099/0025.Reverse-Nodes-in-k-Group.md index cca95bdf..417548b9 100644 --- a/website/content/ChapterFour/0025.Reverse-Nodes-in-k-Group.md +++ b/website/content/ChapterFour/0001~0099/0025.Reverse-Nodes-in-k-Group.md @@ -76,6 +76,6 @@ func reverse(first *ListNode, last *ListNode) *ListNode { ---------------------------------------------- diff --git a/website/content/ChapterFour/0026.Remove-Duplicates-from-Sorted-Array.md b/website/content/ChapterFour/0001~0099/0026.Remove-Duplicates-from-Sorted-Array.md similarity index 92% rename from website/content/ChapterFour/0026.Remove-Duplicates-from-Sorted-Array.md rename to website/content/ChapterFour/0001~0099/0026.Remove-Duplicates-from-Sorted-Array.md index 0b32f0ad..6d603424 100644 --- a/website/content/ChapterFour/0026.Remove-Duplicates-from-Sorted-Array.md +++ b/website/content/ChapterFour/0001~0099/0026.Remove-Duplicates-from-Sorted-Array.md @@ -130,6 +130,6 @@ func removeElement1(nums []int, start, val int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0027.Remove-Element.md b/website/content/ChapterFour/0001~0099/0027.Remove-Element.md similarity index 90% rename from website/content/ChapterFour/0027.Remove-Element.md rename to website/content/ChapterFour/0001~0099/0027.Remove-Element.md index 0dc8bb08..7f77f820 100644 --- a/website/content/ChapterFour/0027.Remove-Element.md +++ b/website/content/ChapterFour/0001~0099/0027.Remove-Element.md @@ -93,6 +93,6 @@ func removeElement(nums []int, val int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0028.Implement-strStr.md b/website/content/ChapterFour/0001~0099/0028.Implement-strStr.md similarity index 86% rename from website/content/ChapterFour/0028.Implement-strStr.md rename to website/content/ChapterFour/0001~0099/0028.Implement-strStr.md index 9ab526ff..b7c44e24 100644 --- a/website/content/ChapterFour/0028.Implement-strStr.md +++ b/website/content/ChapterFour/0001~0099/0028.Implement-strStr.md @@ -88,6 +88,6 @@ func strStr1(haystack string, needle string) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0029.Divide-Two-Integers.md b/website/content/ChapterFour/0001~0099/0029.Divide-Two-Integers.md similarity index 94% rename from website/content/ChapterFour/0029.Divide-Two-Integers.md rename to website/content/ChapterFour/0001~0099/0029.Divide-Two-Integers.md index 5ca4689f..aa5672d1 100755 --- a/website/content/ChapterFour/0029.Divide-Two-Integers.md +++ b/website/content/ChapterFour/0001~0099/0029.Divide-Two-Integers.md @@ -150,6 +150,6 @@ func divide1(divided int, divisor int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0030.Substring-with-Concatenation-of-All-Words.md b/website/content/ChapterFour/0001~0099/0030.Substring-with-Concatenation-of-All-Words.md similarity index 92% rename from website/content/ChapterFour/0030.Substring-with-Concatenation-of-All-Words.md rename to website/content/ChapterFour/0001~0099/0030.Substring-with-Concatenation-of-All-Words.md index 6f6e762b..6494c1c9 100644 --- a/website/content/ChapterFour/0030.Substring-with-Concatenation-of-All-Words.md +++ b/website/content/ChapterFour/0001~0099/0030.Substring-with-Concatenation-of-All-Words.md @@ -100,6 +100,6 @@ func copyMap(s map[string]int) map[string]int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0033.Search-in-Rotated-Sorted-Array.md b/website/content/ChapterFour/0001~0099/0033.Search-in-Rotated-Sorted-Array.md similarity index 91% rename from website/content/ChapterFour/0033.Search-in-Rotated-Sorted-Array.md rename to website/content/ChapterFour/0001~0099/0033.Search-in-Rotated-Sorted-Array.md index c31b5ed5..94fb9ab8 100755 --- a/website/content/ChapterFour/0033.Search-in-Rotated-Sorted-Array.md +++ b/website/content/ChapterFour/0001~0099/0033.Search-in-Rotated-Sorted-Array.md @@ -80,6 +80,6 @@ func search33(nums []int, target int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array.md b/website/content/ChapterFour/0001~0099/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array.md similarity index 93% rename from website/content/ChapterFour/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array.md rename to website/content/ChapterFour/0001~0099/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array.md index 5e5f850c..bed0481a 100755 --- a/website/content/ChapterFour/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array.md +++ b/website/content/ChapterFour/0001~0099/0034.Find-First-and-Last-Position-of-Element-in-Sorted-Array.md @@ -123,6 +123,6 @@ func searchLastLessElement(nums []int, target int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0035.Search-Insert-Position.md b/website/content/ChapterFour/0001~0099/0035.Search-Insert-Position.md similarity index 84% rename from website/content/ChapterFour/0035.Search-Insert-Position.md rename to website/content/ChapterFour/0001~0099/0035.Search-Insert-Position.md index 554f7c5f..ec99aca7 100755 --- a/website/content/ChapterFour/0035.Search-Insert-Position.md +++ b/website/content/ChapterFour/0001~0099/0035.Search-Insert-Position.md @@ -67,6 +67,6 @@ func searchInsert(nums []int, target int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0036.Valid-Sudoku.md b/website/content/ChapterFour/0001~0099/0036.Valid-Sudoku.md similarity index 95% rename from website/content/ChapterFour/0036.Valid-Sudoku.md rename to website/content/ChapterFour/0001~0099/0036.Valid-Sudoku.md index b180ee60..68ad64cd 100755 --- a/website/content/ChapterFour/0036.Valid-Sudoku.md +++ b/website/content/ChapterFour/0001~0099/0036.Valid-Sudoku.md @@ -170,6 +170,6 @@ func isValidSudoku1(board [][]byte) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0037.Sudoku-Solver.md b/website/content/ChapterFour/0001~0099/0037.Sudoku-Solver.md similarity index 93% rename from website/content/ChapterFour/0037.Sudoku-Solver.md rename to website/content/ChapterFour/0001~0099/0037.Sudoku-Solver.md index da7a7c32..541b4efc 100755 --- a/website/content/ChapterFour/0037.Sudoku-Solver.md +++ b/website/content/ChapterFour/0001~0099/0037.Sudoku-Solver.md @@ -120,6 +120,6 @@ func checkSudoku(board *[][]byte, pos position, val int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0039.Combination-Sum.md b/website/content/ChapterFour/0001~0099/0039.Combination-Sum.md similarity index 89% rename from website/content/ChapterFour/0039.Combination-Sum.md rename to website/content/ChapterFour/0001~0099/0039.Combination-Sum.md index 4f5be48c..4681f48b 100755 --- a/website/content/ChapterFour/0039.Combination-Sum.md +++ b/website/content/ChapterFour/0001~0099/0039.Combination-Sum.md @@ -89,6 +89,6 @@ func findcombinationSum(nums []int, target, index int, c []int, res *[][]int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0040.Combination-Sum-II.md b/website/content/ChapterFour/0001~0099/0040.Combination-Sum-II.md similarity index 90% rename from website/content/ChapterFour/0040.Combination-Sum-II.md rename to website/content/ChapterFour/0001~0099/0040.Combination-Sum-II.md index 36ecc38a..4a0185ed 100755 --- a/website/content/ChapterFour/0040.Combination-Sum-II.md +++ b/website/content/ChapterFour/0001~0099/0040.Combination-Sum-II.md @@ -91,6 +91,6 @@ func findcombinationSum2(nums []int, target, index int, c []int, res *[][]int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0041.First-Missing-Positive.md b/website/content/ChapterFour/0001~0099/0041.First-Missing-Positive.md similarity index 82% rename from website/content/ChapterFour/0041.First-Missing-Positive.md rename to website/content/ChapterFour/0001~0099/0041.First-Missing-Positive.md index 6e3915d0..6ab60da3 100644 --- a/website/content/ChapterFour/0041.First-Missing-Positive.md +++ b/website/content/ChapterFour/0001~0099/0041.First-Missing-Positive.md @@ -68,6 +68,6 @@ func firstMissingPositive(nums []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0042.Trapping-Rain-Water.md b/website/content/ChapterFour/0001~0099/0042.Trapping-Rain-Water.md similarity index 93% rename from website/content/ChapterFour/0042.Trapping-Rain-Water.md rename to website/content/ChapterFour/0001~0099/0042.Trapping-Rain-Water.md index a16a2890..c4bb98d4 100644 --- a/website/content/ChapterFour/0042.Trapping-Rain-Water.md +++ b/website/content/ChapterFour/0001~0099/0042.Trapping-Rain-Water.md @@ -63,6 +63,6 @@ func trap(height []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0046.Permutations.md b/website/content/ChapterFour/0001~0099/0046.Permutations.md similarity index 84% rename from website/content/ChapterFour/0046.Permutations.md rename to website/content/ChapterFour/0001~0099/0046.Permutations.md index 1be0d0d2..28369b77 100755 --- a/website/content/ChapterFour/0046.Permutations.md +++ b/website/content/ChapterFour/0001~0099/0046.Permutations.md @@ -68,6 +68,6 @@ func generatePermutation(nums []int, index int, p []int, res *[][]int, used *[]b ---------------------------------------------- diff --git a/website/content/ChapterFour/0047.Permutations-II.md b/website/content/ChapterFour/0001~0099/0047.Permutations-II.md similarity index 88% rename from website/content/ChapterFour/0047.Permutations-II.md rename to website/content/ChapterFour/0001~0099/0047.Permutations-II.md index cd0a38d8..e6aaccdf 100755 --- a/website/content/ChapterFour/0047.Permutations-II.md +++ b/website/content/ChapterFour/0001~0099/0047.Permutations-II.md @@ -72,6 +72,6 @@ func generatePermutation47(nums []int, index int, p []int, res *[][]int, used *[ ---------------------------------------------- diff --git a/website/content/ChapterFour/0048.Rotate-Image.md b/website/content/ChapterFour/0001~0099/0048.Rotate-Image.md similarity index 93% rename from website/content/ChapterFour/0048.Rotate-Image.md rename to website/content/ChapterFour/0001~0099/0048.Rotate-Image.md index 2913142a..4cddaa55 100755 --- a/website/content/ChapterFour/0048.Rotate-Image.md +++ b/website/content/ChapterFour/0001~0099/0048.Rotate-Image.md @@ -129,6 +129,6 @@ func rotate(matrix [][]int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0049.Group-Anagrams.md b/website/content/ChapterFour/0001~0099/0049.Group-Anagrams.md similarity index 88% rename from website/content/ChapterFour/0049.Group-Anagrams.md rename to website/content/ChapterFour/0001~0099/0049.Group-Anagrams.md index 0fe588da..d677466d 100644 --- a/website/content/ChapterFour/0049.Group-Anagrams.md +++ b/website/content/ChapterFour/0001~0099/0049.Group-Anagrams.md @@ -74,6 +74,6 @@ func groupAnagrams(strs []string) [][]string { ---------------------------------------------- diff --git a/website/content/ChapterFour/0050.Powx-n.md b/website/content/ChapterFour/0001~0099/0050.Powx-n.md similarity index 84% rename from website/content/ChapterFour/0050.Powx-n.md rename to website/content/ChapterFour/0001~0099/0050.Powx-n.md index c4a4cc04..714c1861 100755 --- a/website/content/ChapterFour/0050.Powx-n.md +++ b/website/content/ChapterFour/0001~0099/0050.Powx-n.md @@ -71,6 +71,6 @@ func myPow(x float64, n int) float64 { ---------------------------------------------- diff --git a/website/content/ChapterFour/0051.N-Queens.md b/website/content/ChapterFour/0001~0099/0051.N-Queens.md similarity index 94% rename from website/content/ChapterFour/0051.N-Queens.md rename to website/content/ChapterFour/0001~0099/0051.N-Queens.md index a139bf0b..d2d8dbe8 100755 --- a/website/content/ChapterFour/0051.N-Queens.md +++ b/website/content/ChapterFour/0001~0099/0051.N-Queens.md @@ -136,6 +136,6 @@ func generateBoard(n int, row *[]int) []string { ---------------------------------------------- diff --git a/website/content/ChapterFour/0052.N-Queens-II.md b/website/content/ChapterFour/0001~0099/0052.N-Queens-II.md similarity index 92% rename from website/content/ChapterFour/0052.N-Queens-II.md rename to website/content/ChapterFour/0001~0099/0052.N-Queens-II.md index 16aa957d..4bf016f1 100755 --- a/website/content/ChapterFour/0052.N-Queens-II.md +++ b/website/content/ChapterFour/0001~0099/0052.N-Queens-II.md @@ -109,6 +109,6 @@ func putQueen52(n, index int, col, dia1, dia2 *[]bool, row *[]int, res *int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0053.Maximum-Subarray.md b/website/content/ChapterFour/0001~0099/0053.Maximum-Subarray.md similarity index 88% rename from website/content/ChapterFour/0053.Maximum-Subarray.md rename to website/content/ChapterFour/0001~0099/0053.Maximum-Subarray.md index ada3aaa0..a0248127 100755 --- a/website/content/ChapterFour/0053.Maximum-Subarray.md +++ b/website/content/ChapterFour/0001~0099/0053.Maximum-Subarray.md @@ -77,6 +77,6 @@ func maxSubArray1(nums []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0054.Spiral-Matrix.md b/website/content/ChapterFour/0001~0099/0054.Spiral-Matrix.md similarity index 93% rename from website/content/ChapterFour/0054.Spiral-Matrix.md rename to website/content/ChapterFour/0001~0099/0054.Spiral-Matrix.md index f4207db7..5d75a8e6 100755 --- a/website/content/ChapterFour/0054.Spiral-Matrix.md +++ b/website/content/ChapterFour/0001~0099/0054.Spiral-Matrix.md @@ -167,6 +167,6 @@ func spiralOrder2(matrix [][]int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0055.Jump-Game.md b/website/content/ChapterFour/0001~0099/0055.Jump-Game.md similarity index 88% rename from website/content/ChapterFour/0055.Jump-Game.md rename to website/content/ChapterFour/0001~0099/0055.Jump-Game.md index f7728173..a34c5d26 100644 --- a/website/content/ChapterFour/0055.Jump-Game.md +++ b/website/content/ChapterFour/0001~0099/0055.Jump-Game.md @@ -60,6 +60,6 @@ func canJump(nums []int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0056.Merge-Intervals.md b/website/content/ChapterFour/0001~0099/0056.Merge-Intervals.md similarity index 89% rename from website/content/ChapterFour/0056.Merge-Intervals.md rename to website/content/ChapterFour/0001~0099/0056.Merge-Intervals.md index bf424015..236c252f 100644 --- a/website/content/ChapterFour/0056.Merge-Intervals.md +++ b/website/content/ChapterFour/0001~0099/0056.Merge-Intervals.md @@ -111,6 +111,6 @@ func quickSort(a []Interval, lo, hi int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0057.Insert-Interval.md b/website/content/ChapterFour/0001~0099/0057.Insert-Interval.md similarity index 89% rename from website/content/ChapterFour/0057.Insert-Interval.md rename to website/content/ChapterFour/0001~0099/0057.Insert-Interval.md index 77957dd9..9aef7db1 100644 --- a/website/content/ChapterFour/0057.Insert-Interval.md +++ b/website/content/ChapterFour/0001~0099/0057.Insert-Interval.md @@ -77,6 +77,6 @@ func insert(intervals []Interval, newInterval Interval) []Interval { ---------------------------------------------- diff --git a/website/content/ChapterFour/0059.Spiral-Matrix-II.md b/website/content/ChapterFour/0001~0099/0059.Spiral-Matrix-II.md similarity index 89% rename from website/content/ChapterFour/0059.Spiral-Matrix-II.md rename to website/content/ChapterFour/0001~0099/0059.Spiral-Matrix-II.md index 763affe6..f9d5f999 100755 --- a/website/content/ChapterFour/0059.Spiral-Matrix-II.md +++ b/website/content/ChapterFour/0001~0099/0059.Spiral-Matrix-II.md @@ -96,6 +96,6 @@ func generateMatrix(n int) [][]int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0060.Permutation-Sequence.md b/website/content/ChapterFour/0001~0099/0060.Permutation-Sequence.md similarity index 89% rename from website/content/ChapterFour/0060.Permutation-Sequence.md rename to website/content/ChapterFour/0001~0099/0060.Permutation-Sequence.md index 67889293..ea18f695 100755 --- a/website/content/ChapterFour/0060.Permutation-Sequence.md +++ b/website/content/ChapterFour/0001~0099/0060.Permutation-Sequence.md @@ -98,6 +98,6 @@ func findPermutation(n, index int, k *int, p []int, res *string, used *[]bool) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0061.Rotate-List.md b/website/content/ChapterFour/0001~0099/0061.Rotate-List.md similarity index 88% rename from website/content/ChapterFour/0061.Rotate-List.md rename to website/content/ChapterFour/0001~0099/0061.Rotate-List.md index f4adedb5..9a0da026 100644 --- a/website/content/ChapterFour/0061.Rotate-List.md +++ b/website/content/ChapterFour/0001~0099/0061.Rotate-List.md @@ -83,6 +83,6 @@ func rotateRight(head *ListNode, k int) *ListNode { ---------------------------------------------- diff --git a/website/content/ChapterFour/0062.Unique-Paths.md b/website/content/ChapterFour/0001~0099/0062.Unique-Paths.md similarity index 89% rename from website/content/ChapterFour/0062.Unique-Paths.md rename to website/content/ChapterFour/0001~0099/0062.Unique-Paths.md index a0dce700..e2023e49 100755 --- a/website/content/ChapterFour/0062.Unique-Paths.md +++ b/website/content/ChapterFour/0001~0099/0062.Unique-Paths.md @@ -71,6 +71,6 @@ func uniquePaths(m int, n int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0063.Unique-Paths-II.md b/website/content/ChapterFour/0001~0099/0063.Unique-Paths-II.md similarity index 91% rename from website/content/ChapterFour/0063.Unique-Paths-II.md rename to website/content/ChapterFour/0001~0099/0063.Unique-Paths-II.md index 6038f50c..b5353ca8 100755 --- a/website/content/ChapterFour/0063.Unique-Paths-II.md +++ b/website/content/ChapterFour/0001~0099/0063.Unique-Paths-II.md @@ -82,6 +82,6 @@ func uniquePathsWithObstacles(obstacleGrid [][]int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0064.Minimum-Path-Sum.md b/website/content/ChapterFour/0001~0099/0064.Minimum-Path-Sum.md similarity index 91% rename from website/content/ChapterFour/0064.Minimum-Path-Sum.md rename to website/content/ChapterFour/0001~0099/0064.Minimum-Path-Sum.md index c39e60cf..e0fcb093 100755 --- a/website/content/ChapterFour/0064.Minimum-Path-Sum.md +++ b/website/content/ChapterFour/0001~0099/0064.Minimum-Path-Sum.md @@ -95,6 +95,6 @@ func minPathSum1(grid [][]int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0066.Plus-One.md b/website/content/ChapterFour/0001~0099/0066.Plus-One.md similarity index 88% rename from website/content/ChapterFour/0066.Plus-One.md rename to website/content/ChapterFour/0001~0099/0066.Plus-One.md index 6cc9b1e3..5efcd9eb 100755 --- a/website/content/ChapterFour/0066.Plus-One.md +++ b/website/content/ChapterFour/0001~0099/0066.Plus-One.md @@ -65,6 +65,6 @@ func plusOne(digits []int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0067.Add-Binary.md b/website/content/ChapterFour/0001~0099/0067.Add-Binary.md similarity index 86% rename from website/content/ChapterFour/0067.Add-Binary.md rename to website/content/ChapterFour/0001~0099/0067.Add-Binary.md index 74af33b2..f685c258 100644 --- a/website/content/ChapterFour/0067.Add-Binary.md +++ b/website/content/ChapterFour/0001~0099/0067.Add-Binary.md @@ -78,6 +78,6 @@ func addBinary(a string, b string) string { ---------------------------------------------- diff --git a/website/content/ChapterFour/0069.Sqrtx.md b/website/content/ChapterFour/0001~0099/0069.Sqrtx.md similarity index 91% rename from website/content/ChapterFour/0069.Sqrtx.md rename to website/content/ChapterFour/0001~0099/0069.Sqrtx.md index ff8d8742..acc9ddcb 100755 --- a/website/content/ChapterFour/0069.Sqrtx.md +++ b/website/content/ChapterFour/0001~0099/0069.Sqrtx.md @@ -93,6 +93,6 @@ func mySqrt1(x int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0070.Climbing-Stairs.md b/website/content/ChapterFour/0001~0099/0070.Climbing-Stairs.md similarity index 85% rename from website/content/ChapterFour/0070.Climbing-Stairs.md rename to website/content/ChapterFour/0001~0099/0070.Climbing-Stairs.md index 8f8ed262..274f7e02 100755 --- a/website/content/ChapterFour/0070.Climbing-Stairs.md +++ b/website/content/ChapterFour/0001~0099/0070.Climbing-Stairs.md @@ -57,6 +57,6 @@ func climbStairs(n int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0071.Simplify-Path.md b/website/content/ChapterFour/0001~0099/0071.Simplify-Path.md similarity index 91% rename from website/content/ChapterFour/0071.Simplify-Path.md rename to website/content/ChapterFour/0001~0099/0071.Simplify-Path.md index e716cd11..4b175500 100644 --- a/website/content/ChapterFour/0071.Simplify-Path.md +++ b/website/content/ChapterFour/0001~0099/0071.Simplify-Path.md @@ -119,6 +119,6 @@ func simplifyPath1(path string) string { ---------------------------------------------- diff --git a/website/content/ChapterFour/0074.Search-a-2D-Matrix.md b/website/content/ChapterFour/0001~0099/0074.Search-a-2D-Matrix.md similarity index 89% rename from website/content/ChapterFour/0074.Search-a-2D-Matrix.md rename to website/content/ChapterFour/0001~0099/0074.Search-a-2D-Matrix.md index d84a1b1e..326c9043 100755 --- a/website/content/ChapterFour/0074.Search-a-2D-Matrix.md +++ b/website/content/ChapterFour/0001~0099/0074.Search-a-2D-Matrix.md @@ -74,6 +74,6 @@ func searchMatrix(matrix [][]int, target int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0075.Sort-Colors.md b/website/content/ChapterFour/0001~0099/0075.Sort-Colors.md similarity index 90% rename from website/content/ChapterFour/0075.Sort-Colors.md rename to website/content/ChapterFour/0001~0099/0075.Sort-Colors.md index d9653fc9..f6248f14 100644 --- a/website/content/ChapterFour/0075.Sort-Colors.md +++ b/website/content/ChapterFour/0001~0099/0075.Sort-Colors.md @@ -74,6 +74,6 @@ func sortColors(nums []int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0076.Minimum-Window-Substring.md b/website/content/ChapterFour/0001~0099/0076.Minimum-Window-Substring.md similarity index 90% rename from website/content/ChapterFour/0076.Minimum-Window-Substring.md rename to website/content/ChapterFour/0001~0099/0076.Minimum-Window-Substring.md index 5ac08bf8..906f8ae3 100644 --- a/website/content/ChapterFour/0076.Minimum-Window-Substring.md +++ b/website/content/ChapterFour/0001~0099/0076.Minimum-Window-Substring.md @@ -78,6 +78,6 @@ func minWindow(s string, t string) string { ---------------------------------------------- diff --git a/website/content/ChapterFour/0077.Combinations.md b/website/content/ChapterFour/0001~0099/0077.Combinations.md similarity index 83% rename from website/content/ChapterFour/0077.Combinations.md rename to website/content/ChapterFour/0001~0099/0077.Combinations.md index c9c88ed6..19ff4112 100755 --- a/website/content/ChapterFour/0077.Combinations.md +++ b/website/content/ChapterFour/0001~0099/0077.Combinations.md @@ -62,6 +62,6 @@ func generateCombinations(n, k, start int, c []int, res *[][]int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0078.Subsets.md b/website/content/ChapterFour/0001~0099/0078.Subsets.md similarity index 90% rename from website/content/ChapterFour/0078.Subsets.md rename to website/content/ChapterFour/0001~0099/0078.Subsets.md index 32aa9d48..f0ccb142 100755 --- a/website/content/ChapterFour/0078.Subsets.md +++ b/website/content/ChapterFour/0001~0099/0078.Subsets.md @@ -107,6 +107,6 @@ func subsets2(nums []int) [][]int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0079.Word-Search.md b/website/content/ChapterFour/0001~0099/0079.Word-Search.md similarity index 89% rename from website/content/ChapterFour/0079.Word-Search.md rename to website/content/ChapterFour/0001~0099/0079.Word-Search.md index 62c03768..d8d123f4 100755 --- a/website/content/ChapterFour/0079.Word-Search.md +++ b/website/content/ChapterFour/0001~0099/0079.Word-Search.md @@ -85,6 +85,6 @@ func searchWord(board [][]byte, visited [][]bool, word string, index, x, y int) ---------------------------------------------- diff --git a/website/content/ChapterFour/0080.Remove-Duplicates-from-Sorted-Array-II.md b/website/content/ChapterFour/0001~0099/0080.Remove-Duplicates-from-Sorted-Array-II.md similarity index 92% rename from website/content/ChapterFour/0080.Remove-Duplicates-from-Sorted-Array-II.md rename to website/content/ChapterFour/0001~0099/0080.Remove-Duplicates-from-Sorted-Array-II.md index 36438895..4bec7529 100644 --- a/website/content/ChapterFour/0080.Remove-Duplicates-from-Sorted-Array-II.md +++ b/website/content/ChapterFour/0001~0099/0080.Remove-Duplicates-from-Sorted-Array-II.md @@ -107,6 +107,6 @@ func removeDuplicates80(nums []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0081.Search-in-Rotated-Sorted-Array-II.md b/website/content/ChapterFour/0001~0099/0081.Search-in-Rotated-Sorted-Array-II.md similarity index 90% rename from website/content/ChapterFour/0081.Search-in-Rotated-Sorted-Array-II.md rename to website/content/ChapterFour/0001~0099/0081.Search-in-Rotated-Sorted-Array-II.md index e7dad91f..7ed0474b 100755 --- a/website/content/ChapterFour/0081.Search-in-Rotated-Sorted-Array-II.md +++ b/website/content/ChapterFour/0001~0099/0081.Search-in-Rotated-Sorted-Array-II.md @@ -87,6 +87,6 @@ func search(nums []int, target int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0082.Remove-Duplicates-from-Sorted-List-II.md b/website/content/ChapterFour/0001~0099/0082.Remove-Duplicates-from-Sorted-List-II.md similarity index 93% rename from website/content/ChapterFour/0082.Remove-Duplicates-from-Sorted-List-II.md rename to website/content/ChapterFour/0001~0099/0082.Remove-Duplicates-from-Sorted-List-II.md index d0dc28f7..4cbc0bf8 100644 --- a/website/content/ChapterFour/0082.Remove-Duplicates-from-Sorted-List-II.md +++ b/website/content/ChapterFour/0001~0099/0082.Remove-Duplicates-from-Sorted-List-II.md @@ -193,6 +193,6 @@ func deleteDuplicates4(head *ListNode) *ListNode { ---------------------------------------------- diff --git a/website/content/ChapterFour/0083.Remove-Duplicates-from-Sorted-List.md b/website/content/ChapterFour/0001~0099/0083.Remove-Duplicates-from-Sorted-List.md similarity index 79% rename from website/content/ChapterFour/0083.Remove-Duplicates-from-Sorted-List.md rename to website/content/ChapterFour/0001~0099/0083.Remove-Duplicates-from-Sorted-List.md index fd662034..434449c9 100644 --- a/website/content/ChapterFour/0083.Remove-Duplicates-from-Sorted-List.md +++ b/website/content/ChapterFour/0001~0099/0083.Remove-Duplicates-from-Sorted-List.md @@ -68,6 +68,6 @@ func deleteDuplicates(head *ListNode) *ListNode { ---------------------------------------------- diff --git a/website/content/ChapterFour/0084.Largest-Rectangle-in-Histogram.md b/website/content/ChapterFour/0001~0099/0084.Largest-Rectangle-in-Histogram.md similarity index 90% rename from website/content/ChapterFour/0084.Largest-Rectangle-in-Histogram.md rename to website/content/ChapterFour/0001~0099/0084.Largest-Rectangle-in-Histogram.md index f50d91ad..5937127d 100644 --- a/website/content/ChapterFour/0084.Largest-Rectangle-in-Histogram.md +++ b/website/content/ChapterFour/0001~0099/0084.Largest-Rectangle-in-Histogram.md @@ -77,6 +77,6 @@ func largestRectangleArea(heights []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0086.Partition-List.md b/website/content/ChapterFour/0001~0099/0086.Partition-List.md similarity index 93% rename from website/content/ChapterFour/0086.Partition-List.md rename to website/content/ChapterFour/0001~0099/0086.Partition-List.md index 540430a3..de6bb8fc 100644 --- a/website/content/ChapterFour/0086.Partition-List.md +++ b/website/content/ChapterFour/0001~0099/0086.Partition-List.md @@ -150,6 +150,6 @@ func genListNode(head *DoublyListNode) *ListNode { ---------------------------------------------- diff --git a/website/content/ChapterFour/0088.Merge-Sorted-Array.md b/website/content/ChapterFour/0001~0099/0088.Merge-Sorted-Array.md similarity index 88% rename from website/content/ChapterFour/0088.Merge-Sorted-Array.md rename to website/content/ChapterFour/0001~0099/0088.Merge-Sorted-Array.md index 500295f6..de014f8c 100644 --- a/website/content/ChapterFour/0088.Merge-Sorted-Array.md +++ b/website/content/ChapterFour/0001~0099/0088.Merge-Sorted-Array.md @@ -71,6 +71,6 @@ func merge(nums1 []int, m int, nums2 []int, n int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0089.Gray-Code.md b/website/content/ChapterFour/0001~0099/0089.Gray-Code.md similarity index 92% rename from website/content/ChapterFour/0089.Gray-Code.md rename to website/content/ChapterFour/0001~0099/0089.Gray-Code.md index df616ebc..63b2e39a 100755 --- a/website/content/ChapterFour/0089.Gray-Code.md +++ b/website/content/ChapterFour/0001~0099/0089.Gray-Code.md @@ -119,6 +119,6 @@ func grayCode1(n int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0090.Subsets-II.md b/website/content/ChapterFour/0001~0099/0090.Subsets-II.md similarity index 89% rename from website/content/ChapterFour/0090.Subsets-II.md rename to website/content/ChapterFour/0001~0099/0090.Subsets-II.md index 77b974db..73c331b1 100755 --- a/website/content/ChapterFour/0090.Subsets-II.md +++ b/website/content/ChapterFour/0001~0099/0090.Subsets-II.md @@ -78,6 +78,6 @@ func generateSubsetsWithDup(nums []int, k, start int, c []int, res *[][]int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0091.Decode-Ways.md b/website/content/ChapterFour/0001~0099/0091.Decode-Ways.md similarity index 89% rename from website/content/ChapterFour/0091.Decode-Ways.md rename to website/content/ChapterFour/0001~0099/0091.Decode-Ways.md index ccf85684..6bb4b168 100755 --- a/website/content/ChapterFour/0091.Decode-Ways.md +++ b/website/content/ChapterFour/0001~0099/0091.Decode-Ways.md @@ -84,6 +84,6 @@ func numDecodings(s string) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0092.Reverse-Linked-List-II.md b/website/content/ChapterFour/0001~0099/0092.Reverse-Linked-List-II.md similarity index 88% rename from website/content/ChapterFour/0092.Reverse-Linked-List-II.md rename to website/content/ChapterFour/0001~0099/0092.Reverse-Linked-List-II.md index ea62d1f1..d7f3dc7e 100644 --- a/website/content/ChapterFour/0092.Reverse-Linked-List-II.md +++ b/website/content/ChapterFour/0001~0099/0092.Reverse-Linked-List-II.md @@ -67,6 +67,6 @@ func reverseBetween(head *ListNode, m int, n int) *ListNode { ---------------------------------------------- diff --git a/website/content/ChapterFour/0093.Restore-IP-Addresses.md b/website/content/ChapterFour/0001~0099/0093.Restore-IP-Addresses.md similarity index 86% rename from website/content/ChapterFour/0093.Restore-IP-Addresses.md rename to website/content/ChapterFour/0001~0099/0093.Restore-IP-Addresses.md index f4c862d9..ba641bfe 100755 --- a/website/content/ChapterFour/0093.Restore-IP-Addresses.md +++ b/website/content/ChapterFour/0001~0099/0093.Restore-IP-Addresses.md @@ -80,6 +80,6 @@ func getString(ip []int) string { ---------------------------------------------- diff --git a/website/content/ChapterFour/0094.Binary-Tree-Inorder-Traversal.md b/website/content/ChapterFour/0001~0099/0094.Binary-Tree-Inorder-Traversal.md similarity index 80% rename from website/content/ChapterFour/0094.Binary-Tree-Inorder-Traversal.md rename to website/content/ChapterFour/0001~0099/0094.Binary-Tree-Inorder-Traversal.md index 68f2997d..7656edd6 100644 --- a/website/content/ChapterFour/0094.Binary-Tree-Inorder-Traversal.md +++ b/website/content/ChapterFour/0001~0099/0094.Binary-Tree-Inorder-Traversal.md @@ -75,6 +75,6 @@ func inorder(root *TreeNode, output *[]int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0095.Unique-Binary-Search-Trees-II.md b/website/content/ChapterFour/0001~0099/0095.Unique-Binary-Search-Trees-II.md similarity index 87% rename from website/content/ChapterFour/0095.Unique-Binary-Search-Trees-II.md rename to website/content/ChapterFour/0001~0099/0095.Unique-Binary-Search-Trees-II.md index 8bb74436..4ba09dfd 100755 --- a/website/content/ChapterFour/0095.Unique-Binary-Search-Trees-II.md +++ b/website/content/ChapterFour/0001~0099/0095.Unique-Binary-Search-Trees-II.md @@ -80,6 +80,6 @@ func generateBSTree(start, end int) []*TreeNode { ---------------------------------------------- diff --git a/website/content/ChapterFour/0096.Unique-Binary-Search-Trees.md b/website/content/ChapterFour/0001~0099/0096.Unique-Binary-Search-Trees.md similarity index 89% rename from website/content/ChapterFour/0096.Unique-Binary-Search-Trees.md rename to website/content/ChapterFour/0001~0099/0096.Unique-Binary-Search-Trees.md index 216f7084..688a3d0a 100755 --- a/website/content/ChapterFour/0096.Unique-Binary-Search-Trees.md +++ b/website/content/ChapterFour/0001~0099/0096.Unique-Binary-Search-Trees.md @@ -55,6 +55,6 @@ func numTrees(n int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0098.Validate-Binary-Search-Tree.md b/website/content/ChapterFour/0001~0099/0098.Validate-Binary-Search-Tree.md similarity index 90% rename from website/content/ChapterFour/0098.Validate-Binary-Search-Tree.md rename to website/content/ChapterFour/0001~0099/0098.Validate-Binary-Search-Tree.md index d95b7e82..7c124715 100755 --- a/website/content/ChapterFour/0098.Validate-Binary-Search-Tree.md +++ b/website/content/ChapterFour/0001~0099/0098.Validate-Binary-Search-Tree.md @@ -101,6 +101,6 @@ func inOrder(root *TreeNode, arr *[]int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0099.Recover-Binary-Search-Tree.md b/website/content/ChapterFour/0001~0099/0099.Recover-Binary-Search-Tree.md similarity index 93% rename from website/content/ChapterFour/0099.Recover-Binary-Search-Tree.md rename to website/content/ChapterFour/0001~0099/0099.Recover-Binary-Search-Tree.md index 4ec788c7..4a28ea15 100755 --- a/website/content/ChapterFour/0099.Recover-Binary-Search-Tree.md +++ b/website/content/ChapterFour/0001~0099/0099.Recover-Binary-Search-Tree.md @@ -103,6 +103,6 @@ func inOrderTraverse(root, prev, target1, target2 *TreeNode) (*TreeNode, *TreeNo ---------------------------------------------- diff --git a/website/content/ChapterFour/0001~0099/_index.md b/website/content/ChapterFour/0001~0099/_index.md new file mode 100644 index 00000000..d2021683 --- /dev/null +++ b/website/content/ChapterFour/0001~0099/_index.md @@ -0,0 +1,5 @@ +--- +bookCollapseSection: true +weight: 20 +--- + diff --git a/website/content/ChapterFour/0100.Same-Tree.md b/website/content/ChapterFour/0100~0199/0100.Same-Tree.md similarity index 85% rename from website/content/ChapterFour/0100.Same-Tree.md rename to website/content/ChapterFour/0100~0199/0100.Same-Tree.md index e714cda2..90227a8e 100644 --- a/website/content/ChapterFour/0100.Same-Tree.md +++ b/website/content/ChapterFour/0100~0199/0100.Same-Tree.md @@ -94,6 +94,6 @@ func isSameTree(p *TreeNode, q *TreeNode) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0101.Symmetric-Tree.md b/website/content/ChapterFour/0100~0199/0101.Symmetric-Tree.md similarity index 87% rename from website/content/ChapterFour/0101.Symmetric-Tree.md rename to website/content/ChapterFour/0100~0199/0101.Symmetric-Tree.md index 21b4dc1a..4c55bcce 100644 --- a/website/content/ChapterFour/0101.Symmetric-Tree.md +++ b/website/content/ChapterFour/0100~0199/0101.Symmetric-Tree.md @@ -73,6 +73,6 @@ func isSymmetric(root *TreeNode) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0102.Binary-Tree-Level-Order-Traversal.md b/website/content/ChapterFour/0100~0199/0102.Binary-Tree-Level-Order-Traversal.md similarity index 88% rename from website/content/ChapterFour/0102.Binary-Tree-Level-Order-Traversal.md rename to website/content/ChapterFour/0100~0199/0102.Binary-Tree-Level-Order-Traversal.md index e00a4646..127602e4 100644 --- a/website/content/ChapterFour/0102.Binary-Tree-Level-Order-Traversal.md +++ b/website/content/ChapterFour/0100~0199/0102.Binary-Tree-Level-Order-Traversal.md @@ -117,6 +117,6 @@ func dfsLevel(node *TreeNode, level int, res *[][]int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md b/website/content/ChapterFour/0100~0199/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md similarity index 90% rename from website/content/ChapterFour/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md rename to website/content/ChapterFour/0100~0199/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md index 110306c8..85d16fb8 100644 --- a/website/content/ChapterFour/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md +++ b/website/content/ChapterFour/0100~0199/0103.Binary-Tree-Zigzag-Level-Order-Traversal.md @@ -128,6 +128,6 @@ func search(root *TreeNode, depth int, res *[][]int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0104.Maximum-Depth-of-Binary-Tree.md b/website/content/ChapterFour/0100~0199/0104.Maximum-Depth-of-Binary-Tree.md similarity index 78% rename from website/content/ChapterFour/0104.Maximum-Depth-of-Binary-Tree.md rename to website/content/ChapterFour/0100~0199/0104.Maximum-Depth-of-Binary-Tree.md index 8529be03..36d39f9f 100644 --- a/website/content/ChapterFour/0104.Maximum-Depth-of-Binary-Tree.md +++ b/website/content/ChapterFour/0100~0199/0104.Maximum-Depth-of-Binary-Tree.md @@ -62,6 +62,6 @@ func maxDepth(root *TreeNode) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md b/website/content/ChapterFour/0100~0199/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md similarity index 86% rename from website/content/ChapterFour/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md rename to website/content/ChapterFour/0100~0199/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md index 4a77e74b..5de3c4e4 100755 --- a/website/content/ChapterFour/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md +++ b/website/content/ChapterFour/0100~0199/0105.Construct-Binary-Tree-from-Preorder-and-Inorder-Traversal.md @@ -75,6 +75,6 @@ func buildPreIn2TreeDFS(pre []int, preStart int, preEnd int, inStart int, inPos ---------------------------------------------- diff --git a/website/content/ChapterFour/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md b/website/content/ChapterFour/0100~0199/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md similarity index 86% rename from website/content/ChapterFour/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md rename to website/content/ChapterFour/0100~0199/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md index fefec6b0..77b102d5 100755 --- a/website/content/ChapterFour/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md +++ b/website/content/ChapterFour/0100~0199/0106.Construct-Binary-Tree-from-Inorder-and-Postorder-Traversal.md @@ -73,6 +73,6 @@ func buildInPos2TreeDFS(post []int, postStart int, postEnd int, inStart int, inP ---------------------------------------------- diff --git a/website/content/ChapterFour/0107.Binary-Tree-Level-Order-Traversal-II.md b/website/content/ChapterFour/0100~0199/0107.Binary-Tree-Level-Order-Traversal-II.md similarity index 78% rename from website/content/ChapterFour/0107.Binary-Tree-Level-Order-Traversal-II.md rename to website/content/ChapterFour/0100~0199/0107.Binary-Tree-Level-Order-Traversal-II.md index 1003bee3..172e977b 100644 --- a/website/content/ChapterFour/0107.Binary-Tree-Level-Order-Traversal-II.md +++ b/website/content/ChapterFour/0100~0199/0107.Binary-Tree-Level-Order-Traversal-II.md @@ -72,6 +72,6 @@ func levelOrderBottom(root *TreeNode) [][]int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0108.Convert-Sorted-Array-to-Binary-Search-Tree.md b/website/content/ChapterFour/0100~0199/0108.Convert-Sorted-Array-to-Binary-Search-Tree.md similarity index 84% rename from website/content/ChapterFour/0108.Convert-Sorted-Array-to-Binary-Search-Tree.md rename to website/content/ChapterFour/0100~0199/0108.Convert-Sorted-Array-to-Binary-Search-Tree.md index 6b440de7..3ed5eb09 100755 --- a/website/content/ChapterFour/0108.Convert-Sorted-Array-to-Binary-Search-Tree.md +++ b/website/content/ChapterFour/0100~0199/0108.Convert-Sorted-Array-to-Binary-Search-Tree.md @@ -54,6 +54,6 @@ func sortedArrayToBST(nums []int) *TreeNode { ---------------------------------------------- diff --git a/website/content/ChapterFour/0109.Convert-Sorted-List-to-Binary-Search-Tree.md b/website/content/ChapterFour/0100~0199/0109.Convert-Sorted-List-to-Binary-Search-Tree.md similarity index 89% rename from website/content/ChapterFour/0109.Convert-Sorted-List-to-Binary-Search-Tree.md rename to website/content/ChapterFour/0100~0199/0109.Convert-Sorted-List-to-Binary-Search-Tree.md index 9ae35afd..dd85b3b1 100644 --- a/website/content/ChapterFour/0109.Convert-Sorted-List-to-Binary-Search-Tree.md +++ b/website/content/ChapterFour/0100~0199/0109.Convert-Sorted-List-to-Binary-Search-Tree.md @@ -99,6 +99,6 @@ func middleNodeAndPreNode(head *ListNode) (middle *ListNode, pre *ListNode) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0110.Balanced-Binary-Tree.md b/website/content/ChapterFour/0100~0199/0110.Balanced-Binary-Tree.md similarity index 84% rename from website/content/ChapterFour/0110.Balanced-Binary-Tree.md rename to website/content/ChapterFour/0100~0199/0110.Balanced-Binary-Tree.md index 779fae8f..3aad9436 100644 --- a/website/content/ChapterFour/0110.Balanced-Binary-Tree.md +++ b/website/content/ChapterFour/0100~0199/0110.Balanced-Binary-Tree.md @@ -92,6 +92,6 @@ func depth(root *TreeNode) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0111.Minimum-Depth-of-Binary-Tree.md b/website/content/ChapterFour/0100~0199/0111.Minimum-Depth-of-Binary-Tree.md similarity index 85% rename from website/content/ChapterFour/0111.Minimum-Depth-of-Binary-Tree.md rename to website/content/ChapterFour/0100~0199/0111.Minimum-Depth-of-Binary-Tree.md index d3bd4f1b..54530d51 100755 --- a/website/content/ChapterFour/0111.Minimum-Depth-of-Binary-Tree.md +++ b/website/content/ChapterFour/0100~0199/0111.Minimum-Depth-of-Binary-Tree.md @@ -64,6 +64,6 @@ func minDepth(root *TreeNode) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0112.Path-Sum.md b/website/content/ChapterFour/0100~0199/0112.Path-Sum.md similarity index 84% rename from website/content/ChapterFour/0112.Path-Sum.md rename to website/content/ChapterFour/0100~0199/0112.Path-Sum.md index f3fcce0f..5964900a 100755 --- a/website/content/ChapterFour/0112.Path-Sum.md +++ b/website/content/ChapterFour/0100~0199/0112.Path-Sum.md @@ -61,6 +61,6 @@ func hasPathSum(root *TreeNode, sum int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0113.Path-Sum-II.md b/website/content/ChapterFour/0100~0199/0113.Path-Sum-II.md similarity index 90% rename from website/content/ChapterFour/0113.Path-Sum-II.md rename to website/content/ChapterFour/0100~0199/0113.Path-Sum-II.md index e975e8a1..2b6927ff 100755 --- a/website/content/ChapterFour/0113.Path-Sum-II.md +++ b/website/content/ChapterFour/0100~0199/0113.Path-Sum-II.md @@ -110,6 +110,6 @@ func pathSum1(root *TreeNode, sum int) [][]int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0114.Flatten-Binary-Tree-to-Linked-List.md b/website/content/ChapterFour/0100~0199/0114.Flatten-Binary-Tree-to-Linked-List.md similarity index 93% rename from website/content/ChapterFour/0114.Flatten-Binary-Tree-to-Linked-List.md rename to website/content/ChapterFour/0100~0199/0114.Flatten-Binary-Tree-to-Linked-List.md index e80d351b..9fb6278a 100755 --- a/website/content/ChapterFour/0114.Flatten-Binary-Tree-to-Linked-List.md +++ b/website/content/ChapterFour/0100~0199/0114.Flatten-Binary-Tree-to-Linked-List.md @@ -193,6 +193,6 @@ func flatten2(root *TreeNode) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0118.Pascals-Triangle.md b/website/content/ChapterFour/0100~0199/0118.Pascals-Triangle.md similarity index 83% rename from website/content/ChapterFour/0118.Pascals-Triangle.md rename to website/content/ChapterFour/0100~0199/0118.Pascals-Triangle.md index 36a16f50..5c65a888 100644 --- a/website/content/ChapterFour/0118.Pascals-Triangle.md +++ b/website/content/ChapterFour/0100~0199/0118.Pascals-Triangle.md @@ -62,6 +62,6 @@ func generate(numRows int) [][]int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0120.Triangle.md b/website/content/ChapterFour/0100~0199/0120.Triangle.md similarity index 89% rename from website/content/ChapterFour/0120.Triangle.md rename to website/content/ChapterFour/0100~0199/0120.Triangle.md index 473cfa62..4561de92 100755 --- a/website/content/ChapterFour/0120.Triangle.md +++ b/website/content/ChapterFour/0100~0199/0120.Triangle.md @@ -91,6 +91,6 @@ func minimumTotal1(triangle [][]int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0121.Best-Time-to-Buy-and-Sell-Stock.md b/website/content/ChapterFour/0100~0199/0121.Best-Time-to-Buy-and-Sell-Stock.md similarity index 89% rename from website/content/ChapterFour/0121.Best-Time-to-Buy-and-Sell-Stock.md rename to website/content/ChapterFour/0100~0199/0121.Best-Time-to-Buy-and-Sell-Stock.md index 0ec5db6b..b08d1fd2 100755 --- a/website/content/ChapterFour/0121.Best-Time-to-Buy-and-Sell-Stock.md +++ b/website/content/ChapterFour/0100~0199/0121.Best-Time-to-Buy-and-Sell-Stock.md @@ -84,6 +84,6 @@ func maxProfit1(prices []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0122.Best-Time-to-Buy-and-Sell-Stock-II.md b/website/content/ChapterFour/0100~0199/0122.Best-Time-to-Buy-and-Sell-Stock-II.md similarity index 90% rename from website/content/ChapterFour/0122.Best-Time-to-Buy-and-Sell-Stock-II.md rename to website/content/ChapterFour/0100~0199/0122.Best-Time-to-Buy-and-Sell-Stock-II.md index 241e31bc..93d77d36 100755 --- a/website/content/ChapterFour/0122.Best-Time-to-Buy-and-Sell-Stock-II.md +++ b/website/content/ChapterFour/0100~0199/0122.Best-Time-to-Buy-and-Sell-Stock-II.md @@ -62,6 +62,6 @@ func maxProfit122(prices []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0124.Binary-Tree-Maximum-Path-Sum.md b/website/content/ChapterFour/0100~0199/0124.Binary-Tree-Maximum-Path-Sum.md similarity index 89% rename from website/content/ChapterFour/0124.Binary-Tree-Maximum-Path-Sum.md rename to website/content/ChapterFour/0100~0199/0124.Binary-Tree-Maximum-Path-Sum.md index 665d167c..51e96ff6 100755 --- a/website/content/ChapterFour/0124.Binary-Tree-Maximum-Path-Sum.md +++ b/website/content/ChapterFour/0100~0199/0124.Binary-Tree-Maximum-Path-Sum.md @@ -82,6 +82,6 @@ func getPathSum(root *TreeNode, maxSum *int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0125.Valid-Palindrome.md b/website/content/ChapterFour/0100~0199/0125.Valid-Palindrome.md similarity index 83% rename from website/content/ChapterFour/0125.Valid-Palindrome.md rename to website/content/ChapterFour/0100~0199/0125.Valid-Palindrome.md index bc19bb4d..b0c7257a 100644 --- a/website/content/ChapterFour/0125.Valid-Palindrome.md +++ b/website/content/ChapterFour/0100~0199/0125.Valid-Palindrome.md @@ -69,6 +69,6 @@ func isChar(c byte) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0126.Word-Ladder-II.md b/website/content/ChapterFour/0100~0199/0126.Word-Ladder-II.md similarity index 94% rename from website/content/ChapterFour/0126.Word-Ladder-II.md rename to website/content/ChapterFour/0100~0199/0126.Word-Ladder-II.md index a296cf23..e1d328a5 100755 --- a/website/content/ChapterFour/0126.Word-Ladder-II.md +++ b/website/content/ChapterFour/0100~0199/0126.Word-Ladder-II.md @@ -132,6 +132,6 @@ func findLadders(beginWord string, endWord string, wordList []string) [][]string ---------------------------------------------- diff --git a/website/content/ChapterFour/0127.Word-Ladder.md b/website/content/ChapterFour/0100~0199/0127.Word-Ladder.md similarity index 93% rename from website/content/ChapterFour/0127.Word-Ladder.md rename to website/content/ChapterFour/0100~0199/0127.Word-Ladder.md index dbeebb29..7a7db0e8 100755 --- a/website/content/ChapterFour/0127.Word-Ladder.md +++ b/website/content/ChapterFour/0100~0199/0127.Word-Ladder.md @@ -123,6 +123,6 @@ func getCandidates(word string) []string { ---------------------------------------------- diff --git a/website/content/ChapterFour/0128.Longest-Consecutive-Sequence.md b/website/content/ChapterFour/0100~0199/0128.Longest-Consecutive-Sequence.md similarity index 94% rename from website/content/ChapterFour/0128.Longest-Consecutive-Sequence.md rename to website/content/ChapterFour/0100~0199/0128.Longest-Consecutive-Sequence.md index e8d9307c..ef76f90d 100755 --- a/website/content/ChapterFour/0128.Longest-Consecutive-Sequence.md +++ b/website/content/ChapterFour/0100~0199/0128.Longest-Consecutive-Sequence.md @@ -141,6 +141,6 @@ func longestConsecutive2(nums []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0129.Sum-Root-to-Leaf-Numbers.md b/website/content/ChapterFour/0100~0199/0129.Sum-Root-to-Leaf-Numbers.md similarity index 91% rename from website/content/ChapterFour/0129.Sum-Root-to-Leaf-Numbers.md rename to website/content/ChapterFour/0100~0199/0129.Sum-Root-to-Leaf-Numbers.md index 2e52457e..b1a0636d 100755 --- a/website/content/ChapterFour/0129.Sum-Root-to-Leaf-Numbers.md +++ b/website/content/ChapterFour/0100~0199/0129.Sum-Root-to-Leaf-Numbers.md @@ -99,6 +99,6 @@ func binaryTreeNums(root *TreeNode) []string { ---------------------------------------------- diff --git a/website/content/ChapterFour/0130.Surrounded-Regions.md b/website/content/ChapterFour/0100~0199/0130.Surrounded-Regions.md similarity index 93% rename from website/content/ChapterFour/0130.Surrounded-Regions.md rename to website/content/ChapterFour/0100~0199/0130.Surrounded-Regions.md index 228ce63e..3211fb08 100755 --- a/website/content/ChapterFour/0130.Surrounded-Regions.md +++ b/website/content/ChapterFour/0100~0199/0130.Surrounded-Regions.md @@ -128,6 +128,6 @@ func dfs130(i, j int, board [][]byte) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0131.Palindrome-Partitioning.md b/website/content/ChapterFour/0100~0199/0131.Palindrome-Partitioning.md similarity index 91% rename from website/content/ChapterFour/0131.Palindrome-Partitioning.md rename to website/content/ChapterFour/0100~0199/0131.Palindrome-Partitioning.md index 41c4f013..a619e00b 100755 --- a/website/content/ChapterFour/0131.Palindrome-Partitioning.md +++ b/website/content/ChapterFour/0100~0199/0131.Palindrome-Partitioning.md @@ -123,6 +123,6 @@ func isPal(str string, s, e int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0136.Single-Number.md b/website/content/ChapterFour/0100~0199/0136.Single-Number.md similarity index 87% rename from website/content/ChapterFour/0136.Single-Number.md rename to website/content/ChapterFour/0100~0199/0136.Single-Number.md index 73561826..02b2b4b4 100755 --- a/website/content/ChapterFour/0136.Single-Number.md +++ b/website/content/ChapterFour/0100~0199/0136.Single-Number.md @@ -48,6 +48,6 @@ func singleNumber(nums []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0137.Single-Number-II.md b/website/content/ChapterFour/0100~0199/0137.Single-Number-II.md similarity index 94% rename from website/content/ChapterFour/0137.Single-Number-II.md rename to website/content/ChapterFour/0100~0199/0137.Single-Number-II.md index 1330eb03..172739cf 100755 --- a/website/content/ChapterFour/0137.Single-Number-II.md +++ b/website/content/ChapterFour/0100~0199/0137.Single-Number-II.md @@ -111,6 +111,6 @@ func singleNumberIIIII1(nums []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0138.Copy-List-With-Random-Pointer.md b/website/content/ChapterFour/0100~0199/0138.Copy-List-With-Random-Pointer.md similarity index 93% rename from website/content/ChapterFour/0138.Copy-List-With-Random-Pointer.md rename to website/content/ChapterFour/0100~0199/0138.Copy-List-With-Random-Pointer.md index f434c88e..e4392479 100644 --- a/website/content/ChapterFour/0138.Copy-List-With-Random-Pointer.md +++ b/website/content/ChapterFour/0100~0199/0138.Copy-List-With-Random-Pointer.md @@ -132,6 +132,6 @@ func copyNodeToLinkedList(head *Node) *Node { ---------------------------------------------- diff --git a/website/content/ChapterFour/0141.Linked-List-Cycle.md b/website/content/ChapterFour/0100~0199/0141.Linked-List-Cycle.md similarity index 81% rename from website/content/ChapterFour/0141.Linked-List-Cycle.md rename to website/content/ChapterFour/0100~0199/0141.Linked-List-Cycle.md index 7443ccda..248a7b62 100644 --- a/website/content/ChapterFour/0141.Linked-List-Cycle.md +++ b/website/content/ChapterFour/0100~0199/0141.Linked-List-Cycle.md @@ -50,6 +50,6 @@ func hasCycle(head *ListNode) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0142.Linked-List-Cycle-II.md b/website/content/ChapterFour/0100~0199/0142.Linked-List-Cycle-II.md similarity index 92% rename from website/content/ChapterFour/0142.Linked-List-Cycle-II.md rename to website/content/ChapterFour/0100~0199/0142.Linked-List-Cycle-II.md index 07f10488..3bd61425 100644 --- a/website/content/ChapterFour/0142.Linked-List-Cycle-II.md +++ b/website/content/ChapterFour/0100~0199/0142.Linked-List-Cycle-II.md @@ -111,6 +111,6 @@ func hasCycle142(head *ListNode) (bool, *ListNode) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0143.Reorder-List.md b/website/content/ChapterFour/0100~0199/0143.Reorder-List.md similarity index 92% rename from website/content/ChapterFour/0143.Reorder-List.md rename to website/content/ChapterFour/0100~0199/0143.Reorder-List.md index 87060cc9..bd9b2469 100644 --- a/website/content/ChapterFour/0143.Reorder-List.md +++ b/website/content/ChapterFour/0100~0199/0143.Reorder-List.md @@ -129,6 +129,6 @@ func listToArray(head *ListNode) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0144.Binary-Tree-Preorder-Traversal.md b/website/content/ChapterFour/0100~0199/0144.Binary-Tree-Preorder-Traversal.md similarity index 88% rename from website/content/ChapterFour/0144.Binary-Tree-Preorder-Traversal.md rename to website/content/ChapterFour/0100~0199/0144.Binary-Tree-Preorder-Traversal.md index d4b09831..36f8e02f 100644 --- a/website/content/ChapterFour/0144.Binary-Tree-Preorder-Traversal.md +++ b/website/content/ChapterFour/0100~0199/0144.Binary-Tree-Preorder-Traversal.md @@ -114,6 +114,6 @@ func preorderTraversal2(root *TreeNode) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0145.Binary-Tree-Postorder-Traversal.md b/website/content/ChapterFour/0100~0199/0145.Binary-Tree-Postorder-Traversal.md similarity index 81% rename from website/content/ChapterFour/0145.Binary-Tree-Postorder-Traversal.md rename to website/content/ChapterFour/0100~0199/0145.Binary-Tree-Postorder-Traversal.md index e73320d0..e688f82f 100644 --- a/website/content/ChapterFour/0145.Binary-Tree-Postorder-Traversal.md +++ b/website/content/ChapterFour/0100~0199/0145.Binary-Tree-Postorder-Traversal.md @@ -73,6 +73,6 @@ func postorder(root *TreeNode, output *[]int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0146.LRU-Cache.md b/website/content/ChapterFour/0100~0199/0146.LRU-Cache.md similarity index 93% rename from website/content/ChapterFour/0146.LRU-Cache.md rename to website/content/ChapterFour/0100~0199/0146.LRU-Cache.md index abf03290..7c60b34f 100644 --- a/website/content/ChapterFour/0146.LRU-Cache.md +++ b/website/content/ChapterFour/0100~0199/0146.LRU-Cache.md @@ -136,6 +136,6 @@ func (this *LRUCache) Remove(node *Node) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0147.Insertion-Sort-List.md b/website/content/ChapterFour/0100~0199/0147.Insertion-Sort-List.md similarity index 88% rename from website/content/ChapterFour/0147.Insertion-Sort-List.md rename to website/content/ChapterFour/0100~0199/0147.Insertion-Sort-List.md index bbdca940..5ef90856 100644 --- a/website/content/ChapterFour/0147.Insertion-Sort-List.md +++ b/website/content/ChapterFour/0100~0199/0147.Insertion-Sort-List.md @@ -79,6 +79,6 @@ func insertionSortList(head *ListNode) *ListNode { ---------------------------------------------- diff --git a/website/content/ChapterFour/0148.Sort-List.md b/website/content/ChapterFour/0100~0199/0148.Sort-List.md similarity index 86% rename from website/content/ChapterFour/0148.Sort-List.md rename to website/content/ChapterFour/0100~0199/0148.Sort-List.md index 6d435555..f92e2b85 100644 --- a/website/content/ChapterFour/0148.Sort-List.md +++ b/website/content/ChapterFour/0100~0199/0148.Sort-List.md @@ -98,6 +98,6 @@ func mergeTwoLists(l1 *ListNode, l2 *ListNode) *ListNode { ---------------------------------------------- diff --git a/website/content/ChapterFour/0150.Evaluate-Reverse-Polish-Notation.md b/website/content/ChapterFour/0100~0199/0150.Evaluate-Reverse-Polish-Notation.md similarity index 89% rename from website/content/ChapterFour/0150.Evaluate-Reverse-Polish-Notation.md rename to website/content/ChapterFour/0100~0199/0150.Evaluate-Reverse-Polish-Notation.md index b8cfa59b..9b06aa85 100644 --- a/website/content/ChapterFour/0150.Evaluate-Reverse-Polish-Notation.md +++ b/website/content/ChapterFour/0100~0199/0150.Evaluate-Reverse-Polish-Notation.md @@ -117,6 +117,6 @@ func evalRPN(tokens []string) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0151.Reverse-Words-in-a-String.md b/website/content/ChapterFour/0100~0199/0151.Reverse-Words-in-a-String.md similarity index 89% rename from website/content/ChapterFour/0151.Reverse-Words-in-a-String.md rename to website/content/ChapterFour/0100~0199/0151.Reverse-Words-in-a-String.md index 9d3a8fa4..cb2545f1 100755 --- a/website/content/ChapterFour/0151.Reverse-Words-in-a-String.md +++ b/website/content/ChapterFour/0100~0199/0151.Reverse-Words-in-a-String.md @@ -84,6 +84,6 @@ func reverse151(m *[]string, i int, j int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0152.Maximum-Product-Subarray.md b/website/content/ChapterFour/0100~0199/0152.Maximum-Product-Subarray.md similarity index 85% rename from website/content/ChapterFour/0152.Maximum-Product-Subarray.md rename to website/content/ChapterFour/0100~0199/0152.Maximum-Product-Subarray.md index 937780c5..852c8b8a 100755 --- a/website/content/ChapterFour/0152.Maximum-Product-Subarray.md +++ b/website/content/ChapterFour/0100~0199/0152.Maximum-Product-Subarray.md @@ -54,6 +54,6 @@ func maxProduct(nums []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0153.Find-Minimum-in-Rotated-Sorted-Array.md b/website/content/ChapterFour/0100~0199/0153.Find-Minimum-in-Rotated-Sorted-Array.md similarity index 91% rename from website/content/ChapterFour/0153.Find-Minimum-in-Rotated-Sorted-Array.md rename to website/content/ChapterFour/0100~0199/0153.Find-Minimum-in-Rotated-Sorted-Array.md index 2462d5f4..c48a82ae 100755 --- a/website/content/ChapterFour/0153.Find-Minimum-in-Rotated-Sorted-Array.md +++ b/website/content/ChapterFour/0100~0199/0153.Find-Minimum-in-Rotated-Sorted-Array.md @@ -110,6 +110,6 @@ func findMin2(nums []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0154.Find-Minimum-in-Rotated-Sorted-Array-II.md b/website/content/ChapterFour/0100~0199/0154.Find-Minimum-in-Rotated-Sorted-Array-II.md similarity index 88% rename from website/content/ChapterFour/0154.Find-Minimum-in-Rotated-Sorted-Array-II.md rename to website/content/ChapterFour/0100~0199/0154.Find-Minimum-in-Rotated-Sorted-Array-II.md index ed0c89af..7d2c1235 100755 --- a/website/content/ChapterFour/0154.Find-Minimum-in-Rotated-Sorted-Array-II.md +++ b/website/content/ChapterFour/0100~0199/0154.Find-Minimum-in-Rotated-Sorted-Array-II.md @@ -69,6 +69,6 @@ func findMin154(nums []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0155.Min-Stack.md b/website/content/ChapterFour/0100~0199/0155.Min-Stack.md similarity index 86% rename from website/content/ChapterFour/0155.Min-Stack.md rename to website/content/ChapterFour/0100~0199/0155.Min-Stack.md index 4259b85a..606f6500 100644 --- a/website/content/ChapterFour/0155.Min-Stack.md +++ b/website/content/ChapterFour/0100~0199/0155.Min-Stack.md @@ -89,6 +89,6 @@ func (this *MinStack) GetMin() int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0160.Intersection-of-Two-Linked-Lists.md b/website/content/ChapterFour/0100~0199/0160.Intersection-of-Two-Linked-Lists.md similarity index 93% rename from website/content/ChapterFour/0160.Intersection-of-Two-Linked-Lists.md rename to website/content/ChapterFour/0100~0199/0160.Intersection-of-Two-Linked-Lists.md index 0fe6c24d..77ea4b62 100644 --- a/website/content/ChapterFour/0160.Intersection-of-Two-Linked-Lists.md +++ b/website/content/ChapterFour/0100~0199/0160.Intersection-of-Two-Linked-Lists.md @@ -118,6 +118,6 @@ func getIntersectionNode(headA, headB *ListNode) *ListNode { ---------------------------------------------- diff --git a/website/content/ChapterFour/0162.Find-Peak-Element.md b/website/content/ChapterFour/0100~0199/0162.Find-Peak-Element.md similarity index 92% rename from website/content/ChapterFour/0162.Find-Peak-Element.md rename to website/content/ChapterFour/0100~0199/0162.Find-Peak-Element.md index 74e7b14e..1c3e810f 100755 --- a/website/content/ChapterFour/0162.Find-Peak-Element.md +++ b/website/content/ChapterFour/0100~0199/0162.Find-Peak-Element.md @@ -96,6 +96,6 @@ func findPeakElement1(nums []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0164.Maximum-Gap.md b/website/content/ChapterFour/0100~0199/0164.Maximum-Gap.md similarity index 91% rename from website/content/ChapterFour/0164.Maximum-Gap.md rename to website/content/ChapterFour/0100~0199/0164.Maximum-Gap.md index ea05421f..2c4f73a8 100644 --- a/website/content/ChapterFour/0164.Maximum-Gap.md +++ b/website/content/ChapterFour/0100~0199/0164.Maximum-Gap.md @@ -139,6 +139,6 @@ func max(a int, b int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0167.Two-Sum-II---Input-array-is-sorted.md b/website/content/ChapterFour/0100~0199/0167.Two-Sum-II---Input-array-is-sorted.md similarity index 89% rename from website/content/ChapterFour/0167.Two-Sum-II---Input-array-is-sorted.md rename to website/content/ChapterFour/0100~0199/0167.Two-Sum-II---Input-array-is-sorted.md index 1e55e786..dda1165f 100644 --- a/website/content/ChapterFour/0167.Two-Sum-II---Input-array-is-sorted.md +++ b/website/content/ChapterFour/0100~0199/0167.Two-Sum-II---Input-array-is-sorted.md @@ -70,6 +70,6 @@ func twoSum167_1(numbers []int, target int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0168.Excel-Sheet-Column-Title.md b/website/content/ChapterFour/0100~0199/0168.Excel-Sheet-Column-Title.md similarity index 83% rename from website/content/ChapterFour/0168.Excel-Sheet-Column-Title.md rename to website/content/ChapterFour/0100~0199/0168.Excel-Sheet-Column-Title.md index 3a78b80d..2c008faa 100644 --- a/website/content/ChapterFour/0168.Excel-Sheet-Column-Title.md +++ b/website/content/ChapterFour/0100~0199/0168.Excel-Sheet-Column-Title.md @@ -82,6 +82,6 @@ func convertToTitle(n int) string { ---------------------------------------------- diff --git a/website/content/ChapterFour/0169.Majority-Element.md b/website/content/ChapterFour/0100~0199/0169.Majority-Element.md similarity index 86% rename from website/content/ChapterFour/0169.Majority-Element.md rename to website/content/ChapterFour/0100~0199/0169.Majority-Element.md index f05a4392..03173fb7 100755 --- a/website/content/ChapterFour/0169.Majority-Element.md +++ b/website/content/ChapterFour/0100~0199/0169.Majority-Element.md @@ -68,6 +68,6 @@ func majorityElement1(nums []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0171.Excel-Sheet-Column-Number.md b/website/content/ChapterFour/0100~0199/0171.Excel-Sheet-Column-Number.md similarity index 81% rename from website/content/ChapterFour/0171.Excel-Sheet-Column-Number.md rename to website/content/ChapterFour/0100~0199/0171.Excel-Sheet-Column-Number.md index 6294074d..06ec111e 100644 --- a/website/content/ChapterFour/0171.Excel-Sheet-Column-Number.md +++ b/website/content/ChapterFour/0100~0199/0171.Excel-Sheet-Column-Number.md @@ -69,6 +69,6 @@ func titleToNumber(s string) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0172.Factorial-Trailing-Zeroes.md b/website/content/ChapterFour/0100~0199/0172.Factorial-Trailing-Zeroes.md similarity index 87% rename from website/content/ChapterFour/0172.Factorial-Trailing-Zeroes.md rename to website/content/ChapterFour/0100~0199/0172.Factorial-Trailing-Zeroes.md index c6a99740..4ac18a76 100755 --- a/website/content/ChapterFour/0172.Factorial-Trailing-Zeroes.md +++ b/website/content/ChapterFour/0100~0199/0172.Factorial-Trailing-Zeroes.md @@ -53,6 +53,6 @@ func trailingZeroes(n int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0173.Binary-Search-Tree-Iterator.md b/website/content/ChapterFour/0100~0199/0173.Binary-Search-Tree-Iterator.md similarity index 92% rename from website/content/ChapterFour/0173.Binary-Search-Tree-Iterator.md rename to website/content/ChapterFour/0100~0199/0173.Binary-Search-Tree-Iterator.md index b81575ce..581f88a6 100755 --- a/website/content/ChapterFour/0173.Binary-Search-Tree-Iterator.md +++ b/website/content/ChapterFour/0100~0199/0173.Binary-Search-Tree-Iterator.md @@ -120,6 +120,6 @@ func (pq *PriorityQueueOfInt) Pop() interface{} { ---------------------------------------------- diff --git a/website/content/ChapterFour/0174.Dungeon-Game.md b/website/content/ChapterFour/0100~0199/0174.Dungeon-Game.md similarity index 96% rename from website/content/ChapterFour/0174.Dungeon-Game.md rename to website/content/ChapterFour/0100~0199/0174.Dungeon-Game.md index 1c0edf33..30df3397 100755 --- a/website/content/ChapterFour/0174.Dungeon-Game.md +++ b/website/content/ChapterFour/0100~0199/0174.Dungeon-Game.md @@ -137,6 +137,6 @@ func canCross(dungeon [][]int, start int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0179.Largest-Number.md b/website/content/ChapterFour/0100~0199/0179.Largest-Number.md similarity index 91% rename from website/content/ChapterFour/0179.Largest-Number.md rename to website/content/ChapterFour/0100~0199/0179.Largest-Number.md index aeb366ce..09f1a070 100644 --- a/website/content/ChapterFour/0179.Largest-Number.md +++ b/website/content/ChapterFour/0100~0199/0179.Largest-Number.md @@ -124,6 +124,6 @@ func quickSortString(a []string, lo, hi int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0187.Repeated-DNA-Sequences.md b/website/content/ChapterFour/0100~0199/0187.Repeated-DNA-Sequences.md similarity index 91% rename from website/content/ChapterFour/0187.Repeated-DNA-Sequences.md rename to website/content/ChapterFour/0100~0199/0187.Repeated-DNA-Sequences.md index fe746802..5480f7a7 100755 --- a/website/content/ChapterFour/0187.Repeated-DNA-Sequences.md +++ b/website/content/ChapterFour/0100~0199/0187.Repeated-DNA-Sequences.md @@ -73,6 +73,6 @@ func findRepeatedDnaSequences1(s string) []string { ---------------------------------------------- diff --git a/website/content/ChapterFour/0189.Rotate-Array.md b/website/content/ChapterFour/0100~0199/0189.Rotate-Array.md similarity index 90% rename from website/content/ChapterFour/0189.Rotate-Array.md rename to website/content/ChapterFour/0100~0199/0189.Rotate-Array.md index 3be1e0de..34733ee9 100644 --- a/website/content/ChapterFour/0189.Rotate-Array.md +++ b/website/content/ChapterFour/0100~0199/0189.Rotate-Array.md @@ -77,6 +77,6 @@ func rotate1(nums []int, k int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0190.Reverse-Bits.md b/website/content/ChapterFour/0100~0199/0190.Reverse-Bits.md similarity index 91% rename from website/content/ChapterFour/0190.Reverse-Bits.md rename to website/content/ChapterFour/0100~0199/0190.Reverse-Bits.md index dfbb2863..d73e2f2f 100755 --- a/website/content/ChapterFour/0190.Reverse-Bits.md +++ b/website/content/ChapterFour/0100~0199/0190.Reverse-Bits.md @@ -55,6 +55,6 @@ func reverseBits(num uint32) uint32 { ---------------------------------------------- diff --git a/website/content/ChapterFour/0191.Number-of-1-Bits.md b/website/content/ChapterFour/0100~0199/0191.Number-of-1-Bits.md similarity index 90% rename from website/content/ChapterFour/0191.Number-of-1-Bits.md rename to website/content/ChapterFour/0100~0199/0191.Number-of-1-Bits.md index 379892d3..d3a45e1d 100755 --- a/website/content/ChapterFour/0191.Number-of-1-Bits.md +++ b/website/content/ChapterFour/0100~0199/0191.Number-of-1-Bits.md @@ -67,6 +67,6 @@ func hammingWeight1(num uint32) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0198.House-Robber.md b/website/content/ChapterFour/0100~0199/0198.House-Robber.md similarity index 92% rename from website/content/ChapterFour/0198.House-Robber.md rename to website/content/ChapterFour/0100~0199/0198.House-Robber.md index cbe1d110..2ee3a7a1 100755 --- a/website/content/ChapterFour/0198.House-Robber.md +++ b/website/content/ChapterFour/0100~0199/0198.House-Robber.md @@ -96,6 +96,6 @@ func rob(nums []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0199.Binary-Tree-Right-Side-View.md b/website/content/ChapterFour/0100~0199/0199.Binary-Tree-Right-Side-View.md similarity index 91% rename from website/content/ChapterFour/0199.Binary-Tree-Right-Side-View.md rename to website/content/ChapterFour/0100~0199/0199.Binary-Tree-Right-Side-View.md index 5c15e36b..8f0e72c1 100644 --- a/website/content/ChapterFour/0199.Binary-Tree-Right-Side-View.md +++ b/website/content/ChapterFour/0100~0199/0199.Binary-Tree-Right-Side-View.md @@ -86,6 +86,6 @@ func rightSideView(root *TreeNode) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0100~0199/_index.md b/website/content/ChapterFour/0100~0199/_index.md new file mode 100644 index 00000000..d2021683 --- /dev/null +++ b/website/content/ChapterFour/0100~0199/_index.md @@ -0,0 +1,5 @@ +--- +bookCollapseSection: true +weight: 20 +--- + diff --git a/website/content/ChapterFour/0200.Number-of-Islands.md b/website/content/ChapterFour/0200~0299/0200.Number-of-Islands.md similarity index 88% rename from website/content/ChapterFour/0200.Number-of-Islands.md rename to website/content/ChapterFour/0200~0299/0200.Number-of-Islands.md index 703125e3..90936357 100755 --- a/website/content/ChapterFour/0200.Number-of-Islands.md +++ b/website/content/ChapterFour/0200~0299/0200.Number-of-Islands.md @@ -83,6 +83,6 @@ func searchIslands(grid [][]byte, visited *[][]bool, x, y int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0201.Bitwise-AND-of-Numbers-Range.md b/website/content/ChapterFour/0200~0299/0201.Bitwise-AND-of-Numbers-Range.md similarity index 92% rename from website/content/ChapterFour/0201.Bitwise-AND-of-Numbers-Range.md rename to website/content/ChapterFour/0200~0299/0201.Bitwise-AND-of-Numbers-Range.md index c0c11f3d..6f064185 100755 --- a/website/content/ChapterFour/0201.Bitwise-AND-of-Numbers-Range.md +++ b/website/content/ChapterFour/0200~0299/0201.Bitwise-AND-of-Numbers-Range.md @@ -68,6 +68,6 @@ func rangeBitwiseAnd(m int, n int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0202.Happy-Number.md b/website/content/ChapterFour/0200~0299/0202.Happy-Number.md similarity index 85% rename from website/content/ChapterFour/0202.Happy-Number.md rename to website/content/ChapterFour/0200~0299/0202.Happy-Number.md index 453b3275..90def17b 100644 --- a/website/content/ChapterFour/0202.Happy-Number.md +++ b/website/content/ChapterFour/0200~0299/0202.Happy-Number.md @@ -67,6 +67,6 @@ func isHappy(n int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0203.Remove-Linked-List-Elements.md b/website/content/ChapterFour/0200~0299/0203.Remove-Linked-List-Elements.md similarity index 80% rename from website/content/ChapterFour/0203.Remove-Linked-List-Elements.md rename to website/content/ChapterFour/0200~0299/0203.Remove-Linked-List-Elements.md index 0ab51f2a..d8671161 100644 --- a/website/content/ChapterFour/0203.Remove-Linked-List-Elements.md +++ b/website/content/ChapterFour/0200~0299/0203.Remove-Linked-List-Elements.md @@ -58,6 +58,6 @@ func removeElements(head *ListNode, val int) *ListNode { ---------------------------------------------- diff --git a/website/content/ChapterFour/0204.Count-Primes.md b/website/content/ChapterFour/0200~0299/0204.Count-Primes.md similarity index 78% rename from website/content/ChapterFour/0204.Count-Primes.md rename to website/content/ChapterFour/0200~0299/0204.Count-Primes.md index f835f5a8..fe09cb95 100755 --- a/website/content/ChapterFour/0204.Count-Primes.md +++ b/website/content/ChapterFour/0200~0299/0204.Count-Primes.md @@ -52,6 +52,6 @@ func countPrimes(n int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0205.Isomorphic-Strings.md b/website/content/ChapterFour/0200~0299/0205.Isomorphic-Strings.md similarity index 88% rename from website/content/ChapterFour/0205.Isomorphic-Strings.md rename to website/content/ChapterFour/0200~0299/0205.Isomorphic-Strings.md index 43074115..6854aa2a 100644 --- a/website/content/ChapterFour/0205.Isomorphic-Strings.md +++ b/website/content/ChapterFour/0200~0299/0205.Isomorphic-Strings.md @@ -92,6 +92,6 @@ func isIsomorphic(s string, t string) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0206.Reverse-Linked-List.md b/website/content/ChapterFour/0200~0299/0206.Reverse-Linked-List.md similarity index 76% rename from website/content/ChapterFour/0206.Reverse-Linked-List.md rename to website/content/ChapterFour/0200~0299/0206.Reverse-Linked-List.md index af6949ca..773f955f 100644 --- a/website/content/ChapterFour/0206.Reverse-Linked-List.md +++ b/website/content/ChapterFour/0200~0299/0206.Reverse-Linked-List.md @@ -49,6 +49,6 @@ func reverseList(head *ListNode) *ListNode { ---------------------------------------------- diff --git a/website/content/ChapterFour/0207.Course-Schedule.md b/website/content/ChapterFour/0200~0299/0207.Course-Schedule.md similarity index 92% rename from website/content/ChapterFour/0207.Course-Schedule.md rename to website/content/ChapterFour/0200~0299/0207.Course-Schedule.md index c3f60925..52442d3c 100755 --- a/website/content/ChapterFour/0207.Course-Schedule.md +++ b/website/content/ChapterFour/0200~0299/0207.Course-Schedule.md @@ -84,6 +84,6 @@ func canFinish(n int, pre [][]int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0208.Implement-Trie-Prefix-Tree.md b/website/content/ChapterFour/0200~0299/0208.Implement-Trie-Prefix-Tree.md similarity index 90% rename from website/content/ChapterFour/0208.Implement-Trie-Prefix-Tree.md rename to website/content/ChapterFour/0200~0299/0208.Implement-Trie-Prefix-Tree.md index fec04d06..9f997351 100755 --- a/website/content/ChapterFour/0208.Implement-Trie-Prefix-Tree.md +++ b/website/content/ChapterFour/0200~0299/0208.Implement-Trie-Prefix-Tree.md @@ -101,6 +101,6 @@ func (this *Trie) StartsWith(prefix string) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0209.Minimum-Size-Subarray-Sum.md b/website/content/ChapterFour/0200~0299/0209.Minimum-Size-Subarray-Sum.md similarity index 86% rename from website/content/ChapterFour/0209.Minimum-Size-Subarray-Sum.md rename to website/content/ChapterFour/0200~0299/0209.Minimum-Size-Subarray-Sum.md index 0d6d6f1e..446bca92 100644 --- a/website/content/ChapterFour/0209.Minimum-Size-Subarray-Sum.md +++ b/website/content/ChapterFour/0200~0299/0209.Minimum-Size-Subarray-Sum.md @@ -63,6 +63,6 @@ func minSubArrayLen(s int, nums []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0210.Course-Schedule-II.md b/website/content/ChapterFour/0200~0299/0210.Course-Schedule-II.md similarity index 92% rename from website/content/ChapterFour/0210.Course-Schedule-II.md rename to website/content/ChapterFour/0200~0299/0210.Course-Schedule-II.md index d2662b22..8f73b240 100755 --- a/website/content/ChapterFour/0210.Course-Schedule-II.md +++ b/website/content/ChapterFour/0200~0299/0210.Course-Schedule-II.md @@ -82,6 +82,6 @@ func findOrder(numCourses int, prerequisites [][]int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0211.Design-Add-and-Search-Words-Data-Structure.md b/website/content/ChapterFour/0200~0299/0211.Design-Add-and-Search-Words-Data-Structure.md similarity index 92% rename from website/content/ChapterFour/0211.Design-Add-and-Search-Words-Data-Structure.md rename to website/content/ChapterFour/0200~0299/0211.Design-Add-and-Search-Words-Data-Structure.md index 171e82cc..311a827c 100755 --- a/website/content/ChapterFour/0211.Design-Add-and-Search-Words-Data-Structure.md +++ b/website/content/ChapterFour/0200~0299/0211.Design-Add-and-Search-Words-Data-Structure.md @@ -97,6 +97,6 @@ func (this *WordDictionary) Search(word string) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0212.Word-Search-II.md b/website/content/ChapterFour/0200~0299/0212.Word-Search-II.md similarity index 86% rename from website/content/ChapterFour/0212.Word-Search-II.md rename to website/content/ChapterFour/0200~0299/0212.Word-Search-II.md index f83123dc..8966a46b 100755 --- a/website/content/ChapterFour/0212.Word-Search-II.md +++ b/website/content/ChapterFour/0200~0299/0212.Word-Search-II.md @@ -59,6 +59,6 @@ func findWords(board [][]byte, words []string) []string { ---------------------------------------------- diff --git a/website/content/ChapterFour/0213.House-Robber-II.md b/website/content/ChapterFour/0200~0299/0213.House-Robber-II.md similarity index 91% rename from website/content/ChapterFour/0213.House-Robber-II.md rename to website/content/ChapterFour/0200~0299/0213.House-Robber-II.md index 4860b757..e108507b 100755 --- a/website/content/ChapterFour/0213.House-Robber-II.md +++ b/website/content/ChapterFour/0200~0299/0213.House-Robber-II.md @@ -72,6 +72,6 @@ func rob213_1(nums []int, start, end int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0215.Kth-Largest-Element-in-an-Array.md b/website/content/ChapterFour/0200~0299/0215.Kth-Largest-Element-in-an-Array.md similarity index 89% rename from website/content/ChapterFour/0215.Kth-Largest-Element-in-an-Array.md rename to website/content/ChapterFour/0200~0299/0215.Kth-Largest-Element-in-an-Array.md index ed9137fd..d62706dd 100644 --- a/website/content/ChapterFour/0215.Kth-Largest-Element-in-an-Array.md +++ b/website/content/ChapterFour/0200~0299/0215.Kth-Largest-Element-in-an-Array.md @@ -78,6 +78,6 @@ func selection(arr []int, l, r, k int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0216.Combination-Sum-III.md b/website/content/ChapterFour/0200~0299/0216.Combination-Sum-III.md similarity index 87% rename from website/content/ChapterFour/0216.Combination-Sum-III.md rename to website/content/ChapterFour/0200~0299/0216.Combination-Sum-III.md index 97e953dc..c6dbd156 100755 --- a/website/content/ChapterFour/0216.Combination-Sum-III.md +++ b/website/content/ChapterFour/0200~0299/0216.Combination-Sum-III.md @@ -75,6 +75,6 @@ func findcombinationSum3(k, target, index int, c []int, res *[][]int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0217.Contains-Duplicate.md b/website/content/ChapterFour/0200~0299/0217.Contains-Duplicate.md similarity index 80% rename from website/content/ChapterFour/0217.Contains-Duplicate.md rename to website/content/ChapterFour/0200~0299/0217.Contains-Duplicate.md index 2a078acd..ddb948e7 100644 --- a/website/content/ChapterFour/0217.Contains-Duplicate.md +++ b/website/content/ChapterFour/0200~0299/0217.Contains-Duplicate.md @@ -64,6 +64,6 @@ func containsDuplicate(nums []int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0218.The-Skyline-Problem.md b/website/content/ChapterFour/0200~0299/0218.The-Skyline-Problem.md similarity index 97% rename from website/content/ChapterFour/0218.The-Skyline-Problem.md rename to website/content/ChapterFour/0200~0299/0218.The-Skyline-Problem.md index 71fa6d02..72623c5e 100755 --- a/website/content/ChapterFour/0218.The-Skyline-Problem.md +++ b/website/content/ChapterFour/0200~0299/0218.The-Skyline-Problem.md @@ -289,6 +289,6 @@ func (q *IndexMaxPQ) less(i, j int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0219.Contains-Duplicate-II.md b/website/content/ChapterFour/0200~0299/0219.Contains-Duplicate-II.md similarity index 86% rename from website/content/ChapterFour/0219.Contains-Duplicate-II.md rename to website/content/ChapterFour/0200~0299/0219.Contains-Duplicate-II.md index 37772d36..c4080825 100644 --- a/website/content/ChapterFour/0219.Contains-Duplicate-II.md +++ b/website/content/ChapterFour/0200~0299/0219.Contains-Duplicate-II.md @@ -71,6 +71,6 @@ func containsNearbyDuplicate(nums []int, k int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0220.Contains-Duplicate-III.md b/website/content/ChapterFour/0200~0299/0220.Contains-Duplicate-III.md similarity index 94% rename from website/content/ChapterFour/0220.Contains-Duplicate-III.md rename to website/content/ChapterFour/0200~0299/0220.Contains-Duplicate-III.md index 89b23418..b26d478f 100644 --- a/website/content/ChapterFour/0220.Contains-Duplicate-III.md +++ b/website/content/ChapterFour/0200~0299/0220.Contains-Duplicate-III.md @@ -107,6 +107,6 @@ func containsNearbyAlmostDuplicate1(nums []int, k int, t int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0222.Count-Complete-Tree-Nodes.md b/website/content/ChapterFour/0200~0299/0222.Count-Complete-Tree-Nodes.md similarity index 86% rename from website/content/ChapterFour/0222.Count-Complete-Tree-Nodes.md rename to website/content/ChapterFour/0200~0299/0222.Count-Complete-Tree-Nodes.md index 88f00d48..a7f148ba 100644 --- a/website/content/ChapterFour/0222.Count-Complete-Tree-Nodes.md +++ b/website/content/ChapterFour/0200~0299/0222.Count-Complete-Tree-Nodes.md @@ -84,6 +84,6 @@ func countNodes(root *TreeNode) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0223.Rectangle-Area.md b/website/content/ChapterFour/0200~0299/0223.Rectangle-Area.md similarity index 86% rename from website/content/ChapterFour/0223.Rectangle-Area.md rename to website/content/ChapterFour/0200~0299/0223.Rectangle-Area.md index c129f609..a85324ad 100755 --- a/website/content/ChapterFour/0223.Rectangle-Area.md +++ b/website/content/ChapterFour/0200~0299/0223.Rectangle-Area.md @@ -55,6 +55,6 @@ func area(x0, y0, x1, y1 int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0224.Basic-Calculator.md b/website/content/ChapterFour/0200~0299/0224.Basic-Calculator.md similarity index 93% rename from website/content/ChapterFour/0224.Basic-Calculator.md rename to website/content/ChapterFour/0200~0299/0224.Basic-Calculator.md index dae86172..3ae0cccf 100755 --- a/website/content/ChapterFour/0224.Basic-Calculator.md +++ b/website/content/ChapterFour/0200~0299/0224.Basic-Calculator.md @@ -167,6 +167,6 @@ func isDigital(v byte) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0225.Implement-Stack-using-Queues.md b/website/content/ChapterFour/0200~0299/0225.Implement-Stack-using-Queues.md similarity index 90% rename from website/content/ChapterFour/0225.Implement-Stack-using-Queues.md rename to website/content/ChapterFour/0200~0299/0225.Implement-Stack-using-Queues.md index 9a1be896..47b8177c 100644 --- a/website/content/ChapterFour/0225.Implement-Stack-using-Queues.md +++ b/website/content/ChapterFour/0200~0299/0225.Implement-Stack-using-Queues.md @@ -97,6 +97,6 @@ func (this *MyStack) Empty() bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0226.Invert-Binary-Tree.md b/website/content/ChapterFour/0200~0299/0226.Invert-Binary-Tree.md similarity index 83% rename from website/content/ChapterFour/0226.Invert-Binary-Tree.md rename to website/content/ChapterFour/0200~0299/0226.Invert-Binary-Tree.md index 844f3e90..771e047b 100644 --- a/website/content/ChapterFour/0226.Invert-Binary-Tree.md +++ b/website/content/ChapterFour/0200~0299/0226.Invert-Binary-Tree.md @@ -78,6 +78,6 @@ func invertTree(root *TreeNode) *TreeNode { ---------------------------------------------- diff --git a/website/content/ChapterFour/0228.Summary-Ranges.md b/website/content/ChapterFour/0200~0299/0228.Summary-Ranges.md similarity index 90% rename from website/content/ChapterFour/0228.Summary-Ranges.md rename to website/content/ChapterFour/0200~0299/0228.Summary-Ranges.md index 3a2a53ec..30f9cb26 100644 --- a/website/content/ChapterFour/0228.Summary-Ranges.md +++ b/website/content/ChapterFour/0200~0299/0228.Summary-Ranges.md @@ -110,6 +110,6 @@ func summaryRanges(nums []int) (ans []string) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0229.Majority-Element-II.md b/website/content/ChapterFour/0200~0299/0229.Majority-Element-II.md similarity index 91% rename from website/content/ChapterFour/0229.Majority-Element-II.md rename to website/content/ChapterFour/0200~0299/0229.Majority-Element-II.md index 45cbf0db..fb043de6 100755 --- a/website/content/ChapterFour/0229.Majority-Element-II.md +++ b/website/content/ChapterFour/0200~0299/0229.Majority-Element-II.md @@ -102,6 +102,6 @@ func majorityElement229_1(nums []int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0230.Kth-Smallest-Element-in-a-BST.md b/website/content/ChapterFour/0200~0299/0230.Kth-Smallest-Element-in-a-BST.md similarity index 88% rename from website/content/ChapterFour/0230.Kth-Smallest-Element-in-a-BST.md rename to website/content/ChapterFour/0200~0299/0230.Kth-Smallest-Element-in-a-BST.md index 45fcea55..3383a50f 100755 --- a/website/content/ChapterFour/0230.Kth-Smallest-Element-in-a-BST.md +++ b/website/content/ChapterFour/0200~0299/0230.Kth-Smallest-Element-in-a-BST.md @@ -80,6 +80,6 @@ func inorder230(node *TreeNode, k int, count *int, ans *int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0231.Power-of-Two.md b/website/content/ChapterFour/0200~0299/0231.Power-of-Two.md similarity index 87% rename from website/content/ChapterFour/0231.Power-of-Two.md rename to website/content/ChapterFour/0200~0299/0231.Power-of-Two.md index 157f91e5..491f5534 100755 --- a/website/content/ChapterFour/0231.Power-of-Two.md +++ b/website/content/ChapterFour/0200~0299/0231.Power-of-Two.md @@ -72,6 +72,6 @@ func isPowerOfTwo3(num int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0232.Implement-Queue-using-Stacks.md b/website/content/ChapterFour/0200~0299/0232.Implement-Queue-using-Stacks.md similarity index 91% rename from website/content/ChapterFour/0232.Implement-Queue-using-Stacks.md rename to website/content/ChapterFour/0200~0299/0232.Implement-Queue-using-Stacks.md index 6ceaa1b0..71e5bc14 100644 --- a/website/content/ChapterFour/0232.Implement-Queue-using-Stacks.md +++ b/website/content/ChapterFour/0200~0299/0232.Implement-Queue-using-Stacks.md @@ -101,6 +101,6 @@ func (this *MyQueue) fromStackToQueue(s, q *[]int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0234.Palindrome-Linked-List.md b/website/content/ChapterFour/0200~0299/0234.Palindrome-Linked-List.md similarity index 89% rename from website/content/ChapterFour/0234.Palindrome-Linked-List.md rename to website/content/ChapterFour/0200~0299/0234.Palindrome-Linked-List.md index 56eca338..8f409518 100644 --- a/website/content/ChapterFour/0234.Palindrome-Linked-List.md +++ b/website/content/ChapterFour/0200~0299/0234.Palindrome-Linked-List.md @@ -113,6 +113,6 @@ func L2ss(head *ListNode) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree.md b/website/content/ChapterFour/0200~0299/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree.md similarity index 89% rename from website/content/ChapterFour/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree.md rename to website/content/ChapterFour/0200~0299/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree.md index 73a9a443..77f6cdbf 100755 --- a/website/content/ChapterFour/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree.md +++ b/website/content/ChapterFour/0200~0299/0235.Lowest-Common-Ancestor-of-a-Binary-Search-Tree.md @@ -74,6 +74,6 @@ func lowestCommonAncestor(root, p, q *TreeNode) *TreeNode { ---------------------------------------------- diff --git a/website/content/ChapterFour/0236.Lowest-Common-Ancestor-of-a-Binary-Tree.md b/website/content/ChapterFour/0200~0299/0236.Lowest-Common-Ancestor-of-a-Binary-Tree.md similarity index 89% rename from website/content/ChapterFour/0236.Lowest-Common-Ancestor-of-a-Binary-Tree.md rename to website/content/ChapterFour/0200~0299/0236.Lowest-Common-Ancestor-of-a-Binary-Tree.md index 96342c14..302f3f19 100755 --- a/website/content/ChapterFour/0236.Lowest-Common-Ancestor-of-a-Binary-Tree.md +++ b/website/content/ChapterFour/0200~0299/0236.Lowest-Common-Ancestor-of-a-Binary-Tree.md @@ -74,6 +74,6 @@ func lowestCommonAncestor236(root, p, q *TreeNode) *TreeNode { ---------------------------------------------- diff --git a/website/content/ChapterFour/0237.Delete-Node-in-a-Linked-List.md b/website/content/ChapterFour/0200~0299/0237.Delete-Node-in-a-Linked-List.md similarity index 87% rename from website/content/ChapterFour/0237.Delete-Node-in-a-Linked-List.md rename to website/content/ChapterFour/0200~0299/0237.Delete-Node-in-a-Linked-List.md index 981fe415..e7a23da5 100644 --- a/website/content/ChapterFour/0237.Delete-Node-in-a-Linked-List.md +++ b/website/content/ChapterFour/0200~0299/0237.Delete-Node-in-a-Linked-List.md @@ -74,6 +74,6 @@ func deleteNode(node *ListNode) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0239.Sliding-Window-Maximum.md b/website/content/ChapterFour/0200~0299/0239.Sliding-Window-Maximum.md similarity index 92% rename from website/content/ChapterFour/0239.Sliding-Window-Maximum.md rename to website/content/ChapterFour/0200~0299/0239.Sliding-Window-Maximum.md index ea5a4493..bf2a3a11 100755 --- a/website/content/ChapterFour/0239.Sliding-Window-Maximum.md +++ b/website/content/ChapterFour/0200~0299/0239.Sliding-Window-Maximum.md @@ -97,6 +97,6 @@ func maxSlidingWindow(nums []int, k int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0240.Search-a-2D-Matrix-II.md b/website/content/ChapterFour/0200~0299/0240.Search-a-2D-Matrix-II.md similarity index 92% rename from website/content/ChapterFour/0240.Search-a-2D-Matrix-II.md rename to website/content/ChapterFour/0200~0299/0240.Search-a-2D-Matrix-II.md index 736d4ba4..55f99caf 100755 --- a/website/content/ChapterFour/0240.Search-a-2D-Matrix-II.md +++ b/website/content/ChapterFour/0200~0299/0240.Search-a-2D-Matrix-II.md @@ -91,6 +91,6 @@ func searchMatrix2401(matrix [][]int, target int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0242.Valid-Anagram.md b/website/content/ChapterFour/0200~0299/0242.Valid-Anagram.md similarity index 91% rename from website/content/ChapterFour/0242.Valid-Anagram.md rename to website/content/ChapterFour/0200~0299/0242.Valid-Anagram.md index 7f643f68..9e99ce87 100644 --- a/website/content/ChapterFour/0242.Valid-Anagram.md +++ b/website/content/ChapterFour/0200~0299/0242.Valid-Anagram.md @@ -119,6 +119,6 @@ func quickSortByte(a []byte, lo, hi int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0257.Binary-Tree-Paths.md b/website/content/ChapterFour/0200~0299/0257.Binary-Tree-Paths.md similarity index 86% rename from website/content/ChapterFour/0257.Binary-Tree-Paths.md rename to website/content/ChapterFour/0200~0299/0257.Binary-Tree-Paths.md index eaef55f8..22b451ce 100755 --- a/website/content/ChapterFour/0257.Binary-Tree-Paths.md +++ b/website/content/ChapterFour/0200~0299/0257.Binary-Tree-Paths.md @@ -73,6 +73,6 @@ func binaryTreePaths(root *TreeNode) []string { ---------------------------------------------- diff --git a/website/content/ChapterFour/0258.Add-Digits.md b/website/content/ChapterFour/0200~0299/0258.Add-Digits.md similarity index 81% rename from website/content/ChapterFour/0258.Add-Digits.md rename to website/content/ChapterFour/0200~0299/0258.Add-Digits.md index 57abdabc..4e0770ad 100644 --- a/website/content/ChapterFour/0258.Add-Digits.md +++ b/website/content/ChapterFour/0200~0299/0258.Add-Digits.md @@ -49,6 +49,6 @@ func addDigits(num int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0260.Single-Number-III.md b/website/content/ChapterFour/0200~0299/0260.Single-Number-III.md similarity index 90% rename from website/content/ChapterFour/0260.Single-Number-III.md rename to website/content/ChapterFour/0200~0299/0260.Single-Number-III.md index a5c74bf0..ed2a461b 100755 --- a/website/content/ChapterFour/0260.Single-Number-III.md +++ b/website/content/ChapterFour/0200~0299/0260.Single-Number-III.md @@ -63,6 +63,6 @@ func singleNumberIII(nums []int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0263.Ugly-Number.md b/website/content/ChapterFour/0200~0299/0263.Ugly-Number.md similarity index 82% rename from website/content/ChapterFour/0263.Ugly-Number.md rename to website/content/ChapterFour/0200~0299/0263.Ugly-Number.md index 4e04b40e..713d3058 100644 --- a/website/content/ChapterFour/0263.Ugly-Number.md +++ b/website/content/ChapterFour/0200~0299/0263.Ugly-Number.md @@ -71,6 +71,6 @@ func isUgly(num int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0268.Missing-Number.md b/website/content/ChapterFour/0200~0299/0268.Missing-Number.md similarity index 86% rename from website/content/ChapterFour/0268.Missing-Number.md rename to website/content/ChapterFour/0200~0299/0268.Missing-Number.md index f5bafc72..393dbe2f 100755 --- a/website/content/ChapterFour/0268.Missing-Number.md +++ b/website/content/ChapterFour/0200~0299/0268.Missing-Number.md @@ -49,6 +49,6 @@ func missingNumber(nums []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0274.H-Index.md b/website/content/ChapterFour/0200~0299/0274.H-Index.md similarity index 89% rename from website/content/ChapterFour/0274.H-Index.md rename to website/content/ChapterFour/0200~0299/0274.H-Index.md index fd961ebc..75cf67b1 100644 --- a/website/content/ChapterFour/0274.H-Index.md +++ b/website/content/ChapterFour/0200~0299/0274.H-Index.md @@ -80,6 +80,6 @@ func hIndex1(citations []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0275.H-Index-II.md b/website/content/ChapterFour/0200~0299/0275.H-Index-II.md similarity index 93% rename from website/content/ChapterFour/0275.H-Index-II.md rename to website/content/ChapterFour/0200~0299/0275.H-Index-II.md index 880d39d3..a29f7133 100755 --- a/website/content/ChapterFour/0275.H-Index-II.md +++ b/website/content/ChapterFour/0200~0299/0275.H-Index-II.md @@ -73,6 +73,6 @@ func hIndex275(citations []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0283.Move-Zeroes.md b/website/content/ChapterFour/0200~0299/0283.Move-Zeroes.md similarity index 83% rename from website/content/ChapterFour/0283.Move-Zeroes.md rename to website/content/ChapterFour/0200~0299/0283.Move-Zeroes.md index 48c52dd7..092cf3c6 100644 --- a/website/content/ChapterFour/0283.Move-Zeroes.md +++ b/website/content/ChapterFour/0200~0299/0283.Move-Zeroes.md @@ -57,6 +57,6 @@ func moveZeroes(nums []int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0287.Find-the-Duplicate-Number.md b/website/content/ChapterFour/0200~0299/0287.Find-the-Duplicate-Number.md similarity index 93% rename from website/content/ChapterFour/0287.Find-the-Duplicate-Number.md rename to website/content/ChapterFour/0200~0299/0287.Find-the-Duplicate-Number.md index 11dc7ccf..a79bae5b 100644 --- a/website/content/ChapterFour/0287.Find-the-Duplicate-Number.md +++ b/website/content/ChapterFour/0200~0299/0287.Find-the-Duplicate-Number.md @@ -109,6 +109,6 @@ func findDuplicate2(nums []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0290.Word-Pattern.md b/website/content/ChapterFour/0200~0299/0290.Word-Pattern.md similarity index 91% rename from website/content/ChapterFour/0290.Word-Pattern.md rename to website/content/ChapterFour/0200~0299/0290.Word-Pattern.md index d22b9623..bce80db8 100644 --- a/website/content/ChapterFour/0290.Word-Pattern.md +++ b/website/content/ChapterFour/0200~0299/0290.Word-Pattern.md @@ -100,6 +100,6 @@ func wordPattern(pattern string, str string) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0200~0299/_index.md b/website/content/ChapterFour/0200~0299/_index.md new file mode 100644 index 00000000..d2021683 --- /dev/null +++ b/website/content/ChapterFour/0200~0299/_index.md @@ -0,0 +1,5 @@ +--- +bookCollapseSection: true +weight: 20 +--- + diff --git a/website/content/ChapterFour/0300.Longest-Increasing-Subsequence.md b/website/content/ChapterFour/0300~0399/0300.Longest-Increasing-Subsequence.md similarity index 92% rename from website/content/ChapterFour/0300.Longest-Increasing-Subsequence.md rename to website/content/ChapterFour/0300~0399/0300.Longest-Increasing-Subsequence.md index 3d678515..3ba33652 100755 --- a/website/content/ChapterFour/0300.Longest-Increasing-Subsequence.md +++ b/website/content/ChapterFour/0300~0399/0300.Longest-Increasing-Subsequence.md @@ -81,6 +81,6 @@ func lengthOfLIS1(nums []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0303.Range-Sum-Query---Immutable.md b/website/content/ChapterFour/0300~0399/0303.Range-Sum-Query---Immutable.md similarity index 93% rename from website/content/ChapterFour/0303.Range-Sum-Query---Immutable.md rename to website/content/ChapterFour/0300~0399/0303.Range-Sum-Query---Immutable.md index 9f24536e..1f708d35 100755 --- a/website/content/ChapterFour/0303.Range-Sum-Query---Immutable.md +++ b/website/content/ChapterFour/0300~0399/0303.Range-Sum-Query---Immutable.md @@ -112,6 +112,6 @@ func (ma *NumArray) SumRange(i int, j int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0306.Additive-Number.md b/website/content/ChapterFour/0300~0399/0306.Additive-Number.md similarity index 92% rename from website/content/ChapterFour/0306.Additive-Number.md rename to website/content/ChapterFour/0300~0399/0306.Additive-Number.md index b3ed5be6..a798d9fa 100755 --- a/website/content/ChapterFour/0306.Additive-Number.md +++ b/website/content/ChapterFour/0300~0399/0306.Additive-Number.md @@ -91,6 +91,6 @@ func recursiveCheck(num string, x1 int, x2 int, left int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0307.Range-Sum-Query---Mutable.md b/website/content/ChapterFour/0300~0399/0307.Range-Sum-Query---Mutable.md similarity index 92% rename from website/content/ChapterFour/0307.Range-Sum-Query---Mutable.md rename to website/content/ChapterFour/0300~0399/0307.Range-Sum-Query---Mutable.md index c8618b62..57f099b8 100755 --- a/website/content/ChapterFour/0307.Range-Sum-Query---Mutable.md +++ b/website/content/ChapterFour/0300~0399/0307.Range-Sum-Query---Mutable.md @@ -123,6 +123,6 @@ func (this *NumArray) Update(i int, val int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.md b/website/content/ChapterFour/0300~0399/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.md similarity index 94% rename from website/content/ChapterFour/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.md rename to website/content/ChapterFour/0300~0399/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.md index efd0363d..f0afbb14 100755 --- a/website/content/ChapterFour/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.md +++ b/website/content/ChapterFour/0300~0399/0309.Best-Time-to-Buy-and-Sell-Stock-with-Cooldown.md @@ -86,6 +86,6 @@ func maxProfit309_1(prices []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0315.Count-of-Smaller-Numbers-After-Self.md b/website/content/ChapterFour/0300~0399/0315.Count-of-Smaller-Numbers-After-Self.md similarity index 91% rename from website/content/ChapterFour/0315.Count-of-Smaller-Numbers-After-Self.md rename to website/content/ChapterFour/0300~0399/0315.Count-of-Smaller-Numbers-After-Self.md index 77b9e627..dfc08ac7 100755 --- a/website/content/ChapterFour/0315.Count-of-Smaller-Numbers-After-Self.md +++ b/website/content/ChapterFour/0300~0399/0315.Count-of-Smaller-Numbers-After-Self.md @@ -90,6 +90,6 @@ func countSmaller(nums []int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0318.Maximum-Product-of-Word-Lengths.md b/website/content/ChapterFour/0300~0399/0318.Maximum-Product-of-Word-Lengths.md similarity index 90% rename from website/content/ChapterFour/0318.Maximum-Product-of-Word-Lengths.md rename to website/content/ChapterFour/0300~0399/0318.Maximum-Product-of-Word-Lengths.md index de8f712c..00e0b4dc 100755 --- a/website/content/ChapterFour/0318.Maximum-Product-of-Word-Lengths.md +++ b/website/content/ChapterFour/0300~0399/0318.Maximum-Product-of-Word-Lengths.md @@ -79,6 +79,6 @@ func maxProduct318(words []string) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0322.Coin-Change.md b/website/content/ChapterFour/0300~0399/0322.Coin-Change.md similarity index 88% rename from website/content/ChapterFour/0322.Coin-Change.md rename to website/content/ChapterFour/0300~0399/0322.Coin-Change.md index 4e15b87c..fb1838d7 100755 --- a/website/content/ChapterFour/0322.Coin-Change.md +++ b/website/content/ChapterFour/0300~0399/0322.Coin-Change.md @@ -63,6 +63,6 @@ func coinChange(coins []int, amount int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0324.Wiggle-Sort-II.md b/website/content/ChapterFour/0300~0399/0324.Wiggle-Sort-II.md similarity index 96% rename from website/content/ChapterFour/0324.Wiggle-Sort-II.md rename to website/content/ChapterFour/0300~0399/0324.Wiggle-Sort-II.md index 5047b8f0..5d5a250e 100644 --- a/website/content/ChapterFour/0324.Wiggle-Sort-II.md +++ b/website/content/ChapterFour/0300~0399/0324.Wiggle-Sort-II.md @@ -265,6 +265,6 @@ func wiggleSort1(nums []int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0326.Power-of-Three.md b/website/content/ChapterFour/0300~0399/0326.Power-of-Three.md similarity index 88% rename from website/content/ChapterFour/0326.Power-of-Three.md rename to website/content/ChapterFour/0300~0399/0326.Power-of-Three.md index 38328b88..99596c26 100755 --- a/website/content/ChapterFour/0326.Power-of-Three.md +++ b/website/content/ChapterFour/0300~0399/0326.Power-of-Three.md @@ -79,6 +79,6 @@ func isPowerOfThree2(num int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0327.Count-of-Range-Sum.md b/website/content/ChapterFour/0300~0399/0327.Count-of-Range-Sum.md similarity index 97% rename from website/content/ChapterFour/0327.Count-of-Range-Sum.md rename to website/content/ChapterFour/0300~0399/0327.Count-of-Range-Sum.md index 30779996..19beccae 100755 --- a/website/content/ChapterFour/0327.Count-of-Range-Sum.md +++ b/website/content/ChapterFour/0300~0399/0327.Count-of-Range-Sum.md @@ -147,6 +147,6 @@ func countRangeSum1(nums []int, lower int, upper int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0328.Odd-Even-Linked-List.md b/website/content/ChapterFour/0300~0399/0328.Odd-Even-Linked-List.md similarity index 87% rename from website/content/ChapterFour/0328.Odd-Even-Linked-List.md rename to website/content/ChapterFour/0300~0399/0328.Odd-Even-Linked-List.md index 3e76e37c..53b92153 100644 --- a/website/content/ChapterFour/0328.Odd-Even-Linked-List.md +++ b/website/content/ChapterFour/0300~0399/0328.Odd-Even-Linked-List.md @@ -79,6 +79,6 @@ func oddEvenList(head *ListNode) *ListNode { ---------------------------------------------- diff --git a/website/content/ChapterFour/0329.Longest-Increasing-Path-in-a-Matrix.md b/website/content/ChapterFour/0300~0399/0329.Longest-Increasing-Path-in-a-Matrix.md similarity index 90% rename from website/content/ChapterFour/0329.Longest-Increasing-Path-in-a-Matrix.md rename to website/content/ChapterFour/0300~0399/0329.Longest-Increasing-Path-in-a-Matrix.md index f26eb117..198fe2e3 100755 --- a/website/content/ChapterFour/0329.Longest-Increasing-Path-in-a-Matrix.md +++ b/website/content/ChapterFour/0300~0399/0329.Longest-Increasing-Path-in-a-Matrix.md @@ -94,6 +94,6 @@ func searchPath(board, cache [][]int, lastNum, x, y int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md b/website/content/ChapterFour/0300~0399/0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md similarity index 91% rename from website/content/ChapterFour/0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md rename to website/content/ChapterFour/0300~0399/0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md index 83ba9b8d..5167b262 100644 --- a/website/content/ChapterFour/0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md +++ b/website/content/ChapterFour/0300~0399/0331.Verify-Preorder-Serialization-of-a-Binary-Tree.md @@ -87,6 +87,6 @@ func isValidSerialization(preorder string) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0337.House-Robber-III.md b/website/content/ChapterFour/0300~0399/0337.House-Robber-III.md similarity index 90% rename from website/content/ChapterFour/0337.House-Robber-III.md rename to website/content/ChapterFour/0300~0399/0337.House-Robber-III.md index d524b3d3..08ee691b 100644 --- a/website/content/ChapterFour/0337.House-Robber-III.md +++ b/website/content/ChapterFour/0300~0399/0337.House-Robber-III.md @@ -75,6 +75,6 @@ func dfsTreeRob(root *TreeNode) (a, b int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0338.Counting-Bits.md b/website/content/ChapterFour/0300~0399/0338.Counting-Bits.md similarity index 87% rename from website/content/ChapterFour/0338.Counting-Bits.md rename to website/content/ChapterFour/0300~0399/0338.Counting-Bits.md index a543d869..6b466ce2 100755 --- a/website/content/ChapterFour/0338.Counting-Bits.md +++ b/website/content/ChapterFour/0300~0399/0338.Counting-Bits.md @@ -56,6 +56,6 @@ func countBits(num int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0342.Power-of-Four.md b/website/content/ChapterFour/0300~0399/0342.Power-of-Four.md similarity index 86% rename from website/content/ChapterFour/0342.Power-of-Four.md rename to website/content/ChapterFour/0300~0399/0342.Power-of-Four.md index 221989d8..aad686b3 100755 --- a/website/content/ChapterFour/0342.Power-of-Four.md +++ b/website/content/ChapterFour/0300~0399/0342.Power-of-Four.md @@ -57,6 +57,6 @@ func isPowerOfFour1(num int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0343.Integer-Break.md b/website/content/ChapterFour/0300~0399/0343.Integer-Break.md similarity index 87% rename from website/content/ChapterFour/0343.Integer-Break.md rename to website/content/ChapterFour/0300~0399/0343.Integer-Break.md index 3ca9c6af..ff492fa2 100755 --- a/website/content/ChapterFour/0343.Integer-Break.md +++ b/website/content/ChapterFour/0300~0399/0343.Integer-Break.md @@ -55,6 +55,6 @@ func integerBreak(n int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0344.Reverse-String.md b/website/content/ChapterFour/0300~0399/0344.Reverse-String.md similarity index 81% rename from website/content/ChapterFour/0344.Reverse-String.md rename to website/content/ChapterFour/0300~0399/0344.Reverse-String.md index 493fbe3b..e2ed876c 100644 --- a/website/content/ChapterFour/0344.Reverse-String.md +++ b/website/content/ChapterFour/0300~0399/0344.Reverse-String.md @@ -55,6 +55,6 @@ func reverseString(s []byte) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0345.Reverse-Vowels-of-a-String.md b/website/content/ChapterFour/0300~0399/0345.Reverse-Vowels-of-a-String.md similarity index 84% rename from website/content/ChapterFour/0345.Reverse-Vowels-of-a-String.md rename to website/content/ChapterFour/0300~0399/0345.Reverse-Vowels-of-a-String.md index bd7679af..7e812f36 100644 --- a/website/content/ChapterFour/0345.Reverse-Vowels-of-a-String.md +++ b/website/content/ChapterFour/0300~0399/0345.Reverse-Vowels-of-a-String.md @@ -71,6 +71,6 @@ func isVowels(s byte) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0347.Top-K-Frequent-Elements.md b/website/content/ChapterFour/0300~0399/0347.Top-K-Frequent-Elements.md similarity index 88% rename from website/content/ChapterFour/0347.Top-K-Frequent-Elements.md rename to website/content/ChapterFour/0300~0399/0347.Top-K-Frequent-Elements.md index ea1d85b1..99b56de2 100644 --- a/website/content/ChapterFour/0347.Top-K-Frequent-Elements.md +++ b/website/content/ChapterFour/0300~0399/0347.Top-K-Frequent-Elements.md @@ -105,6 +105,6 @@ func (pq *PriorityQueue) Pop() interface{} { ---------------------------------------------- diff --git a/website/content/ChapterFour/0349.Intersection-of-Two-Arrays.md b/website/content/ChapterFour/0300~0399/0349.Intersection-of-Two-Arrays.md similarity index 81% rename from website/content/ChapterFour/0349.Intersection-of-Two-Arrays.md rename to website/content/ChapterFour/0300~0399/0349.Intersection-of-Two-Arrays.md index ade24e62..b57951ab 100644 --- a/website/content/ChapterFour/0349.Intersection-of-Two-Arrays.md +++ b/website/content/ChapterFour/0300~0399/0349.Intersection-of-Two-Arrays.md @@ -62,6 +62,6 @@ func intersection(nums1 []int, nums2 []int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0350.Intersection-of-Two-Arrays-II.md b/website/content/ChapterFour/0300~0399/0350.Intersection-of-Two-Arrays-II.md similarity index 86% rename from website/content/ChapterFour/0350.Intersection-of-Two-Arrays-II.md rename to website/content/ChapterFour/0300~0399/0350.Intersection-of-Two-Arrays-II.md index eb94c11d..dcfe10b5 100644 --- a/website/content/ChapterFour/0350.Intersection-of-Two-Arrays-II.md +++ b/website/content/ChapterFour/0300~0399/0350.Intersection-of-Two-Arrays-II.md @@ -74,6 +74,6 @@ func intersect(nums1 []int, nums2 []int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0354.Russian-Doll-Envelopes.md b/website/content/ChapterFour/0300~0399/0354.Russian-Doll-Envelopes.md similarity index 90% rename from website/content/ChapterFour/0354.Russian-Doll-Envelopes.md rename to website/content/ChapterFour/0300~0399/0354.Russian-Doll-Envelopes.md index 8100d0f6..cdd560ba 100755 --- a/website/content/ChapterFour/0354.Russian-Doll-Envelopes.md +++ b/website/content/ChapterFour/0300~0399/0354.Russian-Doll-Envelopes.md @@ -83,6 +83,6 @@ func maxEnvelopes(envelopes [][]int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0357.Count-Numbers-with-Unique-Digits.md b/website/content/ChapterFour/0300~0399/0357.Count-Numbers-with-Unique-Digits.md similarity index 90% rename from website/content/ChapterFour/0357.Count-Numbers-with-Unique-Digits.md rename to website/content/ChapterFour/0300~0399/0357.Count-Numbers-with-Unique-Digits.md index 6c7583a6..4ae4f41b 100755 --- a/website/content/ChapterFour/0357.Count-Numbers-with-Unique-Digits.md +++ b/website/content/ChapterFour/0300~0399/0357.Count-Numbers-with-Unique-Digits.md @@ -63,6 +63,6 @@ func countNumbersWithUniqueDigits(n int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0367.Valid-Perfect-Square.md b/website/content/ChapterFour/0300~0399/0367.Valid-Perfect-Square.md similarity index 84% rename from website/content/ChapterFour/0367.Valid-Perfect-Square.md rename to website/content/ChapterFour/0300~0399/0367.Valid-Perfect-Square.md index 0edd6fc0..50f9f733 100755 --- a/website/content/ChapterFour/0367.Valid-Perfect-Square.md +++ b/website/content/ChapterFour/0300~0399/0367.Valid-Perfect-Square.md @@ -59,6 +59,6 @@ func isPerfectSquare(num int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0371.Sum-of-Two-Integers.md b/website/content/ChapterFour/0300~0399/0371.Sum-of-Two-Integers.md similarity index 86% rename from website/content/ChapterFour/0371.Sum-of-Two-Integers.md rename to website/content/ChapterFour/0300~0399/0371.Sum-of-Two-Integers.md index 423f35b1..8336684a 100755 --- a/website/content/ChapterFour/0371.Sum-of-Two-Integers.md +++ b/website/content/ChapterFour/0300~0399/0371.Sum-of-Two-Integers.md @@ -49,6 +49,6 @@ func getSum(a int, b int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0372.Super-Pow.md b/website/content/ChapterFour/0300~0399/0372.Super-Pow.md similarity index 93% rename from website/content/ChapterFour/0372.Super-Pow.md rename to website/content/ChapterFour/0300~0399/0372.Super-Pow.md index 1bb73d92..0934a48a 100755 --- a/website/content/ChapterFour/0372.Super-Pow.md +++ b/website/content/ChapterFour/0300~0399/0372.Super-Pow.md @@ -110,6 +110,6 @@ func superPow1(a int, b []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0373.Find-K-Pairs-with-Smallest-Sums.md b/website/content/ChapterFour/0300~0399/0373.Find-K-Pairs-with-Smallest-Sums.md similarity index 94% rename from website/content/ChapterFour/0373.Find-K-Pairs-with-Smallest-Sums.md rename to website/content/ChapterFour/0300~0399/0373.Find-K-Pairs-with-Smallest-Sums.md index 85bb5352..346d24da 100755 --- a/website/content/ChapterFour/0373.Find-K-Pairs-with-Smallest-Sums.md +++ b/website/content/ChapterFour/0300~0399/0373.Find-K-Pairs-with-Smallest-Sums.md @@ -128,6 +128,6 @@ func kSmallestPairs1(nums1 []int, nums2 []int, k int) [][]int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0378.Kth-Smallest-Element-in-a-Sorted-Matrix.md b/website/content/ChapterFour/0300~0399/0378.Kth-Smallest-Element-in-a-Sorted-Matrix.md similarity index 93% rename from website/content/ChapterFour/0378.Kth-Smallest-Element-in-a-Sorted-Matrix.md rename to website/content/ChapterFour/0300~0399/0378.Kth-Smallest-Element-in-a-Sorted-Matrix.md index 9f675463..2b53dec9 100755 --- a/website/content/ChapterFour/0378.Kth-Smallest-Element-in-a-Sorted-Matrix.md +++ b/website/content/ChapterFour/0300~0399/0378.Kth-Smallest-Element-in-a-Sorted-Matrix.md @@ -137,6 +137,6 @@ func (p *pq) Pop() interface{} { ---------------------------------------------- diff --git a/website/content/ChapterFour/0385.Mini-Parser.md b/website/content/ChapterFour/0300~0399/0385.Mini-Parser.md similarity index 94% rename from website/content/ChapterFour/0385.Mini-Parser.md rename to website/content/ChapterFour/0300~0399/0385.Mini-Parser.md index 93706631..869839bf 100755 --- a/website/content/ChapterFour/0385.Mini-Parser.md +++ b/website/content/ChapterFour/0300~0399/0385.Mini-Parser.md @@ -177,6 +177,6 @@ func deserialize(s string) *NestedInteger { ---------------------------------------------- diff --git a/website/content/ChapterFour/0386.Lexicographical-Numbers.md b/website/content/ChapterFour/0300~0399/0386.Lexicographical-Numbers.md similarity index 82% rename from website/content/ChapterFour/0386.Lexicographical-Numbers.md rename to website/content/ChapterFour/0300~0399/0386.Lexicographical-Numbers.md index 2b448727..dc76ab44 100755 --- a/website/content/ChapterFour/0386.Lexicographical-Numbers.md +++ b/website/content/ChapterFour/0300~0399/0386.Lexicographical-Numbers.md @@ -53,6 +53,6 @@ func dfs386(x, n int, res *[]int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0387.First-Unique-Character-in-a-String.md b/website/content/ChapterFour/0300~0399/0387.First-Unique-Character-in-a-String.md similarity index 88% rename from website/content/ChapterFour/0387.First-Unique-Character-in-a-String.md rename to website/content/ChapterFour/0300~0399/0387.First-Unique-Character-in-a-String.md index 211fab68..8f7954da 100755 --- a/website/content/ChapterFour/0387.First-Unique-Character-in-a-String.md +++ b/website/content/ChapterFour/0300~0399/0387.First-Unique-Character-in-a-String.md @@ -83,6 +83,6 @@ func firstUniqChar1(s string) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0389.Find-the-Difference.md b/website/content/ChapterFour/0300~0399/0389.Find-the-Difference.md similarity index 82% rename from website/content/ChapterFour/0389.Find-the-Difference.md rename to website/content/ChapterFour/0300~0399/0389.Find-the-Difference.md index 026b6f99..0a326d51 100755 --- a/website/content/ChapterFour/0389.Find-the-Difference.md +++ b/website/content/ChapterFour/0300~0399/0389.Find-the-Difference.md @@ -50,6 +50,6 @@ func findTheDifference(s string, t string) byte { ---------------------------------------------- diff --git a/website/content/ChapterFour/0392.Is-Subsequence.md b/website/content/ChapterFour/0300~0399/0392.Is-Subsequence.md similarity index 90% rename from website/content/ChapterFour/0392.Is-Subsequence.md rename to website/content/ChapterFour/0300~0399/0392.Is-Subsequence.md index 7b11b78e..ff476a02 100755 --- a/website/content/ChapterFour/0392.Is-Subsequence.md +++ b/website/content/ChapterFour/0300~0399/0392.Is-Subsequence.md @@ -82,6 +82,6 @@ func isSubsequence1(s string, t string) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0393.UTF-8-Validation.md b/website/content/ChapterFour/0300~0399/0393.UTF-8-Validation.md similarity index 93% rename from website/content/ChapterFour/0393.UTF-8-Validation.md rename to website/content/ChapterFour/0300~0399/0393.UTF-8-Validation.md index b1efbce0..1275685b 100755 --- a/website/content/ChapterFour/0393.UTF-8-Validation.md +++ b/website/content/ChapterFour/0300~0399/0393.UTF-8-Validation.md @@ -107,6 +107,6 @@ func validUtf8(data []int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0394.Decode-String.md b/website/content/ChapterFour/0300~0399/0394.Decode-String.md similarity index 91% rename from website/content/ChapterFour/0394.Decode-String.md rename to website/content/ChapterFour/0300~0399/0394.Decode-String.md index 902049c3..0ed35c76 100644 --- a/website/content/ChapterFour/0394.Decode-String.md +++ b/website/content/ChapterFour/0300~0399/0394.Decode-String.md @@ -83,6 +83,6 @@ func decodeString(s string) string { ---------------------------------------------- diff --git a/website/content/ChapterFour/0397.Integer-Replacement.md b/website/content/ChapterFour/0300~0399/0397.Integer-Replacement.md similarity index 91% rename from website/content/ChapterFour/0397.Integer-Replacement.md rename to website/content/ChapterFour/0300~0399/0397.Integer-Replacement.md index 67691292..6b71a2b9 100755 --- a/website/content/ChapterFour/0397.Integer-Replacement.md +++ b/website/content/ChapterFour/0300~0399/0397.Integer-Replacement.md @@ -88,6 +88,6 @@ func integerReplacement(n int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0399.Evaluate-Division.md b/website/content/ChapterFour/0300~0399/0399.Evaluate-Division.md similarity index 95% rename from website/content/ChapterFour/0399.Evaluate-Division.md rename to website/content/ChapterFour/0300~0399/0399.Evaluate-Division.md index cdefaf23..efe0faef 100755 --- a/website/content/ChapterFour/0399.Evaluate-Division.md +++ b/website/content/ChapterFour/0300~0399/0399.Evaluate-Division.md @@ -119,6 +119,6 @@ func calcEquation(equations [][]string, values []float64, queries [][]string) [] ---------------------------------------------- diff --git a/website/content/ChapterFour/0300~0399/_index.md b/website/content/ChapterFour/0300~0399/_index.md new file mode 100644 index 00000000..d2021683 --- /dev/null +++ b/website/content/ChapterFour/0300~0399/_index.md @@ -0,0 +1,5 @@ +--- +bookCollapseSection: true +weight: 20 +--- + diff --git a/website/content/ChapterFour/0401.Binary-Watch.md b/website/content/ChapterFour/0400~0499/0401.Binary-Watch.md similarity index 94% rename from website/content/ChapterFour/0401.Binary-Watch.md rename to website/content/ChapterFour/0400~0499/0401.Binary-Watch.md index ae9162a2..462679a6 100755 --- a/website/content/ChapterFour/0401.Binary-Watch.md +++ b/website/content/ChapterFour/0400~0499/0401.Binary-Watch.md @@ -140,6 +140,6 @@ func findReadBinaryWatchHour(target, index int, c []int, res *[]string) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0402.Remove-K-Digits.md b/website/content/ChapterFour/0400~0499/0402.Remove-K-Digits.md similarity index 90% rename from website/content/ChapterFour/0402.Remove-K-Digits.md rename to website/content/ChapterFour/0400~0499/0402.Remove-K-Digits.md index e8f6c0e4..7e3592c6 100644 --- a/website/content/ChapterFour/0402.Remove-K-Digits.md +++ b/website/content/ChapterFour/0400~0499/0402.Remove-K-Digits.md @@ -90,6 +90,6 @@ func removeKdigits(num string, k int) string { ---------------------------------------------- diff --git a/website/content/ChapterFour/0404.Sum-of-Left-Leaves.md b/website/content/ChapterFour/0400~0499/0404.Sum-of-Left-Leaves.md similarity index 80% rename from website/content/ChapterFour/0404.Sum-of-Left-Leaves.md rename to website/content/ChapterFour/0400~0499/0404.Sum-of-Left-Leaves.md index 18c83472..7e280d0f 100755 --- a/website/content/ChapterFour/0404.Sum-of-Left-Leaves.md +++ b/website/content/ChapterFour/0400~0499/0404.Sum-of-Left-Leaves.md @@ -57,6 +57,6 @@ func sumOfLeftLeaves(root *TreeNode) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0405.Convert-a-Number-to-Hexadecimal.md b/website/content/ChapterFour/0400~0499/0405.Convert-a-Number-to-Hexadecimal.md similarity index 90% rename from website/content/ChapterFour/0405.Convert-a-Number-to-Hexadecimal.md rename to website/content/ChapterFour/0400~0499/0405.Convert-a-Number-to-Hexadecimal.md index 52d661c8..62615f8d 100755 --- a/website/content/ChapterFour/0405.Convert-a-Number-to-Hexadecimal.md +++ b/website/content/ChapterFour/0400~0499/0405.Convert-a-Number-to-Hexadecimal.md @@ -82,6 +82,6 @@ func toHex(num int) string { ---------------------------------------------- diff --git a/website/content/ChapterFour/0409.Longest-Palindrome.md b/website/content/ChapterFour/0400~0499/0409.Longest-Palindrome.md similarity index 86% rename from website/content/ChapterFour/0409.Longest-Palindrome.md rename to website/content/ChapterFour/0400~0499/0409.Longest-Palindrome.md index f0d3f136..2f6aa28a 100755 --- a/website/content/ChapterFour/0409.Longest-Palindrome.md +++ b/website/content/ChapterFour/0400~0499/0409.Longest-Palindrome.md @@ -59,6 +59,6 @@ func longestPalindrome(s string) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0410.Split-Array-Largest-Sum.md b/website/content/ChapterFour/0400~0499/0410.Split-Array-Largest-Sum.md similarity index 91% rename from website/content/ChapterFour/0410.Split-Array-Largest-Sum.md rename to website/content/ChapterFour/0400~0499/0410.Split-Array-Largest-Sum.md index 5620d814..c84eebaa 100755 --- a/website/content/ChapterFour/0410.Split-Array-Largest-Sum.md +++ b/website/content/ChapterFour/0400~0499/0410.Split-Array-Largest-Sum.md @@ -94,6 +94,6 @@ func calSum(mid, m int, nums []int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0412.Fizz-Buzz.md b/website/content/ChapterFour/0400~0499/0412.Fizz-Buzz.md similarity index 84% rename from website/content/ChapterFour/0412.Fizz-Buzz.md rename to website/content/ChapterFour/0400~0499/0412.Fizz-Buzz.md index 2dd24805..e7c37280 100644 --- a/website/content/ChapterFour/0412.Fizz-Buzz.md +++ b/website/content/ChapterFour/0400~0499/0412.Fizz-Buzz.md @@ -73,6 +73,6 @@ func fizzBuzz(n int) []string { ---------------------------------------------- diff --git a/website/content/ChapterFour/0414.Third-Maximum-Number.md b/website/content/ChapterFour/0400~0499/0414.Third-Maximum-Number.md similarity index 87% rename from website/content/ChapterFour/0414.Third-Maximum-Number.md rename to website/content/ChapterFour/0400~0499/0414.Third-Maximum-Number.md index cd2224b0..1d831338 100644 --- a/website/content/ChapterFour/0414.Third-Maximum-Number.md +++ b/website/content/ChapterFour/0400~0499/0414.Third-Maximum-Number.md @@ -74,6 +74,6 @@ func thirdMax(nums []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0416.Partition-Equal-Subset-Sum.md b/website/content/ChapterFour/0400~0499/0416.Partition-Equal-Subset-Sum.md similarity index 89% rename from website/content/ChapterFour/0416.Partition-Equal-Subset-Sum.md rename to website/content/ChapterFour/0400~0499/0416.Partition-Equal-Subset-Sum.md index 94fe2e3c..b1543170 100755 --- a/website/content/ChapterFour/0416.Partition-Equal-Subset-Sum.md +++ b/website/content/ChapterFour/0400~0499/0416.Partition-Equal-Subset-Sum.md @@ -78,6 +78,6 @@ func canPartition(nums []int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md b/website/content/ChapterFour/0400~0499/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md similarity index 94% rename from website/content/ChapterFour/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md rename to website/content/ChapterFour/0400~0499/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md index 688e41e3..ea0db8a7 100755 --- a/website/content/ChapterFour/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md +++ b/website/content/ChapterFour/0400~0499/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md @@ -101,6 +101,6 @@ func findMaximumXOR1(nums []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0424.Longest-Repeating-Character-Replacement.md b/website/content/ChapterFour/0400~0499/0424.Longest-Repeating-Character-Replacement.md similarity index 89% rename from website/content/ChapterFour/0424.Longest-Repeating-Character-Replacement.md rename to website/content/ChapterFour/0400~0499/0424.Longest-Repeating-Character-Replacement.md index 1762c02c..132dbcd2 100644 --- a/website/content/ChapterFour/0424.Longest-Repeating-Character-Replacement.md +++ b/website/content/ChapterFour/0400~0499/0424.Longest-Repeating-Character-Replacement.md @@ -87,6 +87,6 @@ func max(a int, b int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0433.Minimum-Genetic-Mutation.md b/website/content/ChapterFour/0400~0499/0433.Minimum-Genetic-Mutation.md similarity index 94% rename from website/content/ChapterFour/0433.Minimum-Genetic-Mutation.md rename to website/content/ChapterFour/0400~0499/0433.Minimum-Genetic-Mutation.md index 309dece2..2f6b2fd5 100755 --- a/website/content/ChapterFour/0433.Minimum-Genetic-Mutation.md +++ b/website/content/ChapterFour/0400~0499/0433.Minimum-Genetic-Mutation.md @@ -185,6 +185,6 @@ func convert(gene string) uint32 { ---------------------------------------------- diff --git a/website/content/ChapterFour/0435.Non-overlapping-Intervals.md b/website/content/ChapterFour/0400~0499/0435.Non-overlapping-Intervals.md similarity index 93% rename from website/content/ChapterFour/0435.Non-overlapping-Intervals.md rename to website/content/ChapterFour/0400~0499/0435.Non-overlapping-Intervals.md index de0366f7..9ab19644 100755 --- a/website/content/ChapterFour/0435.Non-overlapping-Intervals.md +++ b/website/content/ChapterFour/0400~0499/0435.Non-overlapping-Intervals.md @@ -137,6 +137,6 @@ func eraseOverlapIntervals1(intervals [][]int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0436.Find-Right-Interval.md b/website/content/ChapterFour/0400~0499/0436.Find-Right-Interval.md similarity index 95% rename from website/content/ChapterFour/0436.Find-Right-Interval.md rename to website/content/ChapterFour/0400~0499/0436.Find-Right-Interval.md index 5aef3a4a..d8b2d726 100755 --- a/website/content/ChapterFour/0436.Find-Right-Interval.md +++ b/website/content/ChapterFour/0400~0499/0436.Find-Right-Interval.md @@ -144,6 +144,6 @@ func searchFirstGreaterInterval(nums []Interval, target int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0437.Path-Sum-III.md b/website/content/ChapterFour/0400~0499/0437.Path-Sum-III.md similarity index 91% rename from website/content/ChapterFour/0437.Path-Sum-III.md rename to website/content/ChapterFour/0400~0499/0437.Path-Sum-III.md index 51b357f6..e05fc855 100755 --- a/website/content/ChapterFour/0437.Path-Sum-III.md +++ b/website/content/ChapterFour/0400~0499/0437.Path-Sum-III.md @@ -87,6 +87,6 @@ func findPath437(root *TreeNode, sum int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0438.Find-All-Anagrams-in-a-String.md b/website/content/ChapterFour/0400~0499/0438.Find-All-Anagrams-in-a-String.md similarity index 92% rename from website/content/ChapterFour/0438.Find-All-Anagrams-in-a-String.md rename to website/content/ChapterFour/0400~0499/0438.Find-All-Anagrams-in-a-String.md index 207f321b..93d24093 100644 --- a/website/content/ChapterFour/0438.Find-All-Anagrams-in-a-String.md +++ b/website/content/ChapterFour/0400~0499/0438.Find-All-Anagrams-in-a-String.md @@ -108,6 +108,6 @@ func findAnagrams(s string, p string) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0441.Arranging-Coins.md b/website/content/ChapterFour/0400~0499/0441.Arranging-Coins.md similarity index 87% rename from website/content/ChapterFour/0441.Arranging-Coins.md rename to website/content/ChapterFour/0400~0499/0441.Arranging-Coins.md index fb7ba3f7..33fdee75 100755 --- a/website/content/ChapterFour/0441.Arranging-Coins.md +++ b/website/content/ChapterFour/0400~0499/0441.Arranging-Coins.md @@ -77,6 +77,6 @@ func arrangeCoins1(n int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0445.Add-Two-Numbers-II.md b/website/content/ChapterFour/0400~0499/0445.Add-Two-Numbers-II.md similarity index 91% rename from website/content/ChapterFour/0445.Add-Two-Numbers-II.md rename to website/content/ChapterFour/0400~0499/0445.Add-Two-Numbers-II.md index f0b62889..9d167693 100644 --- a/website/content/ChapterFour/0445.Add-Two-Numbers-II.md +++ b/website/content/ChapterFour/0400~0499/0445.Add-Two-Numbers-II.md @@ -98,6 +98,6 @@ func getLength(l *ListNode) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0447.Number-of-Boomerangs.md b/website/content/ChapterFour/0400~0499/0447.Number-of-Boomerangs.md similarity index 88% rename from website/content/ChapterFour/0447.Number-of-Boomerangs.md rename to website/content/ChapterFour/0400~0499/0447.Number-of-Boomerangs.md index 44289f4d..33f3c1fd 100644 --- a/website/content/ChapterFour/0447.Number-of-Boomerangs.md +++ b/website/content/ChapterFour/0400~0499/0447.Number-of-Boomerangs.md @@ -68,6 +68,6 @@ func dis(pa, pb []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0448.Find-All-Numbers-Disappeared-in-an-Array.md b/website/content/ChapterFour/0400~0499/0448.Find-All-Numbers-Disappeared-in-an-Array.md similarity index 89% rename from website/content/ChapterFour/0448.Find-All-Numbers-Disappeared-in-an-Array.md rename to website/content/ChapterFour/0400~0499/0448.Find-All-Numbers-Disappeared-in-an-Array.md index 02019d10..29532c7e 100644 --- a/website/content/ChapterFour/0448.Find-All-Numbers-Disappeared-in-an-Array.md +++ b/website/content/ChapterFour/0400~0499/0448.Find-All-Numbers-Disappeared-in-an-Array.md @@ -59,6 +59,6 @@ func findDisappearedNumbers(nums []int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0451.Sort-Characters-By-Frequency.md b/website/content/ChapterFour/0400~0499/0451.Sort-Characters-By-Frequency.md similarity index 86% rename from website/content/ChapterFour/0451.Sort-Characters-By-Frequency.md rename to website/content/ChapterFour/0400~0499/0451.Sort-Characters-By-Frequency.md index 84d262a5..81a8d91a 100644 --- a/website/content/ChapterFour/0451.Sort-Characters-By-Frequency.md +++ b/website/content/ChapterFour/0400~0499/0451.Sort-Characters-By-Frequency.md @@ -115,6 +115,6 @@ func frequencySort(s string) string { ---------------------------------------------- diff --git a/website/content/ChapterFour/0453.Minimum-Moves-to-Equal-Array-Elements.md b/website/content/ChapterFour/0400~0499/0453.Minimum-Moves-to-Equal-Array-Elements.md similarity index 87% rename from website/content/ChapterFour/0453.Minimum-Moves-to-Equal-Array-Elements.md rename to website/content/ChapterFour/0400~0499/0453.Minimum-Moves-to-Equal-Array-Elements.md index 7417b7ad..f868c33a 100644 --- a/website/content/ChapterFour/0453.Minimum-Moves-to-Equal-Array-Elements.md +++ b/website/content/ChapterFour/0400~0499/0453.Minimum-Moves-to-Equal-Array-Elements.md @@ -53,6 +53,6 @@ func minMoves(nums []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0454.4Sum-II.md b/website/content/ChapterFour/0400~0499/0454.4Sum-II.md similarity index 87% rename from website/content/ChapterFour/0454.4Sum-II.md rename to website/content/ChapterFour/0400~0499/0454.4Sum-II.md index 048a3452..5b97f45b 100644 --- a/website/content/ChapterFour/0454.4Sum-II.md +++ b/website/content/ChapterFour/0400~0499/0454.4Sum-II.md @@ -67,6 +67,6 @@ func fourSumCount(A []int, B []int, C []int, D []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0455.Assign-Cookies.md b/website/content/ChapterFour/0400~0499/0455.Assign-Cookies.md similarity index 93% rename from website/content/ChapterFour/0455.Assign-Cookies.md rename to website/content/ChapterFour/0400~0499/0455.Assign-Cookies.md index bfdff43a..dfd13b3a 100755 --- a/website/content/ChapterFour/0455.Assign-Cookies.md +++ b/website/content/ChapterFour/0400~0499/0455.Assign-Cookies.md @@ -71,6 +71,6 @@ func findContentChildren(g []int, s []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0456.132-Pattern.md b/website/content/ChapterFour/0400~0499/0456.132-Pattern.md similarity index 91% rename from website/content/ChapterFour/0456.132-Pattern.md rename to website/content/ChapterFour/0400~0499/0456.132-Pattern.md index 425aef1a..eca74359 100755 --- a/website/content/ChapterFour/0456.132-Pattern.md +++ b/website/content/ChapterFour/0400~0499/0456.132-Pattern.md @@ -105,6 +105,6 @@ func find132pattern1(nums []int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0457.Circular-Array-Loop.md b/website/content/ChapterFour/0400~0499/0457.Circular-Array-Loop.md similarity index 95% rename from website/content/ChapterFour/0457.Circular-Array-Loop.md rename to website/content/ChapterFour/0400~0499/0457.Circular-Array-Loop.md index 3038fe2b..e665c389 100755 --- a/website/content/ChapterFour/0457.Circular-Array-Loop.md +++ b/website/content/ChapterFour/0400~0499/0457.Circular-Array-Loop.md @@ -106,6 +106,6 @@ func getNextIndex(nums []int, index int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0460.LFU-Cache.md b/website/content/ChapterFour/0400~0499/0460.LFU-Cache.md similarity index 95% rename from website/content/ChapterFour/0460.LFU-Cache.md rename to website/content/ChapterFour/0400~0499/0460.LFU-Cache.md index cc384229..dfbde243 100644 --- a/website/content/ChapterFour/0460.LFU-Cache.md +++ b/website/content/ChapterFour/0400~0499/0460.LFU-Cache.md @@ -144,6 +144,6 @@ func (this *LFUCache) Put(key int, value int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0461.Hamming-Distance.md b/website/content/ChapterFour/0400~0499/0461.Hamming-Distance.md similarity index 85% rename from website/content/ChapterFour/0461.Hamming-Distance.md rename to website/content/ChapterFour/0400~0499/0461.Hamming-Distance.md index 0d85bdcb..9335d775 100755 --- a/website/content/ChapterFour/0461.Hamming-Distance.md +++ b/website/content/ChapterFour/0400~0499/0461.Hamming-Distance.md @@ -55,6 +55,6 @@ func hammingDistance(x int, y int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0463.Island-Perimeter.md b/website/content/ChapterFour/0400~0499/0463.Island-Perimeter.md similarity index 90% rename from website/content/ChapterFour/0463.Island-Perimeter.md rename to website/content/ChapterFour/0400~0499/0463.Island-Perimeter.md index b847d231..e0e60da7 100755 --- a/website/content/ChapterFour/0463.Island-Perimeter.md +++ b/website/content/ChapterFour/0400~0499/0463.Island-Perimeter.md @@ -73,6 +73,6 @@ func islandPerimeter(grid [][]int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0470.Implement-Rand10-Using-Rand7.md b/website/content/ChapterFour/0400~0499/0470.Implement-Rand10-Using-Rand7.md similarity index 94% rename from website/content/ChapterFour/0470.Implement-Rand10-Using-Rand7.md rename to website/content/ChapterFour/0400~0499/0470.Implement-Rand10-Using-Rand7.md index 06fca2cd..f36524a1 100755 --- a/website/content/ChapterFour/0470.Implement-Rand10-Using-Rand7.md +++ b/website/content/ChapterFour/0400~0499/0470.Implement-Rand10-Using-Rand7.md @@ -102,6 +102,6 @@ func rand101() int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0474.Ones-and-Zeroes.md b/website/content/ChapterFour/0400~0499/0474.Ones-and-Zeroes.md similarity index 93% rename from website/content/ChapterFour/0474.Ones-and-Zeroes.md rename to website/content/ChapterFour/0400~0499/0474.Ones-and-Zeroes.md index dddce982..8fefe5c8 100755 --- a/website/content/ChapterFour/0474.Ones-and-Zeroes.md +++ b/website/content/ChapterFour/0400~0499/0474.Ones-and-Zeroes.md @@ -80,6 +80,6 @@ func findMaxForm(strs []string, m int, n int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0475.Heaters.md b/website/content/ChapterFour/0400~0499/0475.Heaters.md similarity index 94% rename from website/content/ChapterFour/0475.Heaters.md rename to website/content/ChapterFour/0400~0499/0475.Heaters.md index 8beba569..90e81ad3 100755 --- a/website/content/ChapterFour/0475.Heaters.md +++ b/website/content/ChapterFour/0400~0499/0475.Heaters.md @@ -124,6 +124,6 @@ func findRadius1(houses []int, heaters []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0476.Number-Complement.md b/website/content/ChapterFour/0400~0499/0476.Number-Complement.md similarity index 89% rename from website/content/ChapterFour/0476.Number-Complement.md rename to website/content/ChapterFour/0400~0499/0476.Number-Complement.md index cd3ca3b0..41198d10 100755 --- a/website/content/ChapterFour/0476.Number-Complement.md +++ b/website/content/ChapterFour/0400~0499/0476.Number-Complement.md @@ -70,6 +70,6 @@ func findComplement1(num int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0477.Total-Hamming-Distance.md b/website/content/ChapterFour/0400~0499/0477.Total-Hamming-Distance.md similarity index 90% rename from website/content/ChapterFour/0477.Total-Hamming-Distance.md rename to website/content/ChapterFour/0400~0499/0477.Total-Hamming-Distance.md index 12970083..1d5768ab 100755 --- a/website/content/ChapterFour/0477.Total-Hamming-Distance.md +++ b/website/content/ChapterFour/0400~0499/0477.Total-Hamming-Distance.md @@ -68,6 +68,6 @@ func totalHammingDistance1(nums []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0480.Sliding-Window-Median.md b/website/content/ChapterFour/0400~0499/0480.Sliding-Window-Median.md similarity index 96% rename from website/content/ChapterFour/0480.Sliding-Window-Median.md rename to website/content/ChapterFour/0400~0499/0480.Sliding-Window-Median.md index 105da2eb..cf15f847 100755 --- a/website/content/ChapterFour/0480.Sliding-Window-Median.md +++ b/website/content/ChapterFour/0400~0499/0480.Sliding-Window-Median.md @@ -278,6 +278,6 @@ func (h *MaxHeapR) Remove(x int) { heap.Push(&h.hpDel, x) } ---------------------------------------------- diff --git a/website/content/ChapterFour/0483.Smallest-Good-Base.md b/website/content/ChapterFour/0400~0499/0483.Smallest-Good-Base.md similarity index 92% rename from website/content/ChapterFour/0483.Smallest-Good-Base.md rename to website/content/ChapterFour/0400~0499/0483.Smallest-Good-Base.md index 6ab60aef..88e4c378 100755 --- a/website/content/ChapterFour/0483.Smallest-Good-Base.md +++ b/website/content/ChapterFour/0400~0499/0483.Smallest-Good-Base.md @@ -141,6 +141,6 @@ func findBase(mid, bit uint64) uint64 { ---------------------------------------------- diff --git a/website/content/ChapterFour/0485.Max-Consecutive-Ones.md b/website/content/ChapterFour/0400~0499/0485.Max-Consecutive-Ones.md similarity index 84% rename from website/content/ChapterFour/0485.Max-Consecutive-Ones.md rename to website/content/ChapterFour/0400~0499/0485.Max-Consecutive-Ones.md index 02f757ef..afc46ab3 100644 --- a/website/content/ChapterFour/0485.Max-Consecutive-Ones.md +++ b/website/content/ChapterFour/0400~0499/0485.Max-Consecutive-Ones.md @@ -61,6 +61,6 @@ func findMaxConsecutiveOnes(nums []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0491.Increasing-Subsequences.md b/website/content/ChapterFour/0400~0499/0491.Increasing-Subsequences.md similarity index 92% rename from website/content/ChapterFour/0491.Increasing-Subsequences.md rename to website/content/ChapterFour/0400~0499/0491.Increasing-Subsequences.md index b7a1b4a7..a7271f6a 100755 --- a/website/content/ChapterFour/0491.Increasing-Subsequences.md +++ b/website/content/ChapterFour/0400~0499/0491.Increasing-Subsequences.md @@ -86,6 +86,6 @@ func generateIncSubsets(nums []int, current int, c []int, res *[][]int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0493.Reverse-Pairs.md b/website/content/ChapterFour/0400~0499/0493.Reverse-Pairs.md similarity index 94% rename from website/content/ChapterFour/0493.Reverse-Pairs.md rename to website/content/ChapterFour/0400~0499/0493.Reverse-Pairs.md index 82bcc36b..d307f2b6 100755 --- a/website/content/ChapterFour/0493.Reverse-Pairs.md +++ b/website/content/ChapterFour/0400~0499/0493.Reverse-Pairs.md @@ -128,6 +128,6 @@ func mergesortCount(nums, buf []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0494.Target-Sum.md b/website/content/ChapterFour/0400~0499/0494.Target-Sum.md similarity index 94% rename from website/content/ChapterFour/0494.Target-Sum.md rename to website/content/ChapterFour/0400~0499/0494.Target-Sum.md index 16b49336..4dfd11e8 100644 --- a/website/content/ChapterFour/0494.Target-Sum.md +++ b/website/content/ChapterFour/0400~0499/0494.Target-Sum.md @@ -110,6 +110,6 @@ func dfsFindTargetSumWays(nums []int, index int, curSum int, S int, res *int, su ---------------------------------------------- diff --git a/website/content/ChapterFour/0496.Next-Greater-Element-I.md b/website/content/ChapterFour/0400~0499/0496.Next-Greater-Element-I.md similarity index 89% rename from website/content/ChapterFour/0496.Next-Greater-Element-I.md rename to website/content/ChapterFour/0400~0499/0496.Next-Greater-Element-I.md index 8d60eb23..59678c7d 100644 --- a/website/content/ChapterFour/0496.Next-Greater-Element-I.md +++ b/website/content/ChapterFour/0400~0499/0496.Next-Greater-Element-I.md @@ -82,6 +82,6 @@ func nextGreaterElement(nums1 []int, nums2 []int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0497.Random-Point-in-Non-overlapping-Rectangles.md b/website/content/ChapterFour/0400~0499/0497.Random-Point-in-Non-overlapping-Rectangles.md similarity index 94% rename from website/content/ChapterFour/0497.Random-Point-in-Non-overlapping-Rectangles.md rename to website/content/ChapterFour/0400~0499/0497.Random-Point-in-Non-overlapping-Rectangles.md index 6819448c..6d6fa225 100755 --- a/website/content/ChapterFour/0497.Random-Point-in-Non-overlapping-Rectangles.md +++ b/website/content/ChapterFour/0400~0499/0497.Random-Point-in-Non-overlapping-Rectangles.md @@ -136,6 +136,6 @@ func (so *Solution497) Pick() []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0498.Diagonal-Traverse.md b/website/content/ChapterFour/0400~0499/0498.Diagonal-Traverse.md similarity index 95% rename from website/content/ChapterFour/0498.Diagonal-Traverse.md rename to website/content/ChapterFour/0400~0499/0498.Diagonal-Traverse.md index b6d0739c..674ddc2c 100755 --- a/website/content/ChapterFour/0498.Diagonal-Traverse.md +++ b/website/content/ChapterFour/0400~0499/0498.Diagonal-Traverse.md @@ -186,6 +186,6 @@ func addTraverse(matrix [][]int, i, j int, res *[]int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0400~0499/_index.md b/website/content/ChapterFour/0400~0499/_index.md new file mode 100644 index 00000000..d2021683 --- /dev/null +++ b/website/content/ChapterFour/0400~0499/_index.md @@ -0,0 +1,5 @@ +--- +bookCollapseSection: true +weight: 20 +--- + diff --git a/website/content/ChapterFour/0500.Keyboard-Row.md b/website/content/ChapterFour/0500~0599/0500.Keyboard-Row.md similarity index 86% rename from website/content/ChapterFour/0500.Keyboard-Row.md rename to website/content/ChapterFour/0500~0599/0500.Keyboard-Row.md index 168b9370..9771d2e2 100755 --- a/website/content/ChapterFour/0500.Keyboard-Row.md +++ b/website/content/ChapterFour/0500~0599/0500.Keyboard-Row.md @@ -64,6 +64,6 @@ func findWords500(words []string) []string { ---------------------------------------------- diff --git a/website/content/ChapterFour/0503.Next-Greater-Element-II.md b/website/content/ChapterFour/0500~0599/0503.Next-Greater-Element-II.md similarity index 93% rename from website/content/ChapterFour/0503.Next-Greater-Element-II.md rename to website/content/ChapterFour/0500~0599/0503.Next-Greater-Element-II.md index e9ff3ace..2974c302 100644 --- a/website/content/ChapterFour/0503.Next-Greater-Element-II.md +++ b/website/content/ChapterFour/0500~0599/0503.Next-Greater-Element-II.md @@ -80,6 +80,6 @@ func nextGreaterElements1(nums []int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0507.Perfect-Number.md b/website/content/ChapterFour/0500~0599/0507.Perfect-Number.md similarity index 86% rename from website/content/ChapterFour/0507.Perfect-Number.md rename to website/content/ChapterFour/0500~0599/0507.Perfect-Number.md index 3092928a..fe2293ae 100644 --- a/website/content/ChapterFour/0507.Perfect-Number.md +++ b/website/content/ChapterFour/0500~0599/0507.Perfect-Number.md @@ -66,6 +66,6 @@ func checkPerfectNumber_(num int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0508.Most-Frequent-Subtree-Sum.md b/website/content/ChapterFour/0500~0599/0508.Most-Frequent-Subtree-Sum.md similarity index 93% rename from website/content/ChapterFour/0508.Most-Frequent-Subtree-Sum.md rename to website/content/ChapterFour/0500~0599/0508.Most-Frequent-Subtree-Sum.md index 0b78939a..2467d23f 100755 --- a/website/content/ChapterFour/0508.Most-Frequent-Subtree-Sum.md +++ b/website/content/ChapterFour/0500~0599/0508.Most-Frequent-Subtree-Sum.md @@ -125,6 +125,6 @@ func findTreeSum(root *TreeNode, fre map[int]int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0509.Fibonacci-Number.md b/website/content/ChapterFour/0500~0599/0509.Fibonacci-Number.md similarity index 94% rename from website/content/ChapterFour/0509.Fibonacci-Number.md rename to website/content/ChapterFour/0500~0599/0509.Fibonacci-Number.md index 6986acbc..55c0de7d 100755 --- a/website/content/ChapterFour/0509.Fibonacci-Number.md +++ b/website/content/ChapterFour/0500~0599/0509.Fibonacci-Number.md @@ -192,6 +192,6 @@ func fibb(n int) <- chan int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0513.Find-Bottom-Left-Tree-Value.md b/website/content/ChapterFour/0500~0599/0513.Find-Bottom-Left-Tree-Value.md similarity index 89% rename from website/content/ChapterFour/0513.Find-Bottom-Left-Tree-Value.md rename to website/content/ChapterFour/0500~0599/0513.Find-Bottom-Left-Tree-Value.md index 4c6683c4..bce46e77 100755 --- a/website/content/ChapterFour/0513.Find-Bottom-Left-Tree-Value.md +++ b/website/content/ChapterFour/0500~0599/0513.Find-Bottom-Left-Tree-Value.md @@ -114,6 +114,6 @@ func findBottomLeftValue1(root *TreeNode) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0515.Find-Largest-Value-in-Each-Tree-Row.md b/website/content/ChapterFour/0500~0599/0515.Find-Largest-Value-in-Each-Tree-Row.md similarity index 86% rename from website/content/ChapterFour/0515.Find-Largest-Value-in-Each-Tree-Row.md rename to website/content/ChapterFour/0500~0599/0515.Find-Largest-Value-in-Each-Tree-Row.md index cb60a179..40637279 100755 --- a/website/content/ChapterFour/0515.Find-Largest-Value-in-Each-Tree-Row.md +++ b/website/content/ChapterFour/0500~0599/0515.Find-Largest-Value-in-Each-Tree-Row.md @@ -95,6 +95,6 @@ func largestValues1(root *TreeNode) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0524.Longest-Word-in-Dictionary-through-Deleting.md b/website/content/ChapterFour/0500~0599/0524.Longest-Word-in-Dictionary-through-Deleting.md similarity index 87% rename from website/content/ChapterFour/0524.Longest-Word-in-Dictionary-through-Deleting.md rename to website/content/ChapterFour/0500~0599/0524.Longest-Word-in-Dictionary-through-Deleting.md index f9e5044a..1bd98aec 100644 --- a/website/content/ChapterFour/0524.Longest-Word-in-Dictionary-through-Deleting.md +++ b/website/content/ChapterFour/0500~0599/0524.Longest-Word-in-Dictionary-through-Deleting.md @@ -78,6 +78,6 @@ func findLongestWord(s string, d []string) string { ---------------------------------------------- diff --git a/website/content/ChapterFour/0526.Beautiful-Arrangement.md b/website/content/ChapterFour/0500~0599/0526.Beautiful-Arrangement.md similarity index 92% rename from website/content/ChapterFour/0526.Beautiful-Arrangement.md rename to website/content/ChapterFour/0500~0599/0526.Beautiful-Arrangement.md index 5dee55d6..4c91731a 100755 --- a/website/content/ChapterFour/0526.Beautiful-Arrangement.md +++ b/website/content/ChapterFour/0500~0599/0526.Beautiful-Arrangement.md @@ -112,6 +112,6 @@ func checkDivisible(num, d int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0528.Random-Pick-with-Weight.md b/website/content/ChapterFour/0500~0599/0528.Random-Pick-with-Weight.md similarity index 93% rename from website/content/ChapterFour/0528.Random-Pick-with-Weight.md rename to website/content/ChapterFour/0500~0599/0528.Random-Pick-with-Weight.md index ce18b24e..3b83ea43 100755 --- a/website/content/ChapterFour/0528.Random-Pick-with-Weight.md +++ b/website/content/ChapterFour/0500~0599/0528.Random-Pick-with-Weight.md @@ -110,6 +110,6 @@ func (so *Solution528) PickIndex() int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0529.Minesweeper.md b/website/content/ChapterFour/0500~0599/0529.Minesweeper.md similarity index 95% rename from website/content/ChapterFour/0529.Minesweeper.md rename to website/content/ChapterFour/0500~0599/0529.Minesweeper.md index d1b7ed79..b6a4b57b 100644 --- a/website/content/ChapterFour/0529.Minesweeper.md +++ b/website/content/ChapterFour/0500~0599/0529.Minesweeper.md @@ -147,6 +147,6 @@ func mineSweeper(x, y int, board [][]byte, mineMap [][]int, dir8 [][]int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0532.K-diff-Pairs-in-an-Array.md b/website/content/ChapterFour/0500~0599/0532.K-diff-Pairs-in-an-Array.md similarity index 89% rename from website/content/ChapterFour/0532.K-diff-Pairs-in-an-Array.md rename to website/content/ChapterFour/0500~0599/0532.K-diff-Pairs-in-an-Array.md index ff546c26..c20e4c4b 100644 --- a/website/content/ChapterFour/0532.K-diff-Pairs-in-an-Array.md +++ b/website/content/ChapterFour/0500~0599/0532.K-diff-Pairs-in-an-Array.md @@ -97,6 +97,6 @@ func findPairs(nums []int, k int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0537.Complex-Number-Multiplication.md b/website/content/ChapterFour/0500~0599/0537.Complex-Number-Multiplication.md similarity index 89% rename from website/content/ChapterFour/0537.Complex-Number-Multiplication.md rename to website/content/ChapterFour/0500~0599/0537.Complex-Number-Multiplication.md index 6f0c11bb..27290549 100644 --- a/website/content/ChapterFour/0537.Complex-Number-Multiplication.md +++ b/website/content/ChapterFour/0500~0599/0537.Complex-Number-Multiplication.md @@ -75,6 +75,6 @@ func parse(s string) (int, int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0541.Reverse-String-II.md b/website/content/ChapterFour/0500~0599/0541.Reverse-String-II.md similarity index 88% rename from website/content/ChapterFour/0541.Reverse-String-II.md rename to website/content/ChapterFour/0500~0599/0541.Reverse-String-II.md index 6c2c50c9..a55d0603 100755 --- a/website/content/ChapterFour/0541.Reverse-String-II.md +++ b/website/content/ChapterFour/0500~0599/0541.Reverse-String-II.md @@ -58,6 +58,6 @@ func reverseStr(s string, k int) string { ---------------------------------------------- diff --git a/website/content/ChapterFour/0542.01-Matrix.md b/website/content/ChapterFour/0500~0599/0542.01-Matrix.md similarity index 95% rename from website/content/ChapterFour/0542.01-Matrix.md rename to website/content/ChapterFour/0500~0599/0542.01-Matrix.md index 5dc0b0b3..96e59629 100755 --- a/website/content/ChapterFour/0542.01-Matrix.md +++ b/website/content/ChapterFour/0500~0599/0542.01-Matrix.md @@ -204,6 +204,6 @@ func updateMatrixDP(matrix [][]int) [][]int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0547.Number-of-Provinces.md b/website/content/ChapterFour/0500~0599/0547.Number-of-Provinces.md similarity index 93% rename from website/content/ChapterFour/0547.Number-of-Provinces.md rename to website/content/ChapterFour/0500~0599/0547.Number-of-Provinces.md index 727eaa16..1515667c 100755 --- a/website/content/ChapterFour/0547.Number-of-Provinces.md +++ b/website/content/ChapterFour/0500~0599/0547.Number-of-Provinces.md @@ -113,6 +113,6 @@ func dfs547(M [][]int, cur int, visited []bool) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0557.Reverse-Words-in-a-String-III.md b/website/content/ChapterFour/0500~0599/0557.Reverse-Words-in-a-String-III.md similarity index 85% rename from website/content/ChapterFour/0557.Reverse-Words-in-a-String-III.md rename to website/content/ChapterFour/0500~0599/0557.Reverse-Words-in-a-String-III.md index 91251032..d0ab404c 100755 --- a/website/content/ChapterFour/0557.Reverse-Words-in-a-String-III.md +++ b/website/content/ChapterFour/0500~0599/0557.Reverse-Words-in-a-String-III.md @@ -59,6 +59,6 @@ func revers(s string) string { ---------------------------------------------- diff --git a/website/content/ChapterFour/0561.Array-Partition-I.md b/website/content/ChapterFour/0500~0599/0561.Array-Partition-I.md similarity index 92% rename from website/content/ChapterFour/0561.Array-Partition-I.md rename to website/content/ChapterFour/0500~0599/0561.Array-Partition-I.md index 0b146a5a..cb8dc31e 100644 --- a/website/content/ChapterFour/0561.Array-Partition-I.md +++ b/website/content/ChapterFour/0500~0599/0561.Array-Partition-I.md @@ -60,6 +60,6 @@ func arrayPairSum(nums []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0563.Binary-Tree-Tilt.md b/website/content/ChapterFour/0500~0599/0563.Binary-Tree-Tilt.md similarity index 91% rename from website/content/ChapterFour/0563.Binary-Tree-Tilt.md rename to website/content/ChapterFour/0500~0599/0563.Binary-Tree-Tilt.md index 23bdf2ab..83b5be1b 100755 --- a/website/content/ChapterFour/0563.Binary-Tree-Tilt.md +++ b/website/content/ChapterFour/0500~0599/0563.Binary-Tree-Tilt.md @@ -85,6 +85,6 @@ func findTiltDFS(root *TreeNode, sum *int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0566.Reshape-the-Matrix.md b/website/content/ChapterFour/0500~0599/0566.Reshape-the-Matrix.md similarity index 92% rename from website/content/ChapterFour/0566.Reshape-the-Matrix.md rename to website/content/ChapterFour/0500~0599/0566.Reshape-the-Matrix.md index 694ab4b7..7097fece 100755 --- a/website/content/ChapterFour/0566.Reshape-the-Matrix.md +++ b/website/content/ChapterFour/0500~0599/0566.Reshape-the-Matrix.md @@ -104,6 +104,6 @@ func reshape(nums [][]int, r, c int) [][]int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0567.Permutation-in-String.md b/website/content/ChapterFour/0500~0599/0567.Permutation-in-String.md similarity index 87% rename from website/content/ChapterFour/0567.Permutation-in-String.md rename to website/content/ChapterFour/0500~0599/0567.Permutation-in-String.md index 5ca69e64..35262e5d 100644 --- a/website/content/ChapterFour/0567.Permutation-in-String.md +++ b/website/content/ChapterFour/0500~0599/0567.Permutation-in-String.md @@ -89,6 +89,6 @@ func checkInclusion(s1 string, s2 string) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0572.Subtree-of-Another-Tree.md b/website/content/ChapterFour/0500~0599/0572.Subtree-of-Another-Tree.md similarity index 89% rename from website/content/ChapterFour/0572.Subtree-of-Another-Tree.md rename to website/content/ChapterFour/0500~0599/0572.Subtree-of-Another-Tree.md index 38df9747..9781a179 100755 --- a/website/content/ChapterFour/0572.Subtree-of-Another-Tree.md +++ b/website/content/ChapterFour/0500~0599/0572.Subtree-of-Another-Tree.md @@ -89,6 +89,6 @@ func isSubtree(s *TreeNode, t *TreeNode) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0575.Distribute-Candies.md b/website/content/ChapterFour/0500~0599/0575.Distribute-Candies.md similarity index 89% rename from website/content/ChapterFour/0575.Distribute-Candies.md rename to website/content/ChapterFour/0500~0599/0575.Distribute-Candies.md index 98421846..5b27abd6 100755 --- a/website/content/ChapterFour/0575.Distribute-Candies.md +++ b/website/content/ChapterFour/0500~0599/0575.Distribute-Candies.md @@ -61,6 +61,6 @@ func distributeCandies(candies []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0594.Longest-Harmonious-Subsequence.md b/website/content/ChapterFour/0500~0599/0594.Longest-Harmonious-Subsequence.md similarity index 88% rename from website/content/ChapterFour/0594.Longest-Harmonious-Subsequence.md rename to website/content/ChapterFour/0500~0599/0594.Longest-Harmonious-Subsequence.md index e580f1b8..06110aef 100755 --- a/website/content/ChapterFour/0594.Longest-Harmonious-Subsequence.md +++ b/website/content/ChapterFour/0500~0599/0594.Longest-Harmonious-Subsequence.md @@ -59,6 +59,6 @@ func findLHS(nums []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0598.Range-Addition-II.md b/website/content/ChapterFour/0500~0599/0598.Range-Addition-II.md similarity index 91% rename from website/content/ChapterFour/0598.Range-Addition-II.md rename to website/content/ChapterFour/0500~0599/0598.Range-Addition-II.md index 2629104d..c4ca5720 100644 --- a/website/content/ChapterFour/0598.Range-Addition-II.md +++ b/website/content/ChapterFour/0500~0599/0598.Range-Addition-II.md @@ -84,6 +84,6 @@ func min(a, b int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0599.Minimum-Index-Sum-of-Two-Lists.md b/website/content/ChapterFour/0500~0599/0599.Minimum-Index-Sum-of-Two-Lists.md similarity index 91% rename from website/content/ChapterFour/0599.Minimum-Index-Sum-of-Two-Lists.md rename to website/content/ChapterFour/0500~0599/0599.Minimum-Index-Sum-of-Two-Lists.md index 98bedc57..a33f1d28 100755 --- a/website/content/ChapterFour/0599.Minimum-Index-Sum-of-Two-Lists.md +++ b/website/content/ChapterFour/0500~0599/0599.Minimum-Index-Sum-of-Two-Lists.md @@ -79,6 +79,6 @@ func findRestaurant(list1 []string, list2 []string) []string { ---------------------------------------------- diff --git a/website/content/ChapterFour/0500~0599/_index.md b/website/content/ChapterFour/0500~0599/_index.md new file mode 100644 index 00000000..d2021683 --- /dev/null +++ b/website/content/ChapterFour/0500~0599/_index.md @@ -0,0 +1,5 @@ +--- +bookCollapseSection: true +weight: 20 +--- + diff --git a/website/content/ChapterFour/0605.Can-Place-Flowers.md b/website/content/ChapterFour/0600~0699/0605.Can-Place-Flowers.md similarity index 90% rename from website/content/ChapterFour/0605.Can-Place-Flowers.md rename to website/content/ChapterFour/0600~0699/0605.Can-Place-Flowers.md index c873052e..0e26b084 100644 --- a/website/content/ChapterFour/0605.Can-Place-Flowers.md +++ b/website/content/ChapterFour/0600~0699/0605.Can-Place-Flowers.md @@ -62,6 +62,6 @@ func canPlaceFlowers(flowerbed []int, n int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0628.Maximum-Product-of-Three-Numbers.md b/website/content/ChapterFour/0600~0699/0628.Maximum-Product-of-Three-Numbers.md similarity index 90% rename from website/content/ChapterFour/0628.Maximum-Product-of-Three-Numbers.md rename to website/content/ChapterFour/0600~0699/0628.Maximum-Product-of-Three-Numbers.md index ca87c3f1..94180ac3 100755 --- a/website/content/ChapterFour/0628.Maximum-Product-of-Three-Numbers.md +++ b/website/content/ChapterFour/0600~0699/0628.Maximum-Product-of-Three-Numbers.md @@ -105,6 +105,6 @@ func maximumProduct1(nums []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0632.Smallest-Range-Covering-Elements-from-K-Lists.md b/website/content/ChapterFour/0600~0699/0632.Smallest-Range-Covering-Elements-from-K-Lists.md similarity index 93% rename from website/content/ChapterFour/0632.Smallest-Range-Covering-Elements-from-K-Lists.md rename to website/content/ChapterFour/0600~0699/0632.Smallest-Range-Covering-Elements-from-K-Lists.md index 9b77ea7e..ec1310e4 100755 --- a/website/content/ChapterFour/0632.Smallest-Range-Covering-Elements-from-K-Lists.md +++ b/website/content/ChapterFour/0600~0699/0632.Smallest-Range-Covering-Elements-from-K-Lists.md @@ -115,6 +115,6 @@ func (p SortByVal) Less(i, j int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0633.Sum-of-Square-Numbers.md b/website/content/ChapterFour/0600~0699/0633.Sum-of-Square-Numbers.md similarity index 82% rename from website/content/ChapterFour/0633.Sum-of-Square-Numbers.md rename to website/content/ChapterFour/0600~0699/0633.Sum-of-Square-Numbers.md index 5db9b22e..de723cae 100755 --- a/website/content/ChapterFour/0633.Sum-of-Square-Numbers.md +++ b/website/content/ChapterFour/0600~0699/0633.Sum-of-Square-Numbers.md @@ -55,6 +55,6 @@ func judgeSquareSum(c int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0636.Exclusive-Time-of-Functions.md b/website/content/ChapterFour/0600~0699/0636.Exclusive-Time-of-Functions.md similarity index 93% rename from website/content/ChapterFour/0636.Exclusive-Time-of-Functions.md rename to website/content/ChapterFour/0600~0699/0636.Exclusive-Time-of-Functions.md index 49ebc64a..ebe7628c 100755 --- a/website/content/ChapterFour/0636.Exclusive-Time-of-Functions.md +++ b/website/content/ChapterFour/0600~0699/0636.Exclusive-Time-of-Functions.md @@ -102,6 +102,6 @@ func exclusiveTime(n int, logs []string) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0637.Average-of-Levels-in-Binary-Tree.md b/website/content/ChapterFour/0600~0699/0637.Average-of-Levels-in-Binary-Tree.md similarity index 87% rename from website/content/ChapterFour/0637.Average-of-Levels-in-Binary-Tree.md rename to website/content/ChapterFour/0600~0699/0637.Average-of-Levels-in-Binary-Tree.md index 494e17b3..256e1e0b 100644 --- a/website/content/ChapterFour/0637.Average-of-Levels-in-Binary-Tree.md +++ b/website/content/ChapterFour/0600~0699/0637.Average-of-Levels-in-Binary-Tree.md @@ -87,6 +87,6 @@ func averageOfLevels(root *TreeNode) []float64 { ---------------------------------------------- diff --git a/website/content/ChapterFour/0638.Shopping-Offers.md b/website/content/ChapterFour/0600~0699/0638.Shopping-Offers.md similarity index 95% rename from website/content/ChapterFour/0638.Shopping-Offers.md rename to website/content/ChapterFour/0600~0699/0638.Shopping-Offers.md index e139c7b8..978efc8b 100644 --- a/website/content/ChapterFour/0638.Shopping-Offers.md +++ b/website/content/ChapterFour/0600~0699/0638.Shopping-Offers.md @@ -131,6 +131,6 @@ func dfsShoppingOffers(price []int, special [][]int, needs []int, pay int, res * ---------------------------------------------- diff --git a/website/content/ChapterFour/0645.Set-Mismatch.md b/website/content/ChapterFour/0600~0699/0645.Set-Mismatch.md similarity index 89% rename from website/content/ChapterFour/0645.Set-Mismatch.md rename to website/content/ChapterFour/0600~0699/0645.Set-Mismatch.md index 389004d7..0a1e7020 100755 --- a/website/content/ChapterFour/0645.Set-Mismatch.md +++ b/website/content/ChapterFour/0600~0699/0645.Set-Mismatch.md @@ -64,6 +64,6 @@ func findErrorNums(nums []int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0648.Replace-Words.md b/website/content/ChapterFour/0600~0699/0648.Replace-Words.md similarity index 93% rename from website/content/ChapterFour/0648.Replace-Words.md rename to website/content/ChapterFour/0600~0699/0648.Replace-Words.md index d47adb84..0130dce4 100755 --- a/website/content/ChapterFour/0648.Replace-Words.md +++ b/website/content/ChapterFour/0600~0699/0648.Replace-Words.md @@ -113,6 +113,6 @@ func replaceWords1(dict []string, sentence string) string { ---------------------------------------------- diff --git a/website/content/ChapterFour/0653.Two-Sum-IV---Input-is-a-BST.md b/website/content/ChapterFour/0600~0699/0653.Two-Sum-IV---Input-is-a-BST.md similarity index 87% rename from website/content/ChapterFour/0653.Two-Sum-IV---Input-is-a-BST.md rename to website/content/ChapterFour/0600~0699/0653.Two-Sum-IV---Input-is-a-BST.md index bf1681f0..4d13db56 100755 --- a/website/content/ChapterFour/0653.Two-Sum-IV---Input-is-a-BST.md +++ b/website/content/ChapterFour/0600~0699/0653.Two-Sum-IV---Input-is-a-BST.md @@ -77,6 +77,6 @@ func findTargetDFS(root *TreeNode, k int, m map[int]int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0658.Find-K-Closest-Elements.md b/website/content/ChapterFour/0600~0699/0658.Find-K-Closest-Elements.md similarity index 92% rename from website/content/ChapterFour/0658.Find-K-Closest-Elements.md rename to website/content/ChapterFour/0600~0699/0658.Find-K-Closest-Elements.md index cc6ea000..a818069d 100755 --- a/website/content/ChapterFour/0658.Find-K-Closest-Elements.md +++ b/website/content/ChapterFour/0600~0699/0658.Find-K-Closest-Elements.md @@ -84,6 +84,6 @@ func findClosestElements1(arr []int, k int, x int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0661.Image-Smoother.md b/website/content/ChapterFour/0600~0699/0661.Image-Smoother.md similarity index 91% rename from website/content/ChapterFour/0661.Image-Smoother.md rename to website/content/ChapterFour/0600~0699/0661.Image-Smoother.md index 898ac924..048d5da9 100644 --- a/website/content/ChapterFour/0661.Image-Smoother.md +++ b/website/content/ChapterFour/0600~0699/0661.Image-Smoother.md @@ -113,6 +113,6 @@ func smooth(x, y int, M [][]int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0662.Maximum-Width-of-Binary-Tree.md b/website/content/ChapterFour/0600~0699/0662.Maximum-Width-of-Binary-Tree.md similarity index 95% rename from website/content/ChapterFour/0662.Maximum-Width-of-Binary-Tree.md rename to website/content/ChapterFour/0600~0699/0662.Maximum-Width-of-Binary-Tree.md index 00a6fb10..6975b34d 100755 --- a/website/content/ChapterFour/0662.Maximum-Width-of-Binary-Tree.md +++ b/website/content/ChapterFour/0600~0699/0662.Maximum-Width-of-Binary-Tree.md @@ -154,6 +154,6 @@ func widthOfBinaryTree(root *TreeNode) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0668.Kth-Smallest-Number-in-Multiplication-Table.md b/website/content/ChapterFour/0600~0699/0668.Kth-Smallest-Number-in-Multiplication-Table.md similarity index 90% rename from website/content/ChapterFour/0668.Kth-Smallest-Number-in-Multiplication-Table.md rename to website/content/ChapterFour/0600~0699/0668.Kth-Smallest-Number-in-Multiplication-Table.md index cac282b2..7643ffe3 100755 --- a/website/content/ChapterFour/0668.Kth-Smallest-Number-in-Multiplication-Table.md +++ b/website/content/ChapterFour/0600~0699/0668.Kth-Smallest-Number-in-Multiplication-Table.md @@ -86,6 +86,6 @@ func counterKthNum(m, n, mid int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0674.Longest-Continuous-Increasing-Subsequence.md b/website/content/ChapterFour/0600~0699/0674.Longest-Continuous-Increasing-Subsequence.md similarity index 88% rename from website/content/ChapterFour/0674.Longest-Continuous-Increasing-Subsequence.md rename to website/content/ChapterFour/0600~0699/0674.Longest-Continuous-Increasing-Subsequence.md index af34e78f..58966b72 100644 --- a/website/content/ChapterFour/0674.Longest-Continuous-Increasing-Subsequence.md +++ b/website/content/ChapterFour/0600~0699/0674.Longest-Continuous-Increasing-Subsequence.md @@ -71,6 +71,6 @@ func max(a, b int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0676.Implement-Magic-Dictionary.md b/website/content/ChapterFour/0600~0699/0676.Implement-Magic-Dictionary.md similarity index 92% rename from website/content/ChapterFour/0676.Implement-Magic-Dictionary.md rename to website/content/ChapterFour/0600~0699/0676.Implement-Magic-Dictionary.md index 13e25288..c0d96e1a 100755 --- a/website/content/ChapterFour/0676.Implement-Magic-Dictionary.md +++ b/website/content/ChapterFour/0600~0699/0676.Implement-Magic-Dictionary.md @@ -89,6 +89,6 @@ func (this *MagicDictionary) Search(word string) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0682.Baseball-Game.md b/website/content/ChapterFour/0600~0699/0682.Baseball-Game.md similarity index 92% rename from website/content/ChapterFour/0682.Baseball-Game.md rename to website/content/ChapterFour/0600~0699/0682.Baseball-Game.md index 447934fb..a85678d4 100644 --- a/website/content/ChapterFour/0682.Baseball-Game.md +++ b/website/content/ChapterFour/0600~0699/0682.Baseball-Game.md @@ -108,6 +108,6 @@ func calPoints(ops []string) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0684.Redundant-Connection.md b/website/content/ChapterFour/0600~0699/0684.Redundant-Connection.md similarity index 93% rename from website/content/ChapterFour/0684.Redundant-Connection.md rename to website/content/ChapterFour/0600~0699/0684.Redundant-Connection.md index 5348b2b9..6f48fee3 100755 --- a/website/content/ChapterFour/0684.Redundant-Connection.md +++ b/website/content/ChapterFour/0600~0699/0684.Redundant-Connection.md @@ -87,6 +87,6 @@ func findRedundantConnection(edges [][]int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0685.Redundant-Connection-II.md b/website/content/ChapterFour/0600~0699/0685.Redundant-Connection-II.md similarity index 95% rename from website/content/ChapterFour/0685.Redundant-Connection-II.md rename to website/content/ChapterFour/0600~0699/0685.Redundant-Connection-II.md index f96a97c7..b6befebf 100755 --- a/website/content/ChapterFour/0685.Redundant-Connection-II.md +++ b/website/content/ChapterFour/0600~0699/0685.Redundant-Connection-II.md @@ -112,6 +112,6 @@ func findRoot(parent *[]int, k int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0693.Binary-Number-with-Alternating-Bits.md b/website/content/ChapterFour/0600~0699/0693.Binary-Number-with-Alternating-Bits.md similarity index 88% rename from website/content/ChapterFour/0693.Binary-Number-with-Alternating-Bits.md rename to website/content/ChapterFour/0600~0699/0693.Binary-Number-with-Alternating-Bits.md index 0a75d45c..e363ecde 100755 --- a/website/content/ChapterFour/0693.Binary-Number-with-Alternating-Bits.md +++ b/website/content/ChapterFour/0600~0699/0693.Binary-Number-with-Alternating-Bits.md @@ -82,6 +82,6 @@ func hasAlternatingBits1(n int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0695.Max-Area-of-Island.md b/website/content/ChapterFour/0600~0699/0695.Max-Area-of-Island.md similarity index 90% rename from website/content/ChapterFour/0695.Max-Area-of-Island.md rename to website/content/ChapterFour/0600~0699/0695.Max-Area-of-Island.md index 6d5ee78a..8e4d4633 100644 --- a/website/content/ChapterFour/0695.Max-Area-of-Island.md +++ b/website/content/ChapterFour/0600~0699/0695.Max-Area-of-Island.md @@ -79,6 +79,6 @@ func areaOfIsland(grid [][]int, x, y int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0697.Degree-of-an-Array.md b/website/content/ChapterFour/0600~0699/0697.Degree-of-an-Array.md similarity index 91% rename from website/content/ChapterFour/0697.Degree-of-an-Array.md rename to website/content/ChapterFour/0600~0699/0697.Degree-of-an-Array.md index 25cf311a..3b0f4bfd 100644 --- a/website/content/ChapterFour/0697.Degree-of-an-Array.md +++ b/website/content/ChapterFour/0600~0699/0697.Degree-of-an-Array.md @@ -82,6 +82,6 @@ func findShortestSubArray(nums []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0699.Falling-Squares.md b/website/content/ChapterFour/0600~0699/0699.Falling-Squares.md similarity index 96% rename from website/content/ChapterFour/0699.Falling-Squares.md rename to website/content/ChapterFour/0600~0699/0699.Falling-Squares.md index 7986f80e..6e2b84a4 100755 --- a/website/content/ChapterFour/0699.Falling-Squares.md +++ b/website/content/ChapterFour/0600~0699/0699.Falling-Squares.md @@ -147,6 +147,6 @@ func discretization(positions [][]int) map[int]int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0600~0699/_index.md b/website/content/ChapterFour/0600~0699/_index.md new file mode 100644 index 00000000..d2021683 --- /dev/null +++ b/website/content/ChapterFour/0600~0699/_index.md @@ -0,0 +1,5 @@ +--- +bookCollapseSection: true +weight: 20 +--- + diff --git a/website/content/ChapterFour/0704.Binary-Search.md b/website/content/ChapterFour/0700~0799/0704.Binary-Search.md similarity index 88% rename from website/content/ChapterFour/0704.Binary-Search.md rename to website/content/ChapterFour/0700~0799/0704.Binary-Search.md index ea9b82b3..64fc5a4c 100755 --- a/website/content/ChapterFour/0704.Binary-Search.md +++ b/website/content/ChapterFour/0700~0799/0704.Binary-Search.md @@ -69,6 +69,6 @@ func search704(nums []int, target int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0705.Design-HashSet.md b/website/content/ChapterFour/0700~0799/0705.Design-HashSet.md similarity index 91% rename from website/content/ChapterFour/0705.Design-HashSet.md rename to website/content/ChapterFour/0700~0799/0705.Design-HashSet.md index da4d3578..c535d896 100755 --- a/website/content/ChapterFour/0705.Design-HashSet.md +++ b/website/content/ChapterFour/0700~0799/0705.Design-HashSet.md @@ -96,6 +96,6 @@ func (this *MyHashSet) Contains(key int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0706.Design-HashMap.md b/website/content/ChapterFour/0700~0799/0706.Design-HashMap.md similarity index 94% rename from website/content/ChapterFour/0706.Design-HashMap.md rename to website/content/ChapterFour/0700~0799/0706.Design-HashMap.md index 786c2cab..e941b88e 100755 --- a/website/content/ChapterFour/0706.Design-HashMap.md +++ b/website/content/ChapterFour/0700~0799/0706.Design-HashMap.md @@ -153,6 +153,6 @@ func (this *MyHashMap) Hash(value int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0707.Design-Linked-List.md b/website/content/ChapterFour/0700~0799/0707.Design-Linked-List.md similarity index 94% rename from website/content/ChapterFour/0707.Design-Linked-List.md rename to website/content/ChapterFour/0700~0799/0707.Design-Linked-List.md index 6930dd2f..c42b3426 100644 --- a/website/content/ChapterFour/0707.Design-Linked-List.md +++ b/website/content/ChapterFour/0700~0799/0707.Design-Linked-List.md @@ -142,6 +142,6 @@ func (this *MyLinkedList) DeleteAtIndex(index int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0710.Random-Pick-with-Blacklist.md b/website/content/ChapterFour/0700~0799/0710.Random-Pick-with-Blacklist.md similarity index 93% rename from website/content/ChapterFour/0710.Random-Pick-with-Blacklist.md rename to website/content/ChapterFour/0700~0799/0710.Random-Pick-with-Blacklist.md index 8622e8ed..f8054087 100644 --- a/website/content/ChapterFour/0710.Random-Pick-with-Blacklist.md +++ b/website/content/ChapterFour/0700~0799/0710.Random-Pick-with-Blacklist.md @@ -147,6 +147,6 @@ func (this *Solution) Pick() int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0713.Subarray-Product-Less-Than-K.md b/website/content/ChapterFour/0700~0799/0713.Subarray-Product-Less-Than-K.md similarity index 85% rename from website/content/ChapterFour/0713.Subarray-Product-Less-Than-K.md rename to website/content/ChapterFour/0700~0799/0713.Subarray-Product-Less-Than-K.md index 47182853..11c50a4b 100644 --- a/website/content/ChapterFour/0713.Subarray-Product-Less-Than-K.md +++ b/website/content/ChapterFour/0700~0799/0713.Subarray-Product-Less-Than-K.md @@ -67,6 +67,6 @@ func numSubarrayProductLessThanK(nums []int, k int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md b/website/content/ChapterFour/0700~0799/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md similarity index 92% rename from website/content/ChapterFour/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md rename to website/content/ChapterFour/0700~0799/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md index 9a4f62fb..055c8f84 100755 --- a/website/content/ChapterFour/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md +++ b/website/content/ChapterFour/0700~0799/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md @@ -82,6 +82,6 @@ func maxProfit714_1(prices []int, fee int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0715.Range-Module.md b/website/content/ChapterFour/0700~0799/0715.Range-Module.md similarity index 97% rename from website/content/ChapterFour/0715.Range-Module.md rename to website/content/ChapterFour/0700~0799/0715.Range-Module.md index 80b3a39b..27defe3d 100755 --- a/website/content/ChapterFour/0715.Range-Module.md +++ b/website/content/ChapterFour/0700~0799/0715.Range-Module.md @@ -272,6 +272,6 @@ func query(node *SegmentTreeNode, start, end int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0717.1-bit-and-2-bit-Characters.md b/website/content/ChapterFour/0700~0799/0717.1-bit-and-2-bit-Characters.md similarity index 91% rename from website/content/ChapterFour/0717.1-bit-and-2-bit-Characters.md rename to website/content/ChapterFour/0700~0799/0717.1-bit-and-2-bit-Characters.md index 82de8dfc..baf0dc10 100755 --- a/website/content/ChapterFour/0717.1-bit-and-2-bit-Characters.md +++ b/website/content/ChapterFour/0700~0799/0717.1-bit-and-2-bit-Characters.md @@ -67,6 +67,6 @@ func isOneBitCharacter(bits []int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0718.Maximum-Length-of-Repeated-Subarray.md b/website/content/ChapterFour/0700~0799/0718.Maximum-Length-of-Repeated-Subarray.md similarity index 94% rename from website/content/ChapterFour/0718.Maximum-Length-of-Repeated-Subarray.md rename to website/content/ChapterFour/0700~0799/0718.Maximum-Length-of-Repeated-Subarray.md index 211ef777..004d6f82 100755 --- a/website/content/ChapterFour/0718.Maximum-Length-of-Repeated-Subarray.md +++ b/website/content/ChapterFour/0700~0799/0718.Maximum-Length-of-Repeated-Subarray.md @@ -125,6 +125,6 @@ func findLength1(A []int, B []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0719.Find-K-th-Smallest-Pair-Distance.md b/website/content/ChapterFour/0700~0799/0719.Find-K-th-Smallest-Pair-Distance.md similarity index 91% rename from website/content/ChapterFour/0719.Find-K-th-Smallest-Pair-Distance.md rename to website/content/ChapterFour/0700~0799/0719.Find-K-th-Smallest-Pair-Distance.md index d529b244..3f85a6de 100755 --- a/website/content/ChapterFour/0719.Find-K-th-Smallest-Pair-Distance.md +++ b/website/content/ChapterFour/0700~0799/0719.Find-K-th-Smallest-Pair-Distance.md @@ -99,6 +99,6 @@ func findDistanceCount1(nums []int, num int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0720.Longest-Word-in-Dictionary.md b/website/content/ChapterFour/0700~0799/0720.Longest-Word-in-Dictionary.md similarity index 90% rename from website/content/ChapterFour/0720.Longest-Word-in-Dictionary.md rename to website/content/ChapterFour/0700~0799/0720.Longest-Word-in-Dictionary.md index 27b9c7a1..f35712bb 100755 --- a/website/content/ChapterFour/0720.Longest-Word-in-Dictionary.md +++ b/website/content/ChapterFour/0700~0799/0720.Longest-Word-in-Dictionary.md @@ -74,6 +74,6 @@ func longestWord(words []string) string { ---------------------------------------------- diff --git a/website/content/ChapterFour/0721.Accounts-Merge.md b/website/content/ChapterFour/0700~0799/0721.Accounts-Merge.md similarity index 96% rename from website/content/ChapterFour/0721.Accounts-Merge.md rename to website/content/ChapterFour/0700~0799/0721.Accounts-Merge.md index 42c63ba1..dfe1190c 100755 --- a/website/content/ChapterFour/0721.Accounts-Merge.md +++ b/website/content/ChapterFour/0700~0799/0721.Accounts-Merge.md @@ -151,6 +151,6 @@ func accountsMerge1(accounts [][]string) [][]string { ---------------------------------------------- diff --git a/website/content/ChapterFour/0724.Find-Pivot-Index.md b/website/content/ChapterFour/0700~0799/0724.Find-Pivot-Index.md similarity index 90% rename from website/content/ChapterFour/0724.Find-Pivot-Index.md rename to website/content/ChapterFour/0700~0799/0724.Find-Pivot-Index.md index 5360bf54..23a7aeee 100644 --- a/website/content/ChapterFour/0724.Find-Pivot-Index.md +++ b/website/content/ChapterFour/0700~0799/0724.Find-Pivot-Index.md @@ -76,6 +76,6 @@ func pivotIndex(nums []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0725.Split-Linked-List-in-Parts.md b/website/content/ChapterFour/0700~0799/0725.Split-Linked-List-in-Parts.md similarity index 94% rename from website/content/ChapterFour/0725.Split-Linked-List-in-Parts.md rename to website/content/ChapterFour/0700~0799/0725.Split-Linked-List-in-Parts.md index 7bc0e10e..310afd70 100644 --- a/website/content/ChapterFour/0725.Split-Linked-List-in-Parts.md +++ b/website/content/ChapterFour/0700~0799/0725.Split-Linked-List-in-Parts.md @@ -144,6 +144,6 @@ func getLength(l *ListNode) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0726.Number-of-Atoms.md b/website/content/ChapterFour/0700~0799/0726.Number-of-Atoms.md similarity index 95% rename from website/content/ChapterFour/0726.Number-of-Atoms.md rename to website/content/ChapterFour/0700~0799/0726.Number-of-Atoms.md index a885505c..3cbf7a4f 100755 --- a/website/content/ChapterFour/0726.Number-of-Atoms.md +++ b/website/content/ChapterFour/0700~0799/0726.Number-of-Atoms.md @@ -188,6 +188,6 @@ func isLowerLetter(v byte) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0729.My-Calendar-I.md b/website/content/ChapterFour/0700~0799/0729.My-Calendar-I.md similarity index 96% rename from website/content/ChapterFour/0729.My-Calendar-I.md rename to website/content/ChapterFour/0700~0799/0729.My-Calendar-I.md index 15bb691d..6c7cf30b 100755 --- a/website/content/ChapterFour/0729.My-Calendar-I.md +++ b/website/content/ChapterFour/0700~0799/0729.My-Calendar-I.md @@ -182,6 +182,6 @@ func (this *MyCalendar) Book(start int, end int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0732.My-Calendar-III.md b/website/content/ChapterFour/0700~0799/0732.My-Calendar-III.md similarity index 96% rename from website/content/ChapterFour/0732.My-Calendar-III.md rename to website/content/ChapterFour/0700~0799/0732.My-Calendar-III.md index 16114138..170edfd7 100755 --- a/website/content/ChapterFour/0732.My-Calendar-III.md +++ b/website/content/ChapterFour/0700~0799/0732.My-Calendar-III.md @@ -144,6 +144,6 @@ func (st *SegmentTree732) book(start, end int, maxHeight *int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0733.Flood-Fill.md b/website/content/ChapterFour/0700~0799/0733.Flood-Fill.md similarity index 93% rename from website/content/ChapterFour/0733.Flood-Fill.md rename to website/content/ChapterFour/0700~0799/0733.Flood-Fill.md index b66a77a7..9fee69a4 100755 --- a/website/content/ChapterFour/0733.Flood-Fill.md +++ b/website/content/ChapterFour/0700~0799/0733.Flood-Fill.md @@ -83,6 +83,6 @@ func dfs733(image [][]int, x, y int, newColor int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0735.Asteroid-Collision.md b/website/content/ChapterFour/0700~0799/0735.Asteroid-Collision.md similarity index 93% rename from website/content/ChapterFour/0735.Asteroid-Collision.md rename to website/content/ChapterFour/0700~0799/0735.Asteroid-Collision.md index a9933fdb..7a9227f5 100644 --- a/website/content/ChapterFour/0735.Asteroid-Collision.md +++ b/website/content/ChapterFour/0700~0799/0735.Asteroid-Collision.md @@ -107,6 +107,6 @@ func asteroidCollision(asteroids []int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0739.Daily-Temperatures.md b/website/content/ChapterFour/0700~0799/0739.Daily-Temperatures.md similarity index 86% rename from website/content/ChapterFour/0739.Daily-Temperatures.md rename to website/content/ChapterFour/0700~0799/0739.Daily-Temperatures.md index 514474e8..4a15a20b 100644 --- a/website/content/ChapterFour/0739.Daily-Temperatures.md +++ b/website/content/ChapterFour/0700~0799/0739.Daily-Temperatures.md @@ -61,6 +61,6 @@ func dailyTemperatures1(T []int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0744.Find-Smallest-Letter-Greater-Than-Target.md b/website/content/ChapterFour/0700~0799/0744.Find-Smallest-Letter-Greater-Than-Target.md similarity index 91% rename from website/content/ChapterFour/0744.Find-Smallest-Letter-Greater-Than-Target.md rename to website/content/ChapterFour/0700~0799/0744.Find-Smallest-Letter-Greater-Than-Target.md index da03eb56..daa8ce50 100755 --- a/website/content/ChapterFour/0744.Find-Smallest-Letter-Greater-Than-Target.md +++ b/website/content/ChapterFour/0700~0799/0744.Find-Smallest-Letter-Greater-Than-Target.md @@ -94,6 +94,6 @@ func nextGreatestLetter(letters []byte, target byte) byte { ---------------------------------------------- diff --git a/website/content/ChapterFour/0745.Prefix-and-Suffix-Search.md b/website/content/ChapterFour/0700~0799/0745.Prefix-and-Suffix-Search.md similarity index 92% rename from website/content/ChapterFour/0745.Prefix-and-Suffix-Search.md rename to website/content/ChapterFour/0700~0799/0745.Prefix-and-Suffix-Search.md index fef5fe50..6934034e 100755 --- a/website/content/ChapterFour/0745.Prefix-and-Suffix-Search.md +++ b/website/content/ChapterFour/0700~0799/0745.Prefix-and-Suffix-Search.md @@ -100,6 +100,6 @@ func (this *WordFilter_) F_(prefix string, suffix string) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0746.Min-Cost-Climbing-Stairs.md b/website/content/ChapterFour/0700~0799/0746.Min-Cost-Climbing-Stairs.md similarity index 91% rename from website/content/ChapterFour/0746.Min-Cost-Climbing-Stairs.md rename to website/content/ChapterFour/0700~0799/0746.Min-Cost-Climbing-Stairs.md index b7616f0b..94bfac52 100755 --- a/website/content/ChapterFour/0746.Min-Cost-Climbing-Stairs.md +++ b/website/content/ChapterFour/0700~0799/0746.Min-Cost-Climbing-Stairs.md @@ -73,6 +73,6 @@ func minCostClimbingStairs1(cost []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0748.Shortest-Completing-Word.md b/website/content/ChapterFour/0700~0799/0748.Shortest-Completing-Word.md similarity index 94% rename from website/content/ChapterFour/0748.Shortest-Completing-Word.md rename to website/content/ChapterFour/0700~0799/0748.Shortest-Completing-Word.md index 8f2cb3a5..5bf3a79d 100755 --- a/website/content/ChapterFour/0748.Shortest-Completing-Word.md +++ b/website/content/ChapterFour/0700~0799/0748.Shortest-Completing-Word.md @@ -104,6 +104,6 @@ func match(lp [26]int, w string) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0753.Cracking-the-Safe.md b/website/content/ChapterFour/0700~0799/0753.Cracking-the-Safe.md similarity index 92% rename from website/content/ChapterFour/0753.Cracking-the-Safe.md rename to website/content/ChapterFour/0700~0799/0753.Cracking-the-Safe.md index 63567a9f..12f1d6eb 100644 --- a/website/content/ChapterFour/0753.Cracking-the-Safe.md +++ b/website/content/ChapterFour/0700~0799/0753.Cracking-the-Safe.md @@ -94,6 +94,6 @@ func dfsCrackSafe(depth, n, k int, str *[]byte, visit *map[string]bool) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0756.Pyramid-Transition-Matrix.md b/website/content/ChapterFour/0700~0799/0756.Pyramid-Transition-Matrix.md similarity index 93% rename from website/content/ChapterFour/0756.Pyramid-Transition-Matrix.md rename to website/content/ChapterFour/0700~0799/0756.Pyramid-Transition-Matrix.md index b3042ed5..8694d1fe 100755 --- a/website/content/ChapterFour/0756.Pyramid-Transition-Matrix.md +++ b/website/content/ChapterFour/0700~0799/0756.Pyramid-Transition-Matrix.md @@ -94,6 +94,6 @@ func dfsT(bottom, above string, pyramid map[string][]string) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0762.Prime-Number-of-Set-Bits-in-Binary-Representation.md b/website/content/ChapterFour/0700~0799/0762.Prime-Number-of-Set-Bits-in-Binary-Representation.md similarity index 91% rename from website/content/ChapterFour/0762.Prime-Number-of-Set-Bits-in-Binary-Representation.md rename to website/content/ChapterFour/0700~0799/0762.Prime-Number-of-Set-Bits-in-Binary-Representation.md index fcfb1d5c..a4c571cf 100755 --- a/website/content/ChapterFour/0762.Prime-Number-of-Set-Bits-in-Binary-Representation.md +++ b/website/content/ChapterFour/0700~0799/0762.Prime-Number-of-Set-Bits-in-Binary-Representation.md @@ -80,6 +80,6 @@ func isPrime(x int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0763.Partition-Labels.md b/website/content/ChapterFour/0700~0799/0763.Partition-Labels.md similarity index 90% rename from website/content/ChapterFour/0763.Partition-Labels.md rename to website/content/ChapterFour/0700~0799/0763.Partition-Labels.md index e5273f5e..caac72ef 100644 --- a/website/content/ChapterFour/0763.Partition-Labels.md +++ b/website/content/ChapterFour/0700~0799/0763.Partition-Labels.md @@ -94,6 +94,6 @@ func partitionLabels1(S string) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0765.Couples-Holding-Hands.md b/website/content/ChapterFour/0700~0799/0765.Couples-Holding-Hands.md similarity index 95% rename from website/content/ChapterFour/0765.Couples-Holding-Hands.md rename to website/content/ChapterFour/0700~0799/0765.Couples-Holding-Hands.md index 65a08a69..87fe36c4 100755 --- a/website/content/ChapterFour/0765.Couples-Holding-Hands.md +++ b/website/content/ChapterFour/0700~0799/0765.Couples-Holding-Hands.md @@ -95,6 +95,6 @@ func minSwapsCouples(row []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0766.Toeplitz-Matrix.md b/website/content/ChapterFour/0700~0799/0766.Toeplitz-Matrix.md similarity index 89% rename from website/content/ChapterFour/0766.Toeplitz-Matrix.md rename to website/content/ChapterFour/0700~0799/0766.Toeplitz-Matrix.md index e4f7e305..e18758da 100755 --- a/website/content/ChapterFour/0766.Toeplitz-Matrix.md +++ b/website/content/ChapterFour/0700~0799/0766.Toeplitz-Matrix.md @@ -81,6 +81,6 @@ func isToeplitzMatrix(matrix [][]int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0767.Reorganize-String.md b/website/content/ChapterFour/0700~0799/0767.Reorganize-String.md similarity index 94% rename from website/content/ChapterFour/0767.Reorganize-String.md rename to website/content/ChapterFour/0700~0799/0767.Reorganize-String.md index 60eb52c3..c3bb9234 100644 --- a/website/content/ChapterFour/0767.Reorganize-String.md +++ b/website/content/ChapterFour/0700~0799/0767.Reorganize-String.md @@ -151,6 +151,6 @@ func frequencySort767(s string) string { ---------------------------------------------- diff --git a/website/content/ChapterFour/0771.Jewels-and-Stones.md b/website/content/ChapterFour/0700~0799/0771.Jewels-and-Stones.md similarity index 88% rename from website/content/ChapterFour/0771.Jewels-and-Stones.md rename to website/content/ChapterFour/0700~0799/0771.Jewels-and-Stones.md index e5322860..c9a91a4d 100755 --- a/website/content/ChapterFour/0771.Jewels-and-Stones.md +++ b/website/content/ChapterFour/0700~0799/0771.Jewels-and-Stones.md @@ -76,6 +76,6 @@ func numJewelsInStones1(J string, S string) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0778.Swim-in-Rising-Water.md b/website/content/ChapterFour/0700~0799/0778.Swim-in-Rising-Water.md similarity index 95% rename from website/content/ChapterFour/0778.Swim-in-Rising-Water.md rename to website/content/ChapterFour/0700~0799/0778.Swim-in-Rising-Water.md index dbb2414b..cc51e80b 100755 --- a/website/content/ChapterFour/0778.Swim-in-Rising-Water.md +++ b/website/content/ChapterFour/0700~0799/0778.Swim-in-Rising-Water.md @@ -134,6 +134,6 @@ func swimInWater1(grid [][]int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0781.Rabbits-in-Forest.md b/website/content/ChapterFour/0700~0799/0781.Rabbits-in-Forest.md similarity index 90% rename from website/content/ChapterFour/0781.Rabbits-in-Forest.md rename to website/content/ChapterFour/0700~0799/0781.Rabbits-in-Forest.md index 5ec3870d..29edfa86 100755 --- a/website/content/ChapterFour/0781.Rabbits-in-Forest.md +++ b/website/content/ChapterFour/0700~0799/0781.Rabbits-in-Forest.md @@ -71,6 +71,6 @@ func numRabbits(ans []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0784.Letter-Case-Permutation.md b/website/content/ChapterFour/0700~0799/0784.Letter-Case-Permutation.md similarity index 92% rename from website/content/ChapterFour/0784.Letter-Case-Permutation.md rename to website/content/ChapterFour/0700~0799/0784.Letter-Case-Permutation.md index 18f870a0..98edd886 100755 --- a/website/content/ChapterFour/0784.Letter-Case-Permutation.md +++ b/website/content/ChapterFour/0700~0799/0784.Letter-Case-Permutation.md @@ -122,6 +122,6 @@ func toUpper(s string, i int) string { ---------------------------------------------- diff --git a/website/content/ChapterFour/0785.Is-Graph-Bipartite.md b/website/content/ChapterFour/0700~0799/0785.Is-Graph-Bipartite.md similarity index 93% rename from website/content/ChapterFour/0785.Is-Graph-Bipartite.md rename to website/content/ChapterFour/0700~0799/0785.Is-Graph-Bipartite.md index f595b55e..748451ee 100644 --- a/website/content/ChapterFour/0785.Is-Graph-Bipartite.md +++ b/website/content/ChapterFour/0700~0799/0785.Is-Graph-Bipartite.md @@ -100,6 +100,6 @@ func dfs(n int, graph [][]int, colors []int, parentCol int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0786.K-th-Smallest-Prime-Fraction.md b/website/content/ChapterFour/0700~0799/0786.K-th-Smallest-Prime-Fraction.md similarity index 93% rename from website/content/ChapterFour/0786.K-th-Smallest-Prime-Fraction.md rename to website/content/ChapterFour/0700~0799/0786.K-th-Smallest-Prime-Fraction.md index 17203613..b0747026 100755 --- a/website/content/ChapterFour/0786.K-th-Smallest-Prime-Fraction.md +++ b/website/content/ChapterFour/0700~0799/0786.K-th-Smallest-Prime-Fraction.md @@ -121,6 +121,6 @@ func (a SortByFraction) Less(i, j int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0793.Preimage-Size-of-Factorial-Zeroes-Function.md b/website/content/ChapterFour/0700~0799/0793.Preimage-Size-of-Factorial-Zeroes-Function.md similarity index 94% rename from website/content/ChapterFour/0793.Preimage-Size-of-Factorial-Zeroes-Function.md rename to website/content/ChapterFour/0700~0799/0793.Preimage-Size-of-Factorial-Zeroes-Function.md index e931f679..3208a8ae 100755 --- a/website/content/ChapterFour/0793.Preimage-Size-of-Factorial-Zeroes-Function.md +++ b/website/content/ChapterFour/0700~0799/0793.Preimage-Size-of-Factorial-Zeroes-Function.md @@ -103,6 +103,6 @@ func preimageSizeFZF1(K int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0700~0799/_index.md b/website/content/ChapterFour/0700~0799/_index.md new file mode 100644 index 00000000..d2021683 --- /dev/null +++ b/website/content/ChapterFour/0700~0799/_index.md @@ -0,0 +1,5 @@ +--- +bookCollapseSection: true +weight: 20 +--- + diff --git a/website/content/ChapterFour/0802.Find-Eventual-Safe-States.md b/website/content/ChapterFour/0800~0899/0802.Find-Eventual-Safe-States.md similarity index 93% rename from website/content/ChapterFour/0802.Find-Eventual-Safe-States.md rename to website/content/ChapterFour/0800~0899/0802.Find-Eventual-Safe-States.md index af127111..74054507 100644 --- a/website/content/ChapterFour/0802.Find-Eventual-Safe-States.md +++ b/website/content/ChapterFour/0800~0899/0802.Find-Eventual-Safe-States.md @@ -75,6 +75,6 @@ func dfsEventualSafeNodes(graph [][]int, idx int, color []int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0803.Bricks-Falling-When-Hit.md b/website/content/ChapterFour/0800~0899/0803.Bricks-Falling-When-Hit.md similarity index 96% rename from website/content/ChapterFour/0803.Bricks-Falling-When-Hit.md rename to website/content/ChapterFour/0800~0899/0803.Bricks-Falling-When-Hit.md index c08b8ab8..81657194 100755 --- a/website/content/ChapterFour/0803.Bricks-Falling-When-Hit.md +++ b/website/content/ChapterFour/0800~0899/0803.Bricks-Falling-When-Hit.md @@ -127,6 +127,6 @@ func getUnionFindFromGrid(grid [][]int, x, y int, uf template.UnionFindCount) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0811.Subdomain-Visit-Count.md b/website/content/ChapterFour/0800~0899/0811.Subdomain-Visit-Count.md similarity index 95% rename from website/content/ChapterFour/0811.Subdomain-Visit-Count.md rename to website/content/ChapterFour/0800~0899/0811.Subdomain-Visit-Count.md index d2eda349..c3a9ac90 100755 --- a/website/content/ChapterFour/0811.Subdomain-Visit-Count.md +++ b/website/content/ChapterFour/0800~0899/0811.Subdomain-Visit-Count.md @@ -145,6 +145,6 @@ func splitDomain(domain string, domains map[string]int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0812.Largest-Triangle-Area.md b/website/content/ChapterFour/0800~0899/0812.Largest-Triangle-Area.md similarity index 88% rename from website/content/ChapterFour/0812.Largest-Triangle-Area.md rename to website/content/ChapterFour/0800~0899/0812.Largest-Triangle-Area.md index 81ea3077..6519d158 100644 --- a/website/content/ChapterFour/0812.Largest-Triangle-Area.md +++ b/website/content/ChapterFour/0800~0899/0812.Largest-Triangle-Area.md @@ -72,6 +72,6 @@ func max(a, b float64) float64 { ---------------------------------------------- diff --git a/website/content/ChapterFour/0815.Bus-Routes.md b/website/content/ChapterFour/0800~0899/0815.Bus-Routes.md similarity index 93% rename from website/content/ChapterFour/0815.Bus-Routes.md rename to website/content/ChapterFour/0800~0899/0815.Bus-Routes.md index 18b747b2..844c5540 100755 --- a/website/content/ChapterFour/0815.Bus-Routes.md +++ b/website/content/ChapterFour/0800~0899/0815.Bus-Routes.md @@ -90,6 +90,6 @@ func numBusesToDestination(routes [][]int, S int, T int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0817.Linked-List-Components.md b/website/content/ChapterFour/0800~0899/0817.Linked-List-Components.md similarity index 91% rename from website/content/ChapterFour/0817.Linked-List-Components.md rename to website/content/ChapterFour/0800~0899/0817.Linked-List-Components.md index 4b49383b..1442d128 100644 --- a/website/content/ChapterFour/0817.Linked-List-Components.md +++ b/website/content/ChapterFour/0800~0899/0817.Linked-List-Components.md @@ -111,6 +111,6 @@ func toMap(G []int) map[int]int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0819.Most-Common-Word.md b/website/content/ChapterFour/0800~0899/0819.Most-Common-Word.md similarity index 92% rename from website/content/ChapterFour/0819.Most-Common-Word.md rename to website/content/ChapterFour/0800~0899/0819.Most-Common-Word.md index 307a2044..9da8c4cd 100755 --- a/website/content/ChapterFour/0819.Most-Common-Word.md +++ b/website/content/ChapterFour/0800~0899/0819.Most-Common-Word.md @@ -91,6 +91,6 @@ func mostCommonWord(paragraph string, banned []string) string { ---------------------------------------------- diff --git a/website/content/ChapterFour/0826.Most-Profit-Assigning-Work.md b/website/content/ChapterFour/0800~0899/0826.Most-Profit-Assigning-Work.md similarity index 92% rename from website/content/ChapterFour/0826.Most-Profit-Assigning-Work.md rename to website/content/ChapterFour/0800~0899/0826.Most-Profit-Assigning-Work.md index 4e49558d..f8053719 100644 --- a/website/content/ChapterFour/0826.Most-Profit-Assigning-Work.md +++ b/website/content/ChapterFour/0800~0899/0826.Most-Profit-Assigning-Work.md @@ -109,6 +109,6 @@ func maxProfitAssignment(difficulty []int, profit []int, worker []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String.md b/website/content/ChapterFour/0800~0899/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String.md similarity index 95% rename from website/content/ChapterFour/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String.md rename to website/content/ChapterFour/0800~0899/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String.md index c60e35a1..6f5f28d4 100644 --- a/website/content/ChapterFour/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String.md +++ b/website/content/ChapterFour/0800~0899/0828.Count-Unique-Characters-of-All-Substrings-of-a-Given-String.md @@ -103,6 +103,6 @@ func uniqueLetterString1(S string) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0830.Positions-of-Large-Groups.md b/website/content/ChapterFour/0800~0899/0830.Positions-of-Large-Groups.md similarity index 90% rename from website/content/ChapterFour/0830.Positions-of-Large-Groups.md rename to website/content/ChapterFour/0800~0899/0830.Positions-of-Large-Groups.md index 3fdced6d..5efa20ed 100644 --- a/website/content/ChapterFour/0830.Positions-of-Large-Groups.md +++ b/website/content/ChapterFour/0800~0899/0830.Positions-of-Large-Groups.md @@ -82,6 +82,6 @@ func largeGroupPositions(S string) [][]int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0832.Flipping-an-Image.md b/website/content/ChapterFour/0800~0899/0832.Flipping-an-Image.md similarity index 89% rename from website/content/ChapterFour/0832.Flipping-an-Image.md rename to website/content/ChapterFour/0800~0899/0832.Flipping-an-Image.md index 50bf028f..3c3bc5aa 100644 --- a/website/content/ChapterFour/0832.Flipping-an-Image.md +++ b/website/content/ChapterFour/0800~0899/0832.Flipping-an-Image.md @@ -65,6 +65,6 @@ func flipAndInvertImage(A [][]int) [][]int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0834.Sum-of-Distances-in-Tree.md b/website/content/ChapterFour/0800~0899/0834.Sum-of-Distances-in-Tree.md similarity index 95% rename from website/content/ChapterFour/0834.Sum-of-Distances-in-Tree.md rename to website/content/ChapterFour/0800~0899/0834.Sum-of-Distances-in-Tree.md index d6a010e8..f4c5a049 100755 --- a/website/content/ChapterFour/0834.Sum-of-Distances-in-Tree.md +++ b/website/content/ChapterFour/0800~0899/0834.Sum-of-Distances-in-Tree.md @@ -103,6 +103,6 @@ func deepSecondSearch(root int, visited []bool, count, res []int, tree [][]int) ---------------------------------------------- diff --git a/website/content/ChapterFour/0836.Rectangle-Overlap.md b/website/content/ChapterFour/0800~0899/0836.Rectangle-Overlap.md similarity index 87% rename from website/content/ChapterFour/0836.Rectangle-Overlap.md rename to website/content/ChapterFour/0800~0899/0836.Rectangle-Overlap.md index 986dda6e..0475596b 100755 --- a/website/content/ChapterFour/0836.Rectangle-Overlap.md +++ b/website/content/ChapterFour/0800~0899/0836.Rectangle-Overlap.md @@ -56,6 +56,6 @@ func isRectangleOverlap(rec1 []int, rec2 []int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0838.Push-Dominoes.md b/website/content/ChapterFour/0800~0899/0838.Push-Dominoes.md similarity index 93% rename from website/content/ChapterFour/0838.Push-Dominoes.md rename to website/content/ChapterFour/0800~0899/0838.Push-Dominoes.md index 548a2bac..773914ef 100644 --- a/website/content/ChapterFour/0838.Push-Dominoes.md +++ b/website/content/ChapterFour/0800~0899/0838.Push-Dominoes.md @@ -146,6 +146,6 @@ func pushDominoes1(dominoes string) string { ---------------------------------------------- diff --git a/website/content/ChapterFour/0839.Similar-String-Groups.md b/website/content/ChapterFour/0800~0899/0839.Similar-String-Groups.md similarity index 94% rename from website/content/ChapterFour/0839.Similar-String-Groups.md rename to website/content/ChapterFour/0800~0899/0839.Similar-String-Groups.md index e1ad098b..ed2f2242 100755 --- a/website/content/ChapterFour/0839.Similar-String-Groups.md +++ b/website/content/ChapterFour/0800~0899/0839.Similar-String-Groups.md @@ -100,6 +100,6 @@ func isSimilar(a, b string) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0841.Keys-and-Rooms.md b/website/content/ChapterFour/0800~0899/0841.Keys-and-Rooms.md similarity index 91% rename from website/content/ChapterFour/0841.Keys-and-Rooms.md rename to website/content/ChapterFour/0800~0899/0841.Keys-and-Rooms.md index b7f3e74a..8e4f23f9 100644 --- a/website/content/ChapterFour/0841.Keys-and-Rooms.md +++ b/website/content/ChapterFour/0800~0899/0841.Keys-and-Rooms.md @@ -82,6 +82,6 @@ func dfsVisitAllRooms(es [][]int, visited map[int]bool, from int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0842.Split-Array-into-Fibonacci-Sequence.md b/website/content/ChapterFour/0800~0899/0842.Split-Array-into-Fibonacci-Sequence.md similarity index 94% rename from website/content/ChapterFour/0842.Split-Array-into-Fibonacci-Sequence.md rename to website/content/ChapterFour/0800~0899/0842.Split-Array-into-Fibonacci-Sequence.md index 6326d234..a50cc2f3 100755 --- a/website/content/ChapterFour/0842.Split-Array-into-Fibonacci-Sequence.md +++ b/website/content/ChapterFour/0800~0899/0842.Split-Array-into-Fibonacci-Sequence.md @@ -137,6 +137,6 @@ func findRecursiveCheck(S string, x1 int, x2 int, left int, res *[]int, isComple ---------------------------------------------- diff --git a/website/content/ChapterFour/0844.Backspace-String-Compare.md b/website/content/ChapterFour/0800~0899/0844.Backspace-String-Compare.md similarity index 86% rename from website/content/ChapterFour/0844.Backspace-String-Compare.md rename to website/content/ChapterFour/0800~0899/0844.Backspace-String-Compare.md index 2ecbe11f..6adcab29 100644 --- a/website/content/ChapterFour/0844.Backspace-String-Compare.md +++ b/website/content/ChapterFour/0800~0899/0844.Backspace-String-Compare.md @@ -113,6 +113,6 @@ func backspaceCompare(S string, T string) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0845.Longest-Mountain-in-Array.md b/website/content/ChapterFour/0800~0899/0845.Longest-Mountain-in-Array.md similarity index 88% rename from website/content/ChapterFour/0845.Longest-Mountain-in-Array.md rename to website/content/ChapterFour/0800~0899/0845.Longest-Mountain-in-Array.md index 9379ea68..d0270ed5 100644 --- a/website/content/ChapterFour/0845.Longest-Mountain-in-Array.md +++ b/website/content/ChapterFour/0800~0899/0845.Longest-Mountain-in-Array.md @@ -93,6 +93,6 @@ func longestMountain(A []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0850.Rectangle-Area-II.md b/website/content/ChapterFour/0800~0899/0850.Rectangle-Area-II.md similarity index 98% rename from website/content/ChapterFour/0850.Rectangle-Area-II.md rename to website/content/ChapterFour/0800~0899/0850.Rectangle-Area-II.md index 149bcf13..965f4da0 100755 --- a/website/content/ChapterFour/0850.Rectangle-Area-II.md +++ b/website/content/ChapterFour/0800~0899/0850.Rectangle-Area-II.md @@ -295,6 +295,6 @@ func (sat *SegmentAreaTree) updateInTree(treeIndex, left, right, updateLeft, upd ---------------------------------------------- diff --git a/website/content/ChapterFour/0851.Loud-and-Rich.md b/website/content/ChapterFour/0800~0899/0851.Loud-and-Rich.md similarity index 94% rename from website/content/ChapterFour/0851.Loud-and-Rich.md rename to website/content/ChapterFour/0800~0899/0851.Loud-and-Rich.md index fbe44627..ca43a9ef 100644 --- a/website/content/ChapterFour/0851.Loud-and-Rich.md +++ b/website/content/ChapterFour/0800~0899/0851.Loud-and-Rich.md @@ -110,6 +110,6 @@ func loudAndRich(richer [][]int, quiet []int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0852.Peak-Index-in-a-Mountain-Array.md b/website/content/ChapterFour/0800~0899/0852.Peak-Index-in-a-Mountain-Array.md similarity index 91% rename from website/content/ChapterFour/0852.Peak-Index-in-a-Mountain-Array.md rename to website/content/ChapterFour/0800~0899/0852.Peak-Index-in-a-Mountain-Array.md index 0948ede4..12aa32de 100755 --- a/website/content/ChapterFour/0852.Peak-Index-in-a-Mountain-Array.md +++ b/website/content/ChapterFour/0800~0899/0852.Peak-Index-in-a-Mountain-Array.md @@ -93,6 +93,6 @@ func peakIndexInMountainArray1(A []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0853.Car-Fleet.md b/website/content/ChapterFour/0800~0899/0853.Car-Fleet.md similarity index 93% rename from website/content/ChapterFour/0853.Car-Fleet.md rename to website/content/ChapterFour/0800~0899/0853.Car-Fleet.md index bb13b0d5..b3532036 100755 --- a/website/content/ChapterFour/0853.Car-Fleet.md +++ b/website/content/ChapterFour/0800~0899/0853.Car-Fleet.md @@ -100,6 +100,6 @@ func carFleet(target int, position []int, speed []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0856.Score-of-Parentheses.md b/website/content/ChapterFour/0800~0899/0856.Score-of-Parentheses.md similarity index 88% rename from website/content/ChapterFour/0856.Score-of-Parentheses.md rename to website/content/ChapterFour/0800~0899/0856.Score-of-Parentheses.md index 7c810458..1b7546ca 100644 --- a/website/content/ChapterFour/0856.Score-of-Parentheses.md +++ b/website/content/ChapterFour/0800~0899/0856.Score-of-Parentheses.md @@ -104,6 +104,6 @@ func scoreOfParentheses(S string) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0862.Shortest-Subarray-with-Sum-at-Least-K.md b/website/content/ChapterFour/0800~0899/0862.Shortest-Subarray-with-Sum-at-Least-K.md similarity index 94% rename from website/content/ChapterFour/0862.Shortest-Subarray-with-Sum-at-Least-K.md rename to website/content/ChapterFour/0800~0899/0862.Shortest-Subarray-with-Sum-at-Least-K.md index 0bd92651..a1079dfd 100644 --- a/website/content/ChapterFour/0862.Shortest-Subarray-with-Sum-at-Least-K.md +++ b/website/content/ChapterFour/0800~0899/0862.Shortest-Subarray-with-Sum-at-Least-K.md @@ -92,6 +92,6 @@ func shortestSubarray(A []int, K int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0863.All-Nodes-Distance-K-in-Binary-Tree.md b/website/content/ChapterFour/0800~0899/0863.All-Nodes-Distance-K-in-Binary-Tree.md similarity index 91% rename from website/content/ChapterFour/0863.All-Nodes-Distance-K-in-Binary-Tree.md rename to website/content/ChapterFour/0800~0899/0863.All-Nodes-Distance-K-in-Binary-Tree.md index c212698a..2944f0e1 100644 --- a/website/content/ChapterFour/0863.All-Nodes-Distance-K-in-Binary-Tree.md +++ b/website/content/ChapterFour/0800~0899/0863.All-Nodes-Distance-K-in-Binary-Tree.md @@ -98,6 +98,6 @@ func findChild(root *TreeNode, K int, visit *[]int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0864.Shortest-Path-to-Get-All-Keys.md b/website/content/ChapterFour/0800~0899/0864.Shortest-Path-to-Get-All-Keys.md similarity index 96% rename from website/content/ChapterFour/0864.Shortest-Path-to-Get-All-Keys.md rename to website/content/ChapterFour/0800~0899/0864.Shortest-Path-to-Get-All-Keys.md index b9dcafd7..7c05689b 100755 --- a/website/content/ChapterFour/0864.Shortest-Path-to-Get-All-Keys.md +++ b/website/content/ChapterFour/0800~0899/0864.Shortest-Path-to-Get-All-Keys.md @@ -233,6 +233,6 @@ func isKey(board [][]byte, x, y int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0867.Transpose-Matrix.md b/website/content/ChapterFour/0800~0899/0867.Transpose-Matrix.md similarity index 83% rename from website/content/ChapterFour/0867.Transpose-Matrix.md rename to website/content/ChapterFour/0800~0899/0867.Transpose-Matrix.md index b9a42775..8947ba83 100755 --- a/website/content/ChapterFour/0867.Transpose-Matrix.md +++ b/website/content/ChapterFour/0800~0899/0867.Transpose-Matrix.md @@ -59,6 +59,6 @@ func transpose(A [][]int) [][]int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0872.Leaf-Similar-Trees.md b/website/content/ChapterFour/0800~0899/0872.Leaf-Similar-Trees.md similarity index 90% rename from website/content/ChapterFour/0872.Leaf-Similar-Trees.md rename to website/content/ChapterFour/0800~0899/0872.Leaf-Similar-Trees.md index bce16f6b..ae1cbeb2 100644 --- a/website/content/ChapterFour/0872.Leaf-Similar-Trees.md +++ b/website/content/ChapterFour/0800~0899/0872.Leaf-Similar-Trees.md @@ -64,6 +64,6 @@ func dfsLeaf(root *TreeNode, leaf *[]int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0875.Koko-Eating-Bananas.md b/website/content/ChapterFour/0800~0899/0875.Koko-Eating-Bananas.md similarity index 92% rename from website/content/ChapterFour/0875.Koko-Eating-Bananas.md rename to website/content/ChapterFour/0800~0899/0875.Koko-Eating-Bananas.md index 7da578f7..0eeb2e40 100755 --- a/website/content/ChapterFour/0875.Koko-Eating-Bananas.md +++ b/website/content/ChapterFour/0800~0899/0875.Koko-Eating-Bananas.md @@ -103,6 +103,6 @@ func maxInArr(xs []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0876.Middle-of-the-Linked-List.md b/website/content/ChapterFour/0800~0899/0876.Middle-of-the-Linked-List.md similarity index 89% rename from website/content/ChapterFour/0876.Middle-of-the-Linked-List.md rename to website/content/ChapterFour/0800~0899/0876.Middle-of-the-Linked-List.md index e4532487..fb584c8d 100644 --- a/website/content/ChapterFour/0876.Middle-of-the-Linked-List.md +++ b/website/content/ChapterFour/0800~0899/0876.Middle-of-the-Linked-List.md @@ -84,6 +84,6 @@ func middleNode(head *ListNode) *ListNode { ---------------------------------------------- diff --git a/website/content/ChapterFour/0878.Nth-Magical-Number.md b/website/content/ChapterFour/0800~0899/0878.Nth-Magical-Number.md similarity index 87% rename from website/content/ChapterFour/0878.Nth-Magical-Number.md rename to website/content/ChapterFour/0800~0899/0878.Nth-Magical-Number.md index 7dc186cc..ae40b10b 100755 --- a/website/content/ChapterFour/0878.Nth-Magical-Number.md +++ b/website/content/ChapterFour/0800~0899/0878.Nth-Magical-Number.md @@ -83,6 +83,6 @@ func calNthMagicalCount(num, a, b int64) int64 { ---------------------------------------------- diff --git a/website/content/ChapterFour/0880.Decoded-String-at-Index.md b/website/content/ChapterFour/0800~0899/0880.Decoded-String-at-Index.md similarity index 91% rename from website/content/ChapterFour/0880.Decoded-String-at-Index.md rename to website/content/ChapterFour/0800~0899/0880.Decoded-String-at-Index.md index e1f0e0b1..08ca3315 100644 --- a/website/content/ChapterFour/0880.Decoded-String-at-Index.md +++ b/website/content/ChapterFour/0800~0899/0880.Decoded-String-at-Index.md @@ -106,6 +106,6 @@ func decodeAtIndex(S string, K int) string { ---------------------------------------------- diff --git a/website/content/ChapterFour/0881.Boats-to-Save-People.md b/website/content/ChapterFour/0800~0899/0881.Boats-to-Save-People.md similarity index 87% rename from website/content/ChapterFour/0881.Boats-to-Save-People.md rename to website/content/ChapterFour/0800~0899/0881.Boats-to-Save-People.md index a42fd693..ddc07e9f 100644 --- a/website/content/ChapterFour/0881.Boats-to-Save-People.md +++ b/website/content/ChapterFour/0800~0899/0881.Boats-to-Save-People.md @@ -92,6 +92,6 @@ func numRescueBoats(people []int, limit int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0884.Uncommon-Words-from-Two-Sentences.md b/website/content/ChapterFour/0800~0899/0884.Uncommon-Words-from-Two-Sentences.md similarity index 88% rename from website/content/ChapterFour/0884.Uncommon-Words-from-Two-Sentences.md rename to website/content/ChapterFour/0800~0899/0884.Uncommon-Words-from-Two-Sentences.md index cf2505db..40c26024 100755 --- a/website/content/ChapterFour/0884.Uncommon-Words-from-Two-Sentences.md +++ b/website/content/ChapterFour/0800~0899/0884.Uncommon-Words-from-Two-Sentences.md @@ -68,6 +68,6 @@ func uncommonFromSentences(A string, B string) []string { ---------------------------------------------- diff --git a/website/content/ChapterFour/0885.Spiral-Matrix-III.md b/website/content/ChapterFour/0800~0899/0885.Spiral-Matrix-III.md similarity index 92% rename from website/content/ChapterFour/0885.Spiral-Matrix-III.md rename to website/content/ChapterFour/0800~0899/0885.Spiral-Matrix-III.md index 9e57b2b0..48444a0d 100755 --- a/website/content/ChapterFour/0885.Spiral-Matrix-III.md +++ b/website/content/ChapterFour/0800~0899/0885.Spiral-Matrix-III.md @@ -86,6 +86,6 @@ func spiralMatrixIII(R int, C int, r0 int, c0 int) [][]int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0887.Super-Egg-Drop.md b/website/content/ChapterFour/0800~0899/0887.Super-Egg-Drop.md similarity index 97% rename from website/content/ChapterFour/0887.Super-Egg-Drop.md rename to website/content/ChapterFour/0800~0899/0887.Super-Egg-Drop.md index d7508003..1e167223 100755 --- a/website/content/ChapterFour/0887.Super-Egg-Drop.md +++ b/website/content/ChapterFour/0800~0899/0887.Super-Egg-Drop.md @@ -147,6 +147,6 @@ func superEggDrop1(K int, N int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0888.Fair-Candy-Swap.md b/website/content/ChapterFour/0800~0899/0888.Fair-Candy-Swap.md similarity index 93% rename from website/content/ChapterFour/0888.Fair-Candy-Swap.md rename to website/content/ChapterFour/0800~0899/0888.Fair-Candy-Swap.md index 5e805037..4c5a9e21 100644 --- a/website/content/ChapterFour/0888.Fair-Candy-Swap.md +++ b/website/content/ChapterFour/0800~0899/0888.Fair-Candy-Swap.md @@ -112,6 +112,6 @@ func max(a, b int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0891.Sum-of-Subsequence-Widths.md b/website/content/ChapterFour/0800~0899/0891.Sum-of-Subsequence-Widths.md similarity index 91% rename from website/content/ChapterFour/0891.Sum-of-Subsequence-Widths.md rename to website/content/ChapterFour/0800~0899/0891.Sum-of-Subsequence-Widths.md index b8cf2e13..7a75c042 100644 --- a/website/content/ChapterFour/0891.Sum-of-Subsequence-Widths.md +++ b/website/content/ChapterFour/0800~0899/0891.Sum-of-Subsequence-Widths.md @@ -70,6 +70,6 @@ func sumSubseqWidths(A []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0892.Surface-Area-of-3D-Shapes.md b/website/content/ChapterFour/0800~0899/0892.Surface-Area-of-3D-Shapes.md similarity index 88% rename from website/content/ChapterFour/0892.Surface-Area-of-3D-Shapes.md rename to website/content/ChapterFour/0800~0899/0892.Surface-Area-of-3D-Shapes.md index 0ffd62dc..9fa02621 100644 --- a/website/content/ChapterFour/0892.Surface-Area-of-3D-Shapes.md +++ b/website/content/ChapterFour/0800~0899/0892.Surface-Area-of-3D-Shapes.md @@ -110,6 +110,6 @@ func min(a, b int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0895.Maximum-Frequency-Stack.md b/website/content/ChapterFour/0800~0899/0895.Maximum-Frequency-Stack.md similarity index 92% rename from website/content/ChapterFour/0895.Maximum-Frequency-Stack.md rename to website/content/ChapterFour/0800~0899/0895.Maximum-Frequency-Stack.md index 776d3184..06911750 100644 --- a/website/content/ChapterFour/0895.Maximum-Frequency-Stack.md +++ b/website/content/ChapterFour/0800~0899/0895.Maximum-Frequency-Stack.md @@ -115,6 +115,6 @@ func (this *FreqStack) Pop() int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0896.Monotonic-Array.md b/website/content/ChapterFour/0800~0899/0896.Monotonic-Array.md similarity index 87% rename from website/content/ChapterFour/0896.Monotonic-Array.md rename to website/content/ChapterFour/0800~0899/0896.Monotonic-Array.md index 56eddaa0..93101750 100644 --- a/website/content/ChapterFour/0896.Monotonic-Array.md +++ b/website/content/ChapterFour/0800~0899/0896.Monotonic-Array.md @@ -101,6 +101,6 @@ func dec(A []int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0897.Increasing-Order-Search-Tree.md b/website/content/ChapterFour/0800~0899/0897.Increasing-Order-Search-Tree.md similarity index 93% rename from website/content/ChapterFour/0897.Increasing-Order-Search-Tree.md rename to website/content/ChapterFour/0800~0899/0897.Increasing-Order-Search-Tree.md index f0639a17..cfac7507 100755 --- a/website/content/ChapterFour/0897.Increasing-Order-Search-Tree.md +++ b/website/content/ChapterFour/0800~0899/0897.Increasing-Order-Search-Tree.md @@ -125,6 +125,6 @@ func inorder(root *TreeNode, output *[]int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0898.Bitwise-ORs-of-Subarrays.md b/website/content/ChapterFour/0800~0899/0898.Bitwise-ORs-of-Subarrays.md similarity index 93% rename from website/content/ChapterFour/0898.Bitwise-ORs-of-Subarrays.md rename to website/content/ChapterFour/0800~0899/0898.Bitwise-ORs-of-Subarrays.md index c17418d4..bf494c57 100755 --- a/website/content/ChapterFour/0898.Bitwise-ORs-of-Subarrays.md +++ b/website/content/ChapterFour/0800~0899/0898.Bitwise-ORs-of-Subarrays.md @@ -145,6 +145,6 @@ func subarrayBitwiseORs1(A []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0800~0899/_index.md b/website/content/ChapterFour/0800~0899/_index.md new file mode 100644 index 00000000..d2021683 --- /dev/null +++ b/website/content/ChapterFour/0800~0899/_index.md @@ -0,0 +1,5 @@ +--- +bookCollapseSection: true +weight: 20 +--- + diff --git a/website/content/ChapterFour/0901.Online-Stock-Span.md b/website/content/ChapterFour/0900~0999/0901.Online-Stock-Span.md similarity index 92% rename from website/content/ChapterFour/0901.Online-Stock-Span.md rename to website/content/ChapterFour/0900~0999/0901.Online-Stock-Span.md index b85244d1..b9d82c95 100644 --- a/website/content/ChapterFour/0901.Online-Stock-Span.md +++ b/website/content/ChapterFour/0900~0999/0901.Online-Stock-Span.md @@ -113,6 +113,6 @@ func (this *StockSpanner) Next(price int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0904.Fruit-Into-Baskets.md b/website/content/ChapterFour/0900~0999/0904.Fruit-Into-Baskets.md similarity index 92% rename from website/content/ChapterFour/0904.Fruit-Into-Baskets.md rename to website/content/ChapterFour/0900~0999/0904.Fruit-Into-Baskets.md index 95079e7f..7f155d1b 100644 --- a/website/content/ChapterFour/0904.Fruit-Into-Baskets.md +++ b/website/content/ChapterFour/0900~0999/0904.Fruit-Into-Baskets.md @@ -117,6 +117,6 @@ func totalFruit(tree []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0907.Sum-of-Subarray-Minimums.md b/website/content/ChapterFour/0900~0999/0907.Sum-of-Subarray-Minimums.md similarity index 97% rename from website/content/ChapterFour/0907.Sum-of-Subarray-Minimums.md rename to website/content/ChapterFour/0900~0999/0907.Sum-of-Subarray-Minimums.md index 21544292..abf0341b 100644 --- a/website/content/ChapterFour/0907.Sum-of-Subarray-Minimums.md +++ b/website/content/ChapterFour/0900~0999/0907.Sum-of-Subarray-Minimums.md @@ -126,6 +126,6 @@ func sumSubarrayMins2(A []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0910.Smallest-Range-II.md b/website/content/ChapterFour/0900~0999/0910.Smallest-Range-II.md similarity index 88% rename from website/content/ChapterFour/0910.Smallest-Range-II.md rename to website/content/ChapterFour/0900~0999/0910.Smallest-Range-II.md index 82794f39..69ca991f 100644 --- a/website/content/ChapterFour/0910.Smallest-Range-II.md +++ b/website/content/ChapterFour/0900~0999/0910.Smallest-Range-II.md @@ -84,6 +84,6 @@ func min(a, b int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0911.Online-Election.md b/website/content/ChapterFour/0900~0999/0911.Online-Election.md similarity index 93% rename from website/content/ChapterFour/0911.Online-Election.md rename to website/content/ChapterFour/0900~0999/0911.Online-Election.md index eedcb5c8..a00cd736 100755 --- a/website/content/ChapterFour/0911.Online-Election.md +++ b/website/content/ChapterFour/0900~0999/0911.Online-Election.md @@ -101,6 +101,6 @@ func (tvc *TopVotedCandidate) Q(t int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0914.X-of-a-Kind-in-a-Deck-of-Cards.md b/website/content/ChapterFour/0900~0999/0914.X-of-a-Kind-in-a-Deck-of-Cards.md similarity index 91% rename from website/content/ChapterFour/0914.X-of-a-Kind-in-a-Deck-of-Cards.md rename to website/content/ChapterFour/0900~0999/0914.X-of-a-Kind-in-a-Deck-of-Cards.md index 8c1ad0f3..dbba1a2c 100644 --- a/website/content/ChapterFour/0914.X-of-a-Kind-in-a-Deck-of-Cards.md +++ b/website/content/ChapterFour/0900~0999/0914.X-of-a-Kind-in-a-Deck-of-Cards.md @@ -107,6 +107,6 @@ func gcd(a, b int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0918.Maximum-Sum-Circular-Subarray.md b/website/content/ChapterFour/0900~0999/0918.Maximum-Sum-Circular-Subarray.md similarity index 94% rename from website/content/ChapterFour/0918.Maximum-Sum-Circular-Subarray.md rename to website/content/ChapterFour/0900~0999/0918.Maximum-Sum-Circular-Subarray.md index 6f2526d7..94930041 100755 --- a/website/content/ChapterFour/0918.Maximum-Sum-Circular-Subarray.md +++ b/website/content/ChapterFour/0900~0999/0918.Maximum-Sum-Circular-Subarray.md @@ -103,6 +103,6 @@ func kadane(a []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0920.Number-of-Music-Playlists.md b/website/content/ChapterFour/0900~0999/0920.Number-of-Music-Playlists.md similarity index 94% rename from website/content/ChapterFour/0920.Number-of-Music-Playlists.md rename to website/content/ChapterFour/0900~0999/0920.Number-of-Music-Playlists.md index cd023864..27e21445 100755 --- a/website/content/ChapterFour/0920.Number-of-Music-Playlists.md +++ b/website/content/ChapterFour/0900~0999/0920.Number-of-Music-Playlists.md @@ -87,6 +87,6 @@ func numMusicPlaylists(N int, L int, K int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0921.Minimum-Add-to-Make-Parentheses-Valid.md b/website/content/ChapterFour/0900~0999/0921.Minimum-Add-to-Make-Parentheses-Valid.md similarity index 87% rename from website/content/ChapterFour/0921.Minimum-Add-to-Make-Parentheses-Valid.md rename to website/content/ChapterFour/0900~0999/0921.Minimum-Add-to-Make-Parentheses-Valid.md index d634ca3d..f11d433e 100644 --- a/website/content/ChapterFour/0921.Minimum-Add-to-Make-Parentheses-Valid.md +++ b/website/content/ChapterFour/0900~0999/0921.Minimum-Add-to-Make-Parentheses-Valid.md @@ -90,6 +90,6 @@ func minAddToMakeValid(S string) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0922.Sort-Array-By-Parity-II.md b/website/content/ChapterFour/0900~0999/0922.Sort-Array-By-Parity-II.md similarity index 83% rename from website/content/ChapterFour/0922.Sort-Array-By-Parity-II.md rename to website/content/ChapterFour/0900~0999/0922.Sort-Array-By-Parity-II.md index 1b315cbb..c89384dd 100644 --- a/website/content/ChapterFour/0922.Sort-Array-By-Parity-II.md +++ b/website/content/ChapterFour/0900~0999/0922.Sort-Array-By-Parity-II.md @@ -63,6 +63,6 @@ func sortArrayByParityII(A []int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0923.3Sum-With-Multiplicity.md b/website/content/ChapterFour/0900~0999/0923.3Sum-With-Multiplicity.md similarity index 90% rename from website/content/ChapterFour/0923.3Sum-With-Multiplicity.md rename to website/content/ChapterFour/0900~0999/0923.3Sum-With-Multiplicity.md index b10b767f..6cacce75 100644 --- a/website/content/ChapterFour/0923.3Sum-With-Multiplicity.md +++ b/website/content/ChapterFour/0900~0999/0923.3Sum-With-Multiplicity.md @@ -104,6 +104,6 @@ func threeSumMulti(A []int, target int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0924.Minimize-Malware-Spread.md b/website/content/ChapterFour/0900~0999/0924.Minimize-Malware-Spread.md similarity index 94% rename from website/content/ChapterFour/0924.Minimize-Malware-Spread.md rename to website/content/ChapterFour/0900~0999/0924.Minimize-Malware-Spread.md index 3b4fb596..ad9b7f5f 100755 --- a/website/content/ChapterFour/0924.Minimize-Malware-Spread.md +++ b/website/content/ChapterFour/0900~0999/0924.Minimize-Malware-Spread.md @@ -107,6 +107,6 @@ func minMalwareSpread(graph [][]int, initial []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0925.Long-Pressed-Name.md b/website/content/ChapterFour/0900~0999/0925.Long-Pressed-Name.md similarity index 91% rename from website/content/ChapterFour/0925.Long-Pressed-Name.md rename to website/content/ChapterFour/0900~0999/0925.Long-Pressed-Name.md index 4025899b..1634e060 100644 --- a/website/content/ChapterFour/0925.Long-Pressed-Name.md +++ b/website/content/ChapterFour/0900~0999/0925.Long-Pressed-Name.md @@ -109,6 +109,6 @@ func isLongPressedName(name string, typed string) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0927.Three-Equal-Parts.md b/website/content/ChapterFour/0900~0999/0927.Three-Equal-Parts.md similarity index 93% rename from website/content/ChapterFour/0927.Three-Equal-Parts.md rename to website/content/ChapterFour/0900~0999/0927.Three-Equal-Parts.md index d0f0979e..9cdabc5d 100755 --- a/website/content/ChapterFour/0927.Three-Equal-Parts.md +++ b/website/content/ChapterFour/0900~0999/0927.Three-Equal-Parts.md @@ -115,6 +115,6 @@ func threeEqualParts(A []int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0928.Minimize-Malware-Spread-II.md b/website/content/ChapterFour/0900~0999/0928.Minimize-Malware-Spread-II.md similarity index 96% rename from website/content/ChapterFour/0928.Minimize-Malware-Spread-II.md rename to website/content/ChapterFour/0900~0999/0928.Minimize-Malware-Spread-II.md index 22e9f45e..16819d5e 100755 --- a/website/content/ChapterFour/0928.Minimize-Malware-Spread-II.md +++ b/website/content/ChapterFour/0900~0999/0928.Minimize-Malware-Spread-II.md @@ -139,6 +139,6 @@ func minMalwareSpread2(graph [][]int, initial []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0930.Binary-Subarrays-With-Sum.md b/website/content/ChapterFour/0900~0999/0930.Binary-Subarrays-With-Sum.md similarity index 88% rename from website/content/ChapterFour/0930.Binary-Subarrays-With-Sum.md rename to website/content/ChapterFour/0900~0999/0930.Binary-Subarrays-With-Sum.md index 265f9b31..b79ee160 100644 --- a/website/content/ChapterFour/0930.Binary-Subarrays-With-Sum.md +++ b/website/content/ChapterFour/0900~0999/0930.Binary-Subarrays-With-Sum.md @@ -67,6 +67,6 @@ func numSubarraysWithSum(A []int, S int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0933.Number-of-Recent-Calls.md b/website/content/ChapterFour/0900~0999/0933.Number-of-Recent-Calls.md similarity index 90% rename from website/content/ChapterFour/0933.Number-of-Recent-Calls.md rename to website/content/ChapterFour/0900~0999/0933.Number-of-Recent-Calls.md index 44cf1056..5067df81 100644 --- a/website/content/ChapterFour/0933.Number-of-Recent-Calls.md +++ b/website/content/ChapterFour/0900~0999/0933.Number-of-Recent-Calls.md @@ -76,6 +76,6 @@ func (this *RecentCounter) Ping(t int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0942.DI-String-Match.md b/website/content/ChapterFour/0900~0999/0942.DI-String-Match.md similarity index 87% rename from website/content/ChapterFour/0942.DI-String-Match.md rename to website/content/ChapterFour/0900~0999/0942.DI-String-Match.md index 7254de73..ae0835b0 100755 --- a/website/content/ChapterFour/0942.DI-String-Match.md +++ b/website/content/ChapterFour/0900~0999/0942.DI-String-Match.md @@ -75,6 +75,6 @@ func diStringMatch(S string) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0946.Validate-Stack-Sequences.md b/website/content/ChapterFour/0900~0999/0946.Validate-Stack-Sequences.md similarity index 87% rename from website/content/ChapterFour/0946.Validate-Stack-Sequences.md rename to website/content/ChapterFour/0900~0999/0946.Validate-Stack-Sequences.md index 7794c71b..6b316fd5 100644 --- a/website/content/ChapterFour/0946.Validate-Stack-Sequences.md +++ b/website/content/ChapterFour/0900~0999/0946.Validate-Stack-Sequences.md @@ -70,6 +70,6 @@ func validateStackSequences(pushed []int, popped []int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0947.Most-Stones-Removed-with-Same-Row-or-Column.md b/website/content/ChapterFour/0900~0999/0947.Most-Stones-Removed-with-Same-Row-or-Column.md similarity index 92% rename from website/content/ChapterFour/0947.Most-Stones-Removed-with-Same-Row-or-Column.md rename to website/content/ChapterFour/0900~0999/0947.Most-Stones-Removed-with-Same-Row-or-Column.md index b976171e..215f957e 100755 --- a/website/content/ChapterFour/0947.Most-Stones-Removed-with-Same-Row-or-Column.md +++ b/website/content/ChapterFour/0900~0999/0947.Most-Stones-Removed-with-Same-Row-or-Column.md @@ -84,6 +84,6 @@ func removeStones(stones [][]int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0949.Largest-Time-for-Given-Digits.md b/website/content/ChapterFour/0900~0999/0949.Largest-Time-for-Given-Digits.md similarity index 88% rename from website/content/ChapterFour/0949.Largest-Time-for-Given-Digits.md rename to website/content/ChapterFour/0900~0999/0949.Largest-Time-for-Given-Digits.md index 6ec4fffa..4dee6fdb 100644 --- a/website/content/ChapterFour/0949.Largest-Time-for-Given-Digits.md +++ b/website/content/ChapterFour/0900~0999/0949.Largest-Time-for-Given-Digits.md @@ -80,6 +80,6 @@ func largestTimeFromDigits(A []int) string { ---------------------------------------------- diff --git a/website/content/ChapterFour/0952.Largest-Component-Size-by-Common-Factor.md b/website/content/ChapterFour/0900~0999/0952.Largest-Component-Size-by-Common-Factor.md similarity index 93% rename from website/content/ChapterFour/0952.Largest-Component-Size-by-Common-Factor.md rename to website/content/ChapterFour/0900~0999/0952.Largest-Component-Size-by-Common-Factor.md index 85c83482..48a6fda3 100755 --- a/website/content/ChapterFour/0952.Largest-Component-Size-by-Common-Factor.md +++ b/website/content/ChapterFour/0900~0999/0952.Largest-Component-Size-by-Common-Factor.md @@ -121,6 +121,6 @@ func largestComponentSize1(A []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0953.Verifying-an-Alien-Dictionary.md b/website/content/ChapterFour/0900~0999/0953.Verifying-an-Alien-Dictionary.md similarity index 91% rename from website/content/ChapterFour/0953.Verifying-an-Alien-Dictionary.md rename to website/content/ChapterFour/0900~0999/0953.Verifying-an-Alien-Dictionary.md index dfdde219..5d922cba 100755 --- a/website/content/ChapterFour/0953.Verifying-an-Alien-Dictionary.md +++ b/website/content/ChapterFour/0900~0999/0953.Verifying-an-Alien-Dictionary.md @@ -83,6 +83,6 @@ func isAlienSorted(words []string, order string) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0959.Regions-Cut-By-Slashes.md b/website/content/ChapterFour/0900~0999/0959.Regions-Cut-By-Slashes.md similarity index 94% rename from website/content/ChapterFour/0959.Regions-Cut-By-Slashes.md rename to website/content/ChapterFour/0900~0999/0959.Regions-Cut-By-Slashes.md index d9f8eed2..5b6f1314 100755 --- a/website/content/ChapterFour/0959.Regions-Cut-By-Slashes.md +++ b/website/content/ChapterFour/0900~0999/0959.Regions-Cut-By-Slashes.md @@ -152,6 +152,6 @@ func getFaceIdx(size, i, j, k int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0961.N-Repeated-Element-in-Size-2N-Array.md b/website/content/ChapterFour/0900~0999/0961.N-Repeated-Element-in-Size-2N-Array.md similarity index 84% rename from website/content/ChapterFour/0961.N-Repeated-Element-in-Size-2N-Array.md rename to website/content/ChapterFour/0900~0999/0961.N-Repeated-Element-in-Size-2N-Array.md index 5fe35e97..dcadf139 100755 --- a/website/content/ChapterFour/0961.N-Repeated-Element-in-Size-2N-Array.md +++ b/website/content/ChapterFour/0900~0999/0961.N-Repeated-Element-in-Size-2N-Array.md @@ -62,6 +62,6 @@ func repeatedNTimes(A []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0968.Binary-Tree-Cameras.md b/website/content/ChapterFour/0900~0999/0968.Binary-Tree-Cameras.md similarity index 93% rename from website/content/ChapterFour/0968.Binary-Tree-Cameras.md rename to website/content/ChapterFour/0900~0999/0968.Binary-Tree-Cameras.md index d11dbab5..668b10a5 100755 --- a/website/content/ChapterFour/0968.Binary-Tree-Cameras.md +++ b/website/content/ChapterFour/0900~0999/0968.Binary-Tree-Cameras.md @@ -105,6 +105,6 @@ func minCameraCoverDFS(root *TreeNode, res *int) status { ---------------------------------------------- diff --git a/website/content/ChapterFour/0969.Pancake-Sorting.md b/website/content/ChapterFour/0900~0999/0969.Pancake-Sorting.md similarity index 92% rename from website/content/ChapterFour/0969.Pancake-Sorting.md rename to website/content/ChapterFour/0900~0999/0969.Pancake-Sorting.md index 6755f805..29ed06f4 100644 --- a/website/content/ChapterFour/0969.Pancake-Sorting.md +++ b/website/content/ChapterFour/0900~0999/0969.Pancake-Sorting.md @@ -98,6 +98,6 @@ func find(nums []int, t int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0970.Powerful-Integers.md b/website/content/ChapterFour/0900~0999/0970.Powerful-Integers.md similarity index 89% rename from website/content/ChapterFour/0970.Powerful-Integers.md rename to website/content/ChapterFour/0900~0999/0970.Powerful-Integers.md index 95a7db75..9de26c3d 100755 --- a/website/content/ChapterFour/0970.Powerful-Integers.md +++ b/website/content/ChapterFour/0900~0999/0970.Powerful-Integers.md @@ -90,6 +90,6 @@ func pow(x, i int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0973.K-Closest-Points-to-Origin.md b/website/content/ChapterFour/0900~0999/0973.K-Closest-Points-to-Origin.md similarity index 87% rename from website/content/ChapterFour/0973.K-Closest-Points-to-Origin.md rename to website/content/ChapterFour/0900~0999/0973.K-Closest-Points-to-Origin.md index 77984f7e..ead750c1 100644 --- a/website/content/ChapterFour/0973.K-Closest-Points-to-Origin.md +++ b/website/content/ChapterFour/0900~0999/0973.K-Closest-Points-to-Origin.md @@ -73,6 +73,6 @@ func KClosest(points [][]int, K int) [][]int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0976.Largest-Perimeter-Triangle.md b/website/content/ChapterFour/0900~0999/0976.Largest-Perimeter-Triangle.md similarity index 84% rename from website/content/ChapterFour/0976.Largest-Perimeter-Triangle.md rename to website/content/ChapterFour/0900~0999/0976.Largest-Perimeter-Triangle.md index 078db7d9..02ade12a 100644 --- a/website/content/ChapterFour/0976.Largest-Perimeter-Triangle.md +++ b/website/content/ChapterFour/0900~0999/0976.Largest-Perimeter-Triangle.md @@ -80,6 +80,6 @@ func largestPerimeter(A []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0977.Squares-of-a-Sorted-Array.md b/website/content/ChapterFour/0900~0999/0977.Squares-of-a-Sorted-Array.md similarity index 87% rename from website/content/ChapterFour/0977.Squares-of-a-Sorted-Array.md rename to website/content/ChapterFour/0900~0999/0977.Squares-of-a-Sorted-Array.md index d02cfd81..3b279c16 100644 --- a/website/content/ChapterFour/0977.Squares-of-a-Sorted-Array.md +++ b/website/content/ChapterFour/0900~0999/0977.Squares-of-a-Sorted-Array.md @@ -88,6 +88,6 @@ func sortedSquares1(A []int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0978.Longest-Turbulent-Subarray.md b/website/content/ChapterFour/0900~0999/0978.Longest-Turbulent-Subarray.md similarity index 92% rename from website/content/ChapterFour/0978.Longest-Turbulent-Subarray.md rename to website/content/ChapterFour/0900~0999/0978.Longest-Turbulent-Subarray.md index 62ece5f2..bb760b0c 100755 --- a/website/content/ChapterFour/0978.Longest-Turbulent-Subarray.md +++ b/website/content/ChapterFour/0900~0999/0978.Longest-Turbulent-Subarray.md @@ -111,6 +111,6 @@ func maxTurbulenceSize1(A []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0979.Distribute-Coins-in-Binary-Tree.md b/website/content/ChapterFour/0900~0999/0979.Distribute-Coins-in-Binary-Tree.md similarity index 93% rename from website/content/ChapterFour/0979.Distribute-Coins-in-Binary-Tree.md rename to website/content/ChapterFour/0900~0999/0979.Distribute-Coins-in-Binary-Tree.md index 93872dbb..c76f6808 100755 --- a/website/content/ChapterFour/0979.Distribute-Coins-in-Binary-Tree.md +++ b/website/content/ChapterFour/0900~0999/0979.Distribute-Coins-in-Binary-Tree.md @@ -98,6 +98,6 @@ func distributeCoinsDFS(root *TreeNode, res *int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0980.Unique-Paths-III.md b/website/content/ChapterFour/0900~0999/0980.Unique-Paths-III.md similarity index 93% rename from website/content/ChapterFour/0980.Unique-Paths-III.md rename to website/content/ChapterFour/0900~0999/0980.Unique-Paths-III.md index 908e25c8..cd74994f 100755 --- a/website/content/ChapterFour/0980.Unique-Paths-III.md +++ b/website/content/ChapterFour/0900~0999/0980.Unique-Paths-III.md @@ -133,6 +133,6 @@ func findUniquePathIII(board [][]int, visited [][]bool, path []int, empty, start ---------------------------------------------- diff --git a/website/content/ChapterFour/0981.Time-Based-Key-Value-Store.md b/website/content/ChapterFour/0900~0999/0981.Time-Based-Key-Value-Store.md similarity index 95% rename from website/content/ChapterFour/0981.Time-Based-Key-Value-Store.md rename to website/content/ChapterFour/0900~0999/0981.Time-Based-Key-Value-Store.md index 4b5c51ff..4ef63e1d 100755 --- a/website/content/ChapterFour/0981.Time-Based-Key-Value-Store.md +++ b/website/content/ChapterFour/0900~0999/0981.Time-Based-Key-Value-Store.md @@ -126,6 +126,6 @@ func (t TimeMap) Get(key string, timestamp int) string { ---------------------------------------------- diff --git a/website/content/ChapterFour/0984.String-Without-AAA-or-BBB.md b/website/content/ChapterFour/0900~0999/0984.String-Without-AAA-or-BBB.md similarity index 89% rename from website/content/ChapterFour/0984.String-Without-AAA-or-BBB.md rename to website/content/ChapterFour/0900~0999/0984.String-Without-AAA-or-BBB.md index f8f8a7fb..df90e6f0 100755 --- a/website/content/ChapterFour/0984.String-Without-AAA-or-BBB.md +++ b/website/content/ChapterFour/0900~0999/0984.String-Without-AAA-or-BBB.md @@ -95,6 +95,6 @@ func strWithout3a3b(A int, B int) string { ---------------------------------------------- diff --git a/website/content/ChapterFour/0985.Sum-of-Even-Numbers-After-Queries.md b/website/content/ChapterFour/0900~0999/0985.Sum-of-Even-Numbers-After-Queries.md similarity index 91% rename from website/content/ChapterFour/0985.Sum-of-Even-Numbers-After-Queries.md rename to website/content/ChapterFour/0900~0999/0985.Sum-of-Even-Numbers-After-Queries.md index 53918c0e..07f6c748 100644 --- a/website/content/ChapterFour/0985.Sum-of-Even-Numbers-After-Queries.md +++ b/website/content/ChapterFour/0900~0999/0985.Sum-of-Even-Numbers-After-Queries.md @@ -74,6 +74,6 @@ func sumEvenAfterQueries(A []int, queries [][]int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0986.Interval-List-Intersections.md b/website/content/ChapterFour/0900~0999/0986.Interval-List-Intersections.md similarity index 89% rename from website/content/ChapterFour/0986.Interval-List-Intersections.md rename to website/content/ChapterFour/0900~0999/0986.Interval-List-Intersections.md index a33b523e..78aaafa3 100644 --- a/website/content/ChapterFour/0986.Interval-List-Intersections.md +++ b/website/content/ChapterFour/0900~0999/0986.Interval-List-Intersections.md @@ -75,6 +75,6 @@ func intervalIntersection(A []Interval, B []Interval) []Interval { ---------------------------------------------- diff --git a/website/content/ChapterFour/0989.Add-to-Array-Form-of-Integer.md b/website/content/ChapterFour/0900~0999/0989.Add-to-Array-Form-of-Integer.md similarity index 88% rename from website/content/ChapterFour/0989.Add-to-Array-Form-of-Integer.md rename to website/content/ChapterFour/0900~0999/0989.Add-to-Array-Form-of-Integer.md index 6628d58c..0d3600b3 100644 --- a/website/content/ChapterFour/0989.Add-to-Array-Form-of-Integer.md +++ b/website/content/ChapterFour/0900~0999/0989.Add-to-Array-Form-of-Integer.md @@ -86,6 +86,6 @@ func reverse(A []int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0990.Satisfiability-of-Equality-Equations.md b/website/content/ChapterFour/0900~0999/0990.Satisfiability-of-Equality-Equations.md similarity index 92% rename from website/content/ChapterFour/0990.Satisfiability-of-Equality-Equations.md rename to website/content/ChapterFour/0900~0999/0990.Satisfiability-of-Equality-Equations.md index cc6c08ee..7d2b3a22 100755 --- a/website/content/ChapterFour/0990.Satisfiability-of-Equality-Equations.md +++ b/website/content/ChapterFour/0900~0999/0990.Satisfiability-of-Equality-Equations.md @@ -101,6 +101,6 @@ func equationsPossible(equations []string) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0992.Subarrays-with-K-Different-Integers.md b/website/content/ChapterFour/0900~0999/0992.Subarrays-with-K-Different-Integers.md similarity index 93% rename from website/content/ChapterFour/0992.Subarrays-with-K-Different-Integers.md rename to website/content/ChapterFour/0900~0999/0992.Subarrays-with-K-Different-Integers.md index 642f19c2..4d6ad940 100644 --- a/website/content/ChapterFour/0992.Subarrays-with-K-Different-Integers.md +++ b/website/content/ChapterFour/0900~0999/0992.Subarrays-with-K-Different-Integers.md @@ -115,6 +115,6 @@ func subarraysWithKDistinctSlideWindow(A []int, K int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0993.Cousins-in-Binary-Tree.md b/website/content/ChapterFour/0900~0999/0993.Cousins-in-Binary-Tree.md similarity index 94% rename from website/content/ChapterFour/0993.Cousins-in-Binary-Tree.md rename to website/content/ChapterFour/0900~0999/0993.Cousins-in-Binary-Tree.md index 4579f7bd..8a75f3e2 100755 --- a/website/content/ChapterFour/0993.Cousins-in-Binary-Tree.md +++ b/website/content/ChapterFour/0900~0999/0993.Cousins-in-Binary-Tree.md @@ -165,6 +165,6 @@ func dfsCousins(root *TreeNode, val, depth, last int, parent, res *int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md b/website/content/ChapterFour/0900~0999/0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md similarity index 95% rename from website/content/ChapterFour/0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md rename to website/content/ChapterFour/0900~0999/0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md index 3227e1d8..31066661 100755 --- a/website/content/ChapterFour/0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md +++ b/website/content/ChapterFour/0900~0999/0995.Minimum-Number-of-K-Consecutive-Bit-Flips.md @@ -99,6 +99,6 @@ func minKBitFlips(A []int, K int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0996.Number-of-Squareful-Arrays.md b/website/content/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays.md similarity index 91% rename from website/content/ChapterFour/0996.Number-of-Squareful-Arrays.md rename to website/content/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays.md index 270b4cb0..a003aafa 100755 --- a/website/content/ChapterFour/0996.Number-of-Squareful-Arrays.md +++ b/website/content/ChapterFour/0900~0999/0996.Number-of-Squareful-Arrays.md @@ -109,6 +109,6 @@ func checkSquare(num int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/0999.Available-Captures-for-Rook.md b/website/content/ChapterFour/0900~0999/0999.Available-Captures-for-Rook.md similarity index 94% rename from website/content/ChapterFour/0999.Available-Captures-for-Rook.md rename to website/content/ChapterFour/0900~0999/0999.Available-Captures-for-Rook.md index 7253b6c1..1831514c 100644 --- a/website/content/ChapterFour/0999.Available-Captures-for-Rook.md +++ b/website/content/ChapterFour/0900~0999/0999.Available-Captures-for-Rook.md @@ -101,6 +101,6 @@ func caputure(board [][]byte, x, y int, bx, by int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/0900~0999/_index.md b/website/content/ChapterFour/0900~0999/_index.md new file mode 100644 index 00000000..d2021683 --- /dev/null +++ b/website/content/ChapterFour/0900~0999/_index.md @@ -0,0 +1,5 @@ +--- +bookCollapseSection: true +weight: 20 +--- + diff --git a/website/content/ChapterFour/1002.Find-Common-Characters.md b/website/content/ChapterFour/1000~1099/1002.Find-Common-Characters.md similarity index 90% rename from website/content/ChapterFour/1002.Find-Common-Characters.md rename to website/content/ChapterFour/1000~1099/1002.Find-Common-Characters.md index 93b72aa6..2e1f62b4 100755 --- a/website/content/ChapterFour/1002.Find-Common-Characters.md +++ b/website/content/ChapterFour/1000~1099/1002.Find-Common-Characters.md @@ -76,6 +76,6 @@ func commonChars(A []string) []string { ---------------------------------------------- diff --git a/website/content/ChapterFour/1003.Check-If-Word-Is-Valid-After-Substitutions.md b/website/content/ChapterFour/1000~1099/1003.Check-If-Word-Is-Valid-After-Substitutions.md similarity index 92% rename from website/content/ChapterFour/1003.Check-If-Word-Is-Valid-After-Substitutions.md rename to website/content/ChapterFour/1000~1099/1003.Check-If-Word-Is-Valid-After-Substitutions.md index 2c4ec6b3..69a4c678 100644 --- a/website/content/ChapterFour/1003.Check-If-Word-Is-Valid-After-Substitutions.md +++ b/website/content/ChapterFour/1000~1099/1003.Check-If-Word-Is-Valid-After-Substitutions.md @@ -109,6 +109,6 @@ func isValid1003(S string) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/1004.Max-Consecutive-Ones-III.md b/website/content/ChapterFour/1000~1099/1004.Max-Consecutive-Ones-III.md similarity index 85% rename from website/content/ChapterFour/1004.Max-Consecutive-Ones-III.md rename to website/content/ChapterFour/1000~1099/1004.Max-Consecutive-Ones-III.md index 54a10366..c7c40384 100644 --- a/website/content/ChapterFour/1004.Max-Consecutive-Ones-III.md +++ b/website/content/ChapterFour/1000~1099/1004.Max-Consecutive-Ones-III.md @@ -82,6 +82,6 @@ func longestOnes(A []int, K int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1005.Maximize-Sum-Of-Array-After-K-Negations.md b/website/content/ChapterFour/1000~1099/1005.Maximize-Sum-Of-Array-After-K-Negations.md similarity index 89% rename from website/content/ChapterFour/1005.Maximize-Sum-Of-Array-After-K-Negations.md rename to website/content/ChapterFour/1000~1099/1005.Maximize-Sum-Of-Array-After-K-Negations.md index cfa94c28..6b0cc810 100644 --- a/website/content/ChapterFour/1005.Maximize-Sum-Of-Array-After-K-Negations.md +++ b/website/content/ChapterFour/1000~1099/1005.Maximize-Sum-Of-Array-After-K-Negations.md @@ -85,6 +85,6 @@ func largestSumAfterKNegations(A []int, K int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1011.Capacity-To-Ship-Packages-Within-D-Days.md b/website/content/ChapterFour/1000~1099/1011.Capacity-To-Ship-Packages-Within-D-Days.md similarity index 91% rename from website/content/ChapterFour/1011.Capacity-To-Ship-Packages-Within-D-Days.md rename to website/content/ChapterFour/1000~1099/1011.Capacity-To-Ship-Packages-Within-D-Days.md index 5db2dec8..c07d5ecb 100755 --- a/website/content/ChapterFour/1011.Capacity-To-Ship-Packages-Within-D-Days.md +++ b/website/content/ChapterFour/1000~1099/1011.Capacity-To-Ship-Packages-Within-D-Days.md @@ -103,6 +103,6 @@ func shipWithinDays(weights []int, D int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1017.Convert-to-Base--2.md b/website/content/ChapterFour/1000~1099/1017.Convert-to-Base--2.md similarity index 84% rename from website/content/ChapterFour/1017.Convert-to-Base--2.md rename to website/content/ChapterFour/1000~1099/1017.Convert-to-Base--2.md index 26516464..d6aaa9ad 100755 --- a/website/content/ChapterFour/1017.Convert-to-Base--2.md +++ b/website/content/ChapterFour/1000~1099/1017.Convert-to-Base--2.md @@ -77,6 +77,6 @@ func baseNeg2(N int) string { ---------------------------------------------- diff --git a/website/content/ChapterFour/1018.Binary-Prefix-Divisible-By-5.md b/website/content/ChapterFour/1000~1099/1018.Binary-Prefix-Divisible-By-5.md similarity index 87% rename from website/content/ChapterFour/1018.Binary-Prefix-Divisible-By-5.md rename to website/content/ChapterFour/1000~1099/1018.Binary-Prefix-Divisible-By-5.md index 98109b82..ea3b7f5a 100644 --- a/website/content/ChapterFour/1018.Binary-Prefix-Divisible-By-5.md +++ b/website/content/ChapterFour/1000~1099/1018.Binary-Prefix-Divisible-By-5.md @@ -72,6 +72,6 @@ func prefixesDivBy5(a []int) []bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/1019.Next-Greater-Node-In-Linked-List.md b/website/content/ChapterFour/1000~1099/1019.Next-Greater-Node-In-Linked-List.md similarity index 90% rename from website/content/ChapterFour/1019.Next-Greater-Node-In-Linked-List.md rename to website/content/ChapterFour/1000~1099/1019.Next-Greater-Node-In-Linked-List.md index 82843023..d54c4e03 100644 --- a/website/content/ChapterFour/1019.Next-Greater-Node-In-Linked-List.md +++ b/website/content/ChapterFour/1000~1099/1019.Next-Greater-Node-In-Linked-List.md @@ -98,6 +98,6 @@ func nextLargerNodes(head *ListNode) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1020.Number-of-Enclaves.md b/website/content/ChapterFour/1000~1099/1020.Number-of-Enclaves.md similarity index 90% rename from website/content/ChapterFour/1020.Number-of-Enclaves.md rename to website/content/ChapterFour/1000~1099/1020.Number-of-Enclaves.md index b125cd5d..85dcb5ff 100644 --- a/website/content/ChapterFour/1020.Number-of-Enclaves.md +++ b/website/content/ChapterFour/1000~1099/1020.Number-of-Enclaves.md @@ -95,6 +95,6 @@ func dfsNumEnclaves(A [][]int, x, y int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/1021.Remove-Outermost-Parentheses.md b/website/content/ChapterFour/1000~1099/1021.Remove-Outermost-Parentheses.md similarity index 92% rename from website/content/ChapterFour/1021.Remove-Outermost-Parentheses.md rename to website/content/ChapterFour/1000~1099/1021.Remove-Outermost-Parentheses.md index 3bc01ab3..d6ffcbd0 100644 --- a/website/content/ChapterFour/1021.Remove-Outermost-Parentheses.md +++ b/website/content/ChapterFour/1000~1099/1021.Remove-Outermost-Parentheses.md @@ -125,6 +125,6 @@ func removeOuterParentheses1(S string) string { ---------------------------------------------- diff --git a/website/content/ChapterFour/1025.Divisor-Game.md b/website/content/ChapterFour/1000~1099/1025.Divisor-Game.md similarity index 91% rename from website/content/ChapterFour/1025.Divisor-Game.md rename to website/content/ChapterFour/1000~1099/1025.Divisor-Game.md index 34dcdfe2..2183178d 100755 --- a/website/content/ChapterFour/1025.Divisor-Game.md +++ b/website/content/ChapterFour/1000~1099/1025.Divisor-Game.md @@ -64,6 +64,6 @@ func divisorGame(N int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/1026.Maximum-Difference-Between-Node-and-Ancestor.md b/website/content/ChapterFour/1000~1099/1026.Maximum-Difference-Between-Node-and-Ancestor.md similarity index 91% rename from website/content/ChapterFour/1026.Maximum-Difference-Between-Node-and-Ancestor.md rename to website/content/ChapterFour/1000~1099/1026.Maximum-Difference-Between-Node-and-Ancestor.md index 6d75cc21..325536b0 100644 --- a/website/content/ChapterFour/1026.Maximum-Difference-Between-Node-and-Ancestor.md +++ b/website/content/ChapterFour/1000~1099/1026.Maximum-Difference-Between-Node-and-Ancestor.md @@ -76,6 +76,6 @@ func dfsAncestorDiff(root *TreeNode, res *int) (int, int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/1028.Recover-a-Tree-From-Preorder-Traversal.md b/website/content/ChapterFour/1000~1099/1028.Recover-a-Tree-From-Preorder-Traversal.md similarity index 94% rename from website/content/ChapterFour/1028.Recover-a-Tree-From-Preorder-Traversal.md rename to website/content/ChapterFour/1000~1099/1028.Recover-a-Tree-From-Preorder-Traversal.md index 01210afb..a7195a54 100755 --- a/website/content/ChapterFour/1028.Recover-a-Tree-From-Preorder-Traversal.md +++ b/website/content/ChapterFour/1000~1099/1028.Recover-a-Tree-From-Preorder-Traversal.md @@ -137,6 +137,6 @@ func dfsBuildPreorderTree(S string, index, level *int, cur *TreeNode) (newIndex ---------------------------------------------- diff --git a/website/content/ChapterFour/1030.Matrix-Cells-in-Distance-Order.md b/website/content/ChapterFour/1000~1099/1030.Matrix-Cells-in-Distance-Order.md similarity index 91% rename from website/content/ChapterFour/1030.Matrix-Cells-in-Distance-Order.md rename to website/content/ChapterFour/1000~1099/1030.Matrix-Cells-in-Distance-Order.md index 62a940fb..f71f5f8a 100755 --- a/website/content/ChapterFour/1030.Matrix-Cells-in-Distance-Order.md +++ b/website/content/ChapterFour/1000~1099/1030.Matrix-Cells-in-Distance-Order.md @@ -86,6 +86,6 @@ func allCellsDistOrder(R int, C int, r0 int, c0 int) [][]int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1037.Valid-Boomerang.md b/website/content/ChapterFour/1000~1099/1037.Valid-Boomerang.md similarity index 83% rename from website/content/ChapterFour/1037.Valid-Boomerang.md rename to website/content/ChapterFour/1000~1099/1037.Valid-Boomerang.md index 3dc1b94c..7eaf0b08 100644 --- a/website/content/ChapterFour/1037.Valid-Boomerang.md +++ b/website/content/ChapterFour/1000~1099/1037.Valid-Boomerang.md @@ -51,6 +51,6 @@ func isBoomerang(points [][]int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/1040.Moving-Stones-Until-Consecutive-II.md b/website/content/ChapterFour/1000~1099/1040.Moving-Stones-Until-Consecutive-II.md similarity index 96% rename from website/content/ChapterFour/1040.Moving-Stones-Until-Consecutive-II.md rename to website/content/ChapterFour/1000~1099/1040.Moving-Stones-Until-Consecutive-II.md index d611c135..7234a7d0 100755 --- a/website/content/ChapterFour/1040.Moving-Stones-Until-Consecutive-II.md +++ b/website/content/ChapterFour/1000~1099/1040.Moving-Stones-Until-Consecutive-II.md @@ -123,6 +123,6 @@ func numMovesStonesII(stones []int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1047.Remove-All-Adjacent-Duplicates-In-String.md b/website/content/ChapterFour/1000~1099/1047.Remove-All-Adjacent-Duplicates-In-String.md similarity index 87% rename from website/content/ChapterFour/1047.Remove-All-Adjacent-Duplicates-In-String.md rename to website/content/ChapterFour/1000~1099/1047.Remove-All-Adjacent-Duplicates-In-String.md index 1fd0cb3a..22e3764f 100644 --- a/website/content/ChapterFour/1047.Remove-All-Adjacent-Duplicates-In-String.md +++ b/website/content/ChapterFour/1000~1099/1047.Remove-All-Adjacent-Duplicates-In-String.md @@ -59,6 +59,6 @@ func removeDuplicates1047(S string) string { ---------------------------------------------- diff --git a/website/content/ChapterFour/1049.Last-Stone-Weight-II.md b/website/content/ChapterFour/1000~1099/1049.Last-Stone-Weight-II.md similarity index 92% rename from website/content/ChapterFour/1049.Last-Stone-Weight-II.md rename to website/content/ChapterFour/1000~1099/1049.Last-Stone-Weight-II.md index 035a6afc..5cb48f00 100755 --- a/website/content/ChapterFour/1049.Last-Stone-Weight-II.md +++ b/website/content/ChapterFour/1000~1099/1049.Last-Stone-Weight-II.md @@ -81,6 +81,6 @@ func lastStoneWeightII(stones []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1051.Height-Checker.md b/website/content/ChapterFour/1000~1099/1051.Height-Checker.md similarity index 89% rename from website/content/ChapterFour/1051.Height-Checker.md rename to website/content/ChapterFour/1000~1099/1051.Height-Checker.md index 6fecbda0..cb5879d4 100644 --- a/website/content/ChapterFour/1051.Height-Checker.md +++ b/website/content/ChapterFour/1000~1099/1051.Height-Checker.md @@ -74,6 +74,6 @@ func heightChecker(heights []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1052.Grumpy-Bookstore-Owner.md b/website/content/ChapterFour/1000~1099/1052.Grumpy-Bookstore-Owner.md similarity index 95% rename from website/content/ChapterFour/1052.Grumpy-Bookstore-Owner.md rename to website/content/ChapterFour/1000~1099/1052.Grumpy-Bookstore-Owner.md index 40805ff8..4e48b5af 100755 --- a/website/content/ChapterFour/1052.Grumpy-Bookstore-Owner.md +++ b/website/content/ChapterFour/1000~1099/1052.Grumpy-Bookstore-Owner.md @@ -108,6 +108,6 @@ func sumSatisfied(customers []int, grumpy []int, start, end int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1054.Distant-Barcodes.md b/website/content/ChapterFour/1000~1099/1054.Distant-Barcodes.md similarity index 89% rename from website/content/ChapterFour/1054.Distant-Barcodes.md rename to website/content/ChapterFour/1000~1099/1054.Distant-Barcodes.md index e9322c19..ea71fd10 100755 --- a/website/content/ChapterFour/1054.Distant-Barcodes.md +++ b/website/content/ChapterFour/1000~1099/1054.Distant-Barcodes.md @@ -94,6 +94,6 @@ func barcodesFrequencySort(s []int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1073.Adding-Two-Negabinary-Numbers.md b/website/content/ChapterFour/1000~1099/1073.Adding-Two-Negabinary-Numbers.md similarity index 95% rename from website/content/ChapterFour/1073.Adding-Two-Negabinary-Numbers.md rename to website/content/ChapterFour/1000~1099/1073.Adding-Two-Negabinary-Numbers.md index dbbdc84a..ef540b11 100755 --- a/website/content/ChapterFour/1073.Adding-Two-Negabinary-Numbers.md +++ b/website/content/ChapterFour/1000~1099/1073.Adding-Two-Negabinary-Numbers.md @@ -148,6 +148,6 @@ func intToNegabinary(num int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1074.Number-of-Submatrices-That-Sum-to-Target.md b/website/content/ChapterFour/1000~1099/1074.Number-of-Submatrices-That-Sum-to-Target.md similarity index 95% rename from website/content/ChapterFour/1074.Number-of-Submatrices-That-Sum-to-Target.md rename to website/content/ChapterFour/1000~1099/1074.Number-of-Submatrices-That-Sum-to-Target.md index 796e1700..4318fa89 100755 --- a/website/content/ChapterFour/1074.Number-of-Submatrices-That-Sum-to-Target.md +++ b/website/content/ChapterFour/1000~1099/1074.Number-of-Submatrices-That-Sum-to-Target.md @@ -146,6 +146,6 @@ func sumSubmatrix(matrix [][]int, startx, starty, endx, endy int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1078.Occurrences-After-Bigram.md b/website/content/ChapterFour/1000~1099/1078.Occurrences-After-Bigram.md similarity index 88% rename from website/content/ChapterFour/1078.Occurrences-After-Bigram.md rename to website/content/ChapterFour/1000~1099/1078.Occurrences-After-Bigram.md index 37333250..877eeff7 100755 --- a/website/content/ChapterFour/1078.Occurrences-After-Bigram.md +++ b/website/content/ChapterFour/1000~1099/1078.Occurrences-After-Bigram.md @@ -66,6 +66,6 @@ func findOcurrences(text string, first string, second string) []string { ---------------------------------------------- diff --git a/website/content/ChapterFour/1079.Letter-Tile-Possibilities.md b/website/content/ChapterFour/1000~1099/1079.Letter-Tile-Possibilities.md similarity index 93% rename from website/content/ChapterFour/1079.Letter-Tile-Possibilities.md rename to website/content/ChapterFour/1000~1099/1079.Letter-Tile-Possibilities.md index 2dc6dd6a..1227f74c 100755 --- a/website/content/ChapterFour/1079.Letter-Tile-Possibilities.md +++ b/website/content/ChapterFour/1000~1099/1079.Letter-Tile-Possibilities.md @@ -109,6 +109,6 @@ func findTile(tiles, tmp []byte, used *[]bool, index int, res *int, tMap map[str ---------------------------------------------- diff --git a/website/content/ChapterFour/1089.Duplicate-Zeros.md b/website/content/ChapterFour/1000~1099/1089.Duplicate-Zeros.md similarity index 86% rename from website/content/ChapterFour/1089.Duplicate-Zeros.md rename to website/content/ChapterFour/1000~1099/1089.Duplicate-Zeros.md index a124e966..f59028dc 100644 --- a/website/content/ChapterFour/1089.Duplicate-Zeros.md +++ b/website/content/ChapterFour/1000~1099/1089.Duplicate-Zeros.md @@ -60,6 +60,6 @@ func duplicateZeros(arr []int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/1093.Statistics-from-a-Large-Sample.md b/website/content/ChapterFour/1000~1099/1093.Statistics-from-a-Large-Sample.md similarity index 95% rename from website/content/ChapterFour/1093.Statistics-from-a-Large-Sample.md rename to website/content/ChapterFour/1000~1099/1093.Statistics-from-a-Large-Sample.md index 863f1f81..dcc4dd1b 100755 --- a/website/content/ChapterFour/1093.Statistics-from-a-Large-Sample.md +++ b/website/content/ChapterFour/1000~1099/1093.Statistics-from-a-Large-Sample.md @@ -97,6 +97,6 @@ func sampleStats(count []int) []float64 { ---------------------------------------------- diff --git a/website/content/ChapterFour/1000~1099/_index.md b/website/content/ChapterFour/1000~1099/_index.md new file mode 100644 index 00000000..d2021683 --- /dev/null +++ b/website/content/ChapterFour/1000~1099/_index.md @@ -0,0 +1,5 @@ +--- +bookCollapseSection: true +weight: 20 +--- + diff --git a/website/content/ChapterFour/1105.Filling-Bookcase-Shelves.md b/website/content/ChapterFour/1100~1199/1105.Filling-Bookcase-Shelves.md similarity index 94% rename from website/content/ChapterFour/1105.Filling-Bookcase-Shelves.md rename to website/content/ChapterFour/1100~1199/1105.Filling-Bookcase-Shelves.md index e2c256c7..f7a5f422 100755 --- a/website/content/ChapterFour/1105.Filling-Bookcase-Shelves.md +++ b/website/content/ChapterFour/1100~1199/1105.Filling-Bookcase-Shelves.md @@ -70,6 +70,6 @@ func minHeightShelves(books [][]int, shelfWidth int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1108.Defanging-an-IP-Address.md b/website/content/ChapterFour/1100~1199/1108.Defanging-an-IP-Address.md similarity index 81% rename from website/content/ChapterFour/1108.Defanging-an-IP-Address.md rename to website/content/ChapterFour/1100~1199/1108.Defanging-an-IP-Address.md index f745e3bd..90724672 100755 --- a/website/content/ChapterFour/1108.Defanging-an-IP-Address.md +++ b/website/content/ChapterFour/1100~1199/1108.Defanging-an-IP-Address.md @@ -56,6 +56,6 @@ func defangIPaddr(address string) string { ---------------------------------------------- diff --git a/website/content/ChapterFour/1110.Delete-Nodes-And-Return-Forest.md b/website/content/ChapterFour/1100~1199/1110.Delete-Nodes-And-Return-Forest.md similarity index 90% rename from website/content/ChapterFour/1110.Delete-Nodes-And-Return-Forest.md rename to website/content/ChapterFour/1100~1199/1110.Delete-Nodes-And-Return-Forest.md index 971b3e1b..7b317cc4 100644 --- a/website/content/ChapterFour/1110.Delete-Nodes-And-Return-Forest.md +++ b/website/content/ChapterFour/1100~1199/1110.Delete-Nodes-And-Return-Forest.md @@ -84,6 +84,6 @@ func dfsDelNodes(root *TreeNode, toDel map[int]bool, isRoot bool, res *[]*TreeNo ---------------------------------------------- diff --git a/website/content/ChapterFour/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings.md b/website/content/ChapterFour/1100~1199/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings.md similarity index 95% rename from website/content/ChapterFour/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings.md rename to website/content/ChapterFour/1100~1199/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings.md index bc6d761b..4289e982 100755 --- a/website/content/ChapterFour/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings.md +++ b/website/content/ChapterFour/1100~1199/1111.Maximum-Nesting-Depth-of-Two-Valid-Parentheses-Strings.md @@ -134,6 +134,6 @@ func maxDepthAfterSplit1(seq string) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1122.Relative-Sort-Array.md b/website/content/ChapterFour/1100~1199/1122.Relative-Sort-Array.md similarity index 91% rename from website/content/ChapterFour/1122.Relative-Sort-Array.md rename to website/content/ChapterFour/1100~1199/1122.Relative-Sort-Array.md index 3ce06048..c36c2f10 100755 --- a/website/content/ChapterFour/1122.Relative-Sort-Array.md +++ b/website/content/ChapterFour/1100~1199/1122.Relative-Sort-Array.md @@ -103,6 +103,6 @@ func relativeSortArray1(arr1 []int, arr2 []int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md b/website/content/ChapterFour/1100~1199/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md similarity index 92% rename from website/content/ChapterFour/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md rename to website/content/ChapterFour/1100~1199/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md index f3fb3dee..af07abca 100755 --- a/website/content/ChapterFour/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md +++ b/website/content/ChapterFour/1100~1199/1123.Lowest-Common-Ancestor-of-Deepest-Leaves.md @@ -103,6 +103,6 @@ func lcaDeepestLeavesDFS(lca **TreeNode, maxLevel *int, depth int, root *TreeNod ---------------------------------------------- diff --git a/website/content/ChapterFour/1128.Number-of-Equivalent-Domino-Pairs.md b/website/content/ChapterFour/1100~1199/1128.Number-of-Equivalent-Domino-Pairs.md similarity index 89% rename from website/content/ChapterFour/1128.Number-of-Equivalent-Domino-Pairs.md rename to website/content/ChapterFour/1100~1199/1128.Number-of-Equivalent-Domino-Pairs.md index b9f94100..396e61e1 100755 --- a/website/content/ChapterFour/1128.Number-of-Equivalent-Domino-Pairs.md +++ b/website/content/ChapterFour/1100~1199/1128.Number-of-Equivalent-Domino-Pairs.md @@ -70,6 +70,6 @@ func numEquivDominoPairs(dominoes [][]int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1137.N-th-Tribonacci-Number.md b/website/content/ChapterFour/1100~1199/1137.N-th-Tribonacci-Number.md similarity index 83% rename from website/content/ChapterFour/1137.N-th-Tribonacci-Number.md rename to website/content/ChapterFour/1100~1199/1137.N-th-Tribonacci-Number.md index 211d5ba6..179f6cc6 100755 --- a/website/content/ChapterFour/1137.N-th-Tribonacci-Number.md +++ b/website/content/ChapterFour/1100~1199/1137.N-th-Tribonacci-Number.md @@ -73,6 +73,6 @@ func tribonacci(n int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1145.Binary-Tree-Coloring-Game.md b/website/content/ChapterFour/1100~1199/1145.Binary-Tree-Coloring-Game.md similarity index 96% rename from website/content/ChapterFour/1145.Binary-Tree-Coloring-Game.md rename to website/content/ChapterFour/1100~1199/1145.Binary-Tree-Coloring-Game.md index c1395df1..047f0d03 100644 --- a/website/content/ChapterFour/1145.Binary-Tree-Coloring-Game.md +++ b/website/content/ChapterFour/1100~1199/1145.Binary-Tree-Coloring-Game.md @@ -84,6 +84,6 @@ func dfsBtreeGameWinningMove(node *TreeNode, left, right *int, x int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1154.Day-of-the-Year.md b/website/content/ChapterFour/1100~1199/1154.Day-of-the-Year.md similarity index 89% rename from website/content/ChapterFour/1154.Day-of-the-Year.md rename to website/content/ChapterFour/1100~1199/1154.Day-of-the-Year.md index b4c4bcb2..98e392d0 100755 --- a/website/content/ChapterFour/1154.Day-of-the-Year.md +++ b/website/content/ChapterFour/1100~1199/1154.Day-of-the-Year.md @@ -83,6 +83,6 @@ func dayOfYear(date string) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1157.Online-Majority-Element-In-Subarray.md b/website/content/ChapterFour/1100~1199/1157.Online-Majority-Element-In-Subarray.md similarity index 97% rename from website/content/ChapterFour/1157.Online-Majority-Element-In-Subarray.md rename to website/content/ChapterFour/1100~1199/1157.Online-Majority-Element-In-Subarray.md index abfafc03..0fd147e4 100755 --- a/website/content/ChapterFour/1157.Online-Majority-Element-In-Subarray.md +++ b/website/content/ChapterFour/1100~1199/1157.Online-Majority-Element-In-Subarray.md @@ -198,6 +198,6 @@ func (mc *MajorityChecker) Query(left int, right int, threshold int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1160.Find-Words-That-Can-Be-Formed-by-Characters.md b/website/content/ChapterFour/1100~1199/1160.Find-Words-That-Can-Be-Formed-by-Characters.md similarity index 89% rename from website/content/ChapterFour/1160.Find-Words-That-Can-Be-Formed-by-Characters.md rename to website/content/ChapterFour/1100~1199/1160.Find-Words-That-Can-Be-Formed-by-Characters.md index 2df6a209..a0e7603d 100755 --- a/website/content/ChapterFour/1160.Find-Words-That-Can-Be-Formed-by-Characters.md +++ b/website/content/ChapterFour/1100~1199/1160.Find-Words-That-Can-Be-Formed-by-Characters.md @@ -83,6 +83,6 @@ func canBeFormed(w string, c []int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md b/website/content/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md similarity index 91% rename from website/content/ChapterFour/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md rename to website/content/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md index 854c1e78..987a39a8 100755 --- a/website/content/ChapterFour/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md +++ b/website/content/ChapterFour/1100~1199/1170.Compare-Strings-by-Frequency-of-the-Smallest-Character.md @@ -88,6 +88,6 @@ func countFunc(s string) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List.md b/website/content/ChapterFour/1100~1199/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List.md similarity index 93% rename from website/content/ChapterFour/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List.md rename to website/content/ChapterFour/1100~1199/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List.md index bee3e8a8..49e9862b 100755 --- a/website/content/ChapterFour/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List.md +++ b/website/content/ChapterFour/1100~1199/1171.Remove-Zero-Sum-Consecutive-Nodes-from-Linked-List.md @@ -142,6 +142,6 @@ func removeZeroSumSublists1(head *ListNode) *ListNode { ---------------------------------------------- diff --git a/website/content/ChapterFour/1175.Prime-Arrangements.md b/website/content/ChapterFour/1100~1199/1175.Prime-Arrangements.md similarity index 88% rename from website/content/ChapterFour/1175.Prime-Arrangements.md rename to website/content/ChapterFour/1100~1199/1175.Prime-Arrangements.md index 063a2619..e6ef7db5 100755 --- a/website/content/ChapterFour/1175.Prime-Arrangements.md +++ b/website/content/ChapterFour/1100~1199/1175.Prime-Arrangements.md @@ -67,6 +67,6 @@ func factorial(n int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1184.Distance-Between-Bus-Stops.md b/website/content/ChapterFour/1100~1199/1184.Distance-Between-Bus-Stops.md similarity index 92% rename from website/content/ChapterFour/1184.Distance-Between-Bus-Stops.md rename to website/content/ChapterFour/1100~1199/1184.Distance-Between-Bus-Stops.md index 5d23749e..7d3f9829 100755 --- a/website/content/ChapterFour/1184.Distance-Between-Bus-Stops.md +++ b/website/content/ChapterFour/1100~1199/1184.Distance-Between-Bus-Stops.md @@ -84,6 +84,6 @@ func distanceBetweenBusStops(distance []int, start int, destination int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1185.Day-of-the-Week.md b/website/content/ChapterFour/1100~1199/1185.Day-of-the-Week.md similarity index 86% rename from website/content/ChapterFour/1185.Day-of-the-Week.md rename to website/content/ChapterFour/1100~1199/1185.Day-of-the-Week.md index 5b34b8de..e7489d10 100755 --- a/website/content/ChapterFour/1185.Day-of-the-Week.md +++ b/website/content/ChapterFour/1100~1199/1185.Day-of-the-Week.md @@ -63,6 +63,6 @@ func dayOfTheWeek(day int, month int, year int) string { ---------------------------------------------- diff --git a/website/content/ChapterFour/1189.Maximum-Number-of-Balloons.md b/website/content/ChapterFour/1100~1199/1189.Maximum-Number-of-Balloons.md similarity index 92% rename from website/content/ChapterFour/1189.Maximum-Number-of-Balloons.md rename to website/content/ChapterFour/1100~1199/1189.Maximum-Number-of-Balloons.md index ac27e5eb..22cf634d 100755 --- a/website/content/ChapterFour/1189.Maximum-Number-of-Balloons.md +++ b/website/content/ChapterFour/1100~1199/1189.Maximum-Number-of-Balloons.md @@ -72,6 +72,6 @@ func maxNumberOfBalloons(text string) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1100~1199/_index.md b/website/content/ChapterFour/1100~1199/_index.md new file mode 100644 index 00000000..d2021683 --- /dev/null +++ b/website/content/ChapterFour/1100~1199/_index.md @@ -0,0 +1,5 @@ +--- +bookCollapseSection: true +weight: 20 +--- + diff --git a/website/content/ChapterFour/1200.Minimum-Absolute-Difference.md b/website/content/ChapterFour/1200~1299/1200.Minimum-Absolute-Difference.md similarity index 89% rename from website/content/ChapterFour/1200.Minimum-Absolute-Difference.md rename to website/content/ChapterFour/1200~1299/1200.Minimum-Absolute-Difference.md index 2cbf856b..f23995fb 100755 --- a/website/content/ChapterFour/1200.Minimum-Absolute-Difference.md +++ b/website/content/ChapterFour/1200~1299/1200.Minimum-Absolute-Difference.md @@ -79,6 +79,6 @@ func minimumAbsDifference(arr []int) [][]int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1201.Ugly-Number-III.md b/website/content/ChapterFour/1200~1299/1201.Ugly-Number-III.md similarity index 93% rename from website/content/ChapterFour/1201.Ugly-Number-III.md rename to website/content/ChapterFour/1200~1299/1201.Ugly-Number-III.md index 9382712f..a4a3299d 100755 --- a/website/content/ChapterFour/1201.Ugly-Number-III.md +++ b/website/content/ChapterFour/1200~1299/1201.Ugly-Number-III.md @@ -94,6 +94,6 @@ func gcd(a, b int64) int64 { ---------------------------------------------- diff --git a/website/content/ChapterFour/1202.Smallest-String-With-Swaps.md b/website/content/ChapterFour/1200~1299/1202.Smallest-String-With-Swaps.md similarity index 91% rename from website/content/ChapterFour/1202.Smallest-String-With-Swaps.md rename to website/content/ChapterFour/1200~1299/1202.Smallest-String-With-Swaps.md index 903771e8..32b06cb9 100755 --- a/website/content/ChapterFour/1202.Smallest-String-With-Swaps.md +++ b/website/content/ChapterFour/1200~1299/1202.Smallest-String-With-Swaps.md @@ -104,6 +104,6 @@ func smallestStringWithSwaps(s string, pairs [][]int) string { ---------------------------------------------- diff --git a/website/content/ChapterFour/1203.Sort-Items-by-Groups-Respecting-Dependencies.md b/website/content/ChapterFour/1200~1299/1203.Sort-Items-by-Groups-Respecting-Dependencies.md similarity index 96% rename from website/content/ChapterFour/1203.Sort-Items-by-Groups-Respecting-Dependencies.md rename to website/content/ChapterFour/1200~1299/1203.Sort-Items-by-Groups-Respecting-Dependencies.md index 99193c75..6cbdc8ce 100644 --- a/website/content/ChapterFour/1203.Sort-Items-by-Groups-Respecting-Dependencies.md +++ b/website/content/ChapterFour/1200~1299/1203.Sort-Items-by-Groups-Respecting-Dependencies.md @@ -193,6 +193,6 @@ func topSort(graph [][]int, deg, items []int) (orders []int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/1207.Unique-Number-of-Occurrences.md b/website/content/ChapterFour/1200~1299/1207.Unique-Number-of-Occurrences.md similarity index 85% rename from website/content/ChapterFour/1207.Unique-Number-of-Occurrences.md rename to website/content/ChapterFour/1200~1299/1207.Unique-Number-of-Occurrences.md index 1b3aff67..acd4c99d 100755 --- a/website/content/ChapterFour/1207.Unique-Number-of-Occurrences.md +++ b/website/content/ChapterFour/1200~1299/1207.Unique-Number-of-Occurrences.md @@ -70,6 +70,6 @@ func uniqueOccurrences(arr []int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/1208.Get-Equal-Substrings-Within-Budget.md b/website/content/ChapterFour/1200~1299/1208.Get-Equal-Substrings-Within-Budget.md similarity index 92% rename from website/content/ChapterFour/1208.Get-Equal-Substrings-Within-Budget.md rename to website/content/ChapterFour/1200~1299/1208.Get-Equal-Substrings-Within-Budget.md index 92c91739..ff499c21 100755 --- a/website/content/ChapterFour/1208.Get-Equal-Substrings-Within-Budget.md +++ b/website/content/ChapterFour/1200~1299/1208.Get-Equal-Substrings-Within-Budget.md @@ -79,6 +79,6 @@ func equalSubstring(s string, t string, maxCost int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position.md b/website/content/ChapterFour/1200~1299/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position.md similarity index 91% rename from website/content/ChapterFour/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position.md rename to website/content/ChapterFour/1200~1299/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position.md index d1b1cda2..8bba13af 100755 --- a/website/content/ChapterFour/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position.md +++ b/website/content/ChapterFour/1200~1299/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position.md @@ -78,6 +78,6 @@ func minCostToMoveChips(chips []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1221.Split-a-String-in-Balanced-Strings.md b/website/content/ChapterFour/1200~1299/1221.Split-a-String-in-Balanced-Strings.md similarity index 87% rename from website/content/ChapterFour/1221.Split-a-String-in-Balanced-Strings.md rename to website/content/ChapterFour/1200~1299/1221.Split-a-String-in-Balanced-Strings.md index 4111287f..d1735865 100755 --- a/website/content/ChapterFour/1221.Split-a-String-in-Balanced-Strings.md +++ b/website/content/ChapterFour/1200~1299/1221.Split-a-String-in-Balanced-Strings.md @@ -75,6 +75,6 @@ func balancedStringSplit(s string) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1232.Check-If-It-Is-a-Straight-Line.md b/website/content/ChapterFour/1200~1299/1232.Check-If-It-Is-a-Straight-Line.md similarity index 88% rename from website/content/ChapterFour/1232.Check-If-It-Is-a-Straight-Line.md rename to website/content/ChapterFour/1200~1299/1232.Check-If-It-Is-a-Straight-Line.md index 3d4fc4cb..07ad32d4 100755 --- a/website/content/ChapterFour/1232.Check-If-It-Is-a-Straight-Line.md +++ b/website/content/ChapterFour/1200~1299/1232.Check-If-It-Is-a-Straight-Line.md @@ -73,6 +73,6 @@ func checkStraightLine(coordinates [][]int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/1234.Replace-the-Substring-for-Balanced-String.md b/website/content/ChapterFour/1200~1299/1234.Replace-the-Substring-for-Balanced-String.md similarity index 93% rename from website/content/ChapterFour/1234.Replace-the-Substring-for-Balanced-String.md rename to website/content/ChapterFour/1200~1299/1234.Replace-the-Substring-for-Balanced-String.md index 8404def8..50847fe1 100755 --- a/website/content/ChapterFour/1234.Replace-the-Substring-for-Balanced-String.md +++ b/website/content/ChapterFour/1200~1299/1234.Replace-the-Substring-for-Balanced-String.md @@ -95,6 +95,6 @@ func balancedString(s string) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1235.Maximum-Profit-in-Job-Scheduling.md b/website/content/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling.md similarity index 94% rename from website/content/ChapterFour/1235.Maximum-Profit-in-Job-Scheduling.md rename to website/content/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling.md index 831aceef..61532853 100755 --- a/website/content/ChapterFour/1235.Maximum-Profit-in-Job-Scheduling.md +++ b/website/content/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling.md @@ -120,6 +120,6 @@ func (s sortJobs) Swap(i, j int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/1252.Cells-with-Odd-Values-in-a-Matrix.md b/website/content/ChapterFour/1200~1299/1252.Cells-with-Odd-Values-in-a-Matrix.md similarity index 92% rename from website/content/ChapterFour/1252.Cells-with-Odd-Values-in-a-Matrix.md rename to website/content/ChapterFour/1200~1299/1252.Cells-with-Odd-Values-in-a-Matrix.md index 6f869e52..e0a66edf 100755 --- a/website/content/ChapterFour/1252.Cells-with-Odd-Values-in-a-Matrix.md +++ b/website/content/ChapterFour/1200~1299/1252.Cells-with-Odd-Values-in-a-Matrix.md @@ -105,6 +105,6 @@ func oddCells1(n int, m int, indices [][]int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1254.Number-of-Closed-Islands.md b/website/content/ChapterFour/1200~1299/1254.Number-of-Closed-Islands.md similarity index 93% rename from website/content/ChapterFour/1254.Number-of-Closed-Islands.md rename to website/content/ChapterFour/1200~1299/1254.Number-of-Closed-Islands.md index bdcdec52..96e175c9 100755 --- a/website/content/ChapterFour/1254.Number-of-Closed-Islands.md +++ b/website/content/ChapterFour/1200~1299/1254.Number-of-Closed-Islands.md @@ -112,6 +112,6 @@ func isIntInBoard(board [][]int, x, y int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/1260.Shift-2D-Grid.md b/website/content/ChapterFour/1200~1299/1260.Shift-2D-Grid.md similarity index 90% rename from website/content/ChapterFour/1260.Shift-2D-Grid.md rename to website/content/ChapterFour/1200~1299/1260.Shift-2D-Grid.md index 8a10aef5..83fcdef1 100644 --- a/website/content/ChapterFour/1260.Shift-2D-Grid.md +++ b/website/content/ChapterFour/1200~1299/1260.Shift-2D-Grid.md @@ -92,6 +92,6 @@ func shiftGrid(grid [][]int, k int) [][]int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1266.Minimum-Time-Visiting-All-Points.md b/website/content/ChapterFour/1200~1299/1266.Minimum-Time-Visiting-All-Points.md similarity index 91% rename from website/content/ChapterFour/1266.Minimum-Time-Visiting-All-Points.md rename to website/content/ChapterFour/1200~1299/1266.Minimum-Time-Visiting-All-Points.md index 3e9ad63d..252a9822 100755 --- a/website/content/ChapterFour/1266.Minimum-Time-Visiting-All-Points.md +++ b/website/content/ChapterFour/1200~1299/1266.Minimum-Time-Visiting-All-Points.md @@ -77,6 +77,6 @@ func minTimeToVisitAllPoints(points [][]int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1275.Find-Winner-on-a-Tic-Tac-Toe-Game.md b/website/content/ChapterFour/1200~1299/1275.Find-Winner-on-a-Tic-Tac-Toe-Game.md similarity index 94% rename from website/content/ChapterFour/1275.Find-Winner-on-a-Tic-Tac-Toe-Game.md rename to website/content/ChapterFour/1200~1299/1275.Find-Winner-on-a-Tic-Tac-Toe-Game.md index 92f05952..d7721e9e 100644 --- a/website/content/ChapterFour/1275.Find-Winner-on-a-Tic-Tac-Toe-Game.md +++ b/website/content/ChapterFour/1200~1299/1275.Find-Winner-on-a-Tic-Tac-Toe-Game.md @@ -156,6 +156,6 @@ func tictactoe(moves [][]int) string { ---------------------------------------------- diff --git a/website/content/ChapterFour/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer.md b/website/content/ChapterFour/1200~1299/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer.md similarity index 82% rename from website/content/ChapterFour/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer.md rename to website/content/ChapterFour/1200~1299/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer.md index 2c964c08..f512f847 100644 --- a/website/content/ChapterFour/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer.md +++ b/website/content/ChapterFour/1200~1299/1281.Subtract-the-Product-and-Sum-of-Digits-of-an-Integer.md @@ -61,6 +61,6 @@ func subtractProductAndSum(n int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1283.Find-the-Smallest-Divisor-Given-a-Threshold.md b/website/content/ChapterFour/1200~1299/1283.Find-the-Smallest-Divisor-Given-a-Threshold.md similarity index 90% rename from website/content/ChapterFour/1283.Find-the-Smallest-Divisor-Given-a-Threshold.md rename to website/content/ChapterFour/1200~1299/1283.Find-the-Smallest-Divisor-Given-a-Threshold.md index e25c1209..044a91c7 100644 --- a/website/content/ChapterFour/1283.Find-the-Smallest-Divisor-Given-a-Threshold.md +++ b/website/content/ChapterFour/1200~1299/1283.Find-the-Smallest-Divisor-Given-a-Threshold.md @@ -89,6 +89,6 @@ func calDivisor(nums []int, mid, threshold int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/1287.Element-Appearing-More-Than-25-In-Sorted-Array.md b/website/content/ChapterFour/1200~1299/1287.Element-Appearing-More-Than-25-In-Sorted-Array.md similarity index 81% rename from website/content/ChapterFour/1287.Element-Appearing-More-Than-25-In-Sorted-Array.md rename to website/content/ChapterFour/1200~1299/1287.Element-Appearing-More-Than-25-In-Sorted-Array.md index c1c9d669..03294b89 100644 --- a/website/content/ChapterFour/1287.Element-Appearing-More-Than-25-In-Sorted-Array.md +++ b/website/content/ChapterFour/1200~1299/1287.Element-Appearing-More-Than-25-In-Sorted-Array.md @@ -51,6 +51,6 @@ func findSpecialInteger(arr []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer.md b/website/content/ChapterFour/1200~1299/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer.md similarity index 86% rename from website/content/ChapterFour/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer.md rename to website/content/ChapterFour/1200~1299/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer.md index 28ab0065..41633eae 100644 --- a/website/content/ChapterFour/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer.md +++ b/website/content/ChapterFour/1200~1299/1290.Convert-Binary-Number-in-a-Linked-List-to-Integer.md @@ -83,6 +83,6 @@ func getDecimalValue(head *ListNode) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1295.Find-Numbers-with-Even-Number-of-Digits.md b/website/content/ChapterFour/1200~1299/1295.Find-Numbers-with-Even-Number-of-Digits.md similarity index 82% rename from website/content/ChapterFour/1295.Find-Numbers-with-Even-Number-of-Digits.md rename to website/content/ChapterFour/1200~1299/1295.Find-Numbers-with-Even-Number-of-Digits.md index 32096cd1..17d3b6ba 100644 --- a/website/content/ChapterFour/1295.Find-Numbers-with-Even-Number-of-Digits.md +++ b/website/content/ChapterFour/1200~1299/1295.Find-Numbers-with-Even-Number-of-Digits.md @@ -65,6 +65,6 @@ func findNumbers(nums []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1299.Replace-Elements-with-Greatest-Element-on-Right-Side.md b/website/content/ChapterFour/1200~1299/1299.Replace-Elements-with-Greatest-Element-on-Right-Side.md similarity index 86% rename from website/content/ChapterFour/1299.Replace-Elements-with-Greatest-Element-on-Right-Side.md rename to website/content/ChapterFour/1200~1299/1299.Replace-Elements-with-Greatest-Element-on-Right-Side.md index fb242b8f..2bbb88ac 100644 --- a/website/content/ChapterFour/1299.Replace-Elements-with-Greatest-Element-on-Right-Side.md +++ b/website/content/ChapterFour/1200~1299/1299.Replace-Elements-with-Greatest-Element-on-Right-Side.md @@ -53,6 +53,6 @@ func replaceElements(arr []int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1200~1299/_index.md b/website/content/ChapterFour/1200~1299/_index.md new file mode 100644 index 00000000..d2021683 --- /dev/null +++ b/website/content/ChapterFour/1200~1299/_index.md @@ -0,0 +1,5 @@ +--- +bookCollapseSection: true +weight: 20 +--- + diff --git a/website/content/ChapterFour/1300.Sum-of-Mutated-Array-Closest-to-Target.md b/website/content/ChapterFour/1300~1399/1300.Sum-of-Mutated-Array-Closest-to-Target.md similarity index 92% rename from website/content/ChapterFour/1300.Sum-of-Mutated-Array-Closest-to-Target.md rename to website/content/ChapterFour/1300~1399/1300.Sum-of-Mutated-Array-Closest-to-Target.md index 113f3d86..3e13fe77 100644 --- a/website/content/ChapterFour/1300.Sum-of-Mutated-Array-Closest-to-Target.md +++ b/website/content/ChapterFour/1300~1399/1300.Sum-of-Mutated-Array-Closest-to-Target.md @@ -105,6 +105,6 @@ func min(a int, b int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1302.Deepest-Leaves-Sum.md b/website/content/ChapterFour/1300~1399/1302.Deepest-Leaves-Sum.md similarity index 87% rename from website/content/ChapterFour/1302.Deepest-Leaves-Sum.md rename to website/content/ChapterFour/1300~1399/1302.Deepest-Leaves-Sum.md index a79aef4d..6037e30c 100644 --- a/website/content/ChapterFour/1302.Deepest-Leaves-Sum.md +++ b/website/content/ChapterFour/1300~1399/1302.Deepest-Leaves-Sum.md @@ -60,6 +60,6 @@ func dfsDeepestLeavesSum(root *TreeNode, level int, maxLevel, sum *int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/1304.Find-N-Unique-Integers-Sum-up-to-Zero.md b/website/content/ChapterFour/1300~1399/1304.Find-N-Unique-Integers-Sum-up-to-Zero.md similarity index 82% rename from website/content/ChapterFour/1304.Find-N-Unique-Integers-Sum-up-to-Zero.md rename to website/content/ChapterFour/1300~1399/1304.Find-N-Unique-Integers-Sum-up-to-Zero.md index 0fadb33f..35a82147 100644 --- a/website/content/ChapterFour/1304.Find-N-Unique-Integers-Sum-up-to-Zero.md +++ b/website/content/ChapterFour/1300~1399/1304.Find-N-Unique-Integers-Sum-up-to-Zero.md @@ -64,6 +64,6 @@ func sumZero(n int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1305.All-Elements-in-Two-Binary-Search-Trees.md b/website/content/ChapterFour/1300~1399/1305.All-Elements-in-Two-Binary-Search-Trees.md similarity index 91% rename from website/content/ChapterFour/1305.All-Elements-in-Two-Binary-Search-Trees.md rename to website/content/ChapterFour/1300~1399/1305.All-Elements-in-Two-Binary-Search-Trees.md index 4de15219..a29b324c 100644 --- a/website/content/ChapterFour/1305.All-Elements-in-Two-Binary-Search-Trees.md +++ b/website/content/ChapterFour/1300~1399/1305.All-Elements-in-Two-Binary-Search-Trees.md @@ -92,6 +92,6 @@ func getAllElements1(root1 *TreeNode, root2 *TreeNode) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1306.Jump-Game-III.md b/website/content/ChapterFour/1300~1399/1306.Jump-Game-III.md similarity index 90% rename from website/content/ChapterFour/1306.Jump-Game-III.md rename to website/content/ChapterFour/1300~1399/1306.Jump-Game-III.md index 82a9fe22..cddd5cd0 100644 --- a/website/content/ChapterFour/1306.Jump-Game-III.md +++ b/website/content/ChapterFour/1300~1399/1306.Jump-Game-III.md @@ -82,6 +82,6 @@ func canReach(arr []int, start int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/1313.Decompress-Run-Length-Encoded-List.md b/website/content/ChapterFour/1300~1399/1313.Decompress-Run-Length-Encoded-List.md similarity index 88% rename from website/content/ChapterFour/1313.Decompress-Run-Length-Encoded-List.md rename to website/content/ChapterFour/1300~1399/1313.Decompress-Run-Length-Encoded-List.md index a99baec6..afdb5f77 100644 --- a/website/content/ChapterFour/1313.Decompress-Run-Length-Encoded-List.md +++ b/website/content/ChapterFour/1300~1399/1313.Decompress-Run-Length-Encoded-List.md @@ -62,6 +62,6 @@ func decompressRLElist(nums []int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers.md b/website/content/ChapterFour/1300~1399/1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers.md similarity index 88% rename from website/content/ChapterFour/1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers.md rename to website/content/ChapterFour/1300~1399/1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers.md index b275e3db..88984940 100644 --- a/website/content/ChapterFour/1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers.md +++ b/website/content/ChapterFour/1300~1399/1317.Convert-Integer-to-the-Sum-of-Two-No-Zero-Integers.md @@ -98,6 +98,6 @@ func isNoZero(n int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/1319.Number-of-Operations-to-Make-Network-Connected.md b/website/content/ChapterFour/1300~1399/1319.Number-of-Operations-to-Make-Network-Connected.md similarity index 93% rename from website/content/ChapterFour/1319.Number-of-Operations-to-Make-Network-Connected.md rename to website/content/ChapterFour/1300~1399/1319.Number-of-Operations-to-Make-Network-Connected.md index 8cf7a2a2..2982a123 100644 --- a/website/content/ChapterFour/1319.Number-of-Operations-to-Make-Network-Connected.md +++ b/website/content/ChapterFour/1300~1399/1319.Number-of-Operations-to-Make-Network-Connected.md @@ -92,6 +92,6 @@ func makeConnected(n int, connections [][]int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1329.Sort-the-Matrix-Diagonally.md b/website/content/ChapterFour/1300~1399/1329.Sort-the-Matrix-Diagonally.md similarity index 87% rename from website/content/ChapterFour/1329.Sort-the-Matrix-Diagonally.md rename to website/content/ChapterFour/1300~1399/1329.Sort-the-Matrix-Diagonally.md index 4d4808bc..3248ddc6 100644 --- a/website/content/ChapterFour/1329.Sort-the-Matrix-Diagonally.md +++ b/website/content/ChapterFour/1300~1399/1329.Sort-the-Matrix-Diagonally.md @@ -59,6 +59,6 @@ func diagonalSort(mat [][]int) [][]int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1380.Lucky-Numbers-in-a-Matrix.md b/website/content/ChapterFour/1300~1399/1380.Lucky-Numbers-in-a-Matrix.md similarity index 88% rename from website/content/ChapterFour/1380.Lucky-Numbers-in-a-Matrix.md rename to website/content/ChapterFour/1300~1399/1380.Lucky-Numbers-in-a-Matrix.md index 6115acc5..09721269 100644 --- a/website/content/ChapterFour/1380.Lucky-Numbers-in-a-Matrix.md +++ b/website/content/ChapterFour/1300~1399/1380.Lucky-Numbers-in-a-Matrix.md @@ -89,6 +89,6 @@ func luckyNumbers(matrix [][]int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1385.Find-the-Distance-Value-Between-Two-Arrays.md b/website/content/ChapterFour/1300~1399/1385.Find-the-Distance-Value-Between-Two-Arrays.md similarity index 89% rename from website/content/ChapterFour/1385.Find-the-Distance-Value-Between-Two-Arrays.md rename to website/content/ChapterFour/1300~1399/1385.Find-the-Distance-Value-Between-Two-Arrays.md index 3e99081b..9d0a25fa 100644 --- a/website/content/ChapterFour/1385.Find-the-Distance-Value-Between-Two-Arrays.md +++ b/website/content/ChapterFour/1300~1399/1385.Find-the-Distance-Value-Between-Two-Arrays.md @@ -100,6 +100,6 @@ func abs(a int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1389.Create-Target-Array-in-the-Given-Order.md b/website/content/ChapterFour/1300~1399/1389.Create-Target-Array-in-the-Given-Order.md similarity index 88% rename from website/content/ChapterFour/1389.Create-Target-Array-in-the-Given-Order.md rename to website/content/ChapterFour/1300~1399/1389.Create-Target-Array-in-the-Given-Order.md index ada9721b..5cdbf7b4 100644 --- a/website/content/ChapterFour/1389.Create-Target-Array-in-the-Given-Order.md +++ b/website/content/ChapterFour/1300~1399/1389.Create-Target-Array-in-the-Given-Order.md @@ -92,6 +92,6 @@ func createTargetArray(nums []int, index []int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1300~1399/_index.md b/website/content/ChapterFour/1300~1399/_index.md new file mode 100644 index 00000000..d2021683 --- /dev/null +++ b/website/content/ChapterFour/1300~1399/_index.md @@ -0,0 +1,5 @@ +--- +bookCollapseSection: true +weight: 20 +--- + diff --git a/website/content/ChapterFour/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away.md b/website/content/ChapterFour/1400~1499/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away.md similarity index 86% rename from website/content/ChapterFour/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away.md rename to website/content/ChapterFour/1400~1499/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away.md index a0ba4c22..45800178 100644 --- a/website/content/ChapterFour/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away.md +++ b/website/content/ChapterFour/1400~1499/1437.Check-If-All-1s-Are-at-Least-Length-K-Places-Away.md @@ -75,6 +75,6 @@ func kLengthApart(nums []int, k int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence.md b/website/content/ChapterFour/1400~1499/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence.md similarity index 91% rename from website/content/ChapterFour/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence.md rename to website/content/ChapterFour/1400~1499/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence.md index f224d37d..09d90aec 100644 --- a/website/content/ChapterFour/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence.md +++ b/website/content/ChapterFour/1400~1499/1455.Check-If-a-Word-Occurs-As-a-Prefix-of-Any-Word-in-a-Sentence.md @@ -100,6 +100,6 @@ func isPrefixOfWord(sentence string, searchWord string) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1463.Cherry-Pickup-II.md b/website/content/ChapterFour/1400~1499/1463.Cherry-Pickup-II.md similarity index 85% rename from website/content/ChapterFour/1463.Cherry-Pickup-II.md rename to website/content/ChapterFour/1400~1499/1463.Cherry-Pickup-II.md index fe8beb59..2736380d 100644 --- a/website/content/ChapterFour/1463.Cherry-Pickup-II.md +++ b/website/content/ChapterFour/1400~1499/1463.Cherry-Pickup-II.md @@ -46,6 +46,6 @@ Output: 4 ---------------------------------------------- diff --git a/website/content/ChapterFour/1464.Maximum-Product-of-Two-Elements-in-an-Array.md b/website/content/ChapterFour/1400~1499/1464.Maximum-Product-of-Two-Elements-in-an-Array.md similarity index 86% rename from website/content/ChapterFour/1464.Maximum-Product-of-Two-Elements-in-an-Array.md rename to website/content/ChapterFour/1400~1499/1464.Maximum-Product-of-Two-Elements-in-an-Array.md index c727b889..8f75c287 100644 --- a/website/content/ChapterFour/1464.Maximum-Product-of-Two-Elements-in-an-Array.md +++ b/website/content/ChapterFour/1400~1499/1464.Maximum-Product-of-Two-Elements-in-an-Array.md @@ -68,6 +68,6 @@ func maxProduct(nums []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1470.Shuffle-the-Array.md b/website/content/ChapterFour/1400~1499/1470.Shuffle-the-Array.md similarity index 84% rename from website/content/ChapterFour/1470.Shuffle-the-Array.md rename to website/content/ChapterFour/1400~1499/1470.Shuffle-the-Array.md index 571c6c2e..f010ba9f 100644 --- a/website/content/ChapterFour/1470.Shuffle-the-Array.md +++ b/website/content/ChapterFour/1400~1499/1470.Shuffle-the-Array.md @@ -66,6 +66,6 @@ func shuffle(nums []int, n int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1480.Running-Sum-of-1d-Array.md b/website/content/ChapterFour/1400~1499/1480.Running-Sum-of-1d-Array.md similarity index 84% rename from website/content/ChapterFour/1480.Running-Sum-of-1d-Array.md rename to website/content/ChapterFour/1400~1499/1480.Running-Sum-of-1d-Array.md index 12573981..f3bde070 100644 --- a/website/content/ChapterFour/1480.Running-Sum-of-1d-Array.md +++ b/website/content/ChapterFour/1400~1499/1480.Running-Sum-of-1d-Array.md @@ -66,6 +66,6 @@ func runningSum(nums []int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1400~1499/_index.md b/website/content/ChapterFour/1400~1499/_index.md new file mode 100644 index 00000000..d2021683 --- /dev/null +++ b/website/content/ChapterFour/1400~1499/_index.md @@ -0,0 +1,5 @@ +--- +bookCollapseSection: true +weight: 20 +--- + diff --git a/website/content/ChapterFour/1512.Number-of-Good-Pairs.md b/website/content/ChapterFour/1500~1599/1512.Number-of-Good-Pairs.md similarity index 83% rename from website/content/ChapterFour/1512.Number-of-Good-Pairs.md rename to website/content/ChapterFour/1500~1599/1512.Number-of-Good-Pairs.md index 5d5db6bf..327a4e92 100644 --- a/website/content/ChapterFour/1512.Number-of-Good-Pairs.md +++ b/website/content/ChapterFour/1500~1599/1512.Number-of-Good-Pairs.md @@ -69,6 +69,6 @@ func numIdenticalPairs(nums []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1539.Kth-Missing-Positive-Number.md b/website/content/ChapterFour/1500~1599/1539.Kth-Missing-Positive-Number.md similarity index 86% rename from website/content/ChapterFour/1539.Kth-Missing-Positive-Number.md rename to website/content/ChapterFour/1500~1599/1539.Kth-Missing-Positive-Number.md index 9ec04f9e..4052881d 100644 --- a/website/content/ChapterFour/1539.Kth-Missing-Positive-Number.md +++ b/website/content/ChapterFour/1500~1599/1539.Kth-Missing-Positive-Number.md @@ -65,6 +65,6 @@ func findKthPositive(arr []int, k int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1573.Number-of-Ways-to-Split-a-String.md b/website/content/ChapterFour/1500~1599/1573.Number-of-Ways-to-Split-a-String.md similarity index 90% rename from website/content/ChapterFour/1573.Number-of-Ways-to-Split-a-String.md rename to website/content/ChapterFour/1500~1599/1573.Number-of-Ways-to-Split-a-String.md index 9060eded..956091f2 100644 --- a/website/content/ChapterFour/1573.Number-of-Ways-to-Split-a-String.md +++ b/website/content/ChapterFour/1500~1599/1573.Number-of-Ways-to-Split-a-String.md @@ -110,6 +110,6 @@ func numWays(s string) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1500~1599/_index.md b/website/content/ChapterFour/1500~1599/_index.md new file mode 100644 index 00000000..d2021683 --- /dev/null +++ b/website/content/ChapterFour/1500~1599/_index.md @@ -0,0 +1,5 @@ +--- +bookCollapseSection: true +weight: 20 +--- + diff --git a/website/content/ChapterFour/1640.Check-Array-Formation-Through-Concatenation.md b/website/content/ChapterFour/1600~1699/1640.Check-Array-Formation-Through-Concatenation.md similarity index 92% rename from website/content/ChapterFour/1640.Check-Array-Formation-Through-Concatenation.md rename to website/content/ChapterFour/1600~1699/1640.Check-Array-Formation-Through-Concatenation.md index 5889f65b..10c25e7e 100644 --- a/website/content/ChapterFour/1640.Check-Array-Formation-Through-Concatenation.md +++ b/website/content/ChapterFour/1600~1699/1640.Check-Array-Formation-Through-Concatenation.md @@ -97,6 +97,6 @@ func canFormArray(arr []int, pieces [][]int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/1641.Count-Sorted-Vowel-Strings.md b/website/content/ChapterFour/1600~1699/1641.Count-Sorted-Vowel-Strings.md similarity index 92% rename from website/content/ChapterFour/1641.Count-Sorted-Vowel-Strings.md rename to website/content/ChapterFour/1600~1699/1641.Count-Sorted-Vowel-Strings.md index 79480691..88f0b709 100644 --- a/website/content/ChapterFour/1641.Count-Sorted-Vowel-Strings.md +++ b/website/content/ChapterFour/1600~1699/1641.Count-Sorted-Vowel-Strings.md @@ -92,6 +92,6 @@ func countVowelStrings1(n int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1646.Get-Maximum-in-Generated-Array.md b/website/content/ChapterFour/1600~1699/1646.Get-Maximum-in-Generated-Array.md similarity index 89% rename from website/content/ChapterFour/1646.Get-Maximum-in-Generated-Array.md rename to website/content/ChapterFour/1600~1699/1646.Get-Maximum-in-Generated-Array.md index b14b1501..0c91d006 100644 --- a/website/content/ChapterFour/1646.Get-Maximum-in-Generated-Array.md +++ b/website/content/ChapterFour/1600~1699/1646.Get-Maximum-in-Generated-Array.md @@ -98,6 +98,6 @@ func getMaximumGenerated(n int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique.md b/website/content/ChapterFour/1600~1699/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique.md similarity index 91% rename from website/content/ChapterFour/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique.md rename to website/content/ChapterFour/1600~1699/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique.md index dddd6ba1..738cb917 100644 --- a/website/content/ChapterFour/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique.md +++ b/website/content/ChapterFour/1600~1699/1647.Minimum-Deletions-to-Make-Character-Frequencies-Unique.md @@ -91,6 +91,6 @@ func minDeletions(s string) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1648.Sell-Diminishing-Valued-Colored-Balls.md b/website/content/ChapterFour/1600~1699/1648.Sell-Diminishing-Valued-Colored-Balls.md similarity index 96% rename from website/content/ChapterFour/1648.Sell-Diminishing-Valued-Colored-Balls.md rename to website/content/ChapterFour/1600~1699/1648.Sell-Diminishing-Valued-Colored-Balls.md index f65f56cb..6884175a 100644 --- a/website/content/ChapterFour/1648.Sell-Diminishing-Valued-Colored-Balls.md +++ b/website/content/ChapterFour/1600~1699/1648.Sell-Diminishing-Valued-Colored-Balls.md @@ -133,6 +133,6 @@ func maxProfit(inventory []int, orders int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1649.Create-Sorted-Array-through-Instructions.md b/website/content/ChapterFour/1600~1699/1649.Create-Sorted-Array-through-Instructions.md similarity index 96% rename from website/content/ChapterFour/1649.Create-Sorted-Array-through-Instructions.md rename to website/content/ChapterFour/1600~1699/1649.Create-Sorted-Array-through-Instructions.md index 69450ff8..63f7c120 100644 --- a/website/content/ChapterFour/1649.Create-Sorted-Array-through-Instructions.md +++ b/website/content/ChapterFour/1600~1699/1649.Create-Sorted-Array-through-Instructions.md @@ -191,6 +191,6 @@ func (b *BIT) get(i int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1652.Defuse-the-Bomb.md b/website/content/ChapterFour/1600~1699/1652.Defuse-the-Bomb.md similarity index 92% rename from website/content/ChapterFour/1652.Defuse-the-Bomb.md rename to website/content/ChapterFour/1600~1699/1652.Defuse-the-Bomb.md index 3ae46fce..8f5dc35f 100644 --- a/website/content/ChapterFour/1652.Defuse-the-Bomb.md +++ b/website/content/ChapterFour/1600~1699/1652.Defuse-the-Bomb.md @@ -127,6 +127,6 @@ func decrypt(code []int, k int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1653.Minimum-Deletions-to-Make-String-Balanced.md b/website/content/ChapterFour/1600~1699/1653.Minimum-Deletions-to-Make-String-Balanced.md similarity index 93% rename from website/content/ChapterFour/1653.Minimum-Deletions-to-Make-String-Balanced.md rename to website/content/ChapterFour/1600~1699/1653.Minimum-Deletions-to-Make-String-Balanced.md index bd2ee314..15d8427e 100644 --- a/website/content/ChapterFour/1653.Minimum-Deletions-to-Make-String-Balanced.md +++ b/website/content/ChapterFour/1600~1699/1653.Minimum-Deletions-to-Make-String-Balanced.md @@ -92,6 +92,6 @@ func minimumDeletions1(s string) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1654.Minimum-Jumps-to-Reach-Home.md b/website/content/ChapterFour/1600~1699/1654.Minimum-Jumps-to-Reach-Home.md similarity index 93% rename from website/content/ChapterFour/1654.Minimum-Jumps-to-Reach-Home.md rename to website/content/ChapterFour/1600~1699/1654.Minimum-Jumps-to-Reach-Home.md index 793f382c..bc5f9a41 100644 --- a/website/content/ChapterFour/1654.Minimum-Jumps-to-Reach-Home.md +++ b/website/content/ChapterFour/1600~1699/1654.Minimum-Jumps-to-Reach-Home.md @@ -103,6 +103,6 @@ func minimumJumps(forbidden []int, a int, b int, x int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1655.Distribute-Repeating-Integers.md b/website/content/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md similarity index 92% rename from website/content/ChapterFour/1655.Distribute-Repeating-Integers.md rename to website/content/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md index 41977eef..ca4122a8 100644 --- a/website/content/ChapterFour/1655.Distribute-Repeating-Integers.md +++ b/website/content/ChapterFour/1600~1699/1655.Distribute-Repeating-Integers.md @@ -114,6 +114,6 @@ func dfs(freq map[int]int, quantity []int) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/1656.Design-an-Ordered-Stream.md b/website/content/ChapterFour/1600~1699/1656.Design-an-Ordered-Stream.md similarity index 94% rename from website/content/ChapterFour/1656.Design-an-Ordered-Stream.md rename to website/content/ChapterFour/1600~1699/1656.Design-an-Ordered-Stream.md index 39c33d70..d71767f0 100644 --- a/website/content/ChapterFour/1656.Design-an-Ordered-Stream.md +++ b/website/content/ChapterFour/1600~1699/1656.Design-an-Ordered-Stream.md @@ -108,6 +108,6 @@ func (this *OrderedStream) Insert(id int, value string) []string { ---------------------------------------------- diff --git a/website/content/ChapterFour/1657.Determine-if-Two-Strings-Are-Close.md b/website/content/ChapterFour/1600~1699/1657.Determine-if-Two-Strings-Are-Close.md similarity index 93% rename from website/content/ChapterFour/1657.Determine-if-Two-Strings-Are-Close.md rename to website/content/ChapterFour/1600~1699/1657.Determine-if-Two-Strings-Are-Close.md index 82d429e8..c36f7fa2 100644 --- a/website/content/ChapterFour/1657.Determine-if-Two-Strings-Are-Close.md +++ b/website/content/ChapterFour/1600~1699/1657.Determine-if-Two-Strings-Are-Close.md @@ -116,6 +116,6 @@ func closeStrings(word1 string, word2 string) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/1658.Minimum-Operations-to-Reduce-X-to-Zero.md b/website/content/ChapterFour/1600~1699/1658.Minimum-Operations-to-Reduce-X-to-Zero.md similarity index 92% rename from website/content/ChapterFour/1658.Minimum-Operations-to-Reduce-X-to-Zero.md rename to website/content/ChapterFour/1600~1699/1658.Minimum-Operations-to-Reduce-X-to-Zero.md index 955f6f2b..021824d2 100644 --- a/website/content/ChapterFour/1658.Minimum-Operations-to-Reduce-X-to-Zero.md +++ b/website/content/ChapterFour/1600~1699/1658.Minimum-Operations-to-Reduce-X-to-Zero.md @@ -98,6 +98,6 @@ func max(a, b int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1659.Maximize-Grid-Happiness.md b/website/content/ChapterFour/1600~1699/1659.Maximize-Grid-Happiness.md similarity index 97% rename from website/content/ChapterFour/1659.Maximize-Grid-Happiness.md rename to website/content/ChapterFour/1600~1699/1659.Maximize-Grid-Happiness.md index 73f3ed57..049e5fcf 100644 --- a/website/content/ChapterFour/1659.Maximize-Grid-Happiness.md +++ b/website/content/ChapterFour/1600~1699/1659.Maximize-Grid-Happiness.md @@ -187,6 +187,6 @@ func max(a int, b int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1662.Check-If-Two-String-Arrays-are-Equivalent.md b/website/content/ChapterFour/1600~1699/1662.Check-If-Two-String-Arrays-are-Equivalent.md similarity index 87% rename from website/content/ChapterFour/1662.Check-If-Two-String-Arrays-are-Equivalent.md rename to website/content/ChapterFour/1600~1699/1662.Check-If-Two-String-Arrays-are-Equivalent.md index 84931259..4b99dc3e 100644 --- a/website/content/ChapterFour/1662.Check-If-Two-String-Arrays-are-Equivalent.md +++ b/website/content/ChapterFour/1600~1699/1662.Check-If-Two-String-Arrays-are-Equivalent.md @@ -67,6 +67,6 @@ func arrayStringsAreEqual(word1 []string, word2 []string) bool { ---------------------------------------------- diff --git a/website/content/ChapterFour/1663.Smallest-String-With-A-Given-Numeric-Value.md b/website/content/ChapterFour/1600~1699/1663.Smallest-String-With-A-Given-Numeric-Value.md similarity index 93% rename from website/content/ChapterFour/1663.Smallest-String-With-A-Given-Numeric-Value.md rename to website/content/ChapterFour/1600~1699/1663.Smallest-String-With-A-Given-Numeric-Value.md index e6875609..b373c410 100644 --- a/website/content/ChapterFour/1663.Smallest-String-With-A-Given-Numeric-Value.md +++ b/website/content/ChapterFour/1600~1699/1663.Smallest-String-With-A-Given-Numeric-Value.md @@ -104,6 +104,6 @@ func findSmallestString(value int, length, k, index int, str []byte, res *string ---------------------------------------------- diff --git a/website/content/ChapterFour/1664.Ways-to-Make-a-Fair-Array.md b/website/content/ChapterFour/1600~1699/1664.Ways-to-Make-a-Fair-Array.md similarity index 94% rename from website/content/ChapterFour/1664.Ways-to-Make-a-Fair-Array.md rename to website/content/ChapterFour/1600~1699/1664.Ways-to-Make-a-Fair-Array.md index 45d86fc9..1c607617 100644 --- a/website/content/ChapterFour/1664.Ways-to-Make-a-Fair-Array.md +++ b/website/content/ChapterFour/1600~1699/1664.Ways-to-Make-a-Fair-Array.md @@ -118,6 +118,6 @@ func waysToMakeFair1(nums []int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1665.Minimum-Initial-Energy-to-Finish-Tasks.md b/website/content/ChapterFour/1600~1699/1665.Minimum-Initial-Energy-to-Finish-Tasks.md similarity index 94% rename from website/content/ChapterFour/1665.Minimum-Initial-Energy-to-Finish-Tasks.md rename to website/content/ChapterFour/1600~1699/1665.Minimum-Initial-Energy-to-Finish-Tasks.md index 6518e98a..e201a20d 100644 --- a/website/content/ChapterFour/1665.Minimum-Initial-Energy-to-Finish-Tasks.md +++ b/website/content/ChapterFour/1600~1699/1665.Minimum-Initial-Energy-to-Finish-Tasks.md @@ -130,6 +130,6 @@ func (task Task) Swap(i, j int) { ---------------------------------------------- diff --git a/website/content/ChapterFour/1668.Maximum-Repeating-Substring.md b/website/content/ChapterFour/1600~1699/1668.Maximum-Repeating-Substring.md similarity index 89% rename from website/content/ChapterFour/1668.Maximum-Repeating-Substring.md rename to website/content/ChapterFour/1600~1699/1668.Maximum-Repeating-Substring.md index 91c3fd9d..f86e6bc1 100644 --- a/website/content/ChapterFour/1668.Maximum-Repeating-Substring.md +++ b/website/content/ChapterFour/1600~1699/1668.Maximum-Repeating-Substring.md @@ -71,6 +71,6 @@ func maxRepeating(sequence string, word string) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1669.Merge-In-Between-Linked-Lists.md b/website/content/ChapterFour/1600~1699/1669.Merge-In-Between-Linked-Lists.md similarity index 89% rename from website/content/ChapterFour/1669.Merge-In-Between-Linked-Lists.md rename to website/content/ChapterFour/1600~1699/1669.Merge-In-Between-Linked-Lists.md index fdd831d1..05e4afc4 100644 --- a/website/content/ChapterFour/1669.Merge-In-Between-Linked-Lists.md +++ b/website/content/ChapterFour/1600~1699/1669.Merge-In-Between-Linked-Lists.md @@ -77,6 +77,6 @@ func mergeInBetween(list1 *ListNode, a int, b int, list2 *ListNode) *ListNode { ---------------------------------------------- diff --git a/website/content/ChapterFour/1670.Design-Front-Middle-Back-Queue.md b/website/content/ChapterFour/1600~1699/1670.Design-Front-Middle-Back-Queue.md similarity index 95% rename from website/content/ChapterFour/1670.Design-Front-Middle-Back-Queue.md rename to website/content/ChapterFour/1600~1699/1670.Design-Front-Middle-Back-Queue.md index 533fa366..db98ab36 100644 --- a/website/content/ChapterFour/1670.Design-Front-Middle-Back-Queue.md +++ b/website/content/ChapterFour/1600~1699/1670.Design-Front-Middle-Back-Queue.md @@ -174,6 +174,6 @@ func (this *FrontMiddleBackQueue) PopBack() int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1672.Richest-Customer-Wealth.md b/website/content/ChapterFour/1600~1699/1672.Richest-Customer-Wealth.md similarity index 88% rename from website/content/ChapterFour/1672.Richest-Customer-Wealth.md rename to website/content/ChapterFour/1600~1699/1672.Richest-Customer-Wealth.md index 13a3b114..72e287b6 100644 --- a/website/content/ChapterFour/1672.Richest-Customer-Wealth.md +++ b/website/content/ChapterFour/1600~1699/1672.Richest-Customer-Wealth.md @@ -74,6 +74,6 @@ func maximumWealth(accounts [][]int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1673.Find-the-Most-Competitive-Subsequence.md b/website/content/ChapterFour/1600~1699/1673.Find-the-Most-Competitive-Subsequence.md similarity index 90% rename from website/content/ChapterFour/1673.Find-the-Most-Competitive-Subsequence.md rename to website/content/ChapterFour/1600~1699/1673.Find-the-Most-Competitive-Subsequence.md index b0b30764..02292dd4 100644 --- a/website/content/ChapterFour/1673.Find-the-Most-Competitive-Subsequence.md +++ b/website/content/ChapterFour/1600~1699/1673.Find-the-Most-Competitive-Subsequence.md @@ -64,6 +64,6 @@ func mostCompetitive(nums []int, k int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1674.Minimum-Moves-to-Make-Array-Complementary.md b/website/content/ChapterFour/1600~1699/1674.Minimum-Moves-to-Make-Array-Complementary.md similarity index 93% rename from website/content/ChapterFour/1674.Minimum-Moves-to-Make-Array-Complementary.md rename to website/content/ChapterFour/1600~1699/1674.Minimum-Moves-to-Make-Array-Complementary.md index 31ade1f0..306c924e 100644 --- a/website/content/ChapterFour/1674.Minimum-Moves-to-Make-Array-Complementary.md +++ b/website/content/ChapterFour/1600~1699/1674.Minimum-Moves-to-Make-Array-Complementary.md @@ -99,6 +99,6 @@ func max(a, b int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1678.Goal-Parser-Interpretation.md b/website/content/ChapterFour/1600~1699/1678.Goal-Parser-Interpretation.md similarity index 88% rename from website/content/ChapterFour/1678.Goal-Parser-Interpretation.md rename to website/content/ChapterFour/1600~1699/1678.Goal-Parser-Interpretation.md index 0027dd5b..a7cbeff6 100644 --- a/website/content/ChapterFour/1678.Goal-Parser-Interpretation.md +++ b/website/content/ChapterFour/1600~1699/1678.Goal-Parser-Interpretation.md @@ -75,6 +75,6 @@ func interpret(command string) string { ---------------------------------------------- diff --git a/website/content/ChapterFour/1679.Max-Number-of-K-Sum-Pairs.md b/website/content/ChapterFour/1600~1699/1679.Max-Number-of-K-Sum-Pairs.md similarity index 90% rename from website/content/ChapterFour/1679.Max-Number-of-K-Sum-Pairs.md rename to website/content/ChapterFour/1600~1699/1679.Max-Number-of-K-Sum-Pairs.md index a573fadc..f95055aa 100644 --- a/website/content/ChapterFour/1679.Max-Number-of-K-Sum-Pairs.md +++ b/website/content/ChapterFour/1600~1699/1679.Max-Number-of-K-Sum-Pairs.md @@ -100,6 +100,6 @@ func maxOperations_(nums []int, k int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1680.Concatenation-of-Consecutive-Binary-Numbers.md b/website/content/ChapterFour/1600~1699/1680.Concatenation-of-Consecutive-Binary-Numbers.md similarity index 92% rename from website/content/ChapterFour/1680.Concatenation-of-Consecutive-Binary-Numbers.md rename to website/content/ChapterFour/1600~1699/1680.Concatenation-of-Consecutive-Binary-Numbers.md index 5fc06173..085376b2 100644 --- a/website/content/ChapterFour/1680.Concatenation-of-Consecutive-Binary-Numbers.md +++ b/website/content/ChapterFour/1600~1699/1680.Concatenation-of-Consecutive-Binary-Numbers.md @@ -97,6 +97,6 @@ func concatenatedBinary1(n int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1681.Minimum-Incompatibility.md b/website/content/ChapterFour/1600~1699/1681.Minimum-Incompatibility.md similarity index 94% rename from website/content/ChapterFour/1681.Minimum-Incompatibility.md rename to website/content/ChapterFour/1600~1699/1681.Minimum-Incompatibility.md index ebc5c06a..e8a267e6 100644 --- a/website/content/ChapterFour/1681.Minimum-Incompatibility.md +++ b/website/content/ChapterFour/1600~1699/1681.Minimum-Incompatibility.md @@ -124,6 +124,6 @@ func generatePermutation1681(nums, counts, order []int, index, sum, eachSize int ---------------------------------------------- diff --git a/website/content/ChapterFour/1684.Count-the-Number-of-Consistent-Strings.md b/website/content/ChapterFour/1600~1699/1684.Count-the-Number-of-Consistent-Strings.md similarity index 89% rename from website/content/ChapterFour/1684.Count-the-Number-of-Consistent-Strings.md rename to website/content/ChapterFour/1600~1699/1684.Count-the-Number-of-Consistent-Strings.md index 9cce9fd7..afe034b5 100644 --- a/website/content/ChapterFour/1684.Count-the-Number-of-Consistent-Strings.md +++ b/website/content/ChapterFour/1600~1699/1684.Count-the-Number-of-Consistent-Strings.md @@ -81,6 +81,6 @@ func countConsistentStrings(allowed string, words []string) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array.md b/website/content/ChapterFour/1600~1699/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array.md similarity index 92% rename from website/content/ChapterFour/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array.md rename to website/content/ChapterFour/1600~1699/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array.md index 690f9b1d..4ab16dc7 100644 --- a/website/content/ChapterFour/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array.md +++ b/website/content/ChapterFour/1600~1699/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array.md @@ -90,6 +90,6 @@ func getSumAbsoluteDifferences1(nums []int) []int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1688.Count-of-Matches-in-Tournament.md b/website/content/ChapterFour/1600~1699/1688.Count-of-Matches-in-Tournament.md similarity index 89% rename from website/content/ChapterFour/1688.Count-of-Matches-in-Tournament.md rename to website/content/ChapterFour/1600~1699/1688.Count-of-Matches-in-Tournament.md index fc73c685..e8a8c392 100644 --- a/website/content/ChapterFour/1688.Count-of-Matches-in-Tournament.md +++ b/website/content/ChapterFour/1600~1699/1688.Count-of-Matches-in-Tournament.md @@ -82,6 +82,6 @@ func numberOfMatches1(n int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers.md b/website/content/ChapterFour/1600~1699/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers.md similarity index 89% rename from website/content/ChapterFour/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers.md rename to website/content/ChapterFour/1600~1699/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers.md index bb6b7c53..f3494ed4 100644 --- a/website/content/ChapterFour/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers.md +++ b/website/content/ChapterFour/1600~1699/1689.Partitioning-Into-Minimum-Number-Of-Deci-Binary-Numbers.md @@ -62,6 +62,6 @@ func minPartitions(n string) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1690.Stone-Game-VII.md b/website/content/ChapterFour/1600~1699/1690.Stone-Game-VII.md similarity index 95% rename from website/content/ChapterFour/1690.Stone-Game-VII.md rename to website/content/ChapterFour/1600~1699/1690.Stone-Game-VII.md index cdb41310..808f21e1 100644 --- a/website/content/ChapterFour/1690.Stone-Game-VII.md +++ b/website/content/ChapterFour/1600~1699/1690.Stone-Game-VII.md @@ -132,6 +132,6 @@ func max(a, b int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1694.Reformat-Phone-Number.md b/website/content/ChapterFour/1600~1699/1694.Reformat-Phone-Number.md similarity index 94% rename from website/content/ChapterFour/1694.Reformat-Phone-Number.md rename to website/content/ChapterFour/1600~1699/1694.Reformat-Phone-Number.md index b878af68..f27cf352 100644 --- a/website/content/ChapterFour/1694.Reformat-Phone-Number.md +++ b/website/content/ChapterFour/1600~1699/1694.Reformat-Phone-Number.md @@ -137,6 +137,6 @@ func reformatNumber(number string) string { ---------------------------------------------- diff --git a/website/content/ChapterFour/1695.Maximum-Erasure-Value.md b/website/content/ChapterFour/1600~1699/1695.Maximum-Erasure-Value.md similarity index 90% rename from website/content/ChapterFour/1695.Maximum-Erasure-Value.md rename to website/content/ChapterFour/1600~1699/1695.Maximum-Erasure-Value.md index 890a6128..7ca5b884 100644 --- a/website/content/ChapterFour/1695.Maximum-Erasure-Value.md +++ b/website/content/ChapterFour/1600~1699/1695.Maximum-Erasure-Value.md @@ -77,6 +77,6 @@ func max(a int, b int) int { ---------------------------------------------- diff --git a/website/content/ChapterFour/1696.Jump-Game-VI.md b/website/content/ChapterFour/1600~1699/1696.Jump-Game-VI.md similarity index 97% rename from website/content/ChapterFour/1696.Jump-Game-VI.md rename to website/content/ChapterFour/1600~1699/1696.Jump-Game-VI.md index 9186a0f5..2aefdf94 100644 --- a/website/content/ChapterFour/1696.Jump-Game-VI.md +++ b/website/content/ChapterFour/1600~1699/1696.Jump-Game-VI.md @@ -110,5 +110,5 @@ func max(a, b int) int { ---------------------------------------------- - + diff --git a/website/content/ChapterFour/1600~1699/_index.md b/website/content/ChapterFour/1600~1699/_index.md new file mode 100644 index 00000000..d2021683 --- /dev/null +++ b/website/content/ChapterFour/1600~1699/_index.md @@ -0,0 +1,5 @@ +--- +bookCollapseSection: true +weight: 20 +--- + diff --git a/website/content/ChapterFour/_index.md b/website/content/ChapterFour/_index.md index bcc5b320..b3eaba6b 100644 --- a/website/content/ChapterFour/_index.md +++ b/website/content/ChapterFour/_index.md @@ -1,9 +1,10 @@ --- -title: 第四章 +title: 第四章 LeetCode 题解 type: docs +weight: 4 --- -# 第四章 Leetcode 题解 +# 第四章 LeetCode 题解
@@ -20,5 +21,5 @@ type: docs
----------------------------------------------