feat(src): add 71-simplifyPath, 72-minDistance

Author: kwu130

src/71-simplifyPath.cpp

@@ -0,0 +1,45 @@
+//
+// Created by 1412 on 2025/11/10.
+//
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+class Solution {
+public:
+    string simplifyPath(string path) {
+        string res;
+        istringstream iss(path);
+        vector<string> st;
+        string str;
+        while (getline(iss, str, '/')) {
+            if (str == "" || str == ".") continue;
+            if (str == "..") {
+                if (!st.empty()) {
+                    st.pop_back();
+                }
+            } else {
+                st.push_back(str);
+            }
+        }
+        for (const auto& s : st) {
+            res += "/" + s;
+        }
+        return res.empty() ? "/" : res;
+    }
+};
+
+void test() {
+    Solution s;
+    assert(s.simplifyPath("/home/") == "/home");
+    assert(s.simplifyPath("/home//foo/") == "/home/foo");
+    assert(s.simplifyPath("/home/user/Documents/../Pictures") == "/home/user/Pictures");
+    assert(s.simplifyPath("/../") == "/");
+    assert(s.simplifyPath("/.../a/../b/c/../d/./") == "/.../b/d");
+}
+
+int main() {
+    test();
+    return 0;
+}

src/72-minDistance.cpp

@@ -0,0 +1,43 @@
+//
+// Created by 1412 on 2025/11/10.
+//
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+class Solution {
+public:
+    int minDistance(string word1, string word2) {
+        const int m = word1.size(), n = word2.size();
+        vector<vector<int>> dp(m + 1, vector<int>(n + 1));
+        for (int i = 0; i <= m; i++) {
+            dp[i][0] = i;
+        }
+        for (int j = 0; j <= n; j++) {
+            dp[0][j] = j;
+        }
+        for (int i = 1; i <= m; i++) {
+            for (int j = 1; j <= n; j++) {
+                if (word1[i - 1] == word2[j - 1]) {
+                    dp[i][j] = dp[i - 1][j - 1];
+                } else {
+                    // 分别对应 替换 插入 删除
+                    dp[i][j] = min(dp[i - 1][j - 1], min(dp[i - 1][j], dp[i][j - 1])) + 1;
+                }
+            }
+        }
+        return dp[m][n];
+    }
+};
+
+void test() {
+    Solution s;
+    assert(s.minDistance("horse", "ros") == 3);
+    assert(s.minDistance("intention", "execution") == 5);
+}
+
+int main() {
+    test();
+    return 0;
+}