feat: update lc problems (#3488)

yanglbme · web-flow · commit 75d47fc7cf5f · 2024-09-04T09:03:15.000+08:00
diff --git a/lcof2/剑指 Offer II 086. 分割回文子字符串/README.md b/lcof2/剑指 Offer II 086. 分割回文子字符串/README.md
@@ -299,15 +299,15 @@ class Solution {
         n = s.count
         self.s = s
         f = Array(repeating: Array(repeating: true, count: n), count: n)
-        
+
         let chars = Array(s)
-        
+
         for i in stride(from: n - 1, through: 0, by: -1) {
             for j in i + 1 ..< n {
                 f[i][j] = chars[i] == chars[j] && f[i + 1][j - 1]
             }
         }
-        
+
         dfs(0)
         return ans
     }
diff --git a/lcof2/剑指 Offer II 092. 翻转字符/README.md b/lcof2/剑指 Offer II 092. 翻转字符/README.md
@@ -188,22 +188,22 @@ class Solution {
         let n = s.count
         var left0 = 0, right0 = 0
         let chars = Array(s)
-        
+
         for char in chars {
             if char == "0" {
                 right0 += 1
             }
         }
-        
+
         var ans = min(right0, n - right0)
-        
+
         for i in 1...n {
             let x = chars[i - 1] == "0" ? 0 : 1
             right0 -= x ^ 1
             left0 += x ^ 1
             ans = min(ans, i - left0 + right0)
         }
-        
+
         return ans
     }
 }
diff --git a/lcof2/剑指 Offer II 093. 最长斐波那契数列/README.md b/lcof2/剑指 Offer II 093. 最长斐波那契数列/README.md
@@ -198,10 +198,10 @@ class Solution {
         for i in 0..<n {
             mp[arr[i]] = i
         }
-        
+
         var dp = Array(repeating: Array(repeating: 2, count: n), count: n)
         var ans = 0
-        
+
         for i in 0..<n {
             for j in 0..<i {
                 let delta = arr[i] - arr[j]
@@ -211,7 +211,7 @@ class Solution {
                 }
             }
         }
-        
+
         return ans > 2 ? ans : 0
     }
 }
diff --git a/lcof2/剑指 Offer II 094. 最少回文分割/README.md b/lcof2/剑指 Offer II 094. 最少回文分割/README.md
@@ -256,28 +256,28 @@ class Solution {
     func minCut(_ s: String) -> Int {
         let n = s.count
         let sArray = Array(s)
-        
+
         var g = Array(repeating: Array(repeating: true, count: n), count: n)
-        
+
         for i in stride(from: n - 1, through: 0, by: -1) {
             for j in i + 1..<n {
                 g[i][j] = sArray[i] == sArray[j] && g[i + 1][j - 1]
             }
         }
-        
+
         var f = Array(repeating: 0, count: n)
         for i in 0..<n {
             f[i] = i
         }
-        
+
         for i in 1..<n {
             for j in 0...i {
                 if g[j][i] {
                     f[i] = min(f[i], j > 0 ? 1 + f[j - 1] : 0)
                 }
             }
         }
-        
+
         return f[n - 1]
     }
 }
diff --git a/lcof2/剑指 Offer II 096. 字符串交织/README.md b/lcof2/剑指 Offer II 096. 字符串交织/README.md
@@ -694,11 +694,11 @@ class Solution {
         if m + n != s3.count {
             return false
         }
-        
+
         let s1 = Array(s1), s2 = Array(s2), s3 = Array(s3)
         var dp = Array(repeating: Array(repeating: false, count: n + 1), count: m + 1)
         dp[0][0] = true
-        
+
         for i in 0...m {
             for j in 0...n {
                 let k = i + j - 1
@@ -710,7 +710,7 @@ class Solution {
                 }
             }
         }
-        
+
         return dp[m][n]
     }
 }
diff --git a/solution/2800-2899/2860.Happy Students/README.md b/solution/2800-2899/2860.Happy Students/README.md
@@ -103,6 +103,7 @@ class Solution:
                 continue
             if i < n and nums[i] <= i:
                 continue
