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 7d7863a

Browse files
feat: update lc problems (doocs#3561)
1 parent 51350fe commit 7d7863a

File tree

31 files changed

+181
-145
lines changed

31 files changed

+181
-145
lines changed

‎solution/0000-0099/0063.Unique Paths II/README.md‎

Lines changed: 4 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -18,13 +18,13 @@ tags:
1818

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

21-
<p>一个机器人位于一个<metacharset="UTF-8" />&nbsp;<code>m x n</code>&nbsp;网格的左上角 (起始点在下图中标记为 "Start" )。</p>
21+
<p>给定一个&nbsp;<code>m x n</code>&nbsp;的整数数组&nbsp;<code>grid</code>。一个机器人初始位于 <strong>左上角</strong>(即 <code>grid[0][0]</code>)。机器人尝试移动到 <strong>右下角</strong>(即 <code>grid[m - 1][n - 1]</code>)。机器人每次只能向下或者向右移动一步。</p>
2222

23-
<p>机器人每次只能向下或者向右移动一步。机器人试图达到网格的右下角(在下图中标记为 "Finish")。</p>
23+
<p>网格中的障碍物和空位置分别用 <code>1</code> 和 <code>0</code> 来表示。机器人的移动路径中不能包含 <strong>任何</strong>&nbsp;有障碍物的方格。</p>
2424

25-
<p>现在考虑网格中有障碍物。那么从左上角到右下角将会有多少条不同的路径?</p>
25+
<p>返回机器人能够到达右下角的不同路径数量。</p>
2626

27-
<p>网格中的障碍物和空位置分别用 <code>1</code> 和 <code>0</code> 来表示。</p>
27+
<p>测试用例保证答案小于等于 <code>2 * 10<sup>9</sup></code>。</p>
2828

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

‎solution/0100-0199/0191.Number of 1 Bits/README.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -42,7 +42,7 @@ tags:
4242
<pre>
4343
<strong>输入:</strong>n = 2147483645
4444
<strong>输出:</strong>30
45-
<strong>解释:</strong>输入的二进制串 <strong>11111111111111111111111111111101</strong> 中,共有 30 个设置位。</pre>
45+
<strong>解释:</strong>输入的二进制串 <strong>1111111111111111111111111111101</strong> 中,共有 30 个设置位。</pre>
4646

4747
<p>&nbsp;</p>
4848

‎solution/0300-0399/0314.Binary Tree Vertical Order Traversal/README_EN.md‎

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -27,24 +27,24 @@ tags:
2727

2828
<p>&nbsp;</p>
2929
<p><strong class="example">Example 1:</strong></p>
30-
<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0300-0399/0314.Binary%20Tree%20Vertical%20Order%20Traversal/images/vtree1.jpg" style="width: 282px; height: 301px;" />
30+
<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0300-0399/0314.Binary%20Tree%20Vertical%20Order%20Traversal/images/image1.png" style="width: 400px; height: 273px;" />
3131
<pre>
3232
<strong>Input:</strong> root = [3,9,20,null,null,15,7]
3333
<strong>Output:</strong> [[9],[3,15],[20],[7]]
3434
</pre>
3535

3636
<p><strong class="example">Example 2:</strong></p>
37-
<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0300-0399/0314.Binary%20Tree%20Vertical%20Order%20Traversal/images/vtree2-1.jpg" style="width: 462px; height: 222px;" />
37+
<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0300-0399/0314.Binary%20Tree%20Vertical%20Order%20Traversal/images/image3.png" style="width: 450px; height: 285px;" />
3838
<pre>
3939
<strong>Input:</strong> root = [3,9,8,4,0,1,7]
4040
<strong>Output:</strong> [[4],[9],[3,0,1],[8],[7]]
4141
</pre>
4242

4343
<p><strong class="example">Example 3:</strong></p>
44-
<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0300-0399/0314.Binary%20Tree%20Vertical%20Order%20Traversal/images/vtree2.jpg" style="width: 462px; height: 302px;" />
44+
<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0300-0399/0314.Binary%20Tree%20Vertical%20Order%20Traversal/images/image2.png" style="width: 350px; height: 342px;" />
4545
<pre>
46-
<strong>Input:</strong> root = [3,9,8,4,0,1,7,null,null,null,2,5]
47-
<strong>Output:</strong> [[4],[9,5],[3,0,1],[8,2],[7]]
46+
<strong>Input:</strong> root = [1,2,3,4,10,9,11,null,5,null,null,null,null,null,null,null,6]
47+
<strong>Output:</strong> [[4],[2,5],[1,10,9,6],[3],[11]]
4848
</pre>
4949

5050
<p>&nbsp;</p>
212 KB
Loading[フレーム]
348 KB
Loading[フレーム]
250 KB
Loading[フレーム]

‎solution/0400-0499/0428.Serialize and Deserialize N-ary Tree/README.md‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -27,15 +27,15 @@ tags:
2727

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

30-
<p><img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0400-0499/0428.Serialize%20and%20Deserialize%20N-ary%20Tree/images/narytreeexample.png" style="height: 321px; width: 500px;" /></p>
30+
<p><img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0400-0499/0428.Serialize%20and%20Deserialize%20N-ary%20Tree/images/1727093143-BPVnoI-image.png" style="height: 321px; width: 500px;" /></p>
3131

3232
<p>&nbsp;</p>
3333

3434
<p>为&nbsp;<code>[1 [3[5 6] 2 4]]</code>。你不需要以这种形式完成,你可以自己创造和实现不同的方法。</p>
3535

3636
<p>或者,您可以遵循 LeetCode 的层序遍历序列化格式,其中每组孩子节点由空值分隔。</p>
3737

38-
<p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0400-0499/0428.Serialize%20and%20Deserialize%20N-ary%20Tree/images/sample_4_964.png" style="height: 454px; width: 500px;" /></p>
38+
<p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0400-0499/0428.Serialize%20and%20Deserialize%20N-ary%20Tree/images/1727093169-WGFOps-image.png" style="height: 454px; width: 500px;" /></p>
3939

4040
<p>例如,上面的树可以序列化为 <code>[1,null,2,3,4,5,null,null,6,7,null,8,null,9,10,null,null,11,null,12,null,13,null,null,14]</code></p>
4141

15.7 KB
Loading[フレーム]
28.9 KB
Loading[フレーム]

‎solution/0900-0999/0929.Unique Email Addresses/README.md‎

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -67,6 +67,8 @@ tags:
6767
<li>每个 <code>emails[i]</code> 都包含有且仅有一个 <code>'@'</code> 字符</li>
6868
<li>所有本地名和域名都不为空</li>
6969
<li>本地名不会以 <code>'+'</code> 字符作为开头</li>
70+
<li>域名以&nbsp;<code>".com"</code> 后缀结尾。</li>
71+
<li>域名在&nbsp;<code>".com"</code> 后缀前至少包含一个字符</li>
7072
</ul>
7173

7274
<!-- description:end -->

0 commit comments

Comments
(0)

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