update: 添加问题“955.删列造序II”的代码和题解 (#1271)

955: AC.cpp - AC,100.00,81.82% (#1270) + word(en)

一遍过喽

Signed-off-by: LetMeFly666 <[email protected]>

Author: LetMeFly666

.commitmsg

@@ -1,10 +1,3 @@
-944: AC.cpp+java+py+go+rust(#1268) + word(en) + 1problem1day
+955: AC.cpp - AC,100.00,81.82% (#1270) + word(en)
 
-cpp - WA
-cpp - AC,27.82%,45.86%
-py(oneline) - CE
-py(oneline) - AC,11.04%,70.13%
-go - AC,100.00%,38.89%
-java - AC,84.34%,6.03%
-rust - CE
-rust - AC,33.33%,83.33%
+一遍过喽

.github/workflows/1problem1day-autoGenIssueEveryday.yml

@@ -45,4 +45,4 @@ jobs:
             --body "By Github Actions | [$id.$title](https://leetcode.cn/problems/$slug/) | $date" \
             --label 题解 \
             --assignee LetMeFly666 \
-            --repo LetMeFly666/LeetCode-test
+            --repo "${{ github.repository }}"

.github/workflows/1problem1day-closeAndSetDate.yml

@@ -25,7 +25,7 @@ jobs:
           closed_at="${{ github.event.issue.closed_at }}"
           date_cn=$(date -d "$closed_at +8 hours" +%F)
 
-                    echo "Query project item_id via Issue.projectItems..."
+          echo "Query project item_id via Issue.projectItems..."
           item_id=$(gh api graphql -f query='
             query($issue:ID!) {
               node(id:$issue) {

Codes/0944-delete-columns-to-make-sorted_20251220.cpp

@@ -2,21 +2,20 @@
  * @Author: LetMeFly
  * @Date: 2025-12-20 22:44:28
  * @LastEditors: LetMeFly.xyz
- * @LastEditTime: 2025-12-20 22:46:33
+ * @LastEditTime: 2025-12-20 22:48:32
  */
 #if defined(_WIN32) || defined(__APPLE__)
 #include "_[1,2]toVector.h"
 #endif
 
-// THIS CAN NOT AC
 class Solution {
 public:
     int minDeletionSize(vector<string>& strs) {
         int n = strs.size(), m = strs[0].size();
         int ans = 0;
         for (int j = 0; j < m; j++) {
             for (int i = 1; i < n; i++) {
-                if (strs[i][j] <= strs[i - 1][j]) {
+                if (strs[i][j] < strs[i - 1][j]) {  // 好吧，相同相邻字符是合法的
                     ans++;
                     break;
                 }

Codes/0944-delete-columns-to-make-sorted_20251220.py

@@ -2,11 +2,10 @@
 Author: LetMeFly
 Date: 2025-12-20 22:44:28
 LastEditors: LetMeFly.xyz
-LastEditTime: 2025-12-20 22:52:49
+LastEditTime: 2025-12-20 22:55:49
 '''
 from typing import List
 
-# THIS CAN NOT ACCESS
 class Solution:
     def minDeletionSize(self, strs: List[str]) -> int:
-        return sum(any(strs[i][j] < strs[i-1][j] for i in range(1, len(strs)) for j in range(len(strs))))
+        return sum(any(strs[i][j] < strs[i-1][j] for i in range(1, len(strs))) for j in range(len(strs[0])))

Codes/0944-delete-columns-to-make-sorted_20251220.rs

@@ -2,17 +2,16 @@
  * @Author: LetMeFly
  * @Date: 2025-12-20 22:44:28
  * @LastEditors: LetMeFly.xyz
- * @LastEditTime: 2025-12-20 23:02:29
+ * @LastEditTime: 2025-12-20 23:02:37
  */
-// THIS CANNOT ACCESS
 impl Solution {
     pub fn min_deletion_size(strs: Vec<String>) -> i32 {
         let n = strs.len();
         let m = strs[0].len();
         let mut ans: i32 = 0;
         for j in 0..m {
-            for i in 0..n {
-                if strs[i][j] < strs[i-1][j] {
+            for i in 1..n {
+                if strs[i].chars().nth(j).unwrap() < strs[i-1].chars().nth(j).unwrap() {
                     ans += 1;
                     break;
                 }

Codes/0944-delete-columns-to-make-sorted_20251220_AC.cpp

@@ -0,0 +1,45 @@
+/*
+ * @Author: LetMeFly
+ * @Date: 2025-12-21 20:40:47
+ * @LastEditors: LetMeFly.xyz
+ * @LastEditTime: 2025-12-21 20:46:33
+ */
+#if defined(_WIN32) || defined(__APPLE__)
+#include "_[1,2]toVector.h"
+#endif
+
+class Solution {
+public:
+    int minDeletionSize(vector<string>& strs) {
+        int ans = 0;
+        int n = strs.size(), m = strs[0].size();
+        int totalSkip = 1;  // 第一行不用校验
+        vector<bool> canSkip(n);
+        for (int j = 0; j < m; j++) {
+            bool can = true;
+            for (int i = 1; i < n; i++) {
+                if (canSkip[i]) {
+                    continue;
+                }
+                if (strs[i][j] < strs[i-1][j]) {
+                    can = false;
+                    break;
+                }
+            }
+            if (can) {
+                for (int i = 1; i < n; i++) {
+                    if (strs[i][j] != strs[i-1][j] && !canSkip[i]) {
+                        canSkip[i] = true;
+                        totalSkip++;
+                        if (totalSkip == n) {
+                            return ans;
+                        }
+                    }
+                }
+            } else {
+                ans++;
+            }
+        }
+        return ans;
+    }
+};