algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-06 09:23:19 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add solution 0810

Browse Source
This commit is contained in:
YDZ
2021-05-22 22:27:03 +08:00
parent 991cb6e3d7
commit 9dbefba7cd
12 changed files with 232 additions and 52 deletions
Download Patch File Download Diff File Expand all files Collapse all files

88
README.md
View File

@ -126,16 +126,16 @@
| | Easy | Medium | Hard | Total | | | Easy | Medium | Hard | Total |
|:--------:|:--------:|:--------:|:--------:|:--------:| |:--------:|:--------:|:--------:|:--------:|:--------:|
|Optimizing|35|33|21|89| |Optimizing|35|33|20|88|
|Accepted|**283**|**376**|**111**|**770**| |Accepted|**283**|**376**|**111**|**770**|
|Total|490|985|393|1868| |Total|490|985|393|1868|
|Perfection Rate|87.6%|91.2%|81.1%|88.4%| |Perfection Rate|87.6%|91.2%|82.0%|88.6%|
|Completion Rate|57.8%|38.2%|28.2%|41.2%| |Completion Rate|57.8%|38.2%|28.2%|41.2%|
|------------|----------------------------|----------------------------|----------------------------|----------------------------| |------------|----------------------------|----------------------------|----------------------------|----------------------------|
## 二. 目录 ## 二. 目录
以下已经收录了 681 道题的题解，还有 11 道题在尝试优化到 beats 100% 以下已经收录了 682 道题的题解，还有 11 道题在尝试优化到 beats 100%
| No. | Title | Solution | Acceptance | Difficulty | Frequency | | No. | Title | Solution | Acceptance | Difficulty | Frequency |
|:--------:|:--------------------------------------------------------------|:--------:|:--------:|:--------:|:--------:| |:--------:|:--------------------------------------------------------------|:--------:|:--------:|:--------:|:--------:|
@ -189,7 +189,7 @@
|0048|Rotate Image|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0048.Rotate-Image)|61.5%|Medium|| |0048|Rotate Image|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0048.Rotate-Image)|61.5%|Medium||
|0049|Group Anagrams|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0049.Group-Anagrams)|60.2%|Medium|| |0049|Group Anagrams|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0049.Group-Anagrams)|60.2%|Medium||
|0050|Pow(x, n)|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0050.Pow(x,-n))|31.2%|Medium|| |0050|Pow(x, n)|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0050.Pow(x,-n))|31.2%|Medium||
|0051|N-Queens|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0051.N-Queens)|51.1%|Hard|| |0051|N-Queens|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0051.N-Queens)|51.2%|Hard||
|0052|N-Queens II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0052.N-Queens-II)|61.1%|Hard|| |0052|N-Queens II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0052.N-Queens-II)|61.1%|Hard||
|0053|Maximum Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0053.Maximum-Subarray)|48.0%|Easy|| |0053|Maximum Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0053.Maximum-Subarray)|48.0%|Easy||
|0054|Spiral Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0054.Spiral-Matrix)|36.9%|Medium|| |0054|Spiral Matrix|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0054.Spiral-Matrix)|36.9%|Medium||
@ -289,7 +289,7 @@
|0148|Sort List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0148.Sort-List)|47.1%|Medium|| |0148|Sort List|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0148.Sort-List)|47.1%|Medium||
|0149|Max Points on a Line||18.0%|Hard|| |0149|Max Points on a Line||18.0%|Hard||
|0150|Evaluate Reverse Polish Notation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0150.Evaluate-Reverse-Polish-Notation)|38.6%|Medium|| |0150|Evaluate Reverse Polish Notation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0150.Evaluate-Reverse-Polish-Notation)|38.6%|Medium||
|0151|Reverse Words in a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0151.Reverse-Words-in-a-String)|24.5%|Medium|| |0151|Reverse Words in a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0151.Reverse-Words-in-a-String)|24.6%|Medium||
|0152|Maximum Product Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0152.Maximum-Product-Subarray)|33.0%|Medium|| |0152|Maximum Product Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0152.Maximum-Product-Subarray)|33.0%|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.6%|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.6%|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)|42.2%|Hard|| |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.2%|Hard||
@ -390,7 +390,7 @@
|0249|Group Shifted Strings||58.9%|Medium|| |0249|Group Shifted Strings||58.9%|Medium||
|0250|Count Univalue Subtrees||53.7%|Medium|| |0250|Count Univalue Subtrees||53.7%|Medium||
|0251|Flatten 2D Vector||46.6%|Medium|| |0251|Flatten 2D Vector||46.6%|Medium||
|0252|Meeting Rooms||55.7%|Easy|| |0252|Meeting Rooms||55.6%|Easy||
|0253|Meeting Rooms II||47.4%|Medium|| |0253|Meeting Rooms II||47.4%|Medium||
|0254|Factor Combinations||47.7%|Medium|| |0254|Factor Combinations||47.7%|Medium||
|0255|Verify Preorder Sequence in Binary Search Tree||46.6%|Medium|| |0255|Verify Preorder Sequence in Binary Search Tree||46.6%|Medium||
@ -559,7 +559,7 @@
|0418|Sentence Screen Fitting||33.8%|Medium|| |0418|Sentence Screen Fitting||33.8%|Medium||
|0419|Battleships in a Board||71.5%|Medium|| |0419|Battleships in a Board||71.5%|Medium||
|0420|Strong Password Checker||13.7%|Hard|| |0420|Strong Password Checker||13.7%|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.6%|Medium|| |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.5%|Medium||
|0422|Valid Word Square||38.3%|Easy|| |0422|Valid Word Square||38.3%|Easy||
|0423|Reconstruct Original Digits from English|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0423.Reconstruct-Original-Digits-from-English)|51.0%|Medium|| |0423|Reconstruct Original Digits from English|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0423.Reconstruct-Original-Digits-from-English)|51.0%|Medium||
|0424|Longest Repeating Character Replacement|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0424.Longest-Repeating-Character-Replacement)|48.6%|Medium|| |0424|Longest Repeating Character Replacement|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0424.Longest-Repeating-Character-Replacement)|48.6%|Medium||
@ -809,7 +809,7 @@
|0668|Kth Smallest Number in Multiplication Table|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0668.Kth-Smallest-Number-in-Multiplication-Table)|48.1%|Hard|| |0668|Kth Smallest Number in Multiplication Table|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0668.Kth-Smallest-Number-in-Multiplication-Table)|48.1%|Hard||
|0669|Trim a Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0669.Trim-a-Binary-Search-Tree)|64.4%|Medium|| |0669|Trim a Binary Search Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0669.Trim-a-Binary-Search-Tree)|64.4%|Medium||
|0670|Maximum Swap||45.4%|Medium|| |0670|Maximum Swap||45.4%|Medium||
|0671|Second Minimum Node In a Binary Tree||42.8%|Easy|| |0671|Second Minimum Node In a Binary Tree||42.9%|Easy||
|0672|Bulb Switcher II||51.1%|Medium|| |0672|Bulb Switcher II||51.1%|Medium||
|0673|Number of Longest Increasing Subsequence||38.8%|Medium|| |0673|Number of Longest Increasing Subsequence||38.8%|Medium||
|0674|Longest Continuous Increasing Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0674.Longest-Continuous-Increasing-Subsequence)|46.1%|Easy|| |0674|Longest Continuous Increasing Subsequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0674.Longest-Continuous-Increasing-Subsequence)|46.1%|Easy||
@ -826,10 +826,10 @@
|0685|Redundant Connection II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0685.Redundant-Connection-II)|33.2%|Hard|| |0685|Redundant Connection II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0685.Redundant-Connection-II)|33.2%|Hard||
|0686|Repeated String Match||32.9%|Medium|| |0686|Repeated String Match||32.9%|Medium||
|0687|Longest Univalue Path||37.8%|Medium|| |0687|Longest Univalue Path||37.8%|Medium||
|0688|Knight Probability in Chessboard||50.5%|Medium|| |0688|Knight Probability in Chessboard||50.4%|Medium||
|0689|Maximum Sum of 3 Non-Overlapping Subarrays||47.5%|Hard|| |0689|Maximum Sum of 3 Non-Overlapping Subarrays||47.5%|Hard||
|0690|Employee Importance|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0690.Employee-Importance)|59.3%|Easy|| |0690|Employee Importance|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0690.Employee-Importance)|59.3%|Easy||
|0691|Stickers to Spell Word||45.6%|Hard|| |0691|Stickers to Spell Word||45.5%|Hard||
|0692|Top K Frequent Words|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0692.Top-K-Frequent-Words)|53.4%|Medium|| |0692|Top K Frequent Words|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0692.Top-K-Frequent-Words)|53.4%|Medium||
|0693|Binary Number with Alternating Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0693.Binary-Number-with-Alternating-Bits)|60.1%|Easy|| |0693|Binary Number with Alternating Bits|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0693.Binary-Number-with-Alternating-Bits)|60.1%|Easy||
|0694|Number of Distinct Islands||58.3%|Medium|| |0694|Number of Distinct Islands||58.3%|Medium||
@ -918,7 +918,7 @@
|0777|Swap Adjacent in LR String||35.7%|Medium|| |0777|Swap Adjacent in LR String||35.7%|Medium||
|0778|Swim in Rising Water|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0778.Swim-in-Rising-Water)|55.1%|Hard|| |0778|Swim in Rising Water|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0778.Swim-in-Rising-Water)|55.1%|Hard||
|0779|K-th Symbol in Grammar||38.9%|Medium|| |0779|K-th Symbol in Grammar||38.9%|Medium||
|0780|Reaching Points||30.4%|Hard|| |0780|Reaching Points||30.5%|Hard||
|0781|Rabbits in Forest|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0781.Rabbits-in-Forest)|56.0%|Medium|| |0781|Rabbits in Forest|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0781.Rabbits-in-Forest)|56.0%|Medium||
|0782|Transform to Chessboard||47.1%|Hard|| |0782|Transform to Chessboard||47.1%|Hard||
|0783|Minimum Distance Between BST Nodes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0783.Minimum-Distance-Between-BST-Nodes)|54.4%|Easy|| |0783|Minimum Distance Between BST Nodes|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0783.Minimum-Distance-Between-BST-Nodes)|54.4%|Easy||
@ -948,7 +948,7 @@
|0807|Max Increase to Keep City Skyline||84.5%|Medium|| |0807|Max Increase to Keep City Skyline||84.5%|Medium||
|0808|Soup Servings||41.4%|Medium|| |0808|Soup Servings||41.4%|Medium||
|0809|Expressive Words||46.3%|Medium|| |0809|Expressive Words||46.3%|Medium||
|0810|Chalkboard XOR Game||50.7%|Hard|| |0810|Chalkboard XOR Game|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0810.Chalkboard-XOR-Game)|50.7%|Hard||
|0811|Subdomain Visit Count|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0811.Subdomain-Visit-Count)|72.0%|Easy|| |0811|Subdomain Visit Count|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0811.Subdomain-Visit-Count)|72.0%|Easy||
|0812|Largest Triangle Area|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0812.Largest-Triangle-Area)|59.2%|Easy|| |0812|Largest Triangle Area|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0812.Largest-Triangle-Area)|59.2%|Easy||
|0813|Largest Sum of Averages||51.3%|Medium|| |0813|Largest Sum of Averages||51.3%|Medium||
@ -1117,7 +1117,7 @@
|0976|Largest Perimeter Triangle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0976.Largest-Perimeter-Triangle)|59.5%|Easy|| |0976|Largest Perimeter Triangle|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0976.Largest-Perimeter-Triangle)|59.5%|Easy||
|0977|Squares of a Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0977.Squares-of-a-Sorted-Array)|71.7%|Easy|| |0977|Squares of a Sorted Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0977.Squares-of-a-Sorted-Array)|71.7%|Easy||
|0978|Longest Turbulent Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0978.Longest-Turbulent-Subarray)|46.7%|Medium|| |0978|Longest Turbulent Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0978.Longest-Turbulent-Subarray)|46.7%|Medium||
|0979|Distribute Coins in Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0979.Distribute-Coins-in-Binary-Tree)|70.0%|Medium|| |0979|Distribute Coins in Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0979.Distribute-Coins-in-Binary-Tree)|70.1%|Medium||
|0980|Unique Paths III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0980.Unique-Paths-III)|77.1%|Hard|| |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.4%|Medium|| |0981|Time Based Key-Value Store|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0981.Time-Based-Key-Value-Store)|54.4%|Medium||
|0982|Triples with Bitwise AND Equal To Zero||56.7%|Hard|| |0982|Triples with Bitwise AND Equal To Zero||56.7%|Hard||
@ -1128,7 +1128,7 @@
|0987|Vertical Order Traversal of a Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0987.Vertical-Order-Traversal-of-a-Binary-Tree)|39.2%|Hard|| |0987|Vertical Order Traversal of a Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0987.Vertical-Order-Traversal-of-a-Binary-Tree)|39.2%|Hard||
|0988|Smallest String Starting From Leaf||47.1%|Medium|| |0988|Smallest String Starting From Leaf||47.1%|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.9%|Easy|| |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.9%|Easy||
|0990|Satisfiability of Equality Equations|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0990.Satisfiability-of-Equality-Equations)|47.2%|Medium|| |0990|Satisfiability of Equality Equations|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0990.Satisfiability-of-Equality-Equations)|47.1%|Medium||
|0991|Broken Calculator|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0991.Broken-Calculator)|49.8%|Medium|| |0991|Broken Calculator|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0991.Broken-Calculator)|49.8%|Medium||
|0992|Subarrays with K Different Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0992.Subarrays-with-K-Different-Integers)|51.2%|Hard|| |0992|Subarrays with K Different Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0992.Subarrays-with-K-Different-Integers)|51.2%|Hard||
|0993|Cousins in Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0993.Cousins-in-Binary-Tree)|52.3%|Easy|| |0993|Cousins in Binary Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0993.Cousins-in-Binary-Tree)|52.3%|Easy||
@ -1262,7 +1262,7 @@
|1121|Divide Array Into Increasing Sequences||58.6%|Hard|| |1121|Divide Array Into Increasing Sequences||58.6%|Hard||
|1122|Relative Sort Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1122.Relative-Sort-Array)|68.0%|Easy|| |1122|Relative Sort Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1122.Relative-Sort-Array)|68.0%|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)|68.2%|Medium|| |1123|Lowest Common Ancestor of Deepest Leaves|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1123.Lowest-Common-Ancestor-of-Deepest-Leaves)|68.2%|Medium||
|1124|Longest Well-Performing Interval||33.3%|Medium|| |1124|Longest Well-Performing Interval||33.4%|Medium||
|1125|Smallest Sufficient Team||47.2%|Hard|| |1125|Smallest Sufficient Team||47.2%|Hard||
|1126|Active Businesses||68.4%|Medium|| |1126|Active Businesses||68.4%|Medium||
|1127|User Purchase Platform||50.7%|Hard|| |1127|User Purchase Platform||50.7%|Hard||
@ -1274,7 +1274,7 @@
|1133|Largest Unique Number||67.3%|Easy|| |1133|Largest Unique Number||67.3%|Easy||
|1134|Armstrong Number||77.8%|Easy|| |1134|Armstrong Number||77.8%|Easy||
|1135|Connecting Cities With Minimum Cost||59.8%|Medium|| |1135|Connecting Cities With Minimum Cost||59.8%|Medium||
|1136|Parallel Courses||60.8%|Medium|| |1136|Parallel Courses||60.9%|Medium||
|1137|N-th Tribonacci Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1137.N-th-Tribonacci-Number)|55.7%|Easy|| |1137|N-th Tribonacci Number|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1137.N-th-Tribonacci-Number)|55.7%|Easy||
|1138|Alphabet Board Path||51.5%|Medium|| |1138|Alphabet Board Path||51.5%|Medium||
|1139|Largest 1-Bordered Square||48.6%|Medium|| |1139|Largest 1-Bordered Square||48.6%|Medium||
@ -1292,12 +1292,12 @@
|1151|Minimum Swaps to Group All 1's Together||58.9%|Medium|| |1151|Minimum Swaps to Group All 1's Together||58.9%|Medium||
|1152|Analyze User Website Visit Pattern||43.0%|Medium|| |1152|Analyze User Website Visit Pattern||43.0%|Medium||
|1153|String Transforms Into Another String||35.7%|Hard|| |1153|String Transforms Into Another String||35.7%|Hard||
|1154|Day of the Year|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1154.Day-of-the-Year)|49.3%|Easy|| |1154|Day of the Year|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1154.Day-of-the-Year)|49.4%|Easy||
|1155|Number of Dice Rolls With Target Sum||47.6%|Medium|| |1155|Number of Dice Rolls With Target Sum||47.6%|Medium||
|1156|Swap For Longest Repeated Character Substring||47.0%|Medium|| |1156|Swap For Longest Repeated Character Substring||47.0%|Medium||
|1157|Online Majority Element In Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1157.Online-Majority-Element-In-Subarray)|40.9%|Hard|| |1157|Online Majority Element In Subarray|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1157.Online-Majority-Element-In-Subarray)|40.9%|Hard||
|1158|Market Analysis I||64.4%|Medium|| |1158|Market Analysis I||64.4%|Medium||
|1159|Market Analysis II||56.6%|Hard|| |1159|Market Analysis II||56.7%|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|| |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||68.3%|Medium|| |1161|Maximum Level Sum of a Binary Tree||68.3%|Medium||
|1162|As Far from Land as Possible||45.8%|Medium|| |1162|As Far from Land as Possible||45.8%|Medium||
@ -1369,7 +1369,7 @@
|1228|Missing Number In Arithmetic Progression||51.2%|Easy|| |1228|Missing Number In Arithmetic Progression||51.2%|Easy||
|1229|Meeting Scheduler||54.5%|Medium|| |1229|Meeting Scheduler||54.5%|Medium||
|1230|Toss Strange Coins||50.4%|Medium|| |1230|Toss Strange Coins||50.4%|Medium||
|1231|Divide Chocolate||53.8%|Hard|| |1231|Divide Chocolate||53.7%|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.0%|Easy|| |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.0%|Easy||
|1233|Remove Sub-Folders from the Filesystem||62.9%|Medium|| |1233|Remove Sub-Folders from the Filesystem||62.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.8%|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.8%|Medium||
@ -1487,7 +1487,7 @@
|1346|Check If N and Its Double Exist||35.8%|Easy|| |1346|Check If N and Its Double Exist||35.8%|Easy||
|1347|Minimum Number of Steps to Make Two Strings Anagram||75.1%|Medium|| |1347|Minimum Number of Steps to Make Two Strings Anagram||75.1%|Medium||
|1348|Tweet Counts Per Frequency||38.2%|Medium|| |1348|Tweet Counts Per Frequency||38.2%|Medium||
|1349|Maximum Students Taking Exam||44.6%|Hard|| |1349|Maximum Students Taking Exam||44.7%|Hard||
|1350|Students With Invalid Departments||90.4%|Easy|| |1350|Students With Invalid Departments||90.4%|Easy||
|1351|Count Negative Numbers in a Sorted Matrix||75.7%|Easy|| |1351|Count Negative Numbers in a Sorted Matrix||75.7%|Easy||
|1352|Product of the Last K Numbers||45.5%|Medium|| |1352|Product of the Last K Numbers||45.5%|Medium||
@ -1681,7 +1681,7 @@
|1540|Can Convert String in K Moves||31.5%|Medium|| |1540|Can Convert String in K Moves||31.5%|Medium||
|1541|Minimum Insertions to Balance a Parentheses String||43.6%|Medium|| |1541|Minimum Insertions to Balance a Parentheses String||43.6%|Medium||
|1542|Find Longest Awesome Substring||36.9%|Hard|| |1542|Find Longest Awesome Substring||36.9%|Hard||
|1543|Fix Product Name Format||66.1%|Easy|| |1543|Fix Product Name Format||66.0%|Easy||
|1544|Make The String Great||55.6%|Easy|| |1544|Make The String Great||55.6%|Easy||
|1545|Find Kth Bit in Nth Binary String||57.7%|Medium|| |1545|Find Kth Bit in Nth Binary String||57.7%|Medium||
|1546|Maximum Number of Non-Overlapping Subarrays With Sum Equals Target||44.3%|Medium|| |1546|Maximum Number of Non-Overlapping Subarrays With Sum Equals Target||44.3%|Medium||
@ -1737,7 +1737,7 @@
|1596|The Most Frequently Ordered Products for Each Customer||85.1%|Medium|| |1596|The Most Frequently Ordered Products for Each Customer||85.1%|Medium||
|1597|Build Binary Expression Tree From Infix Expression||58.9%|Hard|| |1597|Build Binary Expression Tree From Infix Expression||58.9%|Hard||
|1598|Crawler Log Folder||63.8%|Easy|| |1598|Crawler Log Folder||63.8%|Easy||
|1599|Maximum Profit of Operating a Centennial Wheel||43.8%|Medium|| |1599|Maximum Profit of Operating a Centennial Wheel||43.7%|Medium||
|1600|Throne Inheritance||61.1%|Medium|| |1600|Throne Inheritance||61.1%|Medium||
|1601|Maximum Number of Achievable Transfer Requests||48.1%|Hard|| |1601|Maximum Number of Achievable Transfer Requests||48.1%|Hard||
|1602|Find Nearest Right Node in Binary Tree||73.5%|Medium|| |1602|Find Nearest Right Node in Binary Tree||73.5%|Medium||
@ -1773,7 +1773,7 @@
|1632|Rank Transform of a Matrix||32.1%|Hard|| |1632|Rank Transform of a Matrix||32.1%|Hard||
|1633|Percentage of Users Attended a Contest||71.0%|Easy|| |1633|Percentage of Users Attended a Contest||71.0%|Easy||
|1634|Add Two Polynomials Represented as Linked Lists||53.1%|Medium|| |1634|Add Two Polynomials Represented as Linked Lists||53.1%|Medium||
|1635|Hopper Company Queries I||56.5%|Hard|| |1635|Hopper Company Queries I||56.6%|Hard||
|1636|Sort Array by Increasing Frequency|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1636.Sort-Array-by-Increasing-Frequency)|67.1%|Easy|| |1636|Sort Array by Increasing Frequency|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1636.Sort-Array-by-Increasing-Frequency)|67.1%|Easy||
|1637|Widest Vertical Area Between Two Points Containing No Points||83.8%|Medium|| |1637|Widest Vertical Area Between Two Points Containing No Points||83.8%|Medium||
|1638|Count Substrings That Differ by One Character||70.8%|Medium|| |1638|Count Substrings That Differ by One Character||70.8%|Medium||
@ -1790,8 +1790,8 @@
|1649|Create Sorted Array through Instructions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1649.Create-Sorted-Array-through-Instructions)|36.8%|Hard|| |1649|Create Sorted Array through Instructions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1649.Create-Sorted-Array-through-Instructions)|36.8%|Hard||
|1650|Lowest Common Ancestor of a Binary Tree III||76.5%|Medium|| |1650|Lowest Common Ancestor of a Binary Tree III||76.5%|Medium||
|1651|Hopper Company Queries III||66.3%|Hard|| |1651|Hopper Company Queries III||66.3%|Hard||
|1652|Defuse the Bomb|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1652.Defuse-the-Bomb)|61.0%|Easy|| |1652|Defuse the Bomb|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1652.Defuse-the-Bomb)|60.9%|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)|52.2%|Medium|| |1653|Minimum Deletions to Make String Balanced|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1653.Minimum-Deletions-to-Make-String-Balanced)|52.3%|Medium||
|1654|Minimum Jumps to Reach Home|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1654.Minimum-Jumps-to-Reach-Home)|24.6%|Medium|| |1654|Minimum Jumps to Reach Home|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1654.Minimum-Jumps-to-Reach-Home)|24.6%|Medium||
|1655|Distribute Repeating Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1655.Distribute-Repeating-Integers)|40.1%|Hard|| |1655|Distribute Repeating Integers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1655.Distribute-Repeating-Integers)|40.1%|Hard||
|1656|Design an Ordered Stream|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1656.Design-an-Ordered-Stream)|82.2%|Easy|| |1656|Design an Ordered Stream|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1656.Design-an-Ordered-Stream)|82.2%|Easy||
@ -1815,7 +1815,7 @@
|1674|Minimum Moves to Make Array Complementary|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1674.Minimum-Moves-to-Make-Array-Complementary)|35.3%|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)|35.3%|Medium||
|1675|Minimize Deviation in Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1675.Minimize-Deviation-in-Array)|48.1%|Hard|| |1675|Minimize Deviation in Array|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1675.Minimize-Deviation-in-Array)|48.1%|Hard||
|1676|Lowest Common Ancestor of a Binary Tree IV||79.0%|Medium|| |1676|Lowest Common Ancestor of a Binary Tree IV||79.0%|Medium||
|1677|Product's Worth Over Invoices||58.4%|Easy|| |1677|Product's Worth Over Invoices||58.3%|Easy||
|1678|Goal Parser Interpretation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1678.Goal-Parser-Interpretation)|85.0%|Easy|| |1678|Goal Parser Interpretation|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1678.Goal-Parser-Interpretation)|85.0%|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)|53.6%|Medium|| |1679|Max Number of K-Sum Pairs|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1679.Max-Number-of-K-Sum-Pairs)|53.6%|Medium||
|1680|Concatenation of Consecutive Binary Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1680.Concatenation-of-Consecutive-Binary-Numbers)|52.3%|Medium|| |1680|Concatenation of Consecutive Binary Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1680.Concatenation-of-Consecutive-Binary-Numbers)|52.3%|Medium||
@ -1823,10 +1823,10 @@
|1682|Longest Palindromic Subsequence II||52.0%|Medium|| |1682|Longest Palindromic Subsequence II||52.0%|Medium||
|1683|Invalid Tweets||91.1%|Easy|| |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)|81.7%|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)|81.7%|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)|63.3%|Medium|| |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)|63.4%|Medium||
|1686|Stone Game VI||50.4%|Medium|| |1686|Stone Game VI||50.4%|Medium||
|1687|Delivering Boxes from Storage to Ports||35.8%|Hard|| |1687|Delivering Boxes from Storage to Ports||35.8%|Hard||
|1688|Count of Matches in Tournament|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1688.Count-of-Matches-in-Tournament)|81.5%|Easy|| |1688|Count of Matches in Tournament|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1688.Count-of-Matches-in-Tournament)|81.6%|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.0%|Medium|| |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.0%|Medium||
|1690|Stone Game VII|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1690.Stone-Game-VII)|49.6%|Medium|| |1690|Stone Game VII|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1690.Stone-Game-VII)|49.6%|Medium||
|1691|Maximum Height by Stacking Cuboids|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1691.Maximum-Height-by-Stacking-Cuboids)|50.6%|Hard|| |1691|Maximum Height by Stacking Cuboids|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1691.Maximum-Height-by-Stacking-Cuboids)|50.6%|Hard||
@ -1880,7 +1880,7 @@
|1739|Building Boxes||49.5%|Hard|| |1739|Building Boxes||49.5%|Hard||
|1740|Find Distance in a Binary Tree||68.3%|Medium|| |1740|Find Distance in a Binary Tree||68.3%|Medium||
|1741|Find Total Time Spent by Each Employee||90.7%|Easy|| |1741|Find Total Time Spent by Each Employee||90.7%|Easy||
|1742|Maximum Number of Balls in a Box|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1742.Maximum-Number-of-Balls-in-a-Box)|73.4%|Easy|| |1742|Maximum Number of Balls in a Box|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1742.Maximum-Number-of-Balls-in-a-Box)|73.3%|Easy||
|1743|Restore the Array From Adjacent Pairs||64.0%|Medium|| |1743|Restore the Array From Adjacent Pairs||64.0%|Medium||
|1744|Can You Eat Your Favorite Candy on Your Favorite Day?||30.9%|Medium|| |1744|Can You Eat Your Favorite Candy on Your Favorite Day?||30.9%|Medium||
|1745|Palindrome Partitioning IV||49.7%|Hard|| |1745|Palindrome Partitioning IV||49.7%|Hard||
@ -1912,9 +1912,9 @@
|1771|Maximize Palindrome Length From Subsequences||34.2%|Hard|| |1771|Maximize Palindrome Length From Subsequences||34.2%|Hard||
|1772|Sort Features by Popularity||65.1%|Medium|| |1772|Sort Features by Popularity||65.1%|Medium||
|1773|Count Items Matching a Rule||84.7%|Easy|| |1773|Count Items Matching a Rule||84.7%|Easy||
|1774|Closest Dessert Cost||57.0%|Medium|| |1774|Closest Dessert Cost||56.9%|Medium||
|1775|Equal Sum Arrays With Minimum Number of Operations||50.6%|Medium|| |1775|Equal Sum Arrays With Minimum Number of Operations||50.6%|Medium||
|1776|Car Fleet II||48.7%|Hard|| |1776|Car Fleet II||48.8%|Hard||
|1777|Product's Price for Each Store||86.3%|Easy|| |1777|Product's Price for Each Store||86.3%|Easy||
|1778|Shortest Path in a Hidden Grid||43.9%|Medium|| |1778|Shortest Path in a Hidden Grid||43.9%|Medium||
|1779|Find Nearest Point That Has the Same X or Y Coordinate||66.9%|Easy|| |1779|Find Nearest Point That Has the Same X or Y Coordinate||66.9%|Easy||
@ -1969,7 +1969,7 @@
|1828|Queries on Number of Points Inside a Circle||87.0%|Medium|| |1828|Queries on Number of Points Inside a Circle||87.0%|Medium||
|1829|Maximum XOR for Each Query||73.0%|Medium|| |1829|Maximum XOR for Each Query||73.0%|Medium||
|1830|Minimum Number of Operations to Make String Sorted||46.3%|Hard|| |1830|Minimum Number of Operations to Make String Sorted||46.3%|Hard||
|1831|Maximum Transaction Each Day||85.1%|Medium|| |1831|Maximum Transaction Each Day||85.2%|Medium||
|1832|Check if the Sentence Is Pangram||83.6%|Easy|| |1832|Check if the Sentence Is Pangram||83.6%|Easy||
|1833|Maximum Ice Cream Bars||80.0%|Medium|| |1833|Maximum Ice Cream Bars||80.0%|Medium||
|1834|Single-Threaded CPU||39.9%|Medium|| |1834|Single-Threaded CPU||39.9%|Medium||
@ -1979,34 +1979,34 @@
|1838|Frequency of the Most Frequent Element||38.1%|Medium|| |1838|Frequency of the Most Frequent Element||38.1%|Medium||
|1839|Longest Substring Of All Vowels in Order||61.4%|Medium|| |1839|Longest Substring Of All Vowels in Order||61.4%|Medium||
|1840|Maximum Building Height||37.1%|Hard|| |1840|Maximum Building Height||37.1%|Hard||
|1841|League Statistics||65.9%|Medium|| |1841|League Statistics||66.0%|Medium||
|1842|Next Palindrome Using Same Digits||64.1%|Hard|| |1842|Next Palindrome Using Same Digits||64.2%|Hard||
|1843|Suspicious Bank Accounts||52.5%|Medium|| |1843|Suspicious Bank Accounts||52.3%|Medium||
|1844|Replace All Digits with Characters||81.2%|Easy|| |1844|Replace All Digits with Characters||81.2%|Easy||
|1845|Seat Reservation Manager||80.3%|Medium|| |1845|Seat Reservation Manager||80.3%|Medium||
|1846|Maximum Element After Decreasing and Rearranging||53.9%|Medium|| |1846|Maximum Element After Decreasing and Rearranging||53.9%|Medium||
|1847|Closest Room||36.0%|Hard|| |1847|Closest Room||36.0%|Hard||
|1848|Minimum Distance to the Target Element||60.8%|Easy|| |1848|Minimum Distance to the Target Element||60.8%|Easy||
|1849|Splitting a String Into Descending Consecutive Values||34.5%|Medium|| |1849|Splitting a String Into Descending Consecutive Values||34.6%|Medium||
|1850|Minimum Adjacent Swaps to Reach the Kth Smallest Number||62.8%|Medium|| |1850|Minimum Adjacent Swaps to Reach the Kth Smallest Number||62.8%|Medium||
|1851|Minimum Interval to Include Each Query||41.5%|Hard|| |1851|Minimum Interval to Include Each Query||41.5%|Hard||
|1852|Distinct Numbers in Each Subarray||78.6%|Medium|| |1852|Distinct Numbers in Each Subarray||78.6%|Medium||
|1853|Convert Date Format||87.6%|Easy|| |1853|Convert Date Format||87.6%|Easy||
|1854|Maximum Population Year||77.4%|Easy|| |1854|Maximum Population Year||77.3%|Easy||
|1855|Maximum Distance Between a Pair of Values||60.7%|Medium|| |1855|Maximum Distance Between a Pair of Values||60.7%|Medium||
|1856|Maximum Subarray Min-Product||38.1%|Medium|| |1856|Maximum Subarray Min-Product||38.2%|Medium||
|1857|Largest Color Value in a Directed Graph||38.2%|Hard|| |1857|Largest Color Value in a Directed Graph||38.2%|Hard||
|1858|Longest Word With All Prefixes||69.4%|Medium|| |1858|Longest Word With All Prefixes||69.5%|Medium||
|1859|Sorting the Sentence||80.2%|Easy|| |1859|Sorting the Sentence||80.2%|Easy||
|1860|Incremental Memory Leak||68.9%|Medium|| |1860|Incremental Memory Leak||68.9%|Medium||
|1861|Rotating the Box||60.8%|Medium|| |1861|Rotating the Box||60.8%|Medium||
|1862|Sum of Floored Pairs||32.7%|Hard|| |1862|Sum of Floored Pairs||32.8%|Hard||
|1863|Sum of All Subset XOR Totals||120.7%|Easy|| |1863|Sum of All Subset XOR Totals||120.6%|Easy||
|1864|Minimum Number of Swaps to Make the Binary String Alternating||34.8%|Medium|| |1864|Minimum Number of Swaps to Make the Binary String Alternating||34.8%|Medium||
|1865|Finding Pairs With a Certain Sum||78.6%|Medium|| |1865|Finding Pairs With a Certain Sum||78.5%|Medium||
|1866|Number of Ways to Rearrange Sticks With K Sticks Visible||53.0%|Hard|| |1866|Number of Ways to Rearrange Sticks With K Sticks Visible||52.9%|Hard||
|1867|Orders With Maximum Quantity Above Average||80.5%|Medium|| |1867|Orders With Maximum Quantity Above Average||80.5%|Medium||
|1868|Product of Two Run-Length Encoded Arrays||65.4%|Medium|| |1868|Product of Two Run-Length Encoded Arrays||65.3%|Medium||
|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------| |------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|
------------------------------------------------------------------ ------------------------------------------------------------------

