Skip to content

Commit 4e1dbcc

Browse files
yanglbmeyanglbme
committed
feat: update lc problems
1 parent 0544a35 commit 4e1dbcc

File tree

87 files changed

+271
-60
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

87 files changed

+271
-60
lines changed

‎solution/0000-0099/0047.Permutations II/README.md

+1
Original file line numberDiff line numberDiff line change
@@ -5,6 +5,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/0000-0099/0047.Pe
55
tags:
66
- 数组
77
- 回溯
8+
- 排序
89
---
910

1011
<!-- problem:start -->

‎solution/0000-0099/0047.Permutations II/README_EN.md

+1
Original file line numberDiff line numberDiff line change
@@ -5,6 +5,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/0000-0099/0047.Pe
55
tags:
66
- Array
77
- Backtracking
8+
- Sorting
89
---
910

1011
<!-- problem:start -->

‎solution/0600-0699/0691.Stickers to Spell Word/README.md

+2
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,9 @@ difficulty: 困难
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/0600-0699/0691.Stickers%20to%20Spell%20Word/README.md
55
tags:
66
- 位运算
7+
- 记忆化搜索
78
- 数组
9+
- 哈希表
810
- 字符串
911
- 动态规划
1012
- 回溯

‎solution/0600-0699/0691.Stickers to Spell Word/README_EN.md

+2
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,9 @@ difficulty: Hard
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/0600-0699/0691.Stickers%20to%20Spell%20Word/README_EN.md
55
tags:
66
- Bit Manipulation
7+
- Memoization
78
- Array
9+
- Hash Table
810
- String
911
- Dynamic Programming
1012
- Backtracking

‎solution/0900-0999/0906.Super Palindromes/README.md

+24-17
Original file line numberDiff line numberDiff line change
@@ -18,33 +18,40 @@ tags:
1818

1919
<!-- description:start -->
2020

21-
<p>如果一个正整数自身是回文数，而且它也是一个回文数的平方，那么我们称这个数为超级回文数。</p>
21+
<p>如果一个正整数自身是回文数，而且它也是一个回文数的平方，那么我们称这个数为 <strong>超级回文数</strong> 。</p>
2222

23-
<p>现在，给定两个正整数&nbsp;<code>L</code> 和&nbsp;<code>R</code> （以字符串形式表示），返回包含在范围 <code>[L, R]</code> 中的超级回文数的数目。</p>
23+
<p>现在，给你两个以字符串形式表示的正整数 <font color="#c7254e" face="Menlo, Monaco, Consolas, Courier New, monospace"><span style="caret-color: rgb(199, 37, 78); font-size: 12.6px; background-color: rgb(249, 242, 244);">left</span></font>&nbsp;和 <font color="#c7254e" face="Menlo, Monaco, Consolas, Courier New, monospace"><span style="caret-color: rgb(199, 37, 78); font-size: 12.6px; background-color: rgb(249, 242, 244);">right</span></font>&nbsp; ，统计并返回区间&nbsp;<code>[left, right]</code> 中的 <strong>超级回文数</strong> 的数目。</p>
2424

2525
<p>&nbsp;</p>
2626

27-
<p><strong>示例：</strong></p>
27+
<p><b>示例 1：</b></p>
2828

29-
<pre><strong>输入：</strong>L = &quot;4&quot;, R = &quot;1000&quot;
30-
<strong>输出：</strong>4
31-
<strong>解释：
32-
</strong>4，9，121，以及 484 是超级回文数。
33-
注意 676 不是一个超级回文数： 26 * 26 = 676，但是 26 不是回文数。</pre>
29+
<pre>
30+
<b>输入：</b>left = "4", right = "1000"
31+
<b>输出：</b>4
32+
<b>解释：</b>4、9、121 和 484 都是超级回文数。
33+
注意 676 不是超级回文数：26 * 26 = 676 ，但是 26 不是回文数。
34+
</pre>
3435

35-
<p>&nbsp;</p>
36-
37-
<p><strong>提示：</strong></p>
36+
<p><b>示例 2：</b></p>
3837

39-
<ol>
40-
<li><code>1 &lt;= len(L) &lt;= 18</code></li>
41-
<li><code>1 &lt;= len(R) &lt;= 18</code></li>
42-
<li><code>L</code> 和&nbsp;<code>R</code>&nbsp;是表示&nbsp;<code>[1, 10^18)</code>&nbsp;范围的整数的字符串。</li>
43-
<li><code>int(L) &lt;= int(R)</code></li>
44-
</ol>
38+
<pre>
39+
<b>输入：</b>left = "1", right = "2"
40+
<b>输出：</b>1
41+
</pre>
4542

4643
<p>&nbsp;</p>
4744

45+
<p><b>提示：</b></p>
46+
47+
<ul>
48+
<li><code>1 &lt;= left.length, right.length &lt;= 18</code></li>
49+
<li><code>left</code>&nbsp;和&nbsp;<code>right</code>&nbsp;仅由数字（0 - 9）组成。</li>
50+
<li><code>left</code>&nbsp;和&nbsp;<code>right</code>&nbsp;不含前导零。</li>
51+
<li><code>left</code>&nbsp;和&nbsp;<code>right</code>&nbsp;表示的整数在区间&nbsp;<code>[1, 10<sup>18</sup> - 1]</code> 内。</li>
52+
<li><code>left</code>&nbsp;小于等于&nbsp;<code>right</code>&nbsp;。</li>
53+
</ul>
54+
4855
<!-- description:end -->
4956

5057
## 解法

‎solution/1700-1799/1752.Check if Array Is Sorted and Rotated/README_EN.md

+19-1
Original file line numberDiff line numberDiff line change
@@ -31,7 +31,7 @@ tags:
3131
<strong>Input:</strong> nums = [3,4,5,1,2]
3232
<strong>Output:</strong> true
3333
<strong>Explanation:</strong> [1,2,3,4,5] is the original sorted array.
34-
You can rotate the array by x = 3 positions to begin on the the element of value 3: [3,4,5,1,2].
34+
You can rotate the array by x = 3 positions to begin on the element of value 3: [3,4,5,1,2].
3535
</pre>
3636

3737
<p><strong class="example">Example 2:</strong></p>
@@ -51,6 +51,24 @@ You can rotate the array by x = 3 positions to begin on the the element of value
5151
You can rotate the array by x = 0 positions (i.e. no rotation) to make nums.
5252
</pre>
5353

54+
<div class="simple-translate-system-theme" id="simple-translate">
55+
<div>
56+
<div class="simple-translate-button " style="background-image: url(&quot;moz-extension://8a9ffb6b-7e69-4e93-aae1-436a1448eff6/icons/512.png&quot;); height: 22px; width: 22px; top: 10px; left: 10px;">&nbsp;</div>
57+
58+
<div class="simple-translate-panel " style="width: 300px; height: 200px; top: 0px; left: 0px; font-size: 13px;">
59+
<div class="simple-translate-result-wrapper" style="overflow: hidden;">
60+
<div class="simple-translate-move" draggable="true">&nbsp;</div>
61+
62+
<div class="simple-translate-result-contents">
63+
<p class="simple-translate-result" dir="auto">&nbsp;</p>
64+
65+
<p class="simple-translate-candidate" dir="auto">&nbsp;</p>
66+
</div>
67+
</div>
68+
</div>
69+
</div>
70+
</div>
71+
5472
<p>&nbsp;</p>
5573
<p><strong>Constraints:</strong></p>
5674

‎solution/1900-1999/1911.Maximum Alternating Subsequence Sum/README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -11,7 +11,7 @@ tags:
1111

1212
<!-- problem:start -->
1313

14-
# [1911. 最大子序列交替和](https://leetcode.cn/problems/maximum-alternating-subsequence-sum)
14+
# [1911. 最大交替子序列和](https://leetcode.cn/problems/maximum-alternating-subsequence-sum)
1515

1616
[English Version](/solution/1900-1999/1911.Maximum%20Alternating%20Subsequence%20Sum/README_EN.md)
1717

‎solution/2300-2399/2360.Longest Cycle in a Graph/README.md

+1
Original file line numberDiff line numberDiff line change
@@ -6,6 +6,7 @@ rating: 1897
66
source: 第 304 场周赛 Q4
77
tags:
88
- 深度优先搜索
9+
- 广度优先搜索
910
- 图
1011
- 拓扑排序
1112
---

‎solution/2300-2399/2360.Longest Cycle in a Graph/README_EN.md

+1
Original file line numberDiff line numberDiff line change
@@ -6,6 +6,7 @@ rating: 1897
66
source: Weekly Contest 304 Q4
77
tags:
88
- Depth-First Search
9+
- Breadth-First Search
910
- Graph
1011
- Topological Sort
1112
---

‎solution/2400-2499/2493.Divide Nodes Into the Maximum Number of Groups/README.md

+1
Original file line numberDiff line numberDiff line change
@@ -5,6 +5,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/2400-2499/2493.Di
55
rating: 2415
66
source: 第 322 场周赛 Q4
77
tags:
8+
- 深度优先搜索
89
- 广度优先搜索
910
- 并查集
1011
- 图

‎solution/2400-2499/2493.Divide Nodes Into the Maximum Number of Groups/README_EN.md

+1
Original file line numberDiff line numberDiff line change
@@ -5,6 +5,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/2400-2499/2493.Di
55
rating: 2415
66
source: Weekly Contest 322 Q4
77
tags:
8+
- Depth-First Search
89
- Breadth-First Search
910
- Union Find
1011
- Graph

‎solution/2600-2699/2607.Make K-Subarray Sums Equal/README.md

+1
Original file line numberDiff line numberDiff line change
@@ -5,6 +5,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/2600-2699/2607.Ma
55
rating: 2071
66
source: 第 101 场双周赛 Q3
77
tags:
8+
- 贪心
89
- 数组
910
- 数学
1011
- 数论

‎solution/2600-2699/2607.Make K-Subarray Sums Equal/README_EN.md

+1
Original file line numberDiff line numberDiff line change
@@ -5,6 +5,7 @@ edit_url: https://github.com/doocs/leetcode/edit/main/solution/2600-2699/2607.Ma
55
rating: 2071
66
source: Biweekly Contest 101 Q3
77
tags:
8+
- Greedy
89
- Array
910
- Math
1011
- Number Theory

‎solution/3400-3499/3402.Minimum Operations to Make Columns Strictly Increasing/README.md

+2
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: 简单
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3402.Minimum%20Operations%20to%20Make%20Columns%20Strictly%20Increasing/README.md
5+
rating: 1245
6+
source: 第 430 场周赛 Q1
57
tags:
68
- 贪心
79
- 数组

‎solution/3400-3499/3402.Minimum Operations to Make Columns Strictly Increasing/README_EN.md

+2
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: Easy
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3402.Minimum%20Operations%20to%20Make%20Columns%20Strictly%20Increasing/README_EN.md
5+
rating: 1245
6+
source: Weekly Contest 430 Q1
57
tags:
68
- Greedy
79
- Array

‎solution/3400-3499/3403.Find the Lexicographically Largest String From the Box I/README.md

+2
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: 中等
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3403.Find%20the%20Lexicographically%20Largest%20String%20From%20the%20Box%20I/README.md
5+
rating: 1761
6+
source: 第 430 场周赛 Q2
57
tags:
68
- 双指针
79
- 字符串

‎solution/3400-3499/3403.Find the Lexicographically Largest String From the Box I/README_EN.md

+2
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: Medium
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3403.Find%20the%20Lexicographically%20Largest%20String%20From%20the%20Box%20I/README_EN.md
5+
rating: 1761
6+
source: Weekly Contest 430 Q2
57
tags:
68
- Two Pointers
79
- String

‎solution/3400-3499/3404.Count Special Subsequences/README.md

+2
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: 中等
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3404.Count%20Special%20Subsequences/README.md
5+
rating: 2445
6+
source: 第 430 场周赛 Q3
57
tags:
68
- 数组
79
- 哈希表

‎solution/3400-3499/3404.Count Special Subsequences/README_EN.md

+2
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: Medium
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3404.Count%20Special%20Subsequences/README_EN.md
5+
rating: 2445
6+
source: Weekly Contest 430 Q3
57
tags:
68
- Array
79
- Hash Table

‎solution/3400-3499/3405.Count the Number of Arrays with K Matching Adjacent Elements/README.md

+2
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: 困难
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3405.Count%20the%20Number%20of%20Arrays%20with%20K%20Matching%20Adjacent%20Elements/README.md
5+
rating: 2309
6+
source: 第 430 场周赛 Q4
57
tags:
68
- 数学
79
- 组合数学

‎solution/3400-3499/3405.Count the Number of Arrays with K Matching Adjacent Elements/README_EN.md

+2
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: Hard
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3405.Count%20the%20Number%20of%20Arrays%20with%20K%20Matching%20Adjacent%20Elements/README_EN.md
5+
rating: 2309
6+
source: Weekly Contest 430 Q4
57
tags:
68
- Math
79
- Combinatorics

‎solution/3400-3499/3407.Substring Matching Pattern/README.md

+2
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: 简单
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3407.Substring%20Matching%20Pattern/README.md
5+
rating: 1472
6+
source: 第 147 场双周赛 Q1
57
tags:
68
- 字符串
79
- 字符串匹配

‎solution/3400-3499/3407.Substring Matching Pattern/README_EN.md

+2
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: Easy
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3407.Substring%20Matching%20Pattern/README_EN.md
5+
rating: 1472
6+
source: Biweekly Contest 147 Q1
57
tags:
68
- String
79
- String Matching

‎solution/3400-3499/3408.Design Task Manager/README.md

+2
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: 中等
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3408.Design%20Task%20Manager/README.md
5+
rating: 1806
6+
source: 第 147 场双周赛 Q2
57
tags:
68
- 设计
79
- 哈希表

‎solution/3400-3499/3408.Design Task Manager/README_EN.md

+2
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: Medium
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3408.Design%20Task%20Manager/README_EN.md
5+
rating: 1806
6+
source: Biweekly Contest 147 Q2
57
tags:
68
- Design
79
- Hash Table

‎solution/3400-3499/3409.Longest Subsequence With Decreasing Adjacent Difference/README.md

+2
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: 中等
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3409.Longest%20Subsequence%20With%20Decreasing%20Adjacent%20Difference/README.md
5+
rating: 2500
6+
source: 第 147 场双周赛 Q3
57
tags:
68
- 数组
79
- 动态规划

‎solution/3400-3499/3409.Longest Subsequence With Decreasing Adjacent Difference/README_EN.md

+2
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: Medium
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3409.Longest%20Subsequence%20With%20Decreasing%20Adjacent%20Difference/README_EN.md
5+
rating: 2500
6+
source: Biweekly Contest 147 Q3
57
tags:
68
- Array
79
- Dynamic Programming

‎solution/3400-3499/3410.Maximize Subarray Sum After Removing All Occurrences of One Element/README.md

+2
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: 困难
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3410.Maximize%20Subarray%20Sum%20After%20Removing%20All%20Occurrences%20of%20One%20Element/README.md
5+
rating: 2843
6+
source: 第 147 场双周赛 Q4
57
tags:
68
- 线段树
79
- 数组

‎solution/3400-3499/3410.Maximize Subarray Sum After Removing All Occurrences of One Element/README_EN.md

+2
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: Hard
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3410.Maximize%20Subarray%20Sum%20After%20Removing%20All%20Occurrences%20of%20One%20Element/README_EN.md
5+
rating: 2843
6+
source: Biweekly Contest 147 Q4
57
tags:
68
- Segment Tree
79
- Array

‎solution/3400-3499/3411.Maximum Subarray With Equal Products/README.md

+2
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: 简单
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3411.Maximum%20Subarray%20With%20Equal%20Products/README.md
5+
rating: 1443
6+
source: 第 431 场周赛 Q1
57
tags:
68
- 数组
79
- 数学

‎solution/3400-3499/3411.Maximum Subarray With Equal Products/README_EN.md

+2
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: Easy
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3411.Maximum%20Subarray%20With%20Equal%20Products/README_EN.md
5+
rating: 1443
6+
source: Weekly Contest 431 Q1
57
tags:
68
- Array
79
- Math

‎solution/3400-3499/3412.Find Mirror Score of a String/README.md

+2
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: 中等
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3412.Find%20Mirror%20Score%20of%20a%20String/README.md
5+
rating: 1578
6+
source: 第 431 场周赛 Q2
57
tags:
68
- 栈
79
- 哈希表

‎solution/3400-3499/3412.Find Mirror Score of a String/README_EN.md

+2
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: Medium
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3412.Find%20Mirror%20Score%20of%20a%20String/README_EN.md
5+
rating: 1578
6+
source: Weekly Contest 431 Q2
57
tags:
68
- Stack
79
- Hash Table

‎solution/3400-3499/3413.Maximum Coins From K Consecutive Bags/README.md

+2
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: 中等
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3413.Maximum%20Coins%20From%20K%20Consecutive%20Bags/README.md
5+
rating: 2373
6+
source: 第 431 场周赛 Q3
57
tags:
68
- 贪心
79
- 数组

‎solution/3400-3499/3413.Maximum Coins From K Consecutive Bags/README_EN.md

+2
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: Medium
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3413.Maximum%20Coins%20From%20K%20Consecutive%20Bags/README_EN.md
5+
rating: 2373
6+
source: Weekly Contest 431 Q3
57
tags:
68
- Greedy
79
- Array

‎solution/3400-3499/3414.Maximum Score of Non-overlapping Intervals/README.md

+2
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: 困难
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3400-3499/3414.Maximum%20Score%20of%20Non-overlapping%20Intervals/README.md
5+
rating: 2723
6+
source: 第 431 场周赛 Q4
57
tags:
68
- 数组
79
- 二分查找

0 commit comments

Comments
 (0)