+            ans += 1
         return ans
 ```
 
diff --git a/solution/2800-2899/2860.Happy Students/README_EN.md b/solution/2800-2899/2860.Happy Students/README_EN.md
@@ -101,6 +101,7 @@ class Solution:
                 continue
             if i < n and nums[i] <= i:
                 continue
+            ans += 1
         return ans
 ```
 
diff --git a/solution/2800-2899/2860.Happy Students/Solution.py b/solution/2800-2899/2860.Happy Students/Solution.py
@@ -8,4 +8,5 @@ def countWays(self, nums: List[int]) -> int:
                 continue
             if i < n and nums[i] <= i:
                 continue
+            ans += 1
         return ans
diff --git a/solution/2900-2999/2976.Minimum Cost to Convert String I/README.md b/solution/2900-2999/2976.Minimum Cost to Convert String I/README.md
@@ -53,8 +53,8 @@ tags:
 <strong>输入：</strong>source = "aaaa", target = "bbbb", original = ["a","c"], changed = ["c","b"], cost = [1,2]
 <strong>输出：</strong>12
 <strong>解释：</strong>要将字符 'a' 更改为 'b'：
-- 将字符 'a' 更改为 'c'，成本为 1
-- 将字符 'c' 更改为 'b'，成本为 2
+- 将字符 'a' 更改为 'c'，成本为 1 
+- 将字符 'c' 更改为 'b'，成本为 2 
 产生的总成本是 1 + 2 = 3。
 将所有 'a' 更改为 'b'，产生的总成本是 3 * 4 = 12 。
 </pre>
diff --git a/solution/3200-3299/3268.Find Overlapping Shifts II/README.md b/solution/3200-3299/3268.Find Overlapping Shifts II/README.md
@@ -30,12 +30,12 @@ tags:
 这张表包含员工的排班工作，包括特定日期的开始和结束时间。
 </pre>
 
-<p>编写一个解决方案来为每个员工分析重叠排班。如果一个排班的&nbsp;<code>end_time</code>&nbsp;比另一个排班的&nbsp;<code>start_time</code>&nbsp;<strong>更晚&nbsp;</strong>则认为两个排班重叠。</p>
+<p>编写一个解决方案来为每个员工分析重叠排班。如果两个排班在&nbsp;<strong>同一天</strong>&nbsp;且一个排班的&nbsp;<code>end_time</code>&nbsp;比另一个排班的&nbsp;<code>start_time</code>&nbsp;<strong>更晚&nbsp;</strong>则认为两个排班重叠。</p>
 
 <p>对于&nbsp;<strong>每个员工</strong>，计算如下内容：</p>
 
 <ol>
-	<li>任何 <strong>给定时间</strong><strong>重叠&nbsp;</strong>的 <strong>最大</strong> 班次数。</li>
+	<li>任何 <strong>给定时间</strong> 的 <strong>最多重叠</strong> 班次数。</li>
 	<li>所有重叠班次的 <strong>总持续时间</strong>，以分钟为单位。</li>
 </ol>
 
diff --git a/solution/3200-3299/3269.Constructing Two Increasing Arrays/README.md b/solution/3200-3299/3269.Constructing Two Increasing Arrays/README.md
@@ -2,6 +2,9 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3269.Constructing%20Two%20Increasing%20Arrays/README.md
+tags:
+    - 数组
+    - 动态规划
 ---
 
 <!-- problem:start -->
diff --git a/solution/3200-3299/3269.Constructing Two Increasing Arrays/README_EN.md b/solution/3200-3299/3269.Constructing Two Increasing Arrays/README_EN.md
@@ -2,6 +2,9 @@
 comments: true
 difficulty: Hard
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3269.Constructing%20Two%20Increasing%20Arrays/README_EN.md
+tags:
+    - Array
+    - Dynamic Programming
 ---
 
 <!-- problem:start -->
diff --git a/solution/3200-3299/3270.Find the Key of the Numbers/README.md b/solution/3200-3299/3270.Find the Key of the Numbers/README.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3270.Find%20the%20Key%20of%20the%20Numbers/README.md
+tags:
+    - 数学
 ---
 
 <!-- problem:start -->
diff --git a/solution/3200-3299/3270.Find the Key of the Numbers/README_EN.md b/solution/3200-3299/3270.Find the Key of the Numbers/README_EN.md
@@ -2,6 +2,8 @@
 comments: true
 difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3270.Find%20the%20Key%20of%20the%20Numbers/README_EN.md