12
leetcode/0810.Chalkboard-XOR-Game/810. Chalkboard XOR Game.go Normal file
View File

@ -0,0 +1,12 @@
package leetcode
func xorGame(nums []int) bool {
if len(nums)%2 == 0 {
return true
}
xor := 0
for _, num := range nums {
xor ^= num
}
return xor == 0
}

42
leetcode/0810.Chalkboard-XOR-Game/810. Chalkboard XOR Game_test.go Normal file
View File

@ -0,0 +1,42 @@
package leetcode
import (
"fmt"
"testing"
)
type question810 struct {
para810
ans810
}
// para 是参数
// one 代表第一个参数
type para810 struct {
nums []int
}
// ans 是答案
// one 代表第一个答案
type ans810 struct {
one bool
}
func Test_Problem810(t *testing.T) {
qs := []question810{
{
para810{[]int{1, 1, 2}},
ans810{false},
},
}
fmt.Printf("------------------------Leetcode Problem 810------------------------\n")
for _, q := range qs {
_, p := q.ans810, q.para810
fmt.Printf("【input】:%v 【output】:%v\n", p, xorGame(p.nums))
}
fmt.Printf("\n\n\n")
}

58
leetcode/0810.Chalkboard-XOR-Game/README.md Normal file
View File

@ -0,0 +1,58 @@
# [810. Chalkboard XOR Game](https://leetcode.com/problems/chalkboard-xor-game/)
## 题目
We are given non-negative integers nums[i] which are written on a chalkboard.  Alice and Bob take turns erasing exactly one number from the chalkboard, with Alice starting first.  If erasing a number causes the bitwise XOR of all the elements of the chalkboard to become 0, then that player loses.  (Also, we'll say the bitwise XOR of one element is that element itself, and the bitwise XOR of no elements is 0.)
Also, if any player starts their turn with the bitwise XOR of all the elements of the chalkboard equal to 0, then that player wins.
Return True if and only if Alice wins the game, assuming both players play optimally.
```
Example:Input: nums = [1, 1, 2]
Output: false
Explanation:
Alice has two choices: erase 1 or erase 2.
If she erases 1, the nums array becomes [1, 2]. The bitwise XOR of all the elements of the chalkboard is 1 XOR 2 = 3. Now Bob can remove any element he wants, because Alice will be the one to erase the last element and she will lose.
If Alice erases 2 first, now nums becomes [1, 1]. The bitwise XOR of all the elements of the chalkboard is 1 XOR 1 = 0. Alice will lose.
```
**Notes:**
- `1 <= N <= 1000`.
- `0 <= nums[i] <= 2^16`.
## 题目大意
黑板上写着一个非负整数数组 nums[i] 。Alice 和 Bob 轮流从黑板上擦掉一个数字，Alice 先手。如果擦除一个数字后，剩余的所有数字按位异或运算得出的结果等于 0 的话，当前玩家游戏失败。 (另外，如果只剩一个数字，按位异或运算得到它本身；如果无数字剩余，按位异或运算结果为 0。）并且，轮到某个玩家时，如果当前黑板上所有数字按位异或运算结果等于 0，这个玩家获胜。假设两个玩家每步都使用最优解，当且仅当 Alice 获胜时返回 true。
## 解题思路
- Alice 必胜情况之一，Alice 先手，起始数组全部元素本身异或结果就为 0 。不需要擦除数字便自动获胜。除去这个情况，还有其他情况么？由于 2 人是交替擦除数字，且每次都恰好擦掉一个数字，因此对于这两人中的任意一人，其每次在擦除数字前，黑板上剩余数字的个数的奇偶性一定都是相同的。于是奇偶性成为突破口。
- 如果 nums 的长度是偶数，Alice 先手是否必败呢？如果必败，代表无论擦掉哪一个数字，剩余所有数字的异或结果都等于 0。利用反证法证明上述结论是错误的。首先 $num[0] \oplus num[1] \oplus num[2] \oplus \cdots \oplus num[n-1] = X ≠ 0$，初始所有元素异或结果不为 0。假设 Alice 当前擦掉第 i 个元素，0 ≤ i < n。令 $X_{n}$ 代表擦掉第 n 位元素以后剩余元素异或的结果。由证题，无论擦掉哪一个数字，剩余所有数字的异或结果都等于 0。所以 $X_{0} \oplus X_{1} \oplus X_{2} \oplus \cdots  \oplus X_{n-1} = 0$。
$$\begin{aligned}0 &= X_{0} \oplus  X_{1} \oplus X_{2} \oplus \cdots  \oplus X_{n-1} \\0 &= (X \oplus nums[0]) \oplus (X \oplus nums[1]) \oplus (X \oplus nums[2]) \oplus \cdots  \oplus (X \oplus nums[n-1])\\ 0 &= (X \oplus X \oplus \cdots  \oplus X) \oplus (nums[0] \oplus nums[1] \oplus nums[2] \oplus \cdots  \oplus nums[n-1])\\0 &= 0 \oplus X\\\\\Rightarrow X &= 0\\\end{aligned}$$
由于 n 为偶数，所以 n 个 X 的异或结果为 0。最终推出 X = 0，很明显与前提 X ≠ 0 冲突。所以原命题，代表无论擦掉哪一个数字，剩余所有数字的异或结果都等于 0 是错误的。也就是说，当 n 为偶数时，代表无论擦掉哪一个数字，剩余所有数字的异或结果都不等于 0。即 Alice 有必胜策略。换句话说，当数组的长度是偶数时，先手 Alice 总能找到一个数字，在擦掉这个数字之后剩余的所有数字异或结果不等于 0。
- 综上，Alice 必胜策略有 2 种情况：
1. 数组 nums 的全部元素初始本身异或结果就等于 0。
2. 数组 nums 的长度是偶数。
## 代码
```go
package leetcode
func xorGame(nums []int) bool {
if len(nums)%2 == 0 {
return true
}
xor := 0
for _, num := range nums {
xor ^= num
}
return xor == 0
}
```

2
website/content/ChapterFour/0800~0899/0803.Bricks-Falling-When-Hit.md
View File

@ -128,5 +128,5 @@ func getUnionFindFromGrid(grid [][]int, x, y int, uf template.UnionFindCount) {
---------------------------------------------- ----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;"> <div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0802.Find-Eventual-Safe-States/">⬅️上一页</a></p> <p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0802.Find-Eventual-Safe-States/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0811.Subdomain-Visit-Count/">下一页➡️</a></p> <p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0810.Chalkboard-XOR-Game/">下一页➡️</a></p>
</div> </div>

67
website/content/ChapterFour/0800~0899/0810.Chalkboard-XOR-Game.md Normal file
View File

@ -0,0 +1,67 @@
# [810. Chalkboard XOR Game](https://leetcode.com/problems/chalkboard-xor-game/)
## 题目
We are given non-negative integers nums[i] which are written on a chalkboard.  Alice and Bob take turns erasing exactly one number from the chalkboard, with Alice starting first.  If erasing a number causes the bitwise XOR of all the elements of the chalkboard to become 0, then that player loses.  (Also, we'll say the bitwise XOR of one element is that element itself, and the bitwise XOR of no elements is 0.)
Also, if any player starts their turn with the bitwise XOR of all the elements of the chalkboard equal to 0, then that player wins.
Return True if and only if Alice wins the game, assuming both players play optimally.
```
Example:Input: nums = [1, 1, 2]
Output: false
Explanation:
Alice has two choices: erase 1 or erase 2.
If she erases 1, the nums array becomes [1, 2]. The bitwise XOR of all the elements of the chalkboard is 1 XOR 2 = 3. Now Bob can remove any element he wants, because Alice will be the one to erase the last element and she will lose.
If Alice erases 2 first, now nums becomes [1, 1]. The bitwise XOR of all the elements of the chalkboard is 1 XOR 1 = 0. Alice will lose.
```
**Notes:**
- `1 <= N <= 1000`.
- `0 <= nums[i] <= 2^16`.
## 题目大意
黑板上写着一个非负整数数组 nums[i] 。Alice 和 Bob 轮流从黑板上擦掉一个数字，Alice 先手。如果擦除一个数字后，剩余的所有数字按位异或运算得出的结果等于 0 的话，当前玩家游戏失败。 (另外，如果只剩一个数字，按位异或运算得到它本身；如果无数字剩余，按位异或运算结果为 0。）并且，轮到某个玩家时，如果当前黑板上所有数字按位异或运算结果等于 0，这个玩家获胜。假设两个玩家每步都使用最优解，当且仅当 Alice 获胜时返回 true。
## 解题思路
- Alice 必胜情况之一，Alice 先手，起始数组全部元素本身异或结果就为 0 。不需要擦除数字便自动获胜。除去这个情况，还有其他情况么？由于 2 人是交替擦除数字，且每次都恰好擦掉一个数字，因此对于这两人中的任意一人，其每次在擦除数字前，黑板上剩余数字的个数的奇偶性一定都是相同的。于是奇偶性成为突破口。
- 如果 nums 的长度是偶数，Alice 先手是否必败呢？如果必败，代表无论擦掉哪一个数字，剩余所有数字的异或结果都等于 0。利用反证法证明上述结论是错误的。首先 {{< katex >}} num[0] \oplus num[1] \oplus num[2] \oplus \cdots  \oplus num[n-1] = X ≠ 0 {{< /katex >}} ，初始所有元素异或结果不为 0。假设 Alice 当前擦掉第 i 个元素，0 ≤ i < n。令 {{< katex >}}X_{n}{{< /katex >}} 代表擦掉第 n 位元素以后剩余元素异或的结果。由证题，无论擦掉哪一个数字，剩余所有数字的异或结果都等于 0。所以 {{< katex >}} X_{0} \oplus X_{1} \oplus X_{2} \oplus \cdots  \oplus X_{n-1} = 0{{< /katex >}} 。
{{< katex display >}}
\begin{aligned}0 &= X_{0} \oplus  X_{1} \oplus X_{2} \oplus \cdots  \oplus X_{n-1} \\0 &= (X \oplus nums[0]) \oplus (X \oplus nums[1]) \oplus (X \oplus nums[2]) \oplus \cdots  \oplus (X \oplus nums[n-1])\\ 0 &= (X \oplus X \oplus \cdots  \oplus X) \oplus (nums[0] \oplus nums[1] \oplus nums[2] \oplus \cdots  \oplus nums[n-1])\\0 &= 0 \oplus X\\\\\Rightarrow X &= 0\\\end{aligned}
{{< /katex >}}
由于 n 为偶数，所以 n 个 X 的异或结果为 0。最终推出 X = 0，很明显与前提 X ≠ 0 冲突。所以原命题，代表无论擦掉哪一个数字，剩余所有数字的异或结果都等于 0 是错误的。也就是说，当 n 为偶数时，代表无论擦掉哪一个数字，剩余所有数字的异或结果都不等于 0。即 Alice 有必胜策略。换句话说，当数组的长度是偶数时，先手 Alice 总能找到一个数字，在擦掉这个数字之后剩余的所有数字异或结果不等于 0。
- 综上，Alice 必胜策略有 2 种情况：
1. 数组 nums 的全部元素初始本身异或结果就等于 0。
2. 数组 nums 的长度是偶数。
## 代码
```go
package leetcode
func xorGame(nums []int) bool {
if len(nums)%2 == 0 {
return true
}
xor := 0
for _, num := range nums {
xor ^= num
}
return xor == 0
}
```
----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0803.Bricks-Falling-When-Hit/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0811.Subdomain-Visit-Count/">下一页➡️</a></p>
</div>

2
website/content/ChapterFour/0800~0899/0811.Subdomain-Visit-Count.md
View File

@ -145,6 +145,6 @@ func splitDomain(domain string, domains map[string]int) {
---------------------------------------------- ----------------------------------------------
<div style="display: flex;justify-content: space-between;align-items: center;"> <div style="display: flex;justify-content: space-between;align-items: center;">
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0803.Bricks-Falling-When-Hit/">⬅️上一页</a></p> <p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0810.Chalkboard-XOR-Game/">⬅️上一页</a></p>
<p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0812.Largest-Triangle-Area/">下一页➡️</a></p> <p><a href="https://books.halfrost.com/leetcode/ChapterFour/0800~0899/0812.Largest-Triangle-Area/">下一页➡️</a></p>
</div> </div>

2
website/content/ChapterTwo/Array.md
View File

@ -169,7 +169,7 @@ weight: 1
|1636|Sort Array by Increasing Frequency|[Go]({{< relref "/ChapterFour/1600~1699/1636.Sort-Array-by-Increasing-Frequency.md" >}})|Easy||||67.1%| |1636|Sort Array by Increasing Frequency|[Go]({{< relref "/ChapterFour/1600~1699/1636.Sort-Array-by-Increasing-Frequency.md" >}})|Easy||||67.1%|
|1640|Check Array Formation Through Concatenation|[Go]({{< relref "/ChapterFour/1600~1699/1640.Check-Array-Formation-Through-Concatenation.md" >}})|Easy||||59.6%| |1640|Check Array Formation Through Concatenation|[Go]({{< relref "/ChapterFour/1600~1699/1640.Check-Array-Formation-Through-Concatenation.md" >}})|Easy||||59.6%|
|1646|Get Maximum in Generated Array|[Go]({{< relref "/ChapterFour/1600~1699/1646.Get-Maximum-in-Generated-Array.md" >}})|Easy||||53.0%| |1646|Get Maximum in Generated Array|[Go]({{< relref "/ChapterFour/1600~1699/1646.Get-Maximum-in-Generated-Array.md" >}})|Easy||||53.0%|
|1652|Defuse the Bomb|[Go]({{< relref "/ChapterFour/1600~1699/1652.Defuse-the-Bomb.md" >}})|Easy||||61.0%| |1652|Defuse the Bomb|[Go]({{< relref "/ChapterFour/1600~1699/1652.Defuse-the-Bomb.md" >}})|Easy||||60.9%|
|1656|Design an Ordered Stream|[Go]({{< relref "/ChapterFour/1600~1699/1656.Design-an-Ordered-Stream.md" >}})|Easy||||82.2%| |1656|Design an Ordered Stream|[Go]({{< relref "/ChapterFour/1600~1699/1656.Design-an-Ordered-Stream.md" >}})|Easy||||82.2%|
|1672|Richest Customer Wealth|[Go]({{< relref "/ChapterFour/1600~1699/1672.Richest-Customer-Wealth.md" >}})|Easy||||88.1%| |1672|Richest Customer Wealth|[Go]({{< relref "/ChapterFour/1600~1699/1672.Richest-Customer-Wealth.md" >}})|Easy||||88.1%|
|1700|Number of Students Unable to Eat Lunch|[Go]({{< relref "/ChapterFour/1700~1799/1700.Number-of-Students-Unable-to-Eat-Lunch.md" >}})|Easy||||67.6%| |1700|Number of Students Unable to Eat Lunch|[Go]({{< relref "/ChapterFour/1700~1799/1700.Number-of-Students-Unable-to-Eat-Lunch.md" >}})|Easy||||67.6%|

2
website/content/ChapterTwo/Bit_Manipulation.md
View File

@ -64,7 +64,7 @@ X & ~X = 0
|0397|Integer Replacement|[Go]({{< relref "/ChapterFour/0300~0399/0397.Integer-Replacement.md" >}})|Medium| O(n)| O(1)||33.6%| |0397|Integer Replacement|[Go]({{< relref "/ChapterFour/0300~0399/0397.Integer-Replacement.md" >}})|Medium| O(n)| O(1)||33.6%|
|0401|Binary Watch|[Go]({{< relref "/ChapterFour/0400~0499/0401.Binary-Watch.md" >}})|Easy| O(1)| O(1)||48.8%| |0401|Binary Watch|[Go]({{< relref "/ChapterFour/0400~0499/0401.Binary-Watch.md" >}})|Easy| O(1)| O(1)||48.8%|
|0405|Convert a Number to Hexadecimal|[Go]({{< relref "/ChapterFour/0400~0499/0405.Convert-a-Number-to-Hexadecimal.md" >}})|Easy| O(n)| O(1)||44.7%| |0405|Convert a Number to Hexadecimal|[Go]({{< relref "/ChapterFour/0400~0499/0405.Convert-a-Number-to-Hexadecimal.md" >}})|Easy| O(n)| O(1)||44.7%|
|0421|Maximum XOR of Two Numbers in an Array|[Go]({{< relref "/ChapterFour/0400~0499/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md" >}})|Medium| O(n)| O(1)|❤️|54.6%| |0421|Maximum XOR of Two Numbers in an Array|[Go]({{< relref "/ChapterFour/0400~0499/0421.Maximum-XOR-of-Two-Numbers-in-an-Array.md" >}})|Medium| O(n)| O(1)|❤️|54.5%|
|0461|Hamming Distance|[Go]({{< relref "/ChapterFour/0400~0499/0461.Hamming-Distance.md" >}})|Easy| O(n)| O(1)||73.3%| |0461|Hamming Distance|[Go]({{< relref "/ChapterFour/0400~0499/0461.Hamming-Distance.md" >}})|Easy| O(n)| O(1)||73.3%|
|0476|Number Complement|[Go]({{< relref "/ChapterFour/0400~0499/0476.Number-Complement.md" >}})|Easy| O(n)| O(1)||65.2%| |0476|Number Complement|[Go]({{< relref "/ChapterFour/0400~0499/0476.Number-Complement.md" >}})|Easy| O(n)| O(1)||65.2%|
|0477|Total Hamming Distance|[Go]({{< relref "/ChapterFour/0400~0499/0477.Total-Hamming-Distance.md" >}})|Medium| O(n)| O(1)||50.8%| |0477|Total Hamming Distance|[Go]({{< relref "/ChapterFour/0400~0499/0477.Total-Hamming-Distance.md" >}})|Medium| O(n)| O(1)||50.8%|

5
website/content/ChapterTwo/Math.md
View File

@ -58,6 +58,7 @@ weight: 12
|0753|Cracking the Safe|[Go]({{< relref "/ChapterFour/0700~0799/0753.Cracking-the-Safe.md" >}})|Hard||||52.8%| |0753|Cracking the Safe|[Go]({{< relref "/ChapterFour/0700~0799/0753.Cracking-the-Safe.md" >}})|Hard||||52.8%|
|0775|Global and Local Inversions|[Go]({{< relref "/ChapterFour/0700~0799/0775.Global-and-Local-Inversions.md" >}})|Medium||||46.2%| |0775|Global and Local Inversions|[Go]({{< relref "/ChapterFour/0700~0799/0775.Global-and-Local-Inversions.md" >}})|Medium||||46.2%|
|0781|Rabbits in Forest|[Go]({{< relref "/ChapterFour/0700~0799/0781.Rabbits-in-Forest.md" >}})|Medium||||56.0%| |0781|Rabbits in Forest|[Go]({{< relref "/ChapterFour/0700~0799/0781.Rabbits-in-Forest.md" >}})|Medium||||56.0%|
|0810|Chalkboard XOR Game|[Go]({{< relref "/ChapterFour/0800~0899/0810.Chalkboard-XOR-Game.md" >}})|Hard||||50.7%|
|0812|Largest Triangle Area|[Go]({{< relref "/ChapterFour/0800~0899/0812.Largest-Triangle-Area.md" >}})|Easy||||59.2%| |0812|Largest Triangle Area|[Go]({{< relref "/ChapterFour/0800~0899/0812.Largest-Triangle-Area.md" >}})|Easy||||59.2%|
|0836|Rectangle Overlap|[Go]({{< relref "/ChapterFour/0800~0899/0836.Rectangle-Overlap.md" >}})|Easy||||43.1%| |0836|Rectangle Overlap|[Go]({{< relref "/ChapterFour/0800~0899/0836.Rectangle-Overlap.md" >}})|Easy||||43.1%|
|0869|Reordered Power of 2|[Go]({{< relref "/ChapterFour/0800~0899/0869.Reordered-Power-of-2.md" >}})|Medium||||61.2%| |0869|Reordered Power of 2|[Go]({{< relref "/ChapterFour/0800~0899/0869.Reordered-Power-of-2.md" >}})|Medium||||61.2%|
@ -82,7 +83,7 @@ weight: 12
|1037|Valid Boomerang|[Go]({{< relref "/ChapterFour/1000~1099/1037.Valid-Boomerang.md" >}})|Easy||||37.5%| |1037|Valid Boomerang|[Go]({{< relref "/ChapterFour/1000~1099/1037.Valid-Boomerang.md" >}})|Easy||||37.5%|
|1073|Adding Two Negabinary Numbers|[Go]({{< relref "/ChapterFour/1000~1099/1073.Adding-Two-Negabinary-Numbers.md" >}})|Medium||||34.8%| |1073|Adding Two Negabinary Numbers|[Go]({{< relref "/ChapterFour/1000~1099/1073.Adding-Two-Negabinary-Numbers.md" >}})|Medium||||34.8%|
|1093|Statistics from a Large Sample|[Go]({{< relref "/ChapterFour/1000~1099/1093.Statistics-from-a-Large-Sample.md" >}})|Medium||||48.3%| |1093|Statistics from a Large Sample|[Go]({{< relref "/ChapterFour/1000~1099/1093.Statistics-from-a-Large-Sample.md" >}})|Medium||||48.3%|
|1154|Day of the Year|[Go]({{< relref "/ChapterFour/1100~1199/1154.Day-of-the-Year.md" >}})|Easy||||49.4%| |1154|Day of the Year|[Go]({{< relref "/ChapterFour/1100~1199/1154.Day-of-the-Year.md" >}})|Easy||||49.3%|
|1175|Prime Arrangements|[Go]({{< relref "/ChapterFour/1100~1199/1175.Prime-Arrangements.md" >}})|Easy||||51.8%| |1175|Prime Arrangements|[Go]({{< relref "/ChapterFour/1100~1199/1175.Prime-Arrangements.md" >}})|Easy||||51.8%|
|1201|Ugly Number III|[Go]({{< relref "/ChapterFour/1200~1299/1201.Ugly-Number-III.md" >}})|Medium||||26.5%| |1201|Ugly Number III|[Go]({{< relref "/ChapterFour/1200~1299/1201.Ugly-Number-III.md" >}})|Medium||||26.5%|
|1217|Minimum Cost to Move Chips to The Same Position|[Go]({{< relref "/ChapterFour/1200~1299/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position.md" >}})|Easy||||70.8%| |1217|Minimum Cost to Move Chips to The Same Position|[Go]({{< relref "/ChapterFour/1200~1299/1217.Minimum-Cost-to-Move-Chips-to-The-Same-Position.md" >}})|Easy||||70.8%|
@ -95,7 +96,7 @@ weight: 12
|1641|Count Sorted Vowel Strings|[Go]({{< relref "/ChapterFour/1600~1699/1641.Count-Sorted-Vowel-Strings.md" >}})|Medium||||75.2%| |1641|Count Sorted Vowel Strings|[Go]({{< relref "/ChapterFour/1600~1699/1641.Count-Sorted-Vowel-Strings.md" >}})|Medium||||75.2%|
|1648|Sell Diminishing-Valued Colored Balls|[Go]({{< relref "/ChapterFour/1600~1699/1648.Sell-Diminishing-Valued-Colored-Balls.md" >}})|Medium||||30.8%| |1648|Sell Diminishing-Valued Colored Balls|[Go]({{< relref "/ChapterFour/1600~1699/1648.Sell-Diminishing-Valued-Colored-Balls.md" >}})|Medium||||30.8%|
|1680|Concatenation of Consecutive Binary Numbers|[Go]({{< relref "/ChapterFour/1600~1699/1680.Concatenation-of-Consecutive-Binary-Numbers.md" >}})|Medium||||52.3%| |1680|Concatenation of Consecutive Binary Numbers|[Go]({{< relref "/ChapterFour/1600~1699/1680.Concatenation-of-Consecutive-Binary-Numbers.md" >}})|Medium||||52.3%|
|1685|Sum of Absolute Differences in a Sorted Array|[Go]({{< relref "/ChapterFour/1600~1699/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array.md" >}})|Medium||||63.3%| |1685|Sum of Absolute Differences in a Sorted Array|[Go]({{< relref "/ChapterFour/1600~1699/1685.Sum-of-Absolute-Differences-in-a-Sorted-Array.md" >}})|Medium||||63.4%|
|1716|Calculate Money in Leetcode Bank|[Go]({{< relref "/ChapterFour/1700~1799/1716.Calculate-Money-in-Leetcode-Bank.md" >}})|Easy||||64.3%| |1716|Calculate Money in Leetcode Bank|[Go]({{< relref "/ChapterFour/1700~1799/1716.Calculate-Money-in-Leetcode-Bank.md" >}})|Easy||||64.3%|
|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------| |------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|

2
website/content/ChapterTwo/String.md
View File

@ -31,7 +31,7 @@ weight: 2
|0115|Distinct Subsequences|[Go]({{< relref "/ChapterFour/0100~0199/0115.Distinct-Subsequences.md" >}})|Hard||||40.2%| |0115|Distinct Subsequences|[Go]({{< relref "/ChapterFour/0100~0199/0115.Distinct-Subsequences.md" >}})|Hard||||40.2%|
|0125|Valid Palindrome|[Go]({{< relref "/ChapterFour/0100~0199/0125.Valid-Palindrome.md" >}})|Easy| O(n)| O(1)||38.8%| |0125|Valid Palindrome|[Go]({{< relref "/ChapterFour/0100~0199/0125.Valid-Palindrome.md" >}})|Easy| O(n)| O(1)||38.8%|
|0126|Word Ladder II|[Go]({{< relref "/ChapterFour/0100~0199/0126.Word-Ladder-II.md" >}})|Hard| O(n)| O(n^2)|❤️|24.0%| |0126|Word Ladder II|[Go]({{< relref "/ChapterFour/0100~0199/0126.Word-Ladder-II.md" >}})|Hard| O(n)| O(n^2)|❤️|24.0%|
|0151|Reverse Words in a String|[Go]({{< relref "/ChapterFour/0100~0199/0151.Reverse-Words-in-a-String.md" >}})|Medium||||24.5%| |0151|Reverse Words in a String|[Go]({{< relref "/ChapterFour/0100~0199/0151.Reverse-Words-in-a-String.md" >}})|Medium||||24.6%|
|0227|Basic Calculator II|[Go]({{< relref "/ChapterFour/0200~0299/0227.Basic-Calculator-II.md" >}})|Medium||||39.0%| |0227|Basic Calculator II|[Go]({{< relref "/ChapterFour/0200~0299/0227.Basic-Calculator-II.md" >}})|Medium||||39.0%|
|0344|Reverse String|[Go]({{< relref "/ChapterFour/0300~0399/0344.Reverse-String.md" >}})|Easy| O(n)| O(1)||71.0%| |0344|Reverse String|[Go]({{< relref "/ChapterFour/0300~0399/0344.Reverse-String.md" >}})|Easy| O(n)| O(1)||71.0%|
|0345|Reverse Vowels of a String|[Go]({{< relref "/ChapterFour/0300~0399/0345.Reverse-Vowels-of-a-String.md" >}})|Easy| O(n)| O(1)||45.4%| |0345|Reverse Vowels of a String|[Go]({{< relref "/ChapterFour/0300~0399/0345.Reverse-Vowels-of-a-String.md" >}})|Easy| O(n)| O(1)||45.4%|

2
website/content/ChapterTwo/Union_Find.md
View File

@ -36,7 +36,7 @@ weight: 16
|0947|Most Stones Removed with Same Row or Column|[Go]({{< relref "/ChapterFour/0900~0999/0947.Most-Stones-Removed-with-Same-Row-or-Column.md" >}})|Medium| O(n)| O(n)||55.8%| |0947|Most Stones Removed with Same Row or Column|[Go]({{< relref "/ChapterFour/0900~0999/0947.Most-Stones-Removed-with-Same-Row-or-Column.md" >}})|Medium| O(n)| O(n)||55.8%|
|0952|Largest Component Size by Common Factor|[Go]({{< relref "/ChapterFour/0900~0999/0952.Largest-Component-Size-by-Common-Factor.md" >}})|Hard| O(n)| O(n)|❤️|36.5%| |0952|Largest Component Size by Common Factor|[Go]({{< relref "/ChapterFour/0900~0999/0952.Largest-Component-Size-by-Common-Factor.md" >}})|Hard| O(n)| O(n)|❤️|36.5%|
|0959|Regions Cut By Slashes|[Go]({{< relref "/ChapterFour/0900~0999/0959.Regions-Cut-By-Slashes.md" >}})|Medium| O(n^2)| O(n^2)|❤️|67.4%| |0959|Regions Cut By Slashes|[Go]({{< relref "/ChapterFour/0900~0999/0959.Regions-Cut-By-Slashes.md" >}})|Medium| O(n^2)| O(n^2)|❤️|67.4%|
|0990|Satisfiability of Equality Equations|[Go]({{< relref "/ChapterFour/0900~0999/0990.Satisfiability-of-Equality-Equations.md" >}})|Medium| O(n)| O(n)||47.1%| |0990|Satisfiability of Equality Equations|[Go]({{< relref "/ChapterFour/0900~0999/0990.Satisfiability-of-Equality-Equations.md" >}})|Medium| O(n)| O(n)||47.2%|
|1202|Smallest String With Swaps|[Go]({{< relref "/ChapterFour/1200~1299/1202.Smallest-String-With-Swaps.md" >}})|Medium||||49.3%| |1202|Smallest String With Swaps|[Go]({{< relref "/ChapterFour/1200~1299/1202.Smallest-String-With-Swaps.md" >}})|Medium||||49.3%|
|1319|Number of Operations to Make Network Connected|[Go]({{< relref "/ChapterFour/1300~1399/1319.Number-of-Operations-to-Make-Network-Connected.md" >}})|Medium||||55.5%| |1319|Number of Operations to Make Network Connected|[Go]({{< relref "/ChapterFour/1300~1399/1319.Number-of-Operations-to-Make-Network-Connected.md" >}})|Medium||||55.5%|
|1579|Remove Max Number of Edges to Keep Graph Fully Traversable|[Go]({{< relref "/ChapterFour/1500~1599/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable.md" >}})|Hard||||46.5%| |1579|Remove Max Number of Edges to Keep Graph Fully Traversable|[Go]({{< relref "/ChapterFour/1500~1599/1579.Remove-Max-Number-of-Edges-to-Keep-Graph-Fully-Traversable.md" >}})|Hard||||46.5%|