443,652

Author: baishuai

algorithms/p443/443.hpp

@@ -0,0 +1,52 @@
+
+#ifndef LEETCODE_443_HPP
+#define LEETCODE_443_HPP
+
+#include <iostream>
+#include <queue>
+#include <algorithm>
+#include <vector>
+#include <unordered_map>
+#include <unordered_set>
+#include <set>
+#include <numeric>
+#include <stack>
+#include <string>
+
+using namespace std;
+
+
+class Solution {
+public:
+    int compress(vector<char> &chars) {
+        int cnt = 1, cur = 0;
+        char pre = 0;
+        for (int i = 0; i < chars.size(); ++i) {
+            if (chars[i] == pre) {
+                cnt++;
+            } else {
+                cur = writeOneChar(chars, pre, cnt, cur);
+                pre = chars[i];
+                cnt = 1;
+            }
+        }
+        cur = writeOneChar(chars, pre, cnt, cur);
+        return cur;
+
+    }
+
+    int writeOneChar(vector<char> &chars, char c, int cnt, int cur) {
+        if (c == 0)
+            return 0;
+        chars[cur++] = c;
+        if (cnt > 1) {
+            string count = to_string(cnt);
+            for (char c: count) {
+                chars[cur++] = c;
+            }
+        }
+        return cur;
+    }
+};
+
+#endif //LEETCODE_443_HPP

algorithms/p443/443_test.cpp

@@ -0,0 +1,9 @@
+
+#include "443.hpp"
+#include <gtest/gtest.h>
+
+TEST(p443, example) {
+    Solution s;
+    vector<char> arr = {'a', 'a', 'b', 'b', 'c', 'c', 'c'};
+    ASSERT_EQ(6, s.compress(arr));
+}

algorithms/p652/652.hpp

@@ -0,0 +1,44 @@
+
+#ifndef LEETCODE_652_HPP
+#define LEETCODE_652_HPP
+
+#include <iostream>
+#include <queue>
+#include <algorithm>
+#include <vector>
+#include <unordered_map>
+#include <unordered_set>
+#include <set>
+#include <numeric>
+#include <stack>
+#include <string>
+#include "../common/leetcode.hpp"
+
+using namespace std;
+
+class Solution {
+public:
+    vector<TreeNode *> findDuplicateSubtrees(TreeNode *root) {
+        trees.clear();
+        res.clear();
+        postorder(root);
+        return res;
+    }
+
+private:
+    unordered_map<string, int> trees;
+    vector<TreeNode *> res;
+
+    string postorder(TreeNode *node) {
+        if (node == nullptr) {
+            return "#";
+        }
+        string serial = to_string(node->val) + "," + (postorder(node->left)) + "," + (postorder(node->right));
+        trees[serial]++;
+        if (trees[serial] == 2)
+            res.emplace_back(node);
+        return serial;
+    }
+};
+
+#endif //LEETCODE_652_HPP

algorithms/p652/652_test.cpp

@@ -0,0 +1,7 @@
+
+#include "652.hpp"
+#include <gtest/gtest.h>
+
+TEST(p652, example) {
+    Solution s;
+}