+tags:
+    - Math
 ---
 
 <!-- problem:start -->
diff --git a/solution/3200-3299/3271.Hash Divided String/README.md b/solution/3200-3299/3271.Hash Divided String/README.md
@@ -2,6 +2,9 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3271.Hash%20Divided%20String/README.md
+tags:
+    - 字符串
+    - 模拟
 ---
 
 <!-- problem:start -->
diff --git a/solution/3200-3299/3271.Hash Divided String/README_EN.md b/solution/3200-3299/3271.Hash Divided String/README_EN.md
@@ -2,6 +2,9 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3271.Hash%20Divided%20String/README_EN.md
+tags:
+    - String
+    - Simulation
 ---
 
 <!-- problem:start -->
diff --git a/solution/3200-3299/3272.Find the Count of Good Integers/README.md b/solution/3200-3299/3272.Find the Count of Good Integers/README.md
@@ -2,6 +2,11 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3272.Find%20the%20Count%20of%20Good%20Integers/README.md
+tags:
+    - 哈希表
+    - 数学
+    - 组合数学
+    - 枚举
 ---
 
 <!-- problem:start -->
diff --git a/solution/3200-3299/3272.Find the Count of Good Integers/README_EN.md b/solution/3200-3299/3272.Find the Count of Good Integers/README_EN.md
@@ -2,6 +2,11 @@
 comments: true
 difficulty: Hard
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3272.Find%20the%20Count%20of%20Good%20Integers/README_EN.md
+tags:
+    - Hash Table
+    - Math
+    - Combinatorics
+    - Enumeration
 ---
 
 <!-- problem:start -->
diff --git a/solution/3200-3299/3273.Minimum Amount of Damage Dealt to Bob/README.md b/solution/3200-3299/3273.Minimum Amount of Damage Dealt to Bob/README.md
@@ -2,6 +2,10 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3273.Minimum%20Amount%20of%20Damage%20Dealt%20to%20Bob/README.md
+tags:
+    - 贪心
+    - 数组
+    - 排序
 ---
 
 <!-- problem:start -->
diff --git a/solution/3200-3299/3273.Minimum Amount of Damage Dealt to Bob/README_EN.md b/solution/3200-3299/3273.Minimum Amount of Damage Dealt to Bob/README_EN.md
@@ -2,6 +2,10 @@
 comments: true
 difficulty: Hard
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3273.Minimum%20Amount%20of%20Damage%20Dealt%20to%20Bob/README_EN.md
+tags:
+    - Greedy
+    - Array
+    - Sorting
 ---
 
 <!-- problem:start -->
diff --git a/solution/3200-3299/3274.Check if Two Chessboard Squares Have the Same Color/README.md b/solution/3200-3299/3274.Check if Two Chessboard Squares Have the Same Color/README.md
@@ -2,6 +2,9 @@
 comments: true
 difficulty: 简单
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3274.Check%20if%20Two%20Chessboard%20Squares%20Have%20the%20Same%20Color/README.md
+tags:
+    - 数学
+    - 字符串
 ---
 
 <!-- problem:start -->
diff --git a/solution/3200-3299/3274.Check if Two Chessboard Squares Have the Same Color/README_EN.md b/solution/3200-3299/3274.Check if Two Chessboard Squares Have the Same Color/README_EN.md
@@ -2,6 +2,9 @@
 comments: true
 difficulty: Easy
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3274.Check%20if%20Two%20Chessboard%20Squares%20Have%20the%20Same%20Color/README_EN.md
+tags:
+    - Math
+    - String
 ---
 
 <!-- problem:start -->
diff --git a/solution/3200-3299/3275.K-th Nearest Obstacle Queries/README.md b/solution/3200-3299/3275.K-th Nearest Obstacle Queries/README.md
@@ -2,6 +2,9 @@
 comments: true
 difficulty: 中等
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3275.K-th%20Nearest%20Obstacle%20Queries/README.md
+tags:
+    - 数组
+    - 堆（优先队列）
 ---
 
 <!-- problem:start -->
