960

Author: mkmark

leetcode/960/0.in

@@ -0,0 +1 @@
+["babbba","bbaaab"]

leetcode/960/main.cpp

@@ -0,0 +1,40 @@
+/*
+author: [email protected]
+*/
+
+#include <bits/stdc++.h>
+#include "../../lib/LeetCodeInput.hpp"
+#include "solution.cpp"
+using namespace std;
+
+int main()
+{
+    LeetCodeInput li("0.in");
+
+    // vector<vector<int>> mat_1 = li.get_vvi(0);
+    // vector<int> arr_1 = li.get_vi(0);
+    // int num_1 = li.get_i(0);
+    // string s_1 = li.get_s(0);
+    vector<string> arr_1 = li.get_vs(0);
+
+    chrono::steady_clock::time_point begin = chrono::steady_clock::now();
+    Solution solution;
+    auto output = solution.minDeletionSize(arr_1);
+    chrono::steady_clock::time_point end = chrono::steady_clock::now();
+    cout << "Time difference = " << chrono::duration_cast<chrono::microseconds> (end - begin).count() << "µs" << endl;
+
+    cout << output << endl;
+
+    // for (int i: output){
+    //     cout << i << ' ';
+    // }
+
+    // for (auto i: output){
+    //     for (int j: i){
+    //         cout << j << ' ';
+    //     }
+    //     cout << '\n';
+    // }
+
+    return 0;
+}

leetcode/960/solution.cpp

@@ -0,0 +1,49 @@
+/*
+author: [email protected]
+time: O(nm^2)
+space: O(m)
+
+Runtime: 10 ms, faster than 100.00% of C++ online submissions for Delete Columns to Make Sorted III.
+Memory Usage: 10.3 MB, less than 51.49% of C++ online submissions for Delete Columns to Make Sorted III.
+*/
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+#define all(x) begin(x), end(x)
+typedef vector<int> vi;
+typedef vector<vector<int>> vvi;
+
+class Solution {
+public:
+    int dp[100];
+    int minDeletionSize(vector<string>& strs) {
+        int n = size(strs);
+        int m = size(strs[0]);
+        fill_n(dp, m, 1);
+        int k;
+        int dp_max = 0;
+        for (int i=0; i<m; ++i){
+            for (int j=i+1; j<m; ++j){
+                for (k=0; k<n; ++k){
+                    if (strs[k][i]>strs[k][j]){
+                        break;
+                    }
+                }
+                if (k==n){
+                    dp[j]=max(dp[j],dp[i]+1);
+                }
+            }
+            dp_max = max(dp_max, dp[i]);
+        }
+        return m-dp_max;
+    }
+};
+
+const static auto initialize = [] {
+    std::ios::sync_with_stdio(false);
+    std::cin.tie(nullptr);
+    std::cout.tie(nullptr);
+    return nullptr;
+}();