Skip to content

Commit baf8937

Browse files
yanglbmeyanglbme
committed
feat: add weekly contest 443
1 parent ba273aa commit baf8937

File tree

13 files changed

+957
-1
lines changed

13 files changed

+957
-1
lines changed

‎solution/3500-3599/3502.Minimum Cost to Reach Every Position/README.md

+112
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,112 @@
1+
---
2+
comments: true
3+
difficulty: 简单
4+
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3502.Minimum%20Cost%20to%20Reach%20Every%20Position/README.md
5+
---
6+
7+
<!-- problem:start -->
8+
9+
# [3502. 到达每个位置的最小费用](https://leetcode.cn/problems/minimum-cost-to-reach-every-position)
10+
11+
[English Version](/solution/3500-3599/3502.Minimum%20Cost%20to%20Reach%20Every%20Position/README_EN.md)
12+
13+
## 题目描述
14+
15+
<!-- description:start -->
16+
17+
<p data-end="438" data-start="104">给你一个长度为 <code>n</code> 的整数数组 <code data-end="119" data-start="113">cost</code> 。当前你位于位置 <code data-end="166" data-start="163">n</code>（队伍的末尾），队伍中共有 <code data-end="187" data-start="180">n + 1</code> 人，编号从 0 到 <code>n</code> 。</p>
18+
19+
<p data-end="438" data-start="104">你希望在队伍中向前移动，但队伍中每个人都会收取一定的费用才能与你 <strong>交换</strong>位置。与编号 <code data-end="375" data-start="372">i</code> 的人交换位置的费用为 <code data-end="397" data-start="388">cost[i]</code> 。</p>
20+
21+
<p data-end="487" data-start="440">你可以按照以下规则与他人交换位置：</p>
22+
23+
<ul data-end="632" data-start="488">
24+
<li data-end="572" data-start="488">如果对方在你前面，你 <strong>必须</strong> 支付 <code data-end="546" data-start="537">cost[i]</code> 费用与他们交换位置。</li>
25+
<li data-end="632" data-start="573">如果对方在你后面，他们可以免费与你交换位置。</li>
26+
</ul>
27+
28+
<p data-end="755" data-start="634">返回一个大小为 <code>n</code> 的数组 <code>answer</code>，其中 <code>answer[i]</code> 表示到达队伍中每个位置 <code>i</code> 所需的 <strong data-end="680" data-start="664">最小</strong> 总费用。</p>
29+
30+
<p>&nbsp;</p>
31+
32+
<p><strong class="example">示例 1：</strong></p>
33+
34+
<div class="example-block">
35+
<p><strong>输入:</strong> <span class="example-io">cost = [5,3,4,1,3,2]</span></p>
36+
37+
<p><strong>输出:</strong> <span class="example-io">[5,3,3,1,1,1]</span></p>
38+
39+
<p><strong>解释:</strong></p>
40+
41+
<p>我们可以通过以下方式到达每个位置：</p>
42+
43+
<ul>
44+
<li><code>i = 0</code>。可以花费 5 费用与编号 0 的人交换位置。</li>
45+
<li><span class="example-io"><code>i = 1</code>。可以花费 3 费用与编号 1 的人交换位置。</span></li>
46+
<li><span class="example-io"><code>i = 2</code>。可以花费 3 费用与编号 1 的人交换位置，然后免费与编号 2 的人交换位置。</span></li>
47+
<li><span class="example-io"><code>i = 3</code>。可以花费 1 费用与编号 3 的人交换位置。</span></li>
48+
<li><span class="example-io"><code>i = 4</code>。可以花费 1 费用与编号 3 的人交换位置，然后免费与编号 4 的人交换位置。</span></li>
49+
<li><span class="example-io"><code>i = 5</code>。可以花费 1 费用与编号 3 的人交换位置，然后免费与编号 5 的人交换位置。</span></li>
50+
</ul>
51+
</div>
52+
53+
<p><strong class="example">示例 2：</strong></p>
54+
55+
<div class="example-block">
56+
<p><strong>输入:</strong> <span class="example-io">cost = [1,2,4,6,7]</span></p>
57+
58+
<p><strong>输出:</strong> <span class="example-io">[1,1,1,1,1]</span></p>
59+
60+
<p><strong>解释:</strong></p>
61+
62+
<p>可以花费 1 费用与编号 0 的人交换位置，然后可以免费到达队伍中的任何位置 <code>i</code>。</p>
63+
</div>
64+
65+
<p>&nbsp;</p>
66+
67+
<p><strong>提示</strong></p>
68+
69+
<ul>
70+
<li><code>1 &lt;= n == cost.length &lt;= 100</code></li>
71+
<li><code>1 &lt;= cost[i] &lt;= 100</code></li>
72+
</ul>
73+
74+
<!-- description:end -->
75+
76+
## 解法
77+
78+
<!-- solution:start -->
79+
80+
### 方法一
81+
82+
<!-- tabs:start -->
83+
84+
#### Python3
85+
86+
```python
87+
88+
```
89+
90+
#### Java
91+
92+
```java
93+
94+
```
95+
96+
#### C++
97+
98+
```cpp
99+
100+
```
101+
102+
#### Go
103+
104+
```go
105+
106+
```
107+
108+
<!-- tabs:end -->
109+
110+
<!-- solution:end -->
111+
112+
<!-- problem:end -->

