Skip to content

Commit f4e4580

Browse files
yanglbmeyanglbme
authored
feat: add solutions to lc problem: No.3764 (#4876)
1 parent d6db1b7 commit f4e4580

File tree

19 files changed

+476
-4
lines changed

19 files changed

+476
-4
lines changed

‎solution/2200-2299/2209.Minimum White Tiles After Covering With Carpets/README_EN.md‎

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -37,7 +37,7 @@ tags:
3737
<pre>
3838
<strong>Input:</strong> floor = &quot;10110101&quot;, numCarpets = 2, carpetLen = 2
3939
<strong>Output:</strong> 2
40-
<strong>Explanation:</strong>
40+
<strong>Explanation:</strong>
4141
The figure above shows one way of covering the tiles with the carpets such that only 2 white tiles are visible.
4242
No other way of covering the tiles with the carpets can leave less than 2 white tiles visible.
4343
</pre>
@@ -47,7 +47,7 @@ No other way of covering the tiles with the carpets can leave less than 2 white
4747
<pre>
4848
<strong>Input:</strong> floor = &quot;11111&quot;, numCarpets = 2, carpetLen = 3
4949
<strong>Output:</strong> 0
50-
<strong>Explanation:</strong>
50+
<strong>Explanation:</strong>
5151
The figure above shows one way of covering the tiles with the carpets such that no white tiles are visible.
5252
Note that the carpets are able to overlap one another.
5353
</pre>

‎solution/2200-2299/2211.Count Collisions on a Road/README_EN.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -47,7 +47,7 @@ The collisions that will happen on the road are:
4747
- Cars 2 and 3 will collide with each other. Since car 3 is stationary, the number of collisions becomes 2 + 1 = 3.
4848
- Cars 3 and 4 will collide with each other. Since car 3 is stationary, the number of collisions becomes 3 + 1 = 4.
4949
- Cars 4 and 5 will collide with each other. After car 4 collides with car 3, it will stay at the point of collision and get hit by car 5. The number of collisions becomes 4 + 1 = 5.
50-
Thus, the total number of collisions that will happen on the road is 5.
50+
Thus, the total number of collisions that will happen on the road is 5.
5151
</pre>
5252

5353
<p><strong class="example">Example 2:</strong></p>

‎solution/3700-3799/3759.Count Elements With at Least K Greater Values/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/3700-3799/3759.Count%20Elements%20With%20at%20Least%20K%20Greater%20Values/README.md
5+
rating: 1372
6+
source: 第 478 场周赛 Q1
57
---
68

79
<!-- problem:start -->

‎solution/3700-3799/3759.Count Elements With at Least K Greater Values/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/3700-3799/3759.Count%20Elements%20With%20at%20Least%20K%20Greater%20Values/README_EN.md
5+
rating: 1372
6+
source: Weekly Contest 478 Q1
57
---
68

79
<!-- problem:start -->

‎solution/3700-3799/3760.Maximum Substrings With Distinct Start/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/3700-3799/3760.Maximum%20Substrings%20With%20Distinct%20Start/README.md
5+
rating: 1364
6+
source: 第 478 场周赛 Q2
57
---
68

79
<!-- problem:start -->

‎solution/3700-3799/3760.Maximum Substrings With Distinct Start/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/3700-3799/3760.Maximum%20Substrings%20With%20Distinct%20Start/README_EN.md
5+
rating: 1364
6+
source: Weekly Contest 478 Q2
57
---
68

79
<!-- problem:start -->

‎solution/3700-3799/3761.Minimum Absolute Distance Between Mirror Pairs/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/3700-3799/3761.Minimum%20Absolute%20Distance%20Between%20Mirror%20Pairs/README.md
5+
rating: 1668
6+
source: 第 478 场周赛 Q3
57
---
68

79
<!-- problem:start -->

‎solution/3700-3799/3761.Minimum Absolute Distance Between Mirror Pairs/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/3700-3799/3761.Minimum%20Absolute%20Distance%20Between%20Mirror%20Pairs/README_EN.md
5+
rating: 1668
6+
source: Weekly Contest 478 Q3
57
---
68

79
<!-- problem:start -->

‎solution/3700-3799/3762.Minimum Operations to Equalize Subarrays/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/3700-3799/3762.Minimum%20Operations%20to%20Equalize%20Subarrays/README.md
5+
rating: 2497
6+
source: 第 478 场周赛 Q4
57
---
68

79
<!-- problem:start -->

‎solution/3700-3799/3762.Minimum Operations to Equalize Subarrays/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/3700-3799/3762.Minimum%20Operations%20to%20Equalize%20Subarrays/README_EN.md
5+
rating: 2497
6+
source: Weekly Contest 478 Q4
57
---
68

79
<!-- problem:start -->

0 commit comments

Comments
 (0)