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

LeetCode delete problem 1204 cause ctl order error

Browse Source
This commit is contained in:
YDZ
2021-06-19 22:17:06 +08:00
parent eb5eb51233
commit fe99f9d7d5
8 changed files with 49 additions and 47 deletions
Download Patch File Download Diff File Expand all files Collapse all files

70
README.md
View File

@ -267,7 +267,7 @@
|0126|Word Ladder II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0126.Word-Ladder-II)|24.2%|Hard||
|0127|Word Ladder|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0127.Word-Ladder)|32.7%|Hard||
|0128|Longest Consecutive Sequence|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0128.Longest-Consecutive-Sequence)|47.3%|Medium||
|0129|Sum Root to Leaf Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0129.Sum-Root-to-Leaf-Numbers)|52.0%|Medium||
|0129|Sum Root to Leaf Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0129.Sum-Root-to-Leaf-Numbers)|52.1%|Medium||
|0130|Surrounded Regions|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0130.Surrounded-Regions)|30.4%|Medium||
|0131|Palindrome Partitioning|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0131.Palindrome-Partitioning)|53.7%|Medium||
|0132|Palindrome Partitioning II||31.6%|Hard||
@ -559,7 +559,7 @@
|0418|Sentence Screen Fitting||34.0%|Medium||
|0419|Battleships in a Board||71.6%|Medium||
|0420|Strong Password Checker||13.6%|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.7%|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.6%|Medium||
|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.2%|Medium||
|0424|Longest Repeating Character Replacement|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0424.Longest-Repeating-Character-Replacement)|48.8%|Medium||
@ -579,7 +579,7 @@
|0438|Find All Anagrams in a String|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0438.Find-All-Anagrams-in-a-String)|45.6%|Medium||
|0439|Ternary Expression Parser||57.1%|Medium||
|0440|K-th Smallest in Lexicographical Order||30.0%|Hard||
|0441|Arranging Coins|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0441.Arranging-Coins)|42.8%|Easy||
|0441|Arranging Coins|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0441.Arranging-Coins)|42.9%|Easy||
|0442|Find All Duplicates in an Array||69.6%|Medium||
|0443|String Compression||44.9%|Medium||
|0444|Sequence Reconstruction||23.8%|Medium||
@ -767,7 +767,7 @@
|0626|Exchange Seats||67.0%|Medium||
|0627|Swap Salary||78.7%|Easy||
|0628|Maximum Product of Three Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0628.Maximum-Product-of-Three-Numbers)|46.7%|Easy||
|0629|K Inverse Pairs Array||33.5%|Hard||
|0629|K Inverse Pairs Array||33.8%|Hard||
|0630|Course Schedule III|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0630.Course-Schedule-III)|34.9%|Hard||
|0631|Design Excel Sum Formula||33.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)|55.2%|Hard||
@ -917,7 +917,7 @@
|0776|Split BST||56.9%|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.3%|Hard||
|0779|K-th Symbol in Grammar||39.1%|Medium||
|0779|K-th Symbol in Grammar||39.0%|Medium||
|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.2%|Medium||
|0782|Transform to Chessboard||47.1%|Hard||
@ -1069,7 +1069,7 @@
|0928|Minimize Malware Spread II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0928.Minimize-Malware-Spread-II)|41.5%|Hard||
|0929|Unique Email Addresses||67.2%|Easy||
|0930|Binary Subarrays With Sum|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0930.Binary-Subarrays-With-Sum)|45.6%|Medium||
|0931|Minimum Falling Path Sum||64.5%|Medium||
|0931|Minimum Falling Path Sum||64.4%|Medium||
|0932|Beautiful Array||61.6%|Medium||
|0933|Number of Recent Calls|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/0933.Number-of-Recent-Calls)|72.6%|Easy||
|0934|Shortest Bridge||50.6%|Medium||
@ -1160,7 +1160,7 @@
|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.4%|Medium||
|1020|Number of Enclaves|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1020.Number-of-Enclaves)|59.7%|Medium||
|1021|Remove Outermost Parentheses|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1021.Remove-Outermost-Parentheses)|79.3%|Easy||
|1022|Sum of Root To Leaf Binary Numbers||71.9%|Easy||
|1022|Sum of Root To Leaf Binary Numbers||71.8%|Easy||
|1023|Camelcase Matching||57.8%|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||
@ -1177,7 +1177,7 @@
|1036|Escape a Large Maze||34.2%|Hard||
|1037|Valid Boomerang|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1037.Valid-Boomerang)|37.4%|Easy||
|1038|Binary Search Tree to Greater Sum Tree|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1038.Binary-Search-Tree-to-Greater-Sum-Tree)|83.1%|Medium||
|1039|Minimum Score Triangulation of Polygon||50.8%|Medium||
|1039|Minimum Score Triangulation of Polygon||50.9%|Medium||
|1040|Moving Stones Until Consecutive II|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1040.Moving-Stones-Until-Consecutive-II)|54.8%|Medium||
|1041|Robot Bounded In Circle||54.9%|Medium||
|1042|Flower Planting With No Adjacent||49.0%|Medium||
@ -1211,7 +1211,7 @@
|1070|Product Sales Analysis III||50.1%|Medium||
|1071|Greatest Common Divisor of Strings||51.8%|Easy||
|1072|Flip Columns For Maximum Number of Equal Rows||62.0%|Medium||
|1073|Adding Two Negabinary Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1073.Adding-Two-Negabinary-Numbers)|34.8%|Medium||
|1073|Adding Two Negabinary Numbers|[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/1073.Adding-Two-Negabinary-Numbers)|34.7%|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)|65.2%|Hard||
|1075|Project Employees I||66.5%|Easy||
|1076|Project Employees II||52.5%|Easy||
@ -1455,7 +1455,7 @@
|1315|Sum of Nodes with Even-Valued Grandparent||84.5%|Medium||
|1316|Distinct Echo Substrings||49.5%|Hard||
|1317|Convert Integer to the Sum of Two No-Zero Integers||57.1%|Easy||
|1318|Minimum Flips to Make a OR b Equal to c||64.2%|Medium||
|1318|Minimum Flips to Make a OR b Equal to c||64.1%|Medium||
|1319|Number of Operations to Make Network Connected||55.6%|Medium||
|1320|Minimum Distance to Type a Word Using Two Fingers||61.6%|Hard||
|1321|Restaurant Growth||72.3%|Medium||
@ -1468,7 +1468,7 @@
|1328|Break a Palindrome||49.0%|Medium||
|1329|Sort the Matrix Diagonally||81.4%|Medium||
|1330|Reverse Subarray To Maximize Array Value||37.2%|Hard||
|1331|Rank Transform of an Array||57.3%|Easy||
|1331|Rank Transform of an Array||57.2%|Easy||
|1332|Remove Palindromic Subsequences||68.6%|Easy||
|1333|Filter Restaurants by Vegan-Friendly, Price and Distance||57.8%|Medium||
|1334|Find the City With the Smallest Number of Neighbors at a Threshold Distance||48.1%|Medium||
@ -1523,13 +1523,13 @@
|1383|Maximum Performance of a Team||41.2%|Hard||
|1384|Total Sales Amount by Year||65.2%|Hard||
|1385|Find the Distance Value Between Two Arrays||66.6%|Easy||
|1386|Cinema Seat Allocation||37.0%|Medium||
|1386|Cinema Seat Allocation||36.9%|Medium||
|1387|Sort Integers by The Power Value||70.7%|Medium||
|1388|Pizza With 3n Slices||46.7%|Hard||
|1389|Create Target Array in the Given Order||85.1%|Easy||
|1390|Four Divisors||39.8%|Medium||
|1391|Check if There is a Valid Path in a Grid||45.5%|Medium||
|1392|Longest Happy Prefix||42.7%|Hard||
|1392|Longest Happy Prefix||42.8%|Hard||
|1393|Capital Gain/Loss||91.2%|Medium||
|1394|Find Lucky Integer in an Array||63.1%|Easy||
|1395|Count Number of Teams||72.7%|Medium||
@ -1541,7 +1541,7 @@
|1401|Circle and Rectangle Overlapping||42.9%|Medium||
|1402|Reducing Dishes||72.1%|Hard||
|1403|Minimum Subsequence in Non-Increasing Order||71.9%|Easy||
|1404|Number of Steps to Reduce a Number in Binary Representation to One||50.1%|Medium||
|1404|Number of Steps to Reduce a Number in Binary Representation to One||50.2%|Medium||
|1405|Longest Happy String||53.2%|Medium||
|1406|Stone Game III||58.9%|Hard||
|1407|Top Travellers||84.1%|Easy||
@ -1581,7 +1581,7 @@
|1441|Build an Array With Stack Operations||70.4%|Easy||
|1442|Count Triplets That Can Form Two Arrays of Equal XOR||72.8%|Medium||
|1443|Minimum Time to Collect All Apples in a Tree||54.6%|Medium||
|1444|Number of Ways of Cutting a Pizza||54.3%|Hard||
|1444|Number of Ways of Cutting a Pizza||54.2%|Hard||
|1445|Apples & Oranges||91.2%|Medium||
|1446|Consecutive Characters||61.2%|Easy||
|1447|Simplified Fractions||62.6%|Medium||
@ -1612,7 +1612,7 @@
|1472|Design Browser History||72.6%|Medium||
|1473|Paint House III||49.0%|Hard||
|1474|Delete N Nodes After M Nodes of a Linked List||73.5%|Easy||
|1475|Final Prices With a Special Discount in a Shop||74.7%|Easy||
|1475|Final Prices With a Special Discount in a Shop||74.8%|Easy||
|1476|Subrectangle Queries||87.9%|Medium||
|1477|Find Two Non-overlapping Sub-arrays Each With Target Sum||35.5%|Medium||
|1478|Allocate Mailboxes||54.1%|Hard||
@ -1700,7 +1700,7 @@
|1560|Most Visited Sector in a Circular Track||57.3%|Easy||
|1561|Maximum Number of Coins You Can Get||77.1%|Medium||
|1562|Find Latest Group of Size M||40.0%|Medium||
|1563|Stone Game V||40.0%|Hard||
|1563|Stone Game V||40.1%|Hard||
|1564|Put Boxes Into the Warehouse I||64.2%|Medium||
|1565|Unique Orders and Customers Per Month||82.9%|Easy||
|1566|Detect Pattern of Length M Repeated K or More Times||42.9%|Easy||
@ -1719,7 +1719,7 @@
|1579|Remove Max Number of Edges to Keep Graph Fully Traversable||46.8%|Hard||
|1580|Put Boxes Into the Warehouse II||63.6%|Medium||
|1581|Customer Who Visited but Did Not Make Any Transactions||89.4%|Easy||
|1582|Special Positions in a Binary Matrix||64.2%|Easy||
|1582|Special Positions in a Binary Matrix||64.1%|Easy||
|1583|Count Unhappy Friends||55.3%|Medium||
|1584|Min Cost to Connect All Points||55.1%|Medium||
|1585|Check If String Is Transformable With Substring Sort Operations||48.5%|Hard||
@ -1730,7 +1730,7 @@
|1590|Make Sum Divisible by P||27.2%|Medium||
|1591|Strange Printer II||55.7%|Hard||
|1592|Rearrange Spaces Between Words||43.6%|Easy||
|1593|Split a String Into the Max Number of Unique Substrings||50.6%|Medium||
|1593|Split a String Into the Max Number of Unique Substrings||50.5%|Medium||
|1594|Maximum Non Negative Product in a Matrix||32.6%|Medium||
|1595|Minimum Cost to Connect Two Groups of Points||43.9%|Hard||
|1596|The Most Frequently Ordered Products for Each Customer||85.1%|Medium||
@ -1763,10 +1763,10 @@
|1623|All Valid Triplets That Can Represent a Country||89.0%|Easy||
|1624|Largest Substring Between Two Equal Characters||58.6%|Easy||
|1625|Lexicographically Smallest String After Applying Operations||65.0%|Medium||
|1626|Best Team With No Conflicts||39.4%|Medium||
|1626|Best Team With No Conflicts||39.3%|Medium||
|1627|Graph Connectivity With Threshold||41.1%|Hard||
|1628|Design an Expression Tree With Evaluate Function||80.7%|Medium||
|1629|Slowest Key||58.9%|Easy||
|1629|Slowest Key||59.0%|Easy||
|1630|Arithmetic Subarrays||77.3%|Medium||
|1631|Path With Minimum Effort||50.3%|Medium||
|1632|Rank Transform of a Matrix||32.1%|Hard||
@ -1833,7 +1833,7 @@
|1693|Daily Leads and Partners||90.8%|Easy||
|1694|Reformat Phone Number||64.7%|Easy||
|1695|Maximum Erasure Value||52.5%|Medium||
|1696|Jump Game VI||42.1%|Medium||
|1696|Jump Game VI||42.2%|Medium||
|1697|Checking Existence of Edge Length Limited Paths||47.9%|Hard||
|1698|Number of Distinct Substrings in a String||60.8%|Medium||
|1699|Number of Calls Between Two Persons||85.9%|Medium||
@ -1890,7 +1890,7 @@
|1750|Minimum Length of String After Deleting Similar Ends||42.4%|Medium||
|1751|Maximum Number of Events That Can Be Attended II||48.9%|Hard||
|1752|Check if Array Is Sorted and Rotated||44.5%|Easy||
|1753|Maximum Score From Removing Stones||62.8%|Medium||
|1753|Maximum Score From Removing Stones||62.9%|Medium||
|1754|Largest Merge Of Two Strings||41.7%|Medium||
|1755|Closest Subsequence Sum||34.3%|Hard||
|1756|Design Most Recently Used Queue||78.9%|Medium||
@ -1900,7 +1900,7 @@
|1760|Minimum Limit of Balls in a Bag||53.8%|Medium||
|1761|Minimum Degree of a Connected Trio in a Graph||38.5%|Hard||
|1762|Buildings With an Ocean View||81.5%|Medium||
|1763|Longest Nice Substring||61.1%|Easy||
|1763|Longest Nice Substring||61.2%|Easy||
|1764|Form Array by Concatenating Subarrays of Another Array||53.6%|Medium||
|1765|Map of Highest Peak||56.9%|Medium||
|1766|Tree of Coprimes||36.6%|Hard||
@ -1914,8 +1914,8 @@
|1774|Closest Dessert Cost||45.3%|Medium||
|1775|Equal Sum Arrays With Minimum Number of Operations||50.3%|Medium||
|1776|Car Fleet II||49.8%|Hard||
|1777|Product's Price for Each Store||86.4%|Easy||
|1778|Shortest Path in a Hidden Grid||44.6%|Medium||
|1777|Product's Price for Each Store||86.3%|Easy||
|1778|Shortest Path in a Hidden Grid||44.5%|Medium||
|1779|Find Nearest Point That Has the Same X or Y Coordinate||66.7%|Easy||
|1780|Check if Number is a Sum of Powers of Three||63.2%|Medium||
|1781|Sum of Beauty of All Substrings||58.4%|Medium||
@ -1931,7 +1931,7 @@
|1791|Find Center of Star Graph||84.3%|Medium||
|1792|Maximum Average Pass Ratio||47.4%|Medium||
|1793|Maximum Score of a Good Subarray||47.7%|Hard||
|1794|Count Pairs of Equal Substrings With Minimum Difference||68.7%|Medium||
|1794|Count Pairs of Equal Substrings With Minimum Difference||68.5%|Medium||
|1795|Rearrange Products Table||89.9%|Easy||
|1796|Second Largest Digit in a String||48.0%|Easy||
|1797|Design Authentication Manager||50.0%|Medium||
@ -1949,7 +1949,7 @@
|1809|Ad-Free Sessions||63.4%|Easy||
|1810|Minimum Path Cost in a Hidden Grid||54.0%|Medium||
|1811|Find Interview Candidates||67.3%|Medium||
|1812|Determine Color of a Chessboard Square||77.2%|Easy||
|1812|Determine Color of a Chessboard Square||77.3%|Easy||
|1813|Sentence Similarity III||31.7%|Medium||
|1814|Count Nice Pairs in an Array||39.2%|Medium||
|1815|Maximum Number of Groups Getting Fresh Donuts||39.5%|Hard||
@ -2012,9 +2012,9 @@
|1872|Stone Game VIII||50.8%|Hard||
|1873|Calculate Special Bonus||90.7%|Easy||
|1874|Minimize Product Sum of Two Arrays||91.1%|Medium||
|1875|Group Employees of the Same Salary||75.5%|Medium||
|1875|Group Employees of the Same Salary||75.6%|Medium||
|1876|Substrings of Size Three with Distinct Characters||67.8%|Easy||
|1877|Minimize Maximum Pair Sum in Array||78.5%|Medium||
|1877|Minimize Maximum Pair Sum in Array||78.6%|Medium||
|1878|Get Biggest Three Rhombus Sums in a Grid||43.3%|Medium||
|1879|Minimum XOR Sum of Two Arrays||35.5%|Hard||
|1880|Check if Word Equals Summation of Two Words||71.7%|Easy||
@ -2022,7 +2022,7 @@
|1882|Process Tasks Using Servers||30.5%|Medium||
|1883|Minimum Skips to Arrive at Meeting On Time||38.0%|Hard||
|1884|Egg Drop With 2 Eggs and N Floors||70.1%|Medium||
|1885|Count Pairs in Two Arrays||55.2%|Medium||
|1885|Count Pairs in Two Arrays||55.3%|Medium||
|1886|Determine Whether Matrix Can Be Obtained By Rotation||53.6%|Easy||
|1887|Reduction Operations to Make the Array Elements Equal||59.6%|Medium||
|1888|Minimum Number of Flips to Make the Binary String Alternating||33.7%|Medium||
@ -2033,13 +2033,13 @@
|1893|Check if All the Integers in a Range Are Covered||48.8%|Easy||
|1894|Find the Student that Will Replace the Chalk||38.2%|Medium||
|1895|Largest Magic Square||48.9%|Medium||
|1896|Minimum Cost to Change the Final Value of Expression||50.5%|Hard||
|1896|Minimum Cost to Change the Final Value of Expression||50.3%|Hard||
|1897|Redistribute Characters to Make All Strings Equal||58.3%|Easy||
|1898|Maximum Number of Removable Characters||32.0%|Medium||
|1899|Merge Triplets to Form Target Triplet||58.5%|Medium||
|1900|The Earliest and Latest Rounds Where Players Compete||48.5%|Hard||
|1901|Find a Peak Element II||66.3%|Medium||
|1902|Depth of BST Given Insertion Order||49.1%|Medium||
|1900|The Earliest and Latest Rounds Where Players Compete||48.4%|Hard||
|1901|Find a Peak Element II||66.1%|Medium||
|1902|Depth of BST Given Insertion Order||49.4%|Medium||
|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|
------------------------------------------------------------------

4
ctl/models/mdrow.go
View File

@ -18,13 +18,15 @@ type Mdrow struct {
// GenerateMdRows define
func GenerateMdRows(solutionIds []int, mdrows []Mdrow) {
//fmt.Printf("solutionIds = %v\n\n", solutionIds)
for i := 0; i < len(solutionIds); i++ {
//fmt.Printf("solutionIds[i] = %v id = %v - %v\n", solutionIds[i], mdrows[solutionIds[i]].FrontendQuestionID, mdrows[solutionIds[i]].QuestionTitle)
id := mdrows[solutionIds[i]-1].FrontendQuestionID
if solutionIds[i] == int(id) {
//fmt.Printf("id = %v i = %v solutionIds = %v\n", id, i, solutionIds[i])
mdrows[id-1].SolutionPath = fmt.Sprintf("[Go](https://github.com/halfrost/LeetCode-Go/tree/master/leetcode/%v)", fmt.Sprintf("%04d.%v", id, strings.Replace(strings.TrimSpace(mdrows[id-1].QuestionTitle), " ", "-", -1)))
} else {
fmt.Printf("序号出错了 solutionIds = %v id = %v\n", solutionIds[i], id)
fmt.Printf("序号出错了 len(solutionIds) = %v len(mdrows) = %v len(solutionIds) = %v solutionIds[i] = %v id = %v - %v\n", len(solutionIds), len(mdrows), len(solutionIds), solutionIds[i], id, mdrows[solutionIds[i]-1].QuestionTitle)
}
}
}

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

@ -85,7 +85,7 @@ weight: 1
|0643|Maximum Average Subarray I|[Go]({{< relref "/ChapterFour/0600~0699/0643.Maximum-Average-Subarray-I.md" >}})|Easy||||42.2%|
|0661|Image Smoother|[Go]({{< relref "/ChapterFour/0600~0699/0661.Image-Smoother.md" >}})|Easy||||52.6%|
|0665|Non-decreasing Array|[Go]({{< relref "/ChapterFour/0600~0699/0665.Non-decreasing-Array.md" >}})|Medium||||20.9%|
|0667|Beautiful Arrangement II|[Go]({{< relref "/ChapterFour/0600~0699/0667.Beautiful-Arrangement-II.md" >}})|Medium||||59.0%|
|0667|Beautiful Arrangement II|[Go]({{< relref "/ChapterFour/0600~0699/0667.Beautiful-Arrangement-II.md" >}})|Medium||||58.9%|
|0674|Longest Continuous Increasing Subsequence|[Go]({{< relref "/ChapterFour/0600~0699/0674.Longest-Continuous-Increasing-Subsequence.md" >}})|Easy||||46.4%|
|0695|Max Area of Island|[Go]({{< relref "/ChapterFour/0600~0699/0695.Max-Area-of-Island.md" >}})|Medium||||66.7%|
|0697|Degree of an Array|[Go]({{< relref "/ChapterFour/0600~0699/0697.Degree-of-an-Array.md" >}})|Easy||||54.7%|
@ -93,7 +93,7 @@ weight: 1
|0714|Best Time to Buy and Sell Stock with Transaction Fee|[Go]({{< relref "/ChapterFour/0700~0799/0714.Best-Time-to-Buy-and-Sell-Stock-with-Transaction-Fee.md" >}})|Medium| O(n)| O(1)||58.5%|
|0717|1-bit and 2-bit Characters|[Go]({{< relref "/ChapterFour/0700~0799/0717.1-bit-and-2-bit-Characters.md" >}})|Easy||||46.3%|
|0718|Maximum Length of Repeated Subarray|[Go]({{< relref "/ChapterFour/0700~0799/0718.Maximum-Length-of-Repeated-Subarray.md" >}})|Medium||||50.9%|
|0719|Find K-th Smallest Pair Distance|[Go]({{< relref "/ChapterFour/0700~0799/0719.Find-K-th-Smallest-Pair-Distance.md" >}})|Hard||||32.9%|
|0719|Find K-th Smallest Pair Distance|[Go]({{< relref "/ChapterFour/0700~0799/0719.Find-K-th-Smallest-Pair-Distance.md" >}})|Hard||||32.8%|
|0724|Find Pivot Index|[Go]({{< relref "/ChapterFour/0700~0799/0724.Find-Pivot-Index.md" >}})|Easy||||47.2%|
|0729|My Calendar I|[Go]({{< relref "/ChapterFour/0700~0799/0729.My-Calendar-I.md" >}})|Medium||||54.1%|
|0746|Min Cost Climbing Stairs|[Go]({{< relref "/ChapterFour/0700~0799/0746.Min-Cost-Climbing-Stairs.md" >}})|Easy| O(n)| O(1)||53.5%|
@ -144,7 +144,7 @@ weight: 1
|1287|Element Appearing More Than 25% In Sorted Array|[Go]({{< relref "/ChapterFour/1200~1299/1287.Element-Appearing-More-Than-25-In-Sorted-Array.md" >}})|Easy||||60.0%|
|1295|Find Numbers with Even Number of Digits|[Go]({{< relref "/ChapterFour/1200~1299/1295.Find-Numbers-with-Even-Number-of-Digits.md" >}})|Easy||||78.3%|
|1299|Replace Elements with Greatest Element on Right Side|[Go]({{< relref "/ChapterFour/1200~1299/1299.Replace-Elements-with-Greatest-Element-on-Right-Side.md" >}})|Easy||||74.5%|
|1300|Sum of Mutated Array Closest to Target|[Go]({{< relref "/ChapterFour/1300~1399/1300.Sum-of-Mutated-Array-Closest-to-Target.md" >}})|Medium||||42.7%|
|1300|Sum of Mutated Array Closest to Target|[Go]({{< relref "/ChapterFour/1300~1399/1300.Sum-of-Mutated-Array-Closest-to-Target.md" >}})|Medium||||42.6%|
|1304|Find N Unique Integers Sum up to Zero|[Go]({{< relref "/ChapterFour/1300~1399/1304.Find-N-Unique-Integers-Sum-up-to-Zero.md" >}})|Easy||||76.5%|
|1313|Decompress Run-Length Encoded List|[Go]({{< relref "/ChapterFour/1300~1399/1313.Decompress-Run-Length-Encoded-List.md" >}})|Easy||||85.5%|
|1329|Sort the Matrix Diagonally|[Go]({{< relref "/ChapterFour/1300~1399/1329.Sort-the-Matrix-Diagonally.md" >}})|Medium||||81.4%|
@ -167,7 +167,7 @@ weight: 1
|1572|Matrix Diagonal Sum|[Go]({{< relref "/ChapterFour/1500~1599/1572.Matrix-Diagonal-Sum.md" >}})|Easy||||77.9%|
|1608|Special Array With X Elements Greater Than or Equal X|[Go]({{< relref "/ChapterFour/1600~1699/1608.Special-Array-With-X-Elements-Greater-Than-or-Equal-X.md" >}})|Easy||||61.4%|
|1619|Mean of Array After Removing Some Elements|[Go]({{< relref "/ChapterFour/1600~1699/1619.Mean-of-Array-After-Removing-Some-Elements.md" >}})|Easy||||64.4%|
|1629|Slowest Key|[Go]({{< relref "/ChapterFour/1600~1699/1629.Slowest-Key.md" >}})|Easy||||58.9%|
|1629|Slowest Key|[Go]({{< relref "/ChapterFour/1600~1699/1629.Slowest-Key.md" >}})|Easy||||59.0%|
|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||||55.5%|
|1646|Get Maximum in Generated Array|[Go]({{< relref "/ChapterFour/1600~1699/1646.Get-Maximum-in-Generated-Array.md" >}})|Easy||||52.8%|

4
website/content/ChapterTwo/Binary_Search.md
View File

@ -176,7 +176,7 @@ func peakIndexInMountainArray(A []int) int {
|0704|Binary Search|[Go]({{< relref "/ChapterFour/0700~0799/0704.Binary-Search.md" >}})|Easy||||54.7%|
|0710|Random Pick with Blacklist|[Go]({{< relref "/ChapterFour/0700~0799/0710.Random-Pick-with-Blacklist.md" >}})|Hard| O(n)| O(n) ||33.2%|
|0718|Maximum Length of Repeated Subarray|[Go]({{< relref "/ChapterFour/0700~0799/0718.Maximum-Length-of-Repeated-Subarray.md" >}})|Medium||||50.9%|
|0719|Find K-th Smallest Pair Distance|[Go]({{< relref "/ChapterFour/0700~0799/0719.Find-K-th-Smallest-Pair-Distance.md" >}})|Hard||||32.9%|
|0719|Find K-th Smallest Pair Distance|[Go]({{< relref "/ChapterFour/0700~0799/0719.Find-K-th-Smallest-Pair-Distance.md" >}})|Hard||||32.8%|
|0744|Find Smallest Letter Greater Than Target|[Go]({{< relref "/ChapterFour/0700~0799/0744.Find-Smallest-Letter-Greater-Than-Target.md" >}})|Easy||||45.7%|
|0778|Swim in Rising Water|[Go]({{< relref "/ChapterFour/0700~0799/0778.Swim-in-Rising-Water.md" >}})|Hard||||55.3%|
|0786|K-th Smallest Prime Fraction|[Go]({{< relref "/ChapterFour/0700~0799/0786.K-th-Smallest-Prime-Fraction.md" >}})|Hard||||44.7%|
@ -196,7 +196,7 @@ func peakIndexInMountainArray(A []int) int {
|1201|Ugly Number III|[Go]({{< relref "/ChapterFour/1200~1299/1201.Ugly-Number-III.md" >}})|Medium||||26.6%|
|1235|Maximum Profit in Job Scheduling|[Go]({{< relref "/ChapterFour/1200~1299/1235.Maximum-Profit-in-Job-Scheduling.md" >}})|Hard||||48.2%|
|1283|Find the Smallest Divisor Given a Threshold|[Go]({{< relref "/ChapterFour/1200~1299/1283.Find-the-Smallest-Divisor-Given-a-Threshold.md" >}})|Medium||||50.6%|
|1300|Sum of Mutated Array Closest to Target|[Go]({{< relref "/ChapterFour/1300~1399/1300.Sum-of-Mutated-Array-Closest-to-Target.md" >}})|Medium||||42.7%|
|1300|Sum of Mutated Array Closest to Target|[Go]({{< relref "/ChapterFour/1300~1399/1300.Sum-of-Mutated-Array-Closest-to-Target.md" >}})|Medium||||42.6%|
|1337|The K Weakest Rows in a Matrix|[Go]({{< relref "/ChapterFour/1300~1399/1337.The-K-Weakest-Rows-in-a-Matrix.md" >}})|Easy||||72.0%|
|1482|Minimum Number of Days to Make m Bouquets|[Go]({{< relref "/ChapterFour/1400~1499/1482.Minimum-Number-of-Days-to-Make-m-Bouquets.md" >}})|Medium||||52.1%|
|1631|Path With Minimum Effort|[Go]({{< relref "/ChapterFour/1600~1699/1631.Path-With-Minimum-Effort.md" >}})|Medium||||50.3%|

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.7%|
|0401|Binary Watch|[Go]({{< relref "/ChapterFour/0400~0499/0401.Binary-Watch.md" >}})|Easy| O(1)| O(1)||48.9%|
|0405|Convert a Number to Hexadecimal|[Go]({{< relref "/ChapterFour/0400~0499/0405.Convert-a-Number-to-Hexadecimal.md" >}})|Easy| O(n)| O(1)||44.8%|
|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.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%|
|0461|Hamming Distance|[Go]({{< relref "/ChapterFour/0400~0499/0461.Hamming-Distance.md" >}})|Easy| O(n)| O(1)||73.4%|
|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.9%|

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

@ -25,7 +25,7 @@ weight: 9
|0113|Path Sum II|[Go]({{< relref "/ChapterFour/0100~0199/0113.Path-Sum-II.md" >}})|Medium| O(n)| O(1)||50.3%|
|0114|Flatten Binary Tree to Linked List|[Go]({{< relref "/ChapterFour/0100~0199/0114.Flatten-Binary-Tree-to-Linked-List.md" >}})|Medium| O(n)| O(1)||53.8%|
|0124|Binary Tree Maximum Path Sum|[Go]({{< relref "/ChapterFour/0100~0199/0124.Binary-Tree-Maximum-Path-Sum.md" >}})|Hard| O(n)| O(1)||36.0%|
|0129|Sum Root to Leaf Numbers|[Go]({{< relref "/ChapterFour/0100~0199/0129.Sum-Root-to-Leaf-Numbers.md" >}})|Medium| O(n)| O(1)||52.0%|
|0129|Sum Root to Leaf Numbers|[Go]({{< relref "/ChapterFour/0100~0199/0129.Sum-Root-to-Leaf-Numbers.md" >}})|Medium| O(n)| O(1)||52.1%|
|0130|Surrounded Regions|[Go]({{< relref "/ChapterFour/0100~0199/0130.Surrounded-Regions.md" >}})|Medium||||30.4%|
|0131|Palindrome Partitioning|[Go]({{< relref "/ChapterFour/0100~0199/0131.Palindrome-Partitioning.md" >}})|Medium||||53.7%|
|0199|Binary Tree Right Side View|[Go]({{< relref "/ChapterFour/0100~0199/0199.Binary-Tree-Right-Side-View.md" >}})|Medium| O(n)| O(1)||57.1%|

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

@ -84,7 +84,7 @@ weight: 12
|1017|Convert to Base -2|[Go]({{< relref "/ChapterFour/1000~1099/1017.Convert-to-Base-2.md" >}})|Medium||||59.4%|
|1025|Divisor Game|[Go]({{< relref "/ChapterFour/1000~1099/1025.Divisor-Game.md" >}})|Easy| O(1)| O(1)||66.2%|
|1037|Valid Boomerang|[Go]({{< relref "/ChapterFour/1000~1099/1037.Valid-Boomerang.md" >}})|Easy||||37.4%|
|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.7%|
|1093|Statistics from a Large Sample|[Go]({{< relref "/ChapterFour/1000~1099/1093.Statistics-from-a-Large-Sample.md" >}})|Medium||||47.8%|
|1154|Day of the Year|[Go]({{< relref "/ChapterFour/1100~1199/1154.Day-of-the-Year.md" >}})|Easy||||49.6%|
|1175|Prime Arrangements|[Go]({{< relref "/ChapterFour/1100~1199/1175.Prime-Arrangements.md" >}})|Easy||||51.8%|
@ -100,7 +100,7 @@ weight: 12
|1648|Sell Diminishing-Valued Colored Balls|[Go]({{< relref "/ChapterFour/1600~1699/1648.Sell-Diminishing-Valued-Colored-Balls.md" >}})|Medium||||31.1%|
|1680|Concatenation of Consecutive Binary Numbers|[Go]({{< relref "/ChapterFour/1600~1699/1680.Concatenation-of-Consecutive-Binary-Numbers.md" >}})|Medium||||52.2%|
|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.1%|
|1716|Calculate Money in Leetcode Bank|[Go]({{< relref "/ChapterFour/1700~1799/1716.Calculate-Money-in-Leetcode-Bank.md" >}})|Easy||||64.0%|
|1744|Can You Eat Your Favorite Candy on Your Favorite Day?|[Go]({{< relref "/ChapterFour/1700~1799/1744.Can-You-Eat-Your-Favorite-Candy-on-Your-Favorite-Day.md" >}})|Medium||||31.3%|
|------------|-------------------------------------------------------|-------| ----------------| ---------------|-------------|-------------|-------------|

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

@ -29,7 +29,7 @@ weight: 6
|0113|Path Sum II|[Go]({{< relref "/ChapterFour/0100~0199/0113.Path-Sum-II.md" >}})|Medium| O(n)| O(1)||50.3%|
|0114|Flatten Binary Tree to Linked List|[Go]({{< relref "/ChapterFour/0100~0199/0114.Flatten-Binary-Tree-to-Linked-List.md" >}})|Medium| O(n)| O(1)||53.8%|
|0124|Binary Tree Maximum Path Sum|[Go]({{< relref "/ChapterFour/0100~0199/0124.Binary-Tree-Maximum-Path-Sum.md" >}})|Hard| O(n)| O(1)||36.0%|
|0129|Sum Root to Leaf Numbers|[Go]({{< relref "/ChapterFour/0100~0199/0129.Sum-Root-to-Leaf-Numbers.md" >}})|Medium| O(n)| O(1)||52.0%|
|0129|Sum Root to Leaf Numbers|[Go]({{< relref "/ChapterFour/0100~0199/0129.Sum-Root-to-Leaf-Numbers.md" >}})|Medium| O(n)| O(1)||52.1%|
|0144|Binary Tree Preorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0144.Binary-Tree-Preorder-Traversal.md" >}})|Easy| O(n)| O(1)||58.6%|
|0145|Binary Tree Postorder Traversal|[Go]({{< relref "/ChapterFour/0100~0199/0145.Binary-Tree-Postorder-Traversal.md" >}})|Easy| O(n)| O(1)||59.0%|
|0173|Binary Search Tree Iterator|[Go]({{< relref "/ChapterFour/0100~0199/0173.Binary-Search-Tree-Iterator.md" >}})|Medium| O(n)| O(1)||61.5%|