diff --git a/solution/3200-3299/3275.K-th Nearest Obstacle Queries/README_EN.md b/solution/3200-3299/3275.K-th Nearest Obstacle Queries/README_EN.md
@@ -2,6 +2,9 @@
 comments: true
 difficulty: Medium
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3275.K-th%20Nearest%20Obstacle%20Queries/README_EN.md
+tags:
+    - Array
+    - Heap (Priority Queue)
 ---
 
 <!-- problem:start -->
diff --git a/solution/3200-3299/3276.Select Cells in Grid With Maximum Score/README.md b/solution/3200-3299/3276.Select Cells in Grid With Maximum Score/README.md
@@ -2,6 +2,12 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3276.Select%20Cells%20in%20Grid%20With%20Maximum%20Score/README.md
+tags:
+    - 位运算
+    - 数组
+    - 动态规划
+    - 状态压缩
+    - 矩阵
 ---
 
 <!-- problem:start -->
diff --git a/solution/3200-3299/3276.Select Cells in Grid With Maximum Score/README_EN.md b/solution/3200-3299/3276.Select Cells in Grid With Maximum Score/README_EN.md
@@ -2,6 +2,12 @@
 comments: true
 difficulty: Hard
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3276.Select%20Cells%20in%20Grid%20With%20Maximum%20Score/README_EN.md
+tags:
+    - Bit Manipulation
+    - Array
+    - Dynamic Programming
+    - Bitmask
+    - Matrix
 ---
 
 <!-- problem:start -->
diff --git a/solution/3200-3299/3277.Maximum XOR Score Subarray Queries/README.md b/solution/3200-3299/3277.Maximum XOR Score Subarray Queries/README.md
@@ -2,6 +2,9 @@
 comments: true
 difficulty: 困难
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3277.Maximum%20XOR%20Score%20Subarray%20Queries/README.md
+tags:
+    - 数组
+    - 动态规划
 ---
 
 <!-- problem:start -->
diff --git a/solution/3200-3299/3277.Maximum XOR Score Subarray Queries/README_EN.md b/solution/3200-3299/3277.Maximum XOR Score Subarray Queries/README_EN.md
@@ -2,6 +2,9 @@
 comments: true
 difficulty: Hard
 edit_url: https://github.com/doocs/leetcode/edit/main/solution/3200-3299/3277.Maximum%20XOR%20Score%20Subarray%20Queries/README_EN.md
+tags:
+    - Array
+    - Dynamic Programming
 ---
 
 <!-- problem:start -->
diff --git a/solution/3200-3299/3278.Find Candidates for Data Scientist Position II/README.md b/solution/3200-3299/3278.Find Candidates for Data Scientist Position II/README.md
diff --git a/solution/DATABASE_README.md b/solution/DATABASE_README.md
diff --git a/solution/DATABASE_README_EN.md b/solution/DATABASE_README_EN.md
diff --git a/solution/README.md b/solution/README.md
diff --git a/solution/README_EN.md b/solution/README_EN.md

Original file line number	Diff line number	Diff line change
`@@ -299,15 +299,15 @@ class Solution {`
`299`	`299`	`n = s.count`
`300`	`300`	`self.s = s`
`301`	`301`	`f = Array(repeating: Array(repeating: true, count: n), count: n)`
`302`		`-`
	`302`	`+`
`303`	`303`	`let chars = Array(s)`
`304`		`-`
	`304`	`+`
`305`	`305`	`for i in stride(from: n - 1, through: 0, by: -1) {`
`306`	`306`	`for j in i + 1 ..< n {`
`307`	`307`	`f[i][j] = chars[i] == chars[j] && f[i + 1][j - 1]`
`308`	`308`	`}`
`309`	`309`	`}`
`310`		`-`
	`310`	`+`
`311`	`311`	`dfs(0)`
`312`	`312`	`return ans`
`313`	`313`	`}`
Original file line number	Diff line number	Diff line change
`@@ -188,22 +188,22 @@ class Solution {`
`188`	`188`	`let n = s.count`
`189`	`189`	`var left0 = 0, right0 = 0`
`190`	`190`	`let chars = Array(s)`
`191`		`-`
	`191`	`+`
`192`	`192`	`for char in chars {`
`193`	`193`	`if char == "0" {`
`194`	`194`	`right0 += 1`
`195`	`195`	`}`
`196`	`196`	`}`
`197`		`-`
	`197`	`+`
