Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit c461e7b

Browse files
feat: update lc problems (doocs#4002)
1 parent a1122bc commit c461e7b

File tree

49 files changed

+176
-87
lines changed

Some content is hidden

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

49 files changed

+176
-87
lines changed

‎solution/0200-0299/0238.Product of Array Except Self/README.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -46,7 +46,7 @@ tags:
4646
<ul>
4747
<li><code>2 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
4848
<li><code>-30 &lt;= nums[i] &lt;= 30</code></li>
49-
<li><strong>保证</strong> 数组&nbsp;<code>nums</code>之中任意元素的全部前缀元素和后缀的乘积都在&nbsp; <strong>32 位</strong> 整数范围内</li>
49+
<li>输入&nbsp;<strong>保证</strong> 数组&nbsp;<code>answer[i]</code>&nbsp;在&nbsp; <strong>32 位</strong> 整数范围内</li>
5050
</ul>
5151

5252
<p>&nbsp;</p>

‎solution/0500-0599/0554.Brick Wall/README.md‎

Lines changed: 8 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -23,10 +23,10 @@ tags:
2323

2424
<p>给你一个二维数组 <code>wall</code> ,该数组包含这堵墙的相关信息。其中,<code>wall[i]</code> 是一个代表从左至右每块砖的宽度的数组。你需要找出怎样画才能使这条线 <strong>穿过的砖块数量最少</strong> ,并且返回 <strong>穿过的砖块数量</strong> 。</p>
2525

26-
<p></p>
26+
<p>&nbsp;</p>
2727

2828
<p><strong>示例 1:</strong></p>
29-
<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0500-0599/0554.Brick%20Wall/images/cutwall-grid.jpg" style="width: 493px; height: 577px;" />
29+
<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0500-0599/0554.Brick%20Wall/images/a.png" style="width: 400px; height: 384px;" />
3030
<pre>
3131
<strong>输入:</strong>wall = [[1,2,2,1],[3,1,2],[1,3,2],[2,4],[3,1,2],[1,3,1,1]]
3232
<strong>输出:</strong>2
@@ -39,15 +39,17 @@ tags:
3939
<strong>输出:</strong>3
4040
</pre>
4141

42+
&nbsp;
43+
4244
<p><strong>提示:</strong></p>
4345

4446
<ul>
4547
<li><code>n == wall.length</code></li>
46-
<li><code>1 <= n <= 10<sup>4</sup></code></li>
47-
<li><code>1 <= wall[i].length <= 10<sup>4</sup></code></li>
48-
<li><code>1 <= sum(wall[i].length) <= 2 * 10<sup>4</sup></code></li>
48+
<li><code>1 &lt;= n &lt;= 10<sup>4</sup></code></li>
49+
<li><code>1 &lt;= wall[i].length &lt;= 10<sup>4</sup></code></li>
50+
<li><code>1 &lt;= sum(wall[i].length) &lt;= 2 * 10<sup>4</sup></code></li>
4951
<li>对于每一行 <code>i</code> ,<code>sum(wall[i])</code> 是相同的</li>
50-
<li><code>1 <= wall[i][j] <= 2<sup>31</sup> - 1</code></li>
52+
<li><code>1 &lt;= wall[i][j] &lt;= 2<sup>31</sup> - 1</code></li>
5153
</ul>
5254

5355
<!-- description:end -->

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

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -4,6 +4,7 @@ difficulty: 困难
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/0900-0999/0906.Super%20Palindromes/README.md
55
tags:
66
- 数学
7+
- 字符串
78
- 枚举
89
---
910

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

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -4,6 +4,7 @@ difficulty: Hard
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/0900-0999/0906.Super%20Palindromes/README_EN.md
55
tags:
66
- Math
7+
- String
78
- Enumeration
89
---
910

‎solution/1000-1099/1023.Camelcase Matching/README.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -24,7 +24,7 @@ tags:
2424

2525
<p>给你一个字符串数组 <code>queries</code>,和一个表示模式的字符串&nbsp;<code>pattern</code>,请你返回一个布尔数组 <code>answer</code> 。只有在待查项&nbsp;<code>queries[i]</code> 与模式串&nbsp;<code>pattern</code> 匹配时,&nbsp;<code>answer[i]</code>&nbsp;才为 <code>true</code>,否则为 <code>false</code>。</p>
2626

27-
<p>如果可以将<strong>小写字母</strong>插入模式串&nbsp;<code>pattern</code>&nbsp;得到待查询项&nbsp;<code>queries[i]</code>,那么待查询项与给定模式串匹配。可以在任何位置插入每个字符,也可以不插入字符。</p>
27+
<p>如果可以将&nbsp;<strong>小写字母&nbsp;</strong>插入模式串&nbsp;<code>pattern</code>&nbsp;得到待查询项&nbsp;<code>queries[i]</code>,那么待查询项与给定模式串匹配。您可以在模式串中的任何位置插入字符,也可以选择不插入任何字符。</p>
2828

2929
<p>&nbsp;</p>
3030

‎solution/1000-1099/1023.Camelcase Matching/README_EN.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -24,7 +24,7 @@ tags:
2424

2525
<p>Given an array of strings <code>queries</code> and a string <code>pattern</code>, return a boolean array <code>answer</code> where <code>answer[i]</code> is <code>true</code> if <code>queries[i]</code> matches <code>pattern</code>, and <code>false</code> otherwise.</p>
2626

27-
<p>A query word <code>queries[i]</code> matches <code>pattern</code> if you can insert lowercase English letters pattern so that it equals the query. You may insert each character at any position and you may not insert any characters.</p>
27+
<p>A query word <code>queries[i]</code> matches <code>pattern</code> if you can insert lowercase English letters into the pattern so that it equals the query. You may insert a character at any position in pattern or you may choose not to insert any characters <strong>at all</strong>.</p>
2828

2929
<p>&nbsp;</p>
3030
<p><strong class="example">Example 1:</strong></p>

‎solution/1100-1199/1183.Maximum Number of Ones/README.md‎

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -6,6 +6,8 @@ rating: 2366
66
source: 第 8 场双周赛 Q4
77
tags:
88
- 贪心
9+
- 数学
10+
- 排序
911
- 堆(优先队列)
1012
---
1113

‎solution/1100-1199/1183.Maximum Number of Ones/README_EN.md‎

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -6,6 +6,8 @@ rating: 2366
66
source: Biweekly Contest 8 Q4
77
tags:
88
- Greedy
9+
- Math
10+
- Sorting
911
- Heap (Priority Queue)
1012
---
1113

‎solution/1400-1499/1400.Construct K Palindrome Strings/README.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -21,7 +21,7 @@ tags:
2121

2222
<!-- description:start -->
2323

24-
<p>给你一个字符串 <code>s</code>&nbsp;和一个整数 <code>k</code>&nbsp;。请你用 <code>s</code>&nbsp;字符串中 <strong>所有字符</strong>&nbsp;构造 <code>k</code>&nbsp;个非空 <span data-keyword="palindrome-string">回文串</span>&nbsp;。</p>
24+
<p>给你一个字符串 <code>s</code>&nbsp;和一个整数 <code>k</code>&nbsp;。请你用 <code>s</code>&nbsp;字符串中 <strong>所有字符</strong>&nbsp;构造 <code>k</code>&nbsp;个<strong>非空</strong> <span data-keyword="palindrome-string">回文串</span>&nbsp;。</p>
2525

2626
<p>如果你可以用&nbsp;<code>s</code>&nbsp;中所有字符构造&nbsp;<code>k</code>&nbsp;个回文字符串,那么请你返回 <strong>True</strong>&nbsp;,否则返回&nbsp;<strong>False</strong>&nbsp;。</p>
2727

‎solution/1400-1499/1444.Number of Ways of Cutting a Pizza/README.md‎

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -9,6 +9,7 @@ tags:
99
- 数组
1010
- 动态规划
1111
- 矩阵
12+
- 前缀和
1213
---
1314

1415
<!-- problem:start -->

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /