同步源码

Author: hxz1998

CPP/offer2/CMakeLists.txt

@@ -73,6 +73,8 @@ add_executable(Offer2_92 Offer2_92.cc)
 add_executable(Offer2_90 Offer2_90.cc)
 add_executable(Offer2_38 Offer2_38.cc)
 add_executable(Offer2_73 Offer2_73.cc)
+add_executable(Offer2_65 Offer2_65.cc)
+add_executable(Offer2_86 Offer2_86.cc)
 add_executable(Offer2_63 Offer2_63.cc)
 add_executable(Offer2_62 Offer2_62.cc)
 add_executable(Offer2_53 Offer2_53.cc)
@@ -92,4 +94,3 @@ add_executable(Offer2_50 Offer2_50.cc)
 add_executable(Offer2_54 Offer2_54.cc)
 add_executable(Offer2_64 Offer2_64.cc)
 add_executable(Offer2_66 Offer2_66.cc)
-add_executable(Offer2_86 Offer2_86.cc)

CPP/offer2/Offer2_65.cc

@@ -0,0 +1,71 @@
+/*
+ * Created by Xiaozhong on 5/6/2022.
+ * Copyright (c) 5/6/2022 Xiaozhong. All rights reserved.
+ */
+
+#include "iostream"
+#include "vector"
+#include "algorithm"
+#include "string"
+#include "unordered_map"
+#include "unordered_set"
+#include "set"
+#include "map"
+#include "queue"
+#include "functional"
+#include "stack"
+
+#define mp make_pair
+
+using namespace std;
+
+class Solution {
+    struct Node {
+        bool isEnd;
+        vector<Node *> children;
+
+        Node() : isEnd(false), children(vector<Node *>(26, nullptr)) {}
+    };
+
+    void insert(const string &word) {
+        Node *curr = root;
+        for (int idx = static_cast<int>(word.size() - 1); idx >= 0; --idx) {
+            char c = word[idx];
+            if (curr->children[c - 'a'] == nullptr) curr->children[c - 'a'] = new Node();
+            curr->isEnd = false;
+            curr = curr->children[c - 'a'];
+        }
+        curr->isEnd = true;
+    }
+
+    void dfs(Node *curr, int path) {
+        if (curr == nullptr) return;
+        if (curr->isEnd) ans += path;
+        bool isLeaf = true;
+        for (Node *next: curr->children) {
+            if (next != nullptr) isLeaf = false;
+            dfs(next, path + 1);
+        }
+        if (isLeaf) ans += 1;
+    }
+
+public:
+    int minimumLengthEncoding(vector<string> &words) {
+        sort(words.begin(), words.end(), [](const string &lhs, const string &rhs) {
+            return lhs.size() < rhs.size();
+        });
+        for (const string &word: words) insert(word);
+        dfs(root, 0);
+        return ans;
+    }
+
+private:
+    int ans = 0;
+    Node *root = new Node();
+};
+
+int main(int argc, char **argv) {
+    vector<string> words = {"time", "me", "bell"};
+    Solution s;
+    cout << s.minimumLengthEncoding(words) << endl;
+}

CPP/offer2/Offer2_86.cc

@@ -57,4 +57,4 @@ class Solution {
 int main() {
     Solution s;
     s.partition("google");
-}
+}