Update Solution1, add Solution2

jingwen-z · jingwen-z · commit 9a77c1206c86 · 2020-05-03T13:18:58.000+02:00
diff --git a/May-LeetCoding-Challenge/03-Ransom-Note/Ransom-Note.py b/May-LeetCoding-Challenge/03-Ransom-Note/Ransom-Note.py
@@ -1,13 +1,31 @@
-class Solution:
+class Solution1:
     def canConstruct(self, ransomNote: str, magazine: str) -> bool:
         if ransomNote == magazine:
             return True
-        elif len(ransomNote) == len(magazine):
-            return False
         else:
             for r in ransomNote:
                 if r in magazine:
                     magazine = magazine.replace(r, '', 1)
                 else:
                     return False
             return True
+
+
+class Solution2:
+    def canConstruct(self, ransomNote: str, magazine: str) -> bool:
+        if ransomNote == magazine:
+            return True
+        else:
+            magazines_dict = {}
+            for m in magazine:
+                if m in magazines_dict:
+                    magazines_dict[m] += 1
+                else:
+                    magazines_dict[m] = 1
+
+            for r in ransomNote:
+                if r in magazines_dict and magazines_dict[r] > 0:
+                    magazines_dict[r] -= 1
+                else:
+                    return False
+            return True