‎solution/3500-3599/3502.Minimum Cost to Reach Every Position/README_EN.md

+110
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,110 @@
1+
---
2+
comments: true
3+
difficulty: Easy
4+
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3502.Minimum%20Cost%20to%20Reach%20Every%20Position/README_EN.md
5+
---
6+
7+
<!-- problem:start -->
8+
9+
# [3502. Minimum Cost to Reach Every Position](https://leetcode.com/problems/minimum-cost-to-reach-every-position)
10+
11+
[中文文档](/solution/3500-3599/3502.Minimum%20Cost%20to%20Reach%20Every%20Position/README.md)
12+
13+
## Description
14+
15+
<!-- description:start -->
16+
17+
<p data-end="438" data-start="104">You are given an integer array <code data-end="119" data-start="113">cost</code> of size <code data-end="131" data-start="128">n</code>. You are currently at position <code data-end="166" data-start="163">n</code> (at the end of the line) in a line of <code data-end="187" data-start="180">n + 1</code> people (numbered from 0 to <code data-end="218" data-start="215">n</code>).</p>
18+
19+
<p data-end="438" data-start="104">You wish to move forward in the line, but each person in front of you charges a specific amount to <strong>swap</strong> places. The cost to swap with person <code data-end="375" data-start="372">i</code> is given by <code data-end="397" data-start="388">cost[i]</code>.</p>
20+
21+
<p data-end="487" data-start="440">You are allowed to swap places with people as follows:</p>
22+
23+
<ul data-end="632" data-start="488">
24+
<li data-end="572" data-start="488">If they are in front of you, you <strong>must</strong> pay them <code data-end="546" data-start="537">cost[i]</code> to swap with them.</li>
25+
<li data-end="632" data-start="573">If they are behind you, they can swap with you for free.</li>
26+
</ul>
27+
28+
<p data-end="755" data-start="634">Return an array <code>answer</code> of size <code>n</code>, where <code>answer[i]</code> is the <strong data-end="680" data-start="664">minimum</strong> total cost to reach each position <code>i</code> in the line<font face="monospace">.</font></p>
29+
30+
<p>&nbsp;</p>
31+
<p><strong class="example">Example 1:</strong></p>
32+
33+
<div class="example-block">
34+
<p><strong>Input:</strong> <span class="example-io">cost = [5,3,4,1,3,2]</span></p>
35+
36+
<p><strong>Output:</strong> <span class="example-io">[5,3,3,1,1,1]</span></p>
37+
38+
<p><strong>Explanation:</strong></p>
39+
40+
<p>We can get to each position in the following way:</p>
41+
42+
<ul>
43+
<li><code>i = 0</code>. We can swap with person 0 for a cost of 5.</li>
44+
<li><span class="example-io"><code><font face="monospace">i = </font>1</code>. We can swap with person 1 for a cost of 3.</span></li>
45+
<li><span class="example-io"><code>i = 2</code>. We can swap with person 1 for a cost of 3, then swap with person 2 for free.</span></li>
46+
<li><span class="example-io"><code>i = 3</code>. We can swap with person 3 for a cost of 1.</span></li>
47+
<li><span class="example-io"><code>i = 4</code>. We can swap with person 3 for a cost of 1, then swap with person 4 for free.</span></li>
48+
<li><span class="example-io"><code>i = 5</code>. We can swap with person 3 for a cost of 1, then swap with person 5 for free.</span></li>
49+
</ul>
50+
</div>
51+
52+
<p><strong class="example">Example 2:</strong></p>
53+
54+
<div class="example-block">
55+
<p><strong>Input:</strong> <span class="example-io">cost = [1,2,4,6,7]</span></p>
56+
57+
<p><strong>Output:</strong> <span class="example-io">[1,1,1,1,1]</span></p>
58+
59+
<p><strong>Explanation:</strong></p>
60+
61+
<p>We can swap with person 0 for a cost of <span class="example-io">1, then we will be able to reach any position <code>i</code> for free.</span></p>
62+
</div>
63+
64+
<p>&nbsp;</p>
65+
<p><strong>Constraints:</strong></p>
66+
67+
<ul>
68+
<li><code>1 &lt;= n == cost.length &lt;= 100</code></li>
69+
<li><code>1 &lt;= cost[i] &lt;= 100</code></li>
70+
</ul>
71+
72+
<!-- description:end -->
73+
74+
## Solutions
75+
76+
<!-- solution:start -->
77+
78+
### Solution 1
79+
80+
<!-- tabs:start -->
81+
82+
#### Python3
83+
84+
```python
85+
86+
```
87+
88+
#### Java
89+
90+
```java
91+
92+
```
93+
94+
#### C++
95+
96+
```cpp
97+
98+
```
99+
100+
#### Go
101+
102+
```go
103+
104+
```
105+
106+
<!-- tabs:end -->
107+
108+
<!-- solution:end -->
109+
110+
<!-- problem:end -->