`198`	`198`	`var ans = min(right0, n - right0)`
`199`		`-`
	`199`	`+`
`200`	`200`	`for i in 1...n {`
`201`	`201`	`let x = chars[i - 1] == "0" ? 0 : 1`
`202`	`202`	`right0 -= x ^ 1`
`203`	`203`	`left0 += x ^ 1`
`204`	`204`	`ans = min(ans, i - left0 + right0)`
`205`	`205`	`}`
`206`		`-`
	`206`	`+`
`207`	`207`	`return ans`
`208`	`208`	`}`
`209`	`209`	`}`
Original file line number	Diff line number	Diff line change
`@@ -198,10 +198,10 @@ class Solution {`
`198`	`198`	`for i in 0..<n {`
`199`	`199`	`mp[arr[i]] = i`
`200`	`200`	`}`
`201`		`-`
	`201`	`+`
`202`	`202`	`var dp = Array(repeating: Array(repeating: 2, count: n), count: n)`
`203`	`203`	`var ans = 0`
`204`		`-`
	`204`	`+`
`205`	`205`	`for i in 0..<n {`
`206`	`206`	`for j in 0..<i {`
`207`	`207`	`let delta = arr[i] - arr[j]`
`@@ -211,7 +211,7 @@ class Solution {`
`211`	`211`	`}`
`212`	`212`	`}`
`213`	`213`	`}`
`214`		`-`
	`214`	`+`
`215`	`215`	`return ans > 2 ? ans : 0`
`216`	`216`	`}`
`217`	`217`	`}`
Original file line number	Diff line number	Diff line change
`@@ -256,28 +256,28 @@ class Solution {`
`256`	`256`	`func minCut(_ s: String) -> Int {`
`257`	`257`	`let n = s.count`
`258`	`258`	`let sArray = Array(s)`
`259`		`-`
	`259`	`+`
`260`	`260`	`var g = Array(repeating: Array(repeating: true, count: n), count: n)`
`261`		`-`
	`261`	`+`
`262`	`262`	`for i in stride(from: n - 1, through: 0, by: -1) {`
`263`	`263`	`for j in i + 1..<n {`
`264`	`264`	`g[i][j] = sArray[i] == sArray[j] && g[i + 1][j - 1]`
`265`	`265`	`}`
`266`	`266`	`}`
`267`		`-`
	`267`	`+`
`268`	`268`	`var f = Array(repeating: 0, count: n)`
`269`	`269`	`for i in 0..<n {`
`270`	`270`	`f[i] = i`
`271`	`271`	`}`
`272`		`-`
	`272`	`+`
`273`	`273`	`for i in 1..<n {`
`274`	`274`	`for j in 0...i {`
`275`	`275`	`if g[j][i] {`
`276`	`276`	`f[i] = min(f[i], j > 0 ? 1 + f[j - 1] : 0)`
`277`	`277`	`}`
`278`	`278`	`}`
`279`	`279`	`}`
`280`		`-`
	`280`	`+`
`281`	`281`	`return f[n - 1]`
`282`	`282`	`}`
`283`	`283`	`}`
Original file line number	Diff line number	Diff line change
`@@ -694,11 +694,11 @@ class Solution {`
`694`	`694`	`if m + n != s3.count {`
`695`	`695`	`return false`
`696`	`696`	`}`
`697`		`-`
	`697`	`+`
`698`	`698`	`let s1 = Array(s1), s2 = Array(s2), s3 = Array(s3)`
`699`	`699`	`var dp = Array(repeating: Array(repeating: false, count: n + 1), count: m + 1)`
`700`	`700`	`dp[0][0] = true`
`701`		`-`
	`701`	`+`
`702`	`702`	`for i in 0...m {`
`703`	`703`	`for j in 0...n {`
`704`	`704`	`let k = i + j - 1`
`@@ -710,7 +710,7 @@ class Solution {`
`710`	`710`	`}`
`711`	`711`	`}`
`712`	`712`	`}`
`713`		`-`
	`713`	`+`
`714`	`714`	`return dp[m][n]`
`715`	`715`	`}`
`716`	`716`	`}`