Skip to content

Commit 6717daa

Browse files
yanglbmeyanglbme
committedFeb 19, 2021
docs: update summary
1 parent 2cb88b3 commit 6717daa

File tree

6 files changed

+273
-12
lines changed

6 files changed

+273
-12
lines changed
 

‎solution/1600-1699/1691.Maximum Height by Stacking Cuboids/README_EN.md

+5-6
Original file line numberDiff line numberDiff line change
@@ -55,27 +55,26 @@ The maximum height of stacked cuboids is 6 * 17 = 102.
5555
<li><code>1 &lt;= width<sub>i</sub>, length<sub>i</sub>, height<sub>i</sub> &lt;= 100</code></li>
5656
</ul>
5757

58-
5958
## Solutions
6059

61-
62-
6360
<!-- tabs:start -->
6461

6562
### **Python3**
6663

67-
6864
```python
65+
6966
```
7067

7168
### **Java**
7269

73-
7470
```java
71+
7572
```
7673

7774
### **...**
75+
7876
```
77+
7978
```
8079

81-
<!-- tabs:end -->
80+
<!-- tabs:end -->

‎solution/1700-1799/1744.Can You Eat Your Favorite Candy on Your Favorite Day/README.md

+4-1
Original file line numberDiff line numberDiff line change
@@ -64,18 +64,21 @@
6464
<!-- 这里可写当前语言的特殊实现逻辑 -->
6565

6666
```python
67+
6768
```
6869

6970
### **Java**
7071

7172
<!-- 这里可写当前语言的特殊实现逻辑 -->
7273

7374
```java
75+
7476
```
7577

7678
### **...**
7779

7880
```
81+
7982
```
8083

81-
<!-- tabs:end -->
84+
<!-- tabs:end -->

‎solution/1700-1799/1744.Can You Eat Your Favorite Candy on Your Favorite Day/README_EN.md

+4-1
Original file line numberDiff line numberDiff line change
@@ -59,16 +59,19 @@
5959
### **Python3**
6060

6161
```python
62+
6263
```
6364

6465
### **Java**
6566

6667
```java
68+
6769
```
6870

6971
### **...**
7072

7173
```
74+
7275
```
7376

74-
<!-- tabs:end -->
77+
<!-- tabs:end -->

‎solution/summary.md