‎solution/3500-3599/3503.Longest Palindrome After Substring Concatenation I/README.md

+124
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,124 @@
1+
---
2+
comments: true
3+
difficulty: 中等
4+
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3500-3599/3503.Longest%20Palindrome%20After%20Substring%20Concatenation%20I/README.md
5+
---
6+
7+
<!-- problem:start -->
8+
9+
# [3503. 子字符串连接后的最长回文串 I](https://leetcode.cn/problems/longest-palindrome-after-substring-concatenation-i)
10+
11+
[English Version](/solution/3500-3599/3503.Longest%20Palindrome%20After%20Substring%20Concatenation%20I/README_EN.md)
12+
13+
## 题目描述
14+
15+
<!-- description:start -->
16+
17+
<p>给你两个字符串 <code>s</code> 和 <code>t</code>。</p>
18+
19+
<p>你可以从 <code>s</code> 中选择一个子串（可以为空）以及从 <code>t</code> 中选择一个子串（可以为空），然后将它们<strong> 按顺序 </strong>连接，得到一个新的字符串。</p>
20+
21+
<p>返回可以由上述方法构造出的<strong> 最长</strong> 回文串的长度。</p>
22+
23+
<p><strong>回文串</strong> 是指正着读和反着读都相同的字符串。</p>
24+
25+
<p><strong>子字符串 </strong>是指字符串中的一个连续字符序列。</p>
26+
27+
<p>&nbsp;</p>
28+
29+
<p><strong class="example">示例 1：</strong></p>
30+
31+
<div class="example-block">
32+
<p><strong>输入：</strong> <span class="example-io">s = "a", t = "a"</span></p>
33+
34+
<p><strong>输出：</strong> <span class="example-io">2</span></p>
35+
36+
<p><strong>解释：</strong></p>
37+
38+
<p>从 <code>s</code> 中选择 <code>"a"</code>，从 <code>t</code> 中选择 <code>"a"</code>，拼接得到 <code>"aa"</code>，这是一个长度为 2 的回文串。</p>
39+
</div>
40+
41+
<p><strong class="example">示例 2：</strong></p>
42+
43+
<div class="example-block">
44+
<p><strong>输入：</strong> <span class="example-io">s = "abc", t = "def"</span></p>
45+
46+
<p><strong>输出：</strong> <span class="example-io">1</span></p>
47+
48+
<p><strong>解释：</strong></p>
49+
50+
<p>由于两个字符串的所有字符都不同，最长的回文串只能是任意一个单独的字符，因此答案是 1。</p>
51+
</div>
52+
53+
<p><strong class="example">示例 3：</strong></p>
54+
55+
<div class="example-block">
56+
<p><strong>输入：</strong> <span class="example-io">s = "b", t = "aaaa"</span></p>
57+
58+
<p><strong>输出：</strong> 4</p>
59+
60+
<p><strong>解释：</strong></p>
61+
62+
<p>可以选择 <code>"aaaa"</code> 作为回文串，其长度为 4。</p>
63+
</div>
64+
65+
<p><strong class="example">示例 4：</strong></p>
66+
67+
<div class="example-block">
68+
<p><strong>输入：</strong> <span class="example-io">s = "abcde", t = "ecdba"</span></p>
69+
70+
<p><strong>输出：</strong> 5</p>
71+
72+
<p><strong>解释：</strong></p>
73+
74+
<p>从 <code>s</code> 中选择 <code>"abc"</code>，从 <code>t</code> 中选择 <code>"ba"</code>，拼接得到 <code>"abcba"</code>，这是一个长度为 5 的回文串。</p>
75+
</div>
76+
77+
<p>&nbsp;</p>
78+
79+
<p><strong>提示：</strong></p>
80+
81+
<ul>
82+
<li><code>1 &lt;= s.length, t.length &lt;= 30</code></li>
83+
<li><code>s</code> 和 <code>t</code> 仅由小写英文字母组成。</li>
84+
</ul>
85+
86+
<!-- description:end -->
87+
88+
## 解法
89+
90+
<!-- solution:start -->
91+
92+
### 方法一
93+
94+
<!-- tabs:start -->
95+
96+
#### Python3
97+
98+
```python
99+
100+
```
101+
102+
#### Java
103+
104+
```java
105+
106+
```
107+
108+
#### C++
109+
110+
```cpp
111+
112+
```
113+
114+
#### Go
115+
116+
```go
117+
118+
```
119+
120+
<!-- tabs:end -->
121+
122+
<!-- solution:end -->
123+
124+
<!-- problem:end -->

0 commit comments

Comments
 (0)