202208270530

Author: mkmark

independent/202208270530/0.in

@@ -0,0 +1 @@
+"abaac"

independent/202208270530/README.md

@@ -0,0 +1 @@
+给你一个字符串，长度最大1e5，求最长连续子串使得里面每个字符出现的个数是偶数，只考虑小写字母

independent/202208270530/main.cpp

@@ -0,0 +1,39 @@
+/*
+author: [email protected]
+*/
+
+#include <bits/stdc++.h>
+#include "../../lib/LeetCodeInputTemplate.hpp"
+#include "solution.cpp"
+using namespace std;
+
+typedef vector<int> vi;
+typedef vector<vector<int>> vvi;
+
+int main()
+{
+    LeetCodeInput li("0.in");
+
+    auto l0 = li.get<string>(0);
+
+    chrono::steady_clock::time_point begin = chrono::steady_clock::now();
+    Solution solution;
+    auto output = solution.solution(l0);
+    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;
+}

independent/202208270530/solution.cpp

@@ -0,0 +1,41 @@
+/*
+author: [email protected]
+time: O()
+space: O()
+
+Runtime: 
+Memory Usage: 
+*/
+
+#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 solution(string s) {
+        int n = size(s);
+        unordered_map<uint32_t, int> pos_by_val;
+        uint32_t status = 0;
+        int ans = 0;
+        for (int i=0; i<n; ++i){
+            status ^= s[i]-'a';
+            auto res = pos_by_val.emplace(status, i);
+            if (!res.second){
+                ans = max(ans, i-(*res.first).second);
+            }
+        }
+        return ans;
+    }
+};
+
+const static auto initialize = [] {
+    std::ios::sync_with_stdio(false);
+    std::cin.tie(nullptr);
+    std::cout.tie(nullptr);
+    return nullptr;
+}();