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 c34a0d2

Browse files
feat: add weekly contest 448 (#4390)
1 parent 7cfd1f3 commit c34a0d2

File tree

35 files changed

+1484
-78
lines changed

35 files changed

+1484
-78
lines changed

‎solution/0500-0599/0599.Minimum Index Sum of Two Lists/README.md‎

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

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

21-
<p>假设 Andy 和 Doris 想在晚餐时选择一家餐厅,并且他们都有一个表示最喜爱餐厅的列表,每个餐厅的名字用字符串表示。</p>
21+
<p>给定两个字符串数组&nbsp;<code>list1</code> 和 <code>list2</code>,找到 <strong>索引和最小的公共字符串</strong>。</p>
2222

23-
<p>你需要帮助他们用<strong>最少的索引和</strong>找出他们<strong>共同喜爱的餐厅</strong>。 如果答案不止一个,则输出所有答案并且不考虑顺序。 你可以假设答案总是存在。</p>
23+
<p><strong>公共字符串</strong>&nbsp;是同时出现在&nbsp;<code>list1</code> 和 <code>list2</code>&nbsp;中的字符串。</p>
24+
25+
<p>具有 <strong>最小索引和的公共字符串</strong> 是指,如果它在 <code>list1[i]</code> 和 <code>list2[j]</code> 中出现,那么 <code>i + j</code> 应该是所有其他 <strong>公共字符串</strong> 中的最小值。</p>
26+
27+
<p>返回所有 <strong>具有最小索引和的公共字符串</strong>。以 <strong>任何顺序</strong> 返回答案。</p>
2428

2529
<p>&nbsp;</p>
2630

@@ -29,17 +33,28 @@ tags:
2933
<pre>
3034
<strong>输入: </strong>list1 = ["Shogun", "Tapioca Express", "Burger King", "KFC"],list2 = ["Piatti", "The Grill at Torrey Pines", "Hungry Hunter Steakhouse", "Shogun"]
3135
<strong>输出:</strong> ["Shogun"]
32-
<strong>解释:</strong> 他们唯一共同喜爱的餐厅是"Shogun"。
36+
<strong>解释:</strong> 唯一的公共字符串是 "Shogun"。
3337
</pre>
3438

3539
<p><strong>示例 2:</strong></p>
3640

3741
<pre>
3842
<strong>输入:</strong>list1 = ["Shogun", "Tapioca Express", "Burger King", "KFC"],list2 = ["KFC", "Shogun", "Burger King"]
3943
<strong>输出:</strong> ["Shogun"]
40-
<strong>解释:</strong> 他们共同喜爱且具有最小索引和的餐厅是"Shogun",它有最小的索引和1(0+1)。
44+
<strong>解释:</strong> 具有最小索引和的公共字符串是 "Shogun",它有最小的索引和 = (0 + 1) = 1。
4145
</pre>
4246

47+
<p><strong>示例 3:</strong></p>
48+
49+
<pre>
50+
<strong>输入:</strong>list1 = ["happy","sad","good"], list2 = ["sad","happy","good"]
51+
<b>输出:</b>["sad","happy"]
52+
<b>解释:</b>有三个公共字符串:
53+
"happy" 索引和 = (0 + 1) = 1.
54+
"sad" 索引和 = (1 + 0) = 1.
55+
"good" 索引和 = (2 + 2) = 4.
56+
最小索引和的字符串是 "sad" 和 "happy"。</pre>
57+
4358
<p>&nbsp;</p>
4459

4560
<p><strong>提示:</strong></p>

‎solution/0800-0899/0819.Most Common Word/README_EN.md‎

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

2424
<p>The words in <code>paragraph</code> are <strong>case-insensitive</strong> and the answer should be returned in <strong>lowercase</strong>.</p>
2525

26+
<p><strong>Note</strong> that words can not contain punctuation symbols.</p>
27+
2628
<p>&nbsp;</p>
2729
<p><strong class="example">Example 1:</strong></p>
2830

‎solution/0800-0899/0838.Push Dominoes/README.md‎

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -29,9 +29,9 @@ tags:
2929
<p>给你一个字符串 <code>dominoes</code> 表示这一行多米诺骨牌的初始状态,其中:</p>
3030

3131
<ul>
32-
<li><code>dominoes[i] = 'L'</code>,表示第 <code>i</code> 张多米诺骨牌被推向左侧,</li>
33-
<li><code>dominoes[i] = 'R'</code>,表示第 <code>i</code> 张多米诺骨牌被推向右侧,</li>
34-
<li><code>dominoes[i] = '.'</code>,表示没有推动第 <code>i</code> 张多米诺骨牌。</li>
32+
<li><code>dominoes[i] = 'L'</code>,表示第 <code>i</code> 张多米诺骨牌被推向左侧,</li>
33+
<li><code>dominoes[i] = 'R'</code>,表示第 <code>i</code> 张多米诺骨牌被推向右侧,</li>
34+
<li><code>dominoes[i] = '.'</code>,表示没有推动第 <code>i</code> 张多米诺骨牌。</li>
3535
</ul>
3636

3737
<p>返回表示最终状态的字符串。</p>
@@ -57,9 +57,9 @@ tags:
5757
<p><strong>提示:</strong></p>
5858

5959
<ul>
60-
<li><code>n == dominoes.length</code></li>
61-
<li><code>1 &lt;= n &lt;= 10<sup>5</sup></code></li>
62-
<li><code>dominoes[i]</code> 为 <code>'L'</code>、<code>'R'</code> 或 <code>'.'</code></li>
60+
<li><code>n == dominoes.length</code></li>
61+
<li><code>1 &lt;= n &lt;= 10<sup>5</sup></code></li>
62+
<li><code>dominoes[i]</code> 为 <code>'L'</code>、<code>'R'</code> 或 <code>'.'</code></li>
6363
</ul>
6464

6565
<!-- description:end -->

‎solution/0800-0899/0838.Push Dominoes/README_EN.md‎

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -29,9 +29,9 @@ tags:
2929
<p>You are given a string <code>dominoes</code> representing the initial state where:</p>
3030

3131
<ul>
32-
<li><code>dominoes[i] = &#39;L&#39;</code>, if the <code>i<sup>th</sup></code> domino has been pushed to the left,</li>
33-
<li><code>dominoes[i] = &#39;R&#39;</code>, if the <code>i<sup>th</sup></code> domino has been pushed to the right, and</li>
34-
<li><code>dominoes[i] = &#39;.&#39;</code>, if the <code>i<sup>th</sup></code> domino has not been pushed.</li>
32+
<li><code>dominoes[i] = &#39;L&#39;</code>, if the <code>i<sup>th</sup></code> domino has been pushed to the left,</li>
33+
<li><code>dominoes[i] = &#39;R&#39;</code>, if the <code>i<sup>th</sup></code> domino has been pushed to the right, and</li>
34+
<li><code>dominoes[i] = &#39;.&#39;</code>, if the <code>i<sup>th</sup></code> domino has not been pushed.</li>
3535
</ul>
3636

3737
<p>Return <em>a string representing the final state</em>.</p>
@@ -56,9 +56,9 @@ tags:
5656
<p><strong>Constraints:</strong></p>
5757

5858
<ul>
59-
<li><code>n == dominoes.length</code></li>
60-
<li><code>1 &lt;= n &lt;= 10<sup>5</sup></code></li>
61-
<li><code>dominoes[i]</code> is either <code>&#39;L&#39;</code>, <code>&#39;R&#39;</code>, or <code>&#39;.&#39;</code>.</li>
59+
<li><code>n == dominoes.length</code></li>
60+
<li><code>1 &lt;= n &lt;= 10<sup>5</sup></code></li>
61+
<li><code>dominoes[i]</code> is either <code>&#39;L&#39;</code>, <code>&#39;R&#39;</code>, or <code>&#39;.&#39;</code>.</li>
6262
</ul>
6363

6464
<!-- description:end -->

‎solution/1100-1199/1160.Find Words That Can Be Formed by Characters/README_EN.md‎

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

2424
<p>You are given an array of strings <code>words</code> and a string <code>chars</code>.</p>
2525

26-
<p>A string is <strong>good</strong> if it can be formed by characters from <code>chars</code> (each character can only be used once).</p>
26+
<p>A string is <strong>good</strong> if it can be formed by characters from <code>chars</code> (each character can only be used once for <strong>each</strong> word in <code>words</code>).</p>
2727

2828
<p>Return <em>the sum of lengths of all good strings in words</em>.</p>
2929

‎solution/3400-3499/3401.Find Circular Gift Exchange Chains/README.md‎

Lines changed: 24 additions & 23 deletions
Original file line numberDiff line numberDiff line change
@@ -8,15 +8,15 @@ tags:
88

99
<!-- problem:start -->
1010

11-
# [3401. Find Circular Gift Exchange Chains 🔒](https://leetcode.cn/problems/find-circular-gift-exchange-chains)
11+
# [3401. 寻找环形礼物交换链 🔒](https://leetcode.cn/problems/find-circular-gift-exchange-chains)
1212

1313
[English Version](/solution/3400-3499/3401.Find%20Circular%20Gift%20Exchange%20Chains/README_EN.md)
1414

1515
## 题目描述
1616

1717
<!-- description:start -->
1818

19-
<p>Table: <code>SecretSanta</code></p>
19+
<p>表:<code>SecretSanta</code></p>
2020

2121
<pre>
2222
+-------------+------+
@@ -26,31 +26,32 @@ tags:
2626
| receiver_id | int |
2727
| gift_value | int |
2828
+-------------+------+
29-
(giver_id, receiver_id) is the unique key for this table.
30-
Each row represents a record of a gift exchange between two employees, giver_id represents the employee who gives a gift, receiver_id represents the employee who receives the gift and gift_value represents the value of the gift given.
29+
(giver_id, receiver_id) 是这张表的唯一主键。
30+
每一行表示两个员工之间的一次礼物交换记录,giver_id 表示给予礼物的员工,receiver_id 表示收到礼物的员工,gift_value 表示所给予礼物的价值。
3131
</pre>
3232

33-
<p>Write a solution to find the <strong>total gift value</strong> and <strong>length</strong> of<strong> circular chains</strong> of Secret Santa gift exchanges:</p>
33+
<p>编写一个解决方案来找到 <strong>总礼物价值</strong>&nbsp;以及 <strong>环形礼物交换链的长度</strong>:</p>
3434

35-
<p>A <strong>circular chain</strong> is defined as a series of exchanges where:</p>
35+
<p><strong>环形链</strong> 被定义为一系列交换,其中:</p>
3636

3737
<ul>
38-
<li>Each employee gives a gift to <strong>exactly one</strong> other employee.</li>
39-
<li>Each employee receives a gift <strong>from exactly</strong> one other employee.</li>
40-
<li>The exchanges form a continuous <strong>loop</strong> (e.g., employee A gives a gift to B, B gives to C, and C gives back to A).</li>
38+
<li>每位员工都正好向另 <strong>一位</strong> 员工赠送一份礼物。</li>
39+
<li>每位员工都正好从另 <strong>一位</strong> 员工那里收到一份礼物。</li>
40+
<li>交换形成一个连续的循环(即 员工 A 给 B 一份礼物,B 给 C,C 再给 A)。</li>
4141
</ul>
4242

43-
<p>Return <em>the result ordered by the chain length and total gift value of the chain in&nbsp;<strong>descending</strong> order</em>.&nbsp;</p>
43+
<p>返回结果以链的长度和总礼物价值 <strong>降序</strong>&nbsp;排序。</p>
4444

45-
<p>The result format is in the following example.</p>
45+
<p>结果格式如下所示。</p>
4646

4747
<p>&nbsp;</p>
48-
<p><strong class="example">Example:</strong></p>
48+
49+
<p><strong class="example">示例:</strong></p>
4950

5051
<div class="example-block">
51-
<p><strong>Input:</strong></p>
52+
<p><strong>输入:</strong></p>
5253

53-
<p>SecretSanta table:</p>
54+
<p>SecretSanta 表:</p>
5455

5556
<pre class="example-io">
5657
+----------+-------------+------------+
@@ -64,7 +65,7 @@ Each row represents a record of a gift exchange between two employees, giver_id
6465
+----------+-------------+------------+
6566
</pre>
6667

67-
<p><strong>Output:</strong></p>
68+
<p><strong>输出:</strong></p>
6869

6970
<pre class="example-io">
7071
+----------+--------------+------------------+
@@ -75,26 +76,26 @@ Each row represents a record of a gift exchange between two employees, giver_id
7576
+----------+--------------+------------------+
7677
</pre>
7778

78-
<p><strong>Explanation:</strong></p>
79+
<p><strong>解释:</strong></p>
7980

8081
<ul>
81-
<li><strong>Chain 1</strong> involves employees 1, 2, and 3:
82+
<li><strong>链 1</strong>&nbsp;包含员工 1,2 和 3:
8283

8384
<ul>
84-
<li>Employee 1 gives a gift to 2, employee 2 gives a gift to 3, and employee 3 gives a gift to 1.</li>
85-
<li>Total gift value for this chain = 20 +たす 30 +たす 40 =わ 90.</li>
85+
<li>员工 1 给 2 一份礼物,员工&nbsp;2 给 3 一份礼物,员工 3 给 1 一份礼物。</li>
86+
<li>这个链的总礼物价值 = 20 +たす 30 +たす 40 =わ 90。</li>
8687
</ul>
8788
</li>
88-
<li><strong>Chain 2</strong> involves employees 4 and 5:
89+
<li><strong>链 2</strong> 包含员工 4 和 5:
8990
<ul>
90-
<li>Employee 4 gives a gift to 5, and employee 5 gives a gift to 4.</li>
91-
<li>Total gift value for this chain = 25 + 35 = 60.</li>
91+
<li>员工 4 给 5 一份礼物,员工 5 给 4&nbsp;一份礼物。</li>
92+
<li>这个链的总礼物价值 = 25 + 35 = 60。</li>
9293
</ul>
9394
</li>
9495

9596
</ul>
9697

97-
<p>The result table is ordered by the chain length and total gift value of the chain in descending order.</p>
98+
<p>结果表以链的长度和总礼物价值降序排序。</p>
9899
</div>
99100

100101
<!-- description:end -->

‎solution/3500-3599/3528.Unit Conversion I/README.md‎

Lines changed: 14 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -34,8 +34,8 @@ tags:
3434
<p><strong>解释:</strong></p>
3535

3636
<ul>
37-
<li>使用 <code>conversions[0]</code>:将一个 0 类型单位转换为 2 个 1 类型单位。</li>
38-
<li>使用&nbsp;<code>conversions[0]</code>&nbsp;和&nbsp;<code>conversions[1]</code>&nbsp;将一个 0 类型单位转换为 6 个 2 类型单位。</li>
37+
<li>使用 <code>conversions[0]</code>:将一个 0 类型单位转换为 2 个 1 类型单位。</li>
38+
<li>使用&nbsp;<code>conversions[0]</code>&nbsp;和&nbsp;<code>conversions[1]</code>&nbsp;将一个 0 类型单位转换为 6 个 2 类型单位。</li>
3939
</ul>
4040
<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/3500-3599/3528.Unit%20Conversion%20I/images/1745660099-FZhVTM-example1.png" style="width: 545px; height: 119px;" /></div>
4141

@@ -49,13 +49,13 @@ tags:
4949
<p><strong>解释:</strong></p>
5050

5151
<ul>
52-
<li>使用 <code>conversions[0]</code>&nbsp;将一个 0 类型单位转换为 2 个 1 类型单位。</li>
53-
<li>使用 <code>conversions[1]</code>&nbsp;将一个 0 类型单位转换为 3 个 2 类型单位。</li>
54-
<li>使用 <code>conversions[0]</code> 和 <code>conversions[2]</code>&nbsp;将一个 0 类型单位转换为 8 个 3 类型单位。</li>
55-
<li>使用 <code>conversions[0]</code> 和 <code>conversions[3]</code>&nbsp;将一个 0 类型单位转换为 10 个 4 类型单位。</li>
56-
<li>使用 <code>conversions[1]</code> 和 <code>conversions[4]</code>&nbsp;将一个 0 类型单位转换为 6 个 5 类型单位。</li>
57-
<li>使用 <code>conversions[0]</code>、<code>conversions[3]</code> 和 <code>conversions[5]</code>&nbsp;将一个 0 类型单位转换为 30 个 6 类型单位。</li>
58-
<li>使用 <code>conversions[1]</code>、<code>conversions[4]</code> 和 <code>conversions[6]</code>&nbsp;将一个 0 类型单位转换为 24 个 7 类型单位。</li>
52+
<li>使用 <code>conversions[0]</code>&nbsp;将一个 0 类型单位转换为 2 个 1 类型单位。</li>
53+
<li>使用 <code>conversions[1]</code>&nbsp;将一个 0 类型单位转换为 3 个 2 类型单位。</li>
54+
<li>使用 <code>conversions[0]</code> 和 <code>conversions[2]</code>&nbsp;将一个 0 类型单位转换为 8 个 3 类型单位。</li>
55+
<li>使用 <code>conversions[0]</code> 和 <code>conversions[3]</code>&nbsp;将一个 0 类型单位转换为 10 个 4 类型单位。</li>
56+
<li>使用 <code>conversions[1]</code> 和 <code>conversions[4]</code>&nbsp;将一个 0 类型单位转换为 6 个 5 类型单位。</li>
57+
<li>使用 <code>conversions[0]</code>、<code>conversions[3]</code> 和 <code>conversions[5]</code>&nbsp;将一个 0 类型单位转换为 30 个 6 类型单位。</li>
58+
<li>使用 <code>conversions[1]</code>、<code>conversions[4]</code> 和 <code>conversions[6]</code>&nbsp;将一个 0 类型单位转换为 24 个 7 类型单位。</li>
5959
</ul>
6060
</div>
6161

@@ -64,11 +64,11 @@ tags:
6464
<p><strong>提示:</strong></p>
6565

6666
<ul>
67-
<li><code>2 &lt;= n &lt;= 10<sup>5</sup></code></li>
68-
<li><code>conversions.length == n - 1</code></li>
69-
<li><code>0 &lt;= sourceUnit<sub>i</sub>, targetUnit<sub>i</sub> &lt; n</code></li>
70-
<li><code>1 &lt;= conversionFactor<sub>i</sub> &lt;= 10<sup>9</sup></code></li>
71-
<li>保证单位&nbsp;0 可以通过&nbsp;<strong>唯一&nbsp;</strong>的转换路径(不需要反向转换)转换为任何其他单位。</li>
67+
<li><code>2 &lt;= n &lt;= 10<sup>5</sup></code></li>
68+
<li><code>conversions.length == n - 1</code></li>
69+
<li><code>0 &lt;= sourceUnit<sub>i</sub>, targetUnit<sub>i</sub> &lt; n</code></li>
70+
<li><code>1 &lt;= conversionFactor<sub>i</sub> &lt;= 10<sup>9</sup></code></li>
71+
<li>保证单位&nbsp;0 可以通过&nbsp;<strong>唯一&nbsp;</strong>的转换路径(不需要反向转换)转换为任何其他单位。</li>
7272
</ul>
7373

7474
<!-- description:end -->

‎solution/3500-3599/3528.Unit Conversion I/README_EN.md‎

Lines changed: 14 additions & 14 deletions
Original file line numberDiff line numberDiff line change
@@ -33,8 +33,8 @@ tags:
3333
<p><strong>Explanation:</strong></p>
3434

3535
<ul>
36-
<li>Convert a single unit of type 0 into 2 units of type 1 using <code>conversions[0]</code>.</li>
37-
<li>Convert a single unit of type 0 into 6 units of type 2 using <code>conversions[0]</code>, then <code>conversions[1]</code>.</li>
36+
<li>Convert a single unit of type 0 into 2 units of type 1 using <code>conversions[0]</code>.</li>
37+
<li>Convert a single unit of type 0 into 6 units of type 2 using <code>conversions[0]</code>, then <code>conversions[1]</code>.</li>
3838
</ul>
3939
<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/3500-3599/3528.Unit%20Conversion%20I/images/example1.png" style="width: 545px; height: 118px;" /></div>
4040

@@ -48,25 +48,25 @@ tags:
4848
<p><strong>Explanation:</strong></p>
4949

5050
<ul>
51-
<li>Convert a single unit of type 0 into 2 units of type 1 using <code>conversions[0]</code>.</li>
52-
<li>Convert a single unit of type 0 into 3 units of type 2 using <code>conversions[1]</code>.</li>
53-
<li>Convert a single unit of type 0 into 8 units of type 3 using <code>conversions[0]</code>, then <code>conversions[2]</code>.</li>
54-
<li>Convert a single unit of type 0 into 10 units of type 4 using <code>conversions[0]</code>, then <code>conversions[3]</code>.</li>
55-
<li>Convert a single unit of type 0 into 6 units of type 5 using <code>conversions[1]</code>, then <code>conversions[4]</code>.</li>
56-
<li>Convert a single unit of type 0 into 30 units of type 6 using <code>conversions[0]</code>, <code>conversions[3]</code>, then <code>conversions[5]</code>.</li>
57-
<li>Convert a single unit of type 0 into 24 units of type 7 using <code>conversions[1]</code>, <code>conversions[4]</code>, then <code>conversions[6]</code>.</li>
51+
<li>Convert a single unit of type 0 into 2 units of type 1 using <code>conversions[0]</code>.</li>
52+
<li>Convert a single unit of type 0 into 3 units of type 2 using <code>conversions[1]</code>.</li>
53+
<li>Convert a single unit of type 0 into 8 units of type 3 using <code>conversions[0]</code>, then <code>conversions[2]</code>.</li>
54+
<li>Convert a single unit of type 0 into 10 units of type 4 using <code>conversions[0]</code>, then <code>conversions[3]</code>.</li>
55+
<li>Convert a single unit of type 0 into 6 units of type 5 using <code>conversions[1]</code>, then <code>conversions[4]</code>.</li>
56+
<li>Convert a single unit of type 0 into 30 units of type 6 using <code>conversions[0]</code>, <code>conversions[3]</code>, then <code>conversions[5]</code>.</li>
57+
<li>Convert a single unit of type 0 into 24 units of type 7 using <code>conversions[1]</code>, <code>conversions[4]</code>, then <code>conversions[6]</code>.</li>
5858
</ul>
5959
</div>
6060

6161
<p>&nbsp;</p>
6262
<p><strong>Constraints:</strong></p>
6363

6464
<ul>
65-
<li><code>2 &lt;= n &lt;= 10<sup>5</sup></code></li>
66-
<li><code>conversions.length == n - 1</code></li>
67-
<li><code>0 &lt;= sourceUnit<sub>i</sub>, targetUnit<sub>i</sub> &lt; n</code></li>
68-
<li><code>1 &lt;= conversionFactor<sub>i</sub> &lt;= 10<sup>9</sup></code></li>
69-
<li>It is guaranteed that unit 0 can be converted into any other unit through a <strong>unique</strong> combination of conversions without using any conversions in the opposite direction.</li>
65+
<li><code>2 &lt;= n &lt;= 10<sup>5</sup></code></li>
66+
<li><code>conversions.length == n - 1</code></li>
67+
<li><code>0 &lt;= sourceUnit<sub>i</sub>, targetUnit<sub>i</sub> &lt; n</code></li>
68+
<li><code>1 &lt;= conversionFactor<sub>i</sub> &lt;= 10<sup>9</sup></code></li>
69+
<li>It is guaranteed that unit 0 can be converted into any other unit through a <strong>unique</strong> combination of conversions without using any conversions in the opposite direction.</li>
7070
</ul>
7171

7272
<!-- description:end -->

‎solution/3500-3599/3532.Path Existence Queries in a Graph I/README.md‎

Lines changed: 5 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,11 @@
22
comments: true
33
difficulty: 中等
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3532.Path%20Existence%20Queries%20in%20a%20Graph%20I/README.md
5+
tags:
6+
- 并查集
7+
- 图
8+
- 数组
9+
- 二分查找
510
---
611

712
<!-- problem:start -->

‎solution/3500-3599/3532.Path Existence Queries in a Graph I/README_EN.md‎

Lines changed: 5 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,11 @@
22
comments: true
33
difficulty: Medium
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3532.Path%20Existence%20Queries%20in%20a%20Graph%20I/README_EN.md
5+
tags:
6+
- Union Find
7+
- Graph
8+
- Array
9+
- Binary Search
510
---
611

712
<!-- problem:start -->

0 commit comments

Comments
(0)

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