https://leetcode.cn/problems/ransom-note

Author: masx200

README.md

@@ -49,6 +49,8 @@ Step 2. Add the dependency
 
 <summary>展开查看</summary>
 
+https://leetcode.cn/problems/ransom-note
+
 https://leetcode.cn/problems/valid-perfect-square
 
 https://leetcode.cn/problems/insufficient-nodes-in-root-to-leaf-paths

ransom-note/index.cxx

@@ -0,0 +1,33 @@
+module;
+#include <unordered_map>
+#include <string>
+export module ransom_note.Solution;
+namespace ransom_note
+{
+    using std::string;
+    using std::unordered_map;
+    export class Solution
+    {
+
+    public:
+        bool canConstruct(string ransomNote, string magazine)
+        {
+
+            auto map1 = unordered_map<char, int>{};
+
+            for (auto c : magazine)
+            {
+                map1[c]++;
+            }
+
+            for (auto c : ransomNote)
+            {
+                map1[c]--;
+                if (map1[c] < 0)
+                    return false;
+            }
+            return true;
+        }
+    };
+
+}

ransom-note/index.ts

@@ -0,0 +1,17 @@
+export default function canConstruct(
+    ransomNote: string,
+    magazine: string,
+): boolean {
+    const map1 = new Map<string, number>();
+
+    for (const c of magazine) {
+        map1.set(c, 1 + ((map1.get(c)) ?? 0));
+    }
+
+    for (const c of ransomNote) {
+        map1.set(c, -1 + ((map1.get(c)) ?? 0));
+
+        if (((map1.get(c)) ?? 0) < 0) return false;
+    }
+    return true;
+}