Skip to content

Commit 85e5913

Browse files
authored
chore: update lc problem: No.0258, No.0259, No.0261 (#1400)
1 parent c67ee12 commit 85e5913

File tree

4 files changed

+10
-7
lines changed

4 files changed

+10
-7
lines changed

solution/0200-0299/0258.Add Digits/README.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -13,12 +13,12 @@
1313
<p><strong>示例 1:</strong></p>
1414

1515
<pre>
16-
<strong>输入:</strong> num =<strong> </strong><code>38</code>
16+
<strong>输入:</strong> num =<strong> </strong>38
1717
<strong>输出:</strong> 2
1818
<strong>解释: </strong>各位相加的过程为<strong>:
1919
</strong>38 --&gt; 3 + 8 --&gt; 11
2020
11 --&gt; 1 + 1 --&gt; 2
21-
由于&nbsp;<code>2</code> 是一位数,所以返回 2。
21+
由于&nbsp;2 是一位数,所以返回 2。
2222
</pre>
2323

2424
<p><strong>示例 2:</strong></p>

solution/0200-0299/0259.3Sum Smaller/README.md

+3-3
Original file line numberDiff line numberDiff line change
@@ -13,7 +13,7 @@
1313
<p><strong>示例 1:</strong></p>
1414

1515
<pre>
16-
<strong>输入: </strong><em>nums</em> = <code>[-2,0,1,3]</code>, <em>target</em> = 2
16+
<strong>输入: </strong><em>nums</em> = [-2,0,1,3], <em>target</em> = 2
1717
<strong>输出: </strong>2
1818
<strong>解释: </strong>因为一共有两个三元组满足累加和小于 2:
1919
&nbsp; [-2,0,1]
@@ -23,13 +23,13 @@
2323
<p><strong>示例 2:</strong></p>
2424

2525
<pre>
26-
<strong>输入: </strong><em>nums</em> = <code>[]</code>, <em>target</em> = 0
26+
<strong>输入: </strong><em>nums</em> = [], <em>target</em> = 0
2727
<strong>输出: </strong>0 </pre>
2828

2929
<p><strong>示例 3:</strong></p>
3030

3131
<pre>
32-
<strong>输入: </strong><em>nums</em> = <code>[0]</code>, <em>target</em> = 0
32+
<strong>输入: </strong><em>nums</em> = [0], <em>target</em> = 0
3333
<strong>输出: </strong>0 </pre>
3434

3535
<p>&nbsp;</p>

solution/0200-0299/0261.Graph Valid Tree/README.md

+2-2
Original file line numberDiff line numberDiff line change
@@ -17,15 +17,15 @@
1717
<p><img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0200-0299/0261.Graph%20Valid%20Tree/images/tree1-graph.jpg" /></p>
1818

1919
<pre>
20-
<strong>输入:</strong> <code>n = 5</code>, edges<code> = [[0,1],[0,2],[0,3],[1,4]]</code>
20+
<strong>输入:</strong> n = 5, edges = [[0,1],[0,2],[0,3],[1,4]]
2121
<strong>输出:</strong> true</pre>
2222

2323
<p><strong>示例 2:</strong></p>
2424

2525
<p><img src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/0200-0299/0261.Graph%20Valid%20Tree/images/tree2-graph.jpg" /></p>
2626

2727
<pre>
28-
<strong>输入:</strong> <code>n = 5, </code>edges<code> = [[0,1],[1,2],[2,3],[1,3],[1,4]]</code>
28+
<strong>输入:</strong> n = 5, edges = [[0,1],[1,2],[2,3],[1,3],[1,4]]
2929
<strong>输出:</strong> false</pre>
3030

3131
<p>&nbsp;</p>

solution/config.py

+3
Original file line numberDiff line numberDiff line change
@@ -9,6 +9,9 @@
99
40,
1010
115,
1111
128,
12+
258,
13+
259,
14+
261,
1215
279,
1316
280,
1417
281,

0 commit comments

Comments
 (0)