Skip to content

Commit a5d55fd

Browse files
yanglbmeyanglbme
committed
feat: add weekly contest 498
1 parent d831859 commit a5d55fd

54 files changed

Lines changed: 3373 additions & 5 deletions

File tree

Some content is hidden

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

‎solution/2800-2899/2834.Find the Minimum Possible Sum of a Beautiful Array/README.md‎

Lines changed: 3 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -50,9 +50,9 @@ tags:
5050
<strong>输入：</strong>n = 3, target = 3
5151
<strong>输出：</strong>8
5252
<strong>解释：</strong>
53-
nums = [1,3,4] 是美丽数组。
54-
- nums 的长度为 n = 3 。
55-
- nums 由两两互不相同的正整数组成。
53+
nums = [1,3,4] 是美丽数组。
54+
- nums 的长度为 n = 3 。
55+
- nums 由两两互不相同的正整数组成。
5656
- 不存在两个不同下标 i 和 j ，使得 nums[i] + nums[j] == 3 。
5757
可以证明 8 是符合条件的美丽数组所可能具备的最小和。</pre>
5858

‎solution/3800-3899/3894.Traffic Signal Color/README.md‎

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: 简单
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3894.Traffic%20Signal%20Color/README.md
5+
rating: 1222
6+
source: 第 180 场双周赛 Q1
57
---
68

79
<!-- problem:start -->

‎solution/3800-3899/3894.Traffic Signal Color/README_EN.md‎

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: Easy
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3894.Traffic%20Signal%20Color/README_EN.md
5+
rating: 1222
6+
source: Biweekly Contest 180 Q1
57
---
68

79
<!-- problem:start -->

‎solution/3800-3899/3895.Count Digit Appearances/README.md‎

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: 中等
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3895.Count%20Digit%20Appearances/README.md
5+
rating: 1269
6+
source: 第 180 场双周赛 Q2
57
---
68

79
<!-- problem:start -->

‎solution/3800-3899/3895.Count Digit Appearances/README_EN.md‎

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: Medium
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3895.Count%20Digit%20Appearances/README_EN.md
5+
rating: 1269
6+
source: Biweekly Contest 180 Q2
57
---
68

79
<!-- problem:start -->

‎solution/3800-3899/3896.Minimum Operations to Transform Array into Alternating Prime/README.md‎

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: 中等
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3896.Minimum%20Operations%20to%20Transform%20Array%20into%20Alternating%20Prime/README.md
5+
rating: 1435
6+
source: 第 180 场双周赛 Q3
57
---
68

79
<!-- problem:start -->

‎solution/3800-3899/3896.Minimum Operations to Transform Array into Alternating Prime/README_EN.md‎

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: Medium
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3896.Minimum%20Operations%20to%20Transform%20Array%20into%20Alternating%20Prime/README_EN.md
5+
rating: 1435
6+
source: Biweekly Contest 180 Q3
57
---
68

79
<!-- problem:start -->

‎solution/3800-3899/3897.Maximum Value of Concatenated Binary Segments/README.md‎

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: 困难
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3897.Maximum%20Value%20of%20Concatenated%20Binary%20Segments/README.md
5+
rating: 1998
6+
source: 第 180 场双周赛 Q4
57
---
68

79
<!-- problem:start -->

‎solution/3800-3899/3897.Maximum Value of Concatenated Binary Segments/README_EN.md‎

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: Hard
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3897.Maximum%20Value%20of%20Concatenated%20Binary%20Segments/README_EN.md
5+
rating: 1998
6+
source: Biweekly Contest 180 Q4
57
---
68

79
<!-- problem:start -->

‎solution/3800-3899/3898.Find the Degree of Each Vertex/README.md‎

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,6 +2,8 @@
22
comments: true
33
difficulty: 简单
44
edit_url: https://github.com/doocs/leetcode/edit/main/solution/3800-3899/3898.Find%20the%20Degree%20of%20Each%20Vertex/README.md
5+
rating: 1202
6+
source: 第 497 场周赛 Q1
57
---
68

79
<!-- problem:start -->

0 commit comments

Comments
 (0)