Merge pull request #692 from LetMeFly666/2274

添加问题“2274.不含特殊楼层的最大连续楼层数”的代码和题解

Author: LetMeFly666

Codes/2274-maximum-consecutive-floors-without-special-floors.cpp

@@ -0,0 +1,23 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-01-06 20:32:56
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-01-06 20:35:34
+ */
+#ifdef _WIN32
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    int maxConsecutive(int bottom, int top, vector<int>& special) {
+        sort(special.begin(), special.end());
+        int ans = top - special.back();
+        bottom--;
+        for (int t : special) {
+            ans = max(ans, t - bottom - 1);
+            bottom = t;
+        }
+        return ans;
+    }
+};

Codes/2274-maximum-consecutive-floors-without-special-floors.go

@@ -0,0 +1,24 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-01-06 20:41:20
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-01-06 20:43:19
+ */
+package main
+import "sort"
+
+func max_MCFWSF(a, b int) int {
+    if a > b {
+        return a
+    }
+    return b
+}
+
+func maxConsecutive(bottom int, top int, special []int) (ans int) {
+    sort.Ints(special)
+    ans = max_MCFWSF(special[0] - bottom, top - special[len(special) - 1])
+    for i := 1; i < len(special); i++ {
+        ans = max_MCFWSF(ans, special[i] - special[i - 1] - 1)
+    }
+    return
+}

Codes/2274-maximum-consecutive-floors-without-special-floors.java

@@ -0,0 +1,18 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-01-06 20:39:00
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-01-06 20:40:24
+ */
+import java.util.Arrays;
+
+class Solution {
+    public int maxConsecutive(int bottom, int top, int[] special) {
+        Arrays.sort(special);
+        int ans = Math.max(special[0] - bottom, top - special[special.length - 1]);
+        for (int i = 1; i < special.length; i++) {
+            ans = Math.max(ans, special[i] - special[i - 1] - 1);
+        }
+        return ans;
+    }
+}

Codes/2274-maximum-consecutive-floors-without-special-floors.py

@@ -0,0 +1,15 @@
+'''
+Author: LetMeFly
+Date: 2025-01-06 20:36:27
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-01-06 20:38:18
+'''
+from typing import List
+
+class Solution:
+    def maxConsecutive(self, bottom: int, top: int, special: List[int]) -> int:
+        special.sort()
+        ans = max(special[0] - bottom, top - special[-1])
+        for i in range(1, len(special)):
+            ans = max(ans, special[i] - special[i - 1] - 1)
+        return ans

README.md

@@ -538,6 +538,7 @@
 |2244.完成所有任务需要的最少轮数|中等|<a href="https://leetcode.cn/problems/minimum-rounds-to-complete-all-tasks/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2024/05/14/LeetCode%202244.%E5%AE%8C%E6%88%90%E6%89%80%E6%9C%89%E4%BB%BB%E5%8A%A1%E9%9C%80%E8%A6%81%E7%9A%84%E6%9C%80%E5%B0%91%E8%BD%AE%E6%95%B0/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/138849002" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/minimum-rounds-to-complete-all-tasks/solutions/2777174/letmefly-2244wan-cheng-suo-you-ren-wu-xu-n7bh/" target="_blank">LeetCode题解</a>|
 |2251.花期内花的数目|困难|<a href="https://leetcode.cn/problems/number-of-flowers-in-full-bloom/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/09/28/LeetCode%202251.%E8%8A%B1%E6%9C%9F%E5%86%85%E8%8A%B1%E7%9A%84%E6%95%B0%E7%9B%AE/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/133378624" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/number-of-flowers-in-full-bloom/solutions/2462220/letmefly-2251hua-qi-nei-hua-de-shu-mu-pa-nfvo/" target="_blank">LeetCode题解</a>|
 |2258.逃离火灾|困难|<a href="https://leetcode.cn/problems/escape-the-spreading-fire/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/11/09/LeetCode%202258.%E9%80%83%E7%A6%BB%E7%81%AB%E7%81%BE/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/134331955" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/escape-the-spreading-fire/solutions/2520786/letmefly-2258tao-chi-huo-zai-yan-du-you-kj2r4/" target="_blank">LeetCode题解</a>|
+|2274.不含特殊楼层的最大连续楼层数|中等|<a href="https://leetcode.cn/problems/maximum-consecutive-floors-without-special-floors/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2025/01/06/LeetCode%202274.%E4%B8%8D%E5%90%AB%E7%89%B9%E6%AE%8A%E6%A5%BC%E5%B1%82%E7%9A%84%E6%9C%80%E5%A4%A7%E8%BF%9E%E7%BB%AD%E6%A5%BC%E5%B1%82%E6%95%B0/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/144972086" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/maximum-consecutive-floors-without-special-floors/solutions/3040396/letmefly-2274bu-han-te-shu-lou-ceng-de-z-321m/" target="_blank">LeetCode题解</a>|
 |2276.统计区间中的整数数目|困难|<a href="https://leetcode.cn/problems/count-integers-in-intervals/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/12/16/LeetCode%202276.%E7%BB%9F%E8%AE%A1%E5%8C%BA%E9%97%B4%E4%B8%AD%E7%9A%84%E6%95%B4%E6%95%B0%E6%95%B0%E7%9B%AE/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/135036679" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/count-integers-in-intervals/solutions/2568803/letmefly-2276tong-ji-qu-jian-zhong-de-zh-y3i6/" target="_blank">LeetCode题解</a>|
 |2283.判断一个数的数字计数是否等于数位的值|简单|<a href="https://leetcode.cn/problems/check-if-number-has-equal-digit-count-and-digit-value/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/01/11/LeetCode%202283.%E5%88%A4%E6%96%AD%E4%B8%80%E4%B8%AA%E6%95%B0%E7%9A%84%E6%95%B0%E5%AD%97%E8%AE%A1%E6%95%B0%E6%98%AF%E5%90%A6%E7%AD%89%E4%BA%8E%E6%95%B0%E4%BD%8D%E7%9A%84%E5%80%BC/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/128652351" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/check-if-number-has-equal-digit-count-and-digit-value/solutions/2057234/letmefly-2283pan-duan-yi-ge-shu-de-shu-z-4olo/" target="_blank">LeetCode题解</a>|
 |2287.重排字符形成目标字符串|简单|<a href="https://leetcode.cn/problems/rearrange-characters-to-make-target-string/solutions/" target="_blank">题目地址</a>|<a href="https://blog.letmefly.xyz/2023/01/13/LeetCode%202287.%E9%87%8D%E6%8E%92%E5%AD%97%E7%AC%A6%E5%BD%A2%E6%88%90%E7%9B%AE%E6%A0%87%E5%AD%97%E7%AC%A6%E4%B8%B2/" target="_blank">题解地址</a>|<a href="https://letmefly.blog.csdn.net/article/details/128675652" target="_blank">CSDN题解</a>|<a href="https://leetcode.cn/problems/rearrange-characters-to-make-target-string/solutions/2060137/letmefly-2287zhong-pai-zi-fu-xing-cheng-32wj7/" target="_blank">LeetCode题解</a>|

Solutions/LeetCode 2274.不含特殊楼层的最大连续楼层数.md

@@ -0,0 +1,162 @@
+---
+title: 2274.不含特殊楼层的最大连续楼层数
+date: 2025-01-06 20:45:47
+tags: [题解, LeetCode, 中等, 数组, 排序]
+---
+
+# 【LetMeFly】2274.不含特殊楼层的最大连续楼层数：排序
+
+力扣题目链接：[https://leetcode.cn/problems/maximum-consecutive-floors-without-special-floors/](https://leetcode.cn/problems/maximum-consecutive-floors-without-special-floors/)
+
+<p>Alice 管理着一家公司，并租用大楼的部分楼层作为办公空间。Alice 决定将一些楼层作为 <strong>特殊楼层</strong> ，仅用于放松。</p>
+
+<p>给你两个整数 <code>bottom</code> 和 <code>top</code> ，表示 Alice 租用了从 <code>bottom</code> 到 <code>top</code>（含 <code>bottom</code> 和 <code>top</code> 在内）的所有楼层。另给你一个整数数组 <code>special</code> ，其中 <code>special[i]</code> 表示&nbsp; Alice 指定用于放松的特殊楼层。</p>
+
+<p>返回不含特殊楼层的 <strong>最大</strong> 连续楼层数。</p>
+
+<p>&nbsp;</p>
+
+<p><strong>示例 1：</strong></p>
+
+<pre>
+<strong>输入：</strong>bottom = 2, top = 9, special = [4,6]
+<strong>输出：</strong>3
+<strong>解释：</strong>下面列出的是不含特殊楼层的连续楼层范围：
+- (2, 3) ，楼层数为 2 。
+- (5, 5) ，楼层数为 1 。
+- (7, 9) ，楼层数为 3 。
+因此，返回最大连续楼层数 3 。
+</pre>
+
+<p><strong>示例 2：</strong></p>
+
+<pre>
+<strong>输入：</strong>bottom = 6, top = 8, special = [7,6,8]
+<strong>输出：</strong>0
+<strong>解释：</strong>每层楼都被规划为特殊楼层，所以返回 0 。
+</pre>
+
+<p>&nbsp;</p>
+
+<p><strong>提示</strong></p>
+
+<ul>
+	<li><code>1 &lt;= special.length &lt;= 10<sup>5</sup></code></li>
+	<li><code>1 &lt;= bottom &lt;= special[i] &lt;= top &lt;= 10<sup>9</sup></code></li>
+	<li><code>special</code> 中的所有值 <strong>互不相同</strong></li>
+</ul>
+
+
+    
+## 解题方法：排序
+
+对“特殊楼层”从小到大排序，统计如下三者的最大值即为答案：
+
+1. $special[0] - bottom$
+2. $special[i] - special[i - 1] - 1$，其中$1\leq i\lt len(special)$
+3. $top - special[len(special) - 1]$
+
++ 时间复杂度$O(n\log n)$，其中$n=len(special)$
++ 空间复杂度$O(\log n)$
+
+### AC代码
+
+#### Python
+
+```python
+'''
+Author: LetMeFly
+Date: 2025-01-06 20:36:27
+LastEditors: LetMeFly.xyz
+LastEditTime: 2025-01-06 20:38:18
+'''
+from typing import List
+
+class Solution:
+    def maxConsecutive(self, bottom: int, top: int, special: List[int]) -> int:
+        special.sort()
+        ans = max(special[0] - bottom, top - special[-1])
+        for i in range(1, len(special)):
+            ans = max(ans, special[i] - special[i - 1] - 1)
+        return ans
+```
+
+#### C++
+
+```cpp
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-01-06 20:32:56
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-01-06 20:35:34
+ */
+class Solution {
+public:
+    int maxConsecutive(int bottom, int top, vector<int>& special) {
+        sort(special.begin(), special.end());
+        int ans = top - special.back();
+        bottom--;
+        for (int t : special) {
+            ans = max(ans, t - bottom - 1);
+            bottom = t;
+        }
+        return ans;
+    }
+};
+```
+
+#### Java
+
+```java
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-01-06 20:39:00
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-01-06 20:40:24
+ */
+import java.util.Arrays;
+
+class Solution {
+    public int maxConsecutive(int bottom, int top, int[] special) {
+        Arrays.sort(special);
+        int ans = Math.max(special[0] - bottom, top - special[special.length - 1]);
+        for (int i = 1; i < special.length; i++) {
+            ans = Math.max(ans, special[i] - special[i - 1] - 1);
+        }
+        return ans;
+    }
+}
+```
+
+#### Go
+
+```go
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-01-06 20:41:20
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-01-06 20:43:19
+ */
+package main
+import "sort"
+
+func max_MCFWSF(a, b int) int {
+    if a > b {
+        return a
+    }
+    return b
+}
+
+func maxConsecutive(bottom int, top int, special []int) (ans int) {
+    sort.Ints(special)
+    ans = max_MCFWSF(special[0] - bottom, top - special[len(special) - 1])
+    for i := 1; i < len(special); i++ {
+        ans = max_MCFWSF(ans, special[i] - special[i - 1] - 1)
+    }
+    return
+}
+```
+
+> 同步发文于CSDN和我的[个人博客](https://blog.letmefly.xyz/)，原创不易，转载经作者同意后请附上[原文链接](https://blog.letmefly.xyz/2025/01/06/LeetCode%202274.%E4%B8%8D%E5%90%AB%E7%89%B9%E6%AE%8A%E6%A5%BC%E5%B1%82%E7%9A%84%E6%9C%80%E5%A4%A7%E8%BF%9E%E7%BB%AD%E6%A5%BC%E5%B1%82%E6%95%B0/)哦~
+>
+> Tisfy：[https://letmefly.blog.csdn.net/article/details/144972086](https://letmefly.blog.csdn.net/article/details/144972086)

Solutions/Other-English-LearningNotes-SomeWords.md

@@ -924,6 +924,9 @@ tags: [其他, 知识, 英语, Notes]
 |torment|n. 痛苦，折磨，苦难之源<br/>v. 折磨，使痛苦|
 |procurement|n. (政府/机构的)采购|
 |righteous|ajd. 公正的，正直的，正当的，公平合理的|
+|||
+|snore|n. 鼾声<br/>v. 打鼾|
+|lark|n. 云雀，百灵鸟，玩乐，嬉戏<br/>v. 捉云雀，嬉戏，骑马越野，愚弄|
 
 <p class="wordCounts">单词收录总数</p>
 

Solutions/Other-Japanese-LearningNotes.md

@@ -1136,6 +1136,8 @@ xx型
 |彼わ背が低いです。<br/>他个子很低。|
 |昨日、ワンさんが死にました。<br/>昨天，小王死了。|
 |このから耳が痛くなりました。<br/>昨天耳朵开始疼。|
+|若い時はたくさん旅行しました。<br/>年轻的时候，旅行了很多。|
+|<br/>|
 |<br/>|
 |<br/>|
 |<br/>|