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 81d4744

Browse files
committed
feat: update lc problems
1 parent df2de2e commit 81d4744

File tree

72 files changed

+500
-232
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

72 files changed

+500
-232
lines changed

‎solution/1500-1599/1526.Minimum Number of Increments on Subarrays to Form a Target Array/README.md‎

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

5757
<pre><strong>输入:</strong>target = [3,1,5,4,2]
5858
<strong>输出:</strong>7
59-
<strong>解释:</strong>(initial)[0,0,0,0,0] -&gt; [1,1,1,1,1] -&gt; [2,1,1,1,1] -&gt; [3,1,1,1,1]
59+
<strong>解释:</strong>(initial)[0,0,0,0,0] -&gt; [1,1,1,1,1] -&gt; [2,1,1,1,1] -&gt; [3,1,1,1,1]
6060
-&gt; [3,1,2,2,2] -&gt; [3,1,3,3,2] -&gt; [3,1,4,4,2] -&gt; [3,1,5,4,2] (target)。
6161
</pre>
6262

‎solution/2100-2199/2130.Maximum Twin Sum of a Linked List/README_EN.md‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -39,7 +39,7 @@ tags:
3939
<strong>Explanation:</strong>
4040
Nodes 0 and 1 are the twins of nodes 3 and 2, respectively. All have twin sum = 6.
4141
There are no other nodes with twins in the linked list.
42-
Thus, the maximum twin sum of the linked list is 6.
42+
Thus, the maximum twin sum of the linked list is 6.
4343
</pre>
4444

4545
<p><strong class="example">Example 2:</strong></p>
@@ -51,7 +51,7 @@ Thus, the maximum twin sum of the linked list is 6.
5151
The nodes with twins present in this linked list are:
5252
- Node 0 is the twin of node 3 having a twin sum of 4 + 3 = 7.
5353
- Node 1 is the twin of node 2 having a twin sum of 2 + 2 = 4.
54-
Thus, the maximum twin sum of the linked list is max(7, 4) = 7.
54+
Thus, the maximum twin sum of the linked list is max(7, 4) = 7.
5555
</pre>
5656

5757
<p><strong class="example">Example 3:</strong></p>

‎solution/2500-2599/2528.Maximize the Minimum Powered City/README_EN.md‎

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -45,8 +45,8 @@ tags:
4545
<pre>
4646
<strong>Input:</strong> stations = [1,2,4,5,0], r = 1, k = 2
4747
<strong>Output:</strong> 5
48-
<strong>Explanation:</strong>
49-
One of the optimal ways is to install both the power stations at city 1.
48+
<strong>Explanation:</strong>
49+
One of the optimal ways is to install both the power stations at city 1.
5050
So stations will become [1,4,4,5,0].
5151
- City 0 is provided by 1 + 4 = 5 power stations.
5252
- City 1 is provided by 1 + 4 + 4 = 9 power stations.
@@ -62,7 +62,7 @@ Since it is not possible to obtain a larger power, we return 5.
6262
<pre>
6363
<strong>Input:</strong> stations = [4,4,4,4], r = 0, k = 3
6464
<strong>Output:</strong> 4
65-
<strong>Explanation:</strong>
65+
<strong>Explanation:</strong>
6666
It can be proved that we cannot make the minimum power of a city greater than 4.
6767
</pre>
6868

‎solution/3600-3699/3632.Subarrays with XOR at Least K/README.md‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -4,14 +4,14 @@ difficulty: 困难
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3632.Subarrays%20with%20XOR%20at%20Least%20K/README.md
55
tags:
66
- 位运算
7-
- 树
7+
- 字典树
88
- 数组
99
- 前缀和
1010
---
1111

1212
<!-- problem:start -->
1313

14-
# [3632. 子数组异或至少为 K 的数目 🔒](https://leetcode.cn/problems/subarrays-with-xor-at-least-k)
14+
# [3632. 异或至少为 K 的子数组数目 🔒](https://leetcode.cn/problems/subarrays-with-xor-at-least-k)
1515

1616
[English Version](/solution/3600-3699/3632.Subarrays%20with%20XOR%20at%20Least%20K/README_EN.md)
1717

‎solution/3600-3699/3632.Subarrays with XOR at Least K/README_EN.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,7 @@ difficulty: Hard
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3600-3699/3632.Subarrays%20with%20XOR%20at%20Least%20K/README_EN.md
55
tags:
66
- Bit Manipulation
7-
- Tree
7+
- Trie
88
- Array
99
- Prefix Sum
1010
---

‎solution/3600-3699/3657.Find Loyal Customers/README.md‎

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -40,6 +40,8 @@ transaction_type 可以是 "purchase" 或 "refund"。
4040
<li>他们的 <strong>退款率</strong>&nbsp;少于&nbsp;<code>20%</code>。</li>
4141
</ul>
4242

43+
<p>退款率是退款交易占交易总数(购买加退款)的比例,计算公式为退款交易数量除以总交易数量。</p>
44+
4345
<p>返回结果表以&nbsp;<code>customer_id</code> <strong>升序</strong>&nbsp;排序。</p>
4446

4547
<p>结果格式如下所示。</p>

‎solution/3600-3699/3657.Find Loyal Customers/README_EN.md‎

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -40,6 +40,8 @@ transaction_type can be either &#39;purchase&#39; or &#39;refund&#39;.
4040
<li>Their <strong>refund rate</strong> is less than <code>20%</code> .</li>
4141
</ul>
4242

43+
<p><em>Refund rate</em> is the proportion of transactions that are refunds, calculated as the number of refund transactions divided by the total number of transactions (purchases plus refunds).</p>
44+
4345
<p>Return <em>the result table&nbsp;ordered by</em> <code>customer_id</code> <em>in <strong>ascending</strong> order</em>.</p>
4446

4547
<p>The result format is in the following example.</p>

‎solution/3600-3699/3666.Minimum Operations to Equalize Binary String/README.md‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -6,9 +6,10 @@ rating: 2476
66
source: 第 164 场双周赛 Q4
77
tags:
88
- 广度优先搜索
9-
- 哈希表
9+
- 并查集
1010
- 数学
1111
- 字符串
12+
- 有序集合
1213
---
1314

1415
<!-- problem:start -->

‎solution/3600-3699/3666.Minimum Operations to Equalize Binary String/README_EN.md‎

Lines changed: 2 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -6,9 +6,10 @@ rating: 2476
66
source: Biweekly Contest 164 Q4
77
tags:
88
- Breadth-First Search
9-
- Hash Table
9+
- Union Find
1010
- Math
1111
- String
12+
- Ordered Set
1213
---
1314

1415
<!-- problem:start -->

‎solution/3700-3799/3701.Compute Alternating Sum/README.md‎

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -4,6 +4,9 @@ difficulty: 简单
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3700-3799/3701.Compute%20Alternating%20Sum/README.md
55
rating: 1228
66
source: 第 470 场周赛 Q1
7+
tags:
8+
- 数组
9+
- 模拟
710
---
811

912
<!-- problem:start -->

0 commit comments

Comments
(0)

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