feat: 20260313 check in

Author: NoyeArk

leetcode/5-周赛/第 416 场周赛/3296. 移山所需的最少秒数.md

@@ -1,7 +1,7 @@
 # [3296. 移山所需的最少秒数](https://leetcode.cn/problems/minimum-number-of-seconds-to-make-mountain-height-zero/description/)
 
-> **作者**：弘树
-> **日期**：2024-09-22
+> **日期**：2024-09-22、2026-03-13  
+> **知识点**：二分答案
 
 ## 1. 二分答案
 
@@ -32,6 +32,32 @@ $$
 - 时间复杂度: $O(nlogU)$
 - 空间复杂度: $O(1)$
 
+**Python3**
+
+```python
+class Solution:
+    def minNumberOfSeconds(self, mountainHeight: int, workerTimes: List[int]) -> int:
+        def check(minute):
+            height = 0
+            for workerTime in workerTimes:
+                h = int(sqrt(minute * 2 / workerTime))
+                while h * (h + 1) * workerTime > 2 * minute:
+                    h -= 1
+                height += h
+                if height >= mountainHeight:
+                    return True
+            return False
+
+        l, r = 1, int(1e17)
+        while l < r:
+            mid = l + r >> 1
+            if check(mid):
+                r = mid
+            else:
+                l = mid + 1
+        return r
+```
+
 **C++**
 
 ```C++

leetcode/其他/2826. 将三个组排序.md

@@ -1,6 +1,6 @@
 # [2826. 将三个组排序](https://leetcode.cn/problems/sorting-three-groups/description/)
 
-> **日期**：2025-05-22
+> **日期**：2025-05-22、2026-03-13  
 > **所用时间**：2min
 
 ## 1. 最长递增子序列
@@ -30,4 +30,19 @@ class Solution:
                 if nums[i] >= nums[j]:
                     f[i] = max(f[i], f[j] + 1)
         return len(nums) - max(f)
+```
+
+**Python3**
+
+```python
+class Solution:
+    def minimumOperations(self, nums: List[int]) -> int:
+        f = []
+        for x in nums:
+            i = bisect.bisect_right(f, x)
+            if i == len(f):
+                f.append(x)
+            else:
+                f[i] = x
+        return len(nums) - len(f)
 ```