+129-1
Original file line numberDiff line numberDiff line change
@@ -1627,7 +1627,7 @@
16271627
- [1573.Number of Ways to Split a String](/solution/1500-1599/1573.Number%20of%20Ways%20to%20Split%20a%20String/README.md)
16281628
- [1574.Shortest Subarray to be Removed to Make Array Sorted](/solution/1500-1599/1574.Shortest%20Subarray%20to%20be%20Removed%20to%20Make%20Array%20Sorted/README.md)
16291629
- [1575.Count All Possible Routes](/solution/1500-1599/1575.Count%20All%20Possible%20Routes/README.md)
1630-
- [1576.Replace All #003F's to Avoid Consecutive Repeating Characters](/solution/1500-1599/1576.Replace%20All%20S%20to%20Avoid%20Consecutive%20Repeating%20Characters/README.md)
1630+
- [1576.Replace All S to Avoid Consecutive Repeating Characters](/solution/1500-1599/1576.Replace%20All%20S%20to%20Avoid%20Consecutive%20Repeating%20Characters/README.md)
16311631
- [1577.Number of Ways Where Square of Number Is Equal to Product of Two Numbers](/solution/1500-1599/1577.Number%20of%20Ways%20Where%20Square%20of%20Number%20Is%20Equal%20to%20Product%20of%20Two%20Numbers/README.md)
16321632
- [1578.Minimum Deletion Cost to Avoid Repeating Letters](/solution/1500-1599/1578.Minimum%20Deletion%20Cost%20to%20Avoid%20Repeating%20Letters/README.md)
16331633
- [1579.Remove Max Number of Edges to Keep Graph Fully Traversable](/solution/1500-1599/1579.Remove%20Max%20Number%20of%20Edges%20to%20Keep%20Graph%20Fully%20Traversable/README.md)
@@ -1646,6 +1646,134 @@
16461646
- [1598.Crawler Log Folder](/solution/1500-1599/1598.Crawler%20Log%20Folder/README.md)
16471647
- [1599.Maximum Profit of Operating a Centennial Wheel](/solution/1500-1599/1599.Maximum%20Profit%20of%20Operating%20a%20Centennial%20Wheel/README.md)
16481648

1649+
- 1600-1699
1650+
1651+
- [1600.Throne Inheritance](/solution/1600-1699/1600.Throne%20Inheritance/README.md)
1652+
- [1601.Maximum Number of Achievable Transfer Requests](/solution/1600-1699/1601.Maximum%20Number%20of%20Achievable%20Transfer%20Requests/README.md)
1653+
- [1603.Design Parking System](/solution/1600-1699/1603.Design%20Parking%20System/README.md)
1654+
- [1604.Alert Using Same Key-Card Three or More Times in a One Hour Period](/solution/1600-1699/1604.Alert%20Using%20Same%20Key-Card%20Three%20or%20More%20Times%20in%20a%20One%20Hour%20Period/README.md)
1655+
- [1605.Find Valid Matrix Given Row and Column Sums](/solution/1600-1699/1605.Find%20Valid%20Matrix%20Given%20Row%20and%20Column%20Sums/README.md)
1656+
- [1606.Find Servers That Handled Most Number of Requests](/solution/1600-1699/1606.Find%20Servers%20That%20Handled%20Most%20Number%20of%20Requests/README.md)
1657+
- [1608.Special Array With X Elements Greater Than or Equal X](/solution/1600-1699/1608.Special%20Array%20With%20X%20Elements%20Greater%20Than%20or%20Equal%20X/README.md)
1658+
- [1609.Even Odd Tree](/solution/1600-1699/1609.Even%20Odd%20Tree/README.md)
1659+
- [1610.Maximum Number of Visible Points](/solution/1600-1699/1610.Maximum%20Number%20of%20Visible%20Points/README.md)
1660+
- [1611.Minimum One Bit Operations to Make Integers Zero](/solution/1600-1699/1611.Minimum%20One%20Bit%20Operations%20to%20Make%20Integers%20Zero/README.md)
1661+
- [1614.Maximum Nesting Depth of the Parentheses](/solution/1600-1699/1614.Maximum%20Nesting%20Depth%20of%20the%20Parentheses/README.md)
1662+
- [1615.Maximal Network Rank](/solution/1600-1699/1615.Maximal%20Network%20Rank/README.md)
1663+
- [1616.Split Two Strings to Make Palindrome](/solution/1600-1699/1616.Split%20Two%20Strings%20to%20Make%20Palindrome/README.md)
1664+
- [1617.Count Subtrees With Max Distance Between Cities](/solution/1600-1699/1617.Count%20Subtrees%20With%20Max%20Distance%20Between%20Cities/README.md)
1665+
- [1619.Mean of Array After Removing Some Elements](/solution/1600-1699/1619.Mean%20of%20Array%20After%20Removing%20Some%20Elements/README.md)
1666+
- [1620.Coordinate With Maximum Network Quality](/solution/1600-1699/1620.Coordinate%20With%20Maximum%20Network%20Quality/README.md)
1667+
- [1621.Number of Sets of K Non-Overlapping Line Segments](/solution/1600-1699/1621.Number%20of%20Sets%20of%20K%20Non-Overlapping%20Line%20Segments/README.md)
1668+
- [1622.Fancy Sequence](/solution/1600-1699/1622.Fancy%20Sequence/README.md)
1669+
- [1624.Largest Substring Between Two Equal Characters](/solution/1600-1699/1624.Largest%20Substring%20Between%20Two%20Equal%20Characters/README.md)
1670+
- [1625.Lexicographically Smallest String After Applying Operations](/solution/1600-1699/1625.Lexicographically%20Smallest%20String%20After%20Applying%20Operations/README.md)
1671+
- [1626.Best Team With No Conflicts](/solution/1600-1699/1626.Best%20Team%20With%20No%20Conflicts/README.md)
1672+
- [1627.Graph Connectivity With Threshold](/solution/1600-1699/1627.Graph%20Connectivity%20With%20Threshold/README.md)
1673+
- [1629.Slowest Key](/solution/1600-1699/1629.Slowest%20Key/README.md)
1674+
- [1630.Arithmetic Subarrays](/solution/1600-1699/1630.Arithmetic%20Subarrays/README.md)
1675+
- [1631.Path With Minimum Effort](/solution/1600-1699/1631.Path%20With%20Minimum%20Effort/README.md)
1676+
- [1632.Rank Transform of a Matrix](/solution/1600-1699/1632.Rank%20Transform%20of%20a%20Matrix/README.md)
1677+
- [1636.Sort Array by Increasing Frequency](/solution/1600-1699/1636.Sort%20Array%20by%20Increasing%20Frequency/README.md)
1678+
- [1637.Widest Vertical Area Between Two Points Containing No Points](/solution/1600-1699/1637.Widest%20Vertical%20Area%20Between%20Two%20Points%20Containing%20No%20Points/README.md)
1679+
- [1638.Count Substrings That Differ by One Character](/solution/1600-1699/1638.Count%20Substrings%20That%20Differ%20by%20One%20Character/README.md)
1680+
- [1639.Number of Ways to Form a Target String Given a Dictionary](/solution/1600-1699/1639.Number%20of%20Ways%20to%20Form%20a%20Target%20String%20Given%20a%20Dictionary/README.md)
1681+
- [1640.Check Array Formation Through Concatenation](/solution/1600-1699/1640.Check%20Array%20Formation%20Through%20Concatenation/README.md)
1682+
- [1641.Count Sorted Vowel Strings](/solution/1600-1699/1641.Count%20Sorted%20Vowel%20Strings/README.md)
1683+
- [1642.Furthest Building You Can Reach](/solution/1600-1699/1642.Furthest%20Building%20You%20Can%20Reach/README.md)
1684+
- [1643.Kth Smallest Instructions](/solution/1600-1699/1643.Kth%20Smallest%20Instructions/README.md)
1685+
- [1646.Get Maximum in Generated Array](/solution/1600-1699/1646.Get%20Maximum%20in%20Generated%20Array/README.md)
1686+
- [1647.Minimum Deletions to Make Character Frequencies Unique](/solution/1600-1699/1647.Minimum%20Deletions%20to%20Make%20Character%20Frequencies%20Unique/README.md)
1687+
- [1648.Sell Diminishing-Valued Colored Balls](/solution/1600-1699/1648.Sell%20Diminishing-Valued%20Colored%20Balls/README.md)
1688+
- [1649.Create Sorted Array through Instructions](/solution/1600-1699/1649.Create%20Sorted%20Array%20through%20Instructions/README.md)
1689+
- [1652.Defuse the Bomb](/solution/1600-1699/1652.Defuse%20the%20Bomb/README.md)
1690+
- [1653.Minimum Deletions to Make String Balanced](/solution/1600-1699/1653.Minimum%20Deletions%20to%20Make%20String%20Balanced/README.md)
1691+
- [1654.Minimum Jumps to Reach Home](/solution/1600-1699/1654.Minimum%20Jumps%20to%20Reach%20Home/README.md)
1692+
- [1655.Distribute Repeating Integers](/solution/1600-1699/1655.Distribute%20Repeating%20Integers/README.md)
1693+
- [1656.Design an Ordered Stream](/solution/1600-1699/1656.Design%20an%20Ordered%20Stream/README.md)
1694+
- [1657.Determine if Two Strings Are Close](/solution/1600-1699/1657.Determine%20if%20Two%20Strings%20Are%20Close/README.md)
1695+
- [1658.Minimum Operations to Reduce X to Zero](/solution/1600-1699/1658.Minimum%20Operations%20to%20Reduce%20X%20to%20Zero/README.md)
1696+
- [1659.Maximize Grid Happiness](/solution/1600-1699/1659.Maximize%20Grid%20Happiness/README.md)
1697+
- [1662.Check If Two String Arrays are Equivalent](/solution/1600-1699/1662.Check%20If%20Two%20String%20Arrays%20are%20Equivalent/README.md)
1698+
- [1663.Smallest String With A Given Numeric Value](/solution/1600-1699/1663.Smallest%20String%20With%20A%20Given%20Numeric%20Value/README.md)
1699+
- [1664.Ways to Make a Fair Array](/solution/1600-1699/1664.Ways%20to%20Make%20a%20Fair%20Array/README.md)
1700+
- [1665.Minimum Initial Energy to Finish Tasks](/solution/1600-1699/1665.Minimum%20Initial%20Energy%20to%20Finish%20Tasks/README.md)
1701+
- [1668.Maximum Repeating Substring](/solution/1600-1699/1668.Maximum%20Repeating%20Substring/README.md)
1702+
- [1669.Merge In Between Linked Lists](/solution/1600-1699/1669.Merge%20In%20Between%20Linked%20Lists/README.md)
1703+
- [1670.Design Front Middle Back Queue](/solution/1600-1699/1670.Design%20Front%20Middle%20Back%20Queue/README.md)
1704+
- [1671.Minimum Number of Removals to Make Mountain Array](/solution/1600-1699/1671.Minimum%20Number%20of%20Removals%20to%20Make%20Mountain%20Array/README.md)
1705+
- [1672.Richest Customer Wealth](/solution/1600-1699/1672.Richest%20Customer%20Wealth/README.md)
1706+
- [1673.Find the Most Competitive Subsequence](/solution/1600-1699/1673.Find%20the%20Most%20Competitive%20Subsequence/README.md)
1707+
- [1674.Minimum Moves to Make Array Complementary](/solution/1600-1699/1674.Minimum%20Moves%20to%20Make%20Array%20Complementary/README.md)
1708+
- [1675.Minimize Deviation in Array](/solution/1600-1699/1675.Minimize%20Deviation%20in%20Array/README.md)
1709+
- [1678.Goal Parser Interpretation](/solution/1600-1699/1678.Goal%20Parser%20Interpretation/README.md)
1710+
- [1679.Max Number of K-Sum Pairs](/solution/1600-1699/1679.Max%20Number%20of%20K-Sum%20Pairs/README.md)
1711+
- [1680.Concatenation of Consecutive Binary Numbers](/solution/1600-1699/1680.Concatenation%20of%20Consecutive%20Binary%20Numbers/README.md)
1712+
- [1681.Minimum Incompatibility](/solution/1600-1699/1681.Minimum%20Incompatibility/README.md)
1713+
- [1684.Count the Number of Consistent Strings](/solution/1600-1699/1684.Count%20the%20Number%20of%20Consistent%20Strings/README.md)
1714+
- [1685.Sum of Absolute Differences in a Sorted Array](/solution/1600-1699/1685.Sum%20of%20Absolute%20Differences%20in%20a%20Sorted%20Array/README.md)
1715+
- [1686.Stone Game VI](/solution/1600-1699/1686.Stone%20Game%20VI/README.md)
1716+
- [1687.Delivering Boxes from Storage to Ports](/solution/1600-1699/1687.Delivering%20Boxes%20from%20Storage%20to%20Ports/README.md)
1717+
- [1688.Count of Matches in Tournament](/solution/1600-1699/1688.Count%20of%20Matches%20in%20Tournament/README.md)
1718+
- [1689.Partitioning Into Minimum Number Of Deci-Binary Numbers](/solution/1600-1699/1689.Partitioning%20Into%20Minimum%20Number%20Of%20Deci-Binary%20Numbers/README.md)
1719+
- [1690.Stone Game VII](/solution/1600-1699/1690.Stone%20Game%20VII/README.md)
1720+
- [1691.Maximum Height by Stacking Cuboids](/solution/1600-1699/1691.Maximum%20Height%20by%20Stacking%20Cuboids/README.md)
1721+
- [1694.Reformat Phone Number](/solution/1600-1699/1694.Reformat%20Phone%20Number/README.md)
1722+
- [1695.Maximum Erasure Value](/solution/1600-1699/1695.Maximum%20Erasure%20Value/README.md)
1723+
- [1696.Jump Game VI](/solution/1600-1699/1696.Jump%20Game%20VI/README.md)
1724+
- [1697.Checking Existence of Edge Length Limited Paths](/solution/1600-1699/1697.Checking%20Existence%20of%20Edge%20Length%20Limited%20Paths/README.md)
1725+
1726+
- 1700-1799
1727+
1728+
- [1700.Number of Students Unable to Eat Lunch](/solution/1700-1799/1700.Number%20of%20Students%20Unable%20to%20Eat%20Lunch/README.md)
1729+
- [1701.Average Waiting Time](/solution/1700-1799/1701.Average%20Waiting%20Time/README.md)
1730+
- [1702.Maximum Binary String After Change](/solution/1700-1799/1702.Maximum%20Binary%20String%20After%20Change/README.md)
1731+
- [1703.Minimum Adjacent Swaps for K Consecutive Ones](/solution/1700-1799/1703.Minimum%20Adjacent%20Swaps%20for%20K%20Consecutive%20Ones/README.md)
1732+
- [1704.Determine if String Halves Are Alike](/solution/1700-1799/1704.Determine%20if%20String%20Halves%20Are%20Alike/README.md)
1733+
- [1705.Maximum Number of Eaten Apples](/solution/1700-1799/1705.Maximum%20Number%20of%20Eaten%20Apples/README.md)
1734+
- [1706.Where Will the Ball Fall](/solution/1700-1799/1706.Where%20Will%20the%20Ball%20Fall/README.md)
1735+
- [1707.Maximum XOR With an Element From Array](/solution/1700-1799/1707.Maximum%20XOR%20With%20an%20Element%20From%20Array/README.md)
1736+
- [1710.Maximum Units on a Truck](/solution/1700-1799/1710.Maximum%20Units%20on%20a%20Truck/README.md)
1737+
- [1711.Count Good Meals](/solution/1700-1799/1711.Count%20Good%20Meals/README.md)
1738+
- [1712.Ways to Split Array Into Three Subarrays](/solution/1700-1799/1712.Ways%20to%20Split%20Array%20Into%20Three%20Subarrays/README.md)
1739+
- [1713.Minimum Operations to Make a Subsequence](/solution/1700-1799/1713.Minimum%20Operations%20to%20Make%20a%20Subsequence/README.md)
1740+
- [1716.Calculate Money in Leetcode Bank](/solution/1700-1799/1716.Calculate%20Money%20in%20Leetcode%20Bank/README.md)
1741+
- [1717.Maximum Score From Removing Substrings](/solution/1700-1799/1717.Maximum%20Score%20From%20Removing%20Substrings/README.md)
1742+
- [1718.Construct the Lexicographically Largest Valid Sequence](/solution/1700-1799/1718.Construct%20the%20Lexicographically%20Largest%20Valid%20Sequence/README.md)
1743+
- [1719.Number Of Ways To Reconstruct A Tree](/solution/1700-1799/1719.Number%20Of%20Ways%20To%20Reconstruct%20A%20Tree/README.md)
1744+
- [1720.Decode XORed Array](/solution/1700-1799/1720.Decode%20XORed%20Array/README.md)
1745+
- [1721.Swapping Nodes in a Linked List](/solution/1700-1799/1721.Swapping%20Nodes%20in%20a%20Linked%20List/README.md)
1746+
- [1722.Minimize Hamming Distance After Swap Operations](/solution/1700-1799/1722.Minimize%20Hamming%20Distance%20After%20Swap%20Operations/README.md)
1747+
- [1723.Find Minimum Time to Finish All Jobs](/solution/1700-1799/1723.Find%20Minimum%20Time%20to%20Finish%20All%20Jobs/README.md)
1748+
- [1725.Number Of Rectangles That Can Form The Largest Square](/solution/1700-1799/1725.Number%20Of%20Rectangles%20That%20Can%20Form%20The%20Largest%20Square/README.md)
1749+
- [1726.Tuple with Same Product](/solution/1700-1799/1726.Tuple%20with%20Same%20Product/README.md)
1750+
- [1727.Largest Submatrix With Rearrangements](/solution/1700-1799/1727.Largest%20Submatrix%20With%20Rearrangements/README.md)
1751+
- [1728.Cat and Mouse II](/solution/1700-1799/1728.Cat%20and%20Mouse%20II/README.md)
1752+
- [1732.Find the Highest Altitude](/solution/1700-1799/1732.Find%20the%20Highest%20Altitude/README.md)
1753+
- [1733.Minimum Number of People to Teach](/solution/1700-1799/1733.Minimum%20Number%20of%20People%20to%20Teach/README.md)
1754+
- [1734.Decode XORed Permutation](/solution/1700-1799/1734.Decode%20XORed%20Permutation/README.md)
1755+
- [1735.Count Ways to Make Array With Product](/solution/1700-1799/1735.Count%20Ways%20to%20Make%20Array%20With%20Product/README.md)
1756+
- [1736.Latest Time by Replacing Hidden Digits](/solution/1700-1799/1736.Latest%20Time%20by%20Replacing%20Hidden%20Digits/README.md)
1757+
- [1737.Change Minimum Characters to Satisfy One of Three Conditions](/solution/1700-1799/1737.Change%20Minimum%20Characters%20to%20Satisfy%20One%20of%20Three%20Conditions/README.md)
1758+
- [1738.Find Kth Largest XOR Coordinate Value](/solution/1700-1799/1738.Find%20Kth%20Largest%20XOR%20Coordinate%20Value/README.md)
1759+
- [1739.Building Boxes](/solution/1700-1799/1739.Building%20Boxes/README.md)
1760+
- [1742.Maximum Number of Balls in a Box](/solution/1700-1799/1742.Maximum%20Number%20of%20Balls%20in%20a%20Box/README.md)
1761+
- [1743.Restore the Array From Adjacent Pairs](/solution/1700-1799/1743.Restore%20the%20Array%20From%20Adjacent%20Pairs/README.md)
1762+
- [1744.Can You Eat Your Favorite Candy on Your Favorite Day](/solution/1700-1799/1744.Can%20You%20Eat%20Your%20Favorite%20Candy%20on%20Your%20Favorite%20Day/README.md)
1763+
- [1745.Palindrome Partitioning IV](/solution/1700-1799/1745.Palindrome%20Partitioning%20IV/README.md)
1764+
- [1748.Sum of Unique Elements](/solution/1700-1799/1748.Sum%20of%20Unique%20Elements/README.md)
1765+
- [1749.Maximum Absolute Sum of Any Subarray](/solution/1700-1799/1749.Maximum%20Absolute%20Sum%20of%20Any%20Subarray/README.md)
1766+
- [1750.Minimum Length of String After Deleting Similar Ends](/solution/1700-1799/1750.Minimum%20Length%20of%20String%20After%20Deleting%20Similar%20Ends/README.md)
1767+
- [1751.Maximum Number of Events That Can Be Attended II](/solution/1700-1799/1751.Maximum%20Number%20of%20Events%20That%20Can%20Be%20Attended%20II/README.md)
1768+
- [1752.Check if Array Is Sorted and Rotated](/solution/1700-1799/1752.Check%20if%20Array%20Is%20Sorted%20and%20Rotated/README.md)
1769+
- [1753.Maximum Score From Removing Stones](/solution/1700-1799/1753.Maximum%20Score%20From%20Removing%20Stones/README.md)
1770+
- [1754.Largest Merge Of Two Strings](/solution/1700-1799/1754.Largest%20Merge%20Of%20Two%20Strings/README.md)
1771+
- [1755.Closest Subsequence Sum](/solution/1700-1799/1755.Closest%20Subsequence%20Sum/README.md)
1772+
- [1758.Minimum Changes To Make Alternating Binary String](/solution/1700-1799/1758.Minimum%20Changes%20To%20Make%20Alternating%20Binary%20String/README.md)
1773+
- [1759.Count Number of Homogenous Substrings](/solution/1700-1799/1759.Count%20Number%20of%20Homogenous%20Substrings/README.md)
1774+
- [1760.Minimum Limit of Balls in a Bag](/solution/1700-1799/1760.Minimum%20Limit%20of%20Balls%20in%20a%20Bag/README.md)
1775+
- [1761.Minimum Degree of a Connected Trio in a Graph](/solution/1700-1799/1761.Minimum%20Degree%20of%20a%20Connected%20Trio%20in%20a%20Graph/README.md)
1776+
16491777
- 5000-5099
16501778

16511779
- [5075.Number of Submatrices That Sum to Target](/solution/5000-5099/5075.Number%20of%20Submatrices%20That%20Sum%20to%20Target/README.md)

‎solution/summary.py

+2-2
Original file line numberDiff line numberDiff line change
@@ -3,7 +3,7 @@
33

44
for file in os.listdir("./"):
55
if os.path.isdir("./" + file) and file != '__pycache__':
6-
print("\n* " + file + "\n")
6+
print("\n- " + file + "\n")
77
for sub in os.listdir("./" + file):
88
enc = quote(sub)
9-
print(f'\t* [{sub}](/solution/{file}/{enc}/README.md)')
9+
print(f'\t- [{sub}](/solution/{file}/{enc}/README.md)')

0 commit comments

Comments
 (0)