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 a85f495

Browse files
acbinidoocs
andauthored
feat: add weekly contest 377 (doocs#2148)
 --------- Co-authored-by: Doocs Bot <doocs-bot@outlook.com>
1 parent 6b3553e commit a85f495

File tree

28 files changed

+852
-50
lines changed

28 files changed

+852
-50
lines changed

‎solution/10000-10099/10031.Count the Number of Incremovable Subarrays I/README.md‎ renamed to ‎solution/2900-2999/2970.Count the Number of Incremovable Subarrays I/README.md‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
1-
# [10031. 统计移除递增子数组的数目 I](https://leetcode.cn/problems/count-the-number-of-incremovable-subarrays-i)
1+
# [2970. 统计移除递增子数组的数目 I](https://leetcode.cn/problems/count-the-number-of-incremovable-subarrays-i)
22

3-
[English Version](/solution/10000-10099/10031.Count%20the%20Number%20of%20Incremovable%20Subarrays%20I/README_EN.md)
3+
[English Version](/solution/2900-2999/2970.Count%20the%20Number%20of%20Incremovable%20Subarrays%20I/README_EN.md)
44

55
## 题目描述
66

‎solution/10000-10099/10031.Count the Number of Incremovable Subarrays I/README_EN.md‎ renamed to ‎solution/2900-2999/2970.Count the Number of Incremovable Subarrays I/README_EN.md‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
1-
# [10031. Count the Number of Incremovable Subarrays I](https://leetcode.com/problems/count-the-number-of-incremovable-subarrays-i)
1+
# [2970. Count the Number of Incremovable Subarrays I](https://leetcode.com/problems/count-the-number-of-incremovable-subarrays-i)
22

3-
[中文文档](/solution/10000-10099/10031.Count%20the%20Number%20of%20Incremovable%20Subarrays%20I/README.md)
3+
[中文文档](/solution/2900-2999/2970.Count%20the%20Number%20of%20Incremovable%20Subarrays%20I/README.md)
44

55
## Description
66

‎solution/10000-10099/10032.Find Polygon With the Largest Perimeter/README.md‎ renamed to ‎solution/2900-2999/2971.Find Polygon With the Largest Perimeter/README.md‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
1-
# [10032. 找到最大周长的多边形](https://leetcode.cn/problems/find-polygon-with-the-largest-perimeter)
1+
# [2971. 找到最大周长的多边形](https://leetcode.cn/problems/find-polygon-with-the-largest-perimeter)
22

3-
[English Version](/solution/10000-10099/10032.Find%20Polygon%20With%20the%20Largest%20Perimeter/README_EN.md)
3+
[English Version](/solution/2900-2999/2971.Find%20Polygon%20With%20the%20Largest%20Perimeter/README_EN.md)
44

55
## 题目描述
66

‎solution/10000-10099/10032.Find Polygon With the Largest Perimeter/README_EN.md‎ renamed to ‎solution/2900-2999/2971.Find Polygon With the Largest Perimeter/README_EN.md‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
1-
# [10032. Find Polygon With the Largest Perimeter](https://leetcode.com/problems/find-polygon-with-the-largest-perimeter)
1+
# [2971. Find Polygon With the Largest Perimeter](https://leetcode.com/problems/find-polygon-with-the-largest-perimeter)
22

3-
[中文文档](/solution/10000-10099/10032.Find%20Polygon%20With%20the%20Largest%20Perimeter/README.md)
3+
[中文文档](/solution/2900-2999/2971.Find%20Polygon%20With%20the%20Largest%20Perimeter/README.md)
44

55
## Description
66

‎solution/10000-10099/10033.Count the Number of Incremovable Subarrays II/README.md‎ renamed to ‎solution/2900-2999/2972.Count the Number of Incremovable Subarrays II/README.md‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
1-
# [10033. 统计移除递增子数组的数目 II](https://leetcode.cn/problems/count-the-number-of-incremovable-subarrays-ii)
1+
# [2972. 统计移除递增子数组的数目 II](https://leetcode.cn/problems/count-the-number-of-incremovable-subarrays-ii)
22

3-
[English Version](/solution/10000-10099/10033.Count%20the%20Number%20of%20Incremovable%20Subarrays%20II/README_EN.md)
3+
[English Version](/solution/2900-2999/2972.Count%20the%20Number%20of%20Incremovable%20Subarrays%20II/README_EN.md)
44

55
## 题目描述
66

‎solution/10000-10099/10033.Count the Number of Incremovable Subarrays II/README_EN.md‎ renamed to ‎solution/2900-2999/2972.Count the Number of Incremovable Subarrays II/README_EN.md‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
1-
# [10033. Count the Number of Incremovable Subarrays II](https://leetcode.com/problems/count-the-number-of-incremovable-subarrays-ii)
1+
# [2972. Count the Number of Incremovable Subarrays II](https://leetcode.com/problems/count-the-number-of-incremovable-subarrays-ii)
22

3-
[中文文档](/solution/10000-10099/10033.Count%20the%20Number%20of%20Incremovable%20Subarrays%20II/README.md)
3+
[中文文档](/solution/2900-2999/2972.Count%20the%20Number%20of%20Incremovable%20Subarrays%20II/README.md)
44

55
## Description
66

‎solution/10000-10099/10034.Find Number of Coins to Place in Tree Nodes/README.md‎ renamed to ‎solution/2900-2999/2973.Find Number of Coins to Place in Tree Nodes/README.md‎

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
1-
# [10034. 树中每个节点放置的金币数目](https://leetcode.cn/problems/find-number-of-coins-to-place-in-tree-nodes)
1+
# [2973. 树中每个节点放置的金币数目](https://leetcode.cn/problems/find-number-of-coins-to-place-in-tree-nodes)
22

3-
[English Version](/solution/10000-10099/10034.Find%20Number%20of%20Coins%20to%20Place%20in%20Tree%20Nodes/README_EN.md)
3+
[English Version](/solution/2900-2999/2973.Find%20Number%20of%20Coins%20to%20Place%20in%20Tree%20Nodes/README_EN.md)
44

55
## 题目描述
66

@@ -23,7 +23,7 @@
2323

2424
<p><strong class="example">示例 1:</strong></p>
2525

26-
<p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/10000-10099/10034.Find%20Number%20of%20Coins%20to%20Place%20in%20Tree%20Nodes/images/screenshot-2023年11月10日-012641.png" style="width: 600px; height: 233px;" /></p>
26+
<p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/2900-2999/2973.Find%20Number%20of%20Coins%20to%20Place%20in%20Tree%20Nodes/images/screenshot-2023年11月10日-012641.png" style="width: 600px; height: 233px;" /></p>
2727

2828
<pre>
2929
<b>输入:</b>edges = [[0,1],[0,2],[0,3],[0,4],[0,5]], cost = [1,2,3,4,5,6]
@@ -33,7 +33,7 @@
3333

3434
<p><strong class="example">示例 2:</strong></p>
3535

36-
<p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/10000-10099/10034.Find%20Number%20of%20Coins%20to%20Place%20in%20Tree%20Nodes/images/screenshot-2023年11月10日-012614.png" style="width: 800px; height: 374px;" /></p>
36+
<p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/2900-2999/2973.Find%20Number%20of%20Coins%20to%20Place%20in%20Tree%20Nodes/images/screenshot-2023年11月10日-012614.png" style="width: 800px; height: 374px;" /></p>
3737

3838
<pre>
3939
<b>输入:</b>edges = [[0,1],[0,2],[1,3],[1,4],[1,5],[2,6],[2,7],[2,8]], cost = [1,4,2,3,5,7,8,-4,2]
@@ -47,7 +47,7 @@
4747

4848
<p><strong class="example">示例 3:</strong></p>
4949

50-
<p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/10000-10099/10034.Find%20Number%20of%20Coins%20to%20Place%20in%20Tree%20Nodes/images/screenshot-2023年11月10日-012513.png" style="width: 300px; height: 277px;" /></p>
50+
<p><img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/2900-2999/2973.Find%20Number%20of%20Coins%20to%20Place%20in%20Tree%20Nodes/images/screenshot-2023年11月10日-012513.png" style="width: 300px; height: 277px;" /></p>
5151

5252
<pre>
5353
<b>输入:</b>edges = [[0,1],[0,2]], cost = [1,2,-2]

‎solution/10000-10099/10034.Find Number of Coins to Place in Tree Nodes/README_EN.md‎ renamed to ‎solution/2900-2999/2973.Find Number of Coins to Place in Tree Nodes/README_EN.md‎

Lines changed: 5 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
1-
# [10034. Find Number of Coins to Place in Tree Nodes](https://leetcode.com/problems/find-number-of-coins-to-place-in-tree-nodes)
1+
# [2973. Find Number of Coins to Place in Tree Nodes](https://leetcode.com/problems/find-number-of-coins-to-place-in-tree-nodes)
22

3-
[中文文档](/solution/10000-10099/10034.Find%20Number%20of%20Coins%20to%20Place%20in%20Tree%20Nodes/README.md)
3+
[中文文档](/solution/2900-2999/2973.Find%20Number%20of%20Coins%20to%20Place%20in%20Tree%20Nodes/README.md)
44

55
## Description
66

@@ -19,15 +19,15 @@
1919

2020
<p>&nbsp;</p>
2121
<p><strong class="example">Example 1:</strong></p>
22-
<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/10000-10099/10034.Find%20Number%20of%20Coins%20to%20Place%20in%20Tree%20Nodes/images/screenshot-2023年11月10日-012641.png" style="width: 600px; height: 233px;" />
22+
<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/2900-2999/2973.Find%20Number%20of%20Coins%20to%20Place%20in%20Tree%20Nodes/images/screenshot-2023年11月10日-012641.png" style="width: 600px; height: 233px;" />
2323
<pre>
2424
<strong>Input:</strong> edges = [[0,1],[0,2],[0,3],[0,4],[0,5]], cost = [1,2,3,4,5,6]
2525
<strong>Output:</strong> [120,1,1,1,1,1]
2626
<strong>Explanation:</strong> For node 0 place 6 * 5 * 4 = 120 coins. All other nodes are leaves with subtree of size 1, place 1 coin on each of them.
2727
</pre>
2828

2929
<p><strong class="example">Example 2:</strong></p>
30-
<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/10000-10099/10034.Find%20Number%20of%20Coins%20to%20Place%20in%20Tree%20Nodes/images/screenshot-2023年11月10日-012614.png" style="width: 800px; height: 374px;" />
30+
<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/2900-2999/2973.Find%20Number%20of%20Coins%20to%20Place%20in%20Tree%20Nodes/images/screenshot-2023年11月10日-012614.png" style="width: 800px; height: 374px;" />
3131
<pre>
3232
<strong>Input:</strong> edges = [[0,1],[0,2],[1,3],[1,4],[1,5],[2,6],[2,7],[2,8]], cost = [1,4,2,3,5,7,8,-4,2]
3333
<strong>Output:</strong> [280,140,32,1,1,1,1,1,1]
@@ -39,7 +39,7 @@
3939
</pre>
4040

4141
<p><strong class="example">Example 3:</strong></p>
42-
<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/10000-10099/10034.Find%20Number%20of%20Coins%20to%20Place%20in%20Tree%20Nodes/images/screenshot-2023年11月10日-012513.png" style="width: 300px; height: 277px;" />
42+
<img alt="" src="https://fastly.jsdelivr.net/gh/doocs/leetcode@main/solution/2900-2999/2973.Find%20Number%20of%20Coins%20to%20Place%20in%20Tree%20Nodes/images/screenshot-2023年11月10日-012513.png" style="width: 300px; height: 277px;" />
4343
<pre>
4444
<strong>Input:</strong> edges = [[0,1],[0,2]], cost = [1,2,-2]
4545
<strong>Output:</strong> [0,1,1]
File renamed without changes.
File renamed without changes.

0 commit comments

Comments
(0)

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