feat: add python and java solutions to leetcode problem: No.0383

Author: yanglbme

README.md

@@ -66,6 +66,7 @@
 
 - [反转字符串中的元音字母](/solution/0300-0399/0345.Reverse%20Vowels%20of%20a%20String/README.md)
 - [字符串转换整数 (atoi)](/solution/0000-0099/0008.String%20to%20Integer%20%28atoi%29/README.md)
+- [赎金信](/solution/0300-0399/0383.Ransom%20Note/README.md)
 
 ### 链表
 

README_EN.md

@@ -63,6 +63,7 @@ Complete solutions to [LeetCode](https://leetcode-cn.com/problemset/all/), [LCOF
 
 - [Reverse Vowels of a String](/solution/0300-0399/0345.Reverse%20Vowels%20of%20a%20String/README_EN.md)
 - [String to Integer (atoi)](/solution/0000-0099/0008.String%20to%20Integer%20%28atoi%29/README_EN.md)
+- [Ransom Note](/solution/0300-0399/0383.Ransom%20Note/README_EN.md)
 
 ### Linked List
 

solution/0300-0399/0383.Ransom Note/README.md

@@ -23,22 +23,47 @@ canConstruct("aa", "aab") -> true
 
 <!-- 这里可写通用的实现逻辑 -->
 
+用一个数组或字典 chars 存放 magazine 中每个字母出现的次数。遍历 ransomNote 中每个字母，判断 chars 是否包含即可。
+
 <!-- tabs:start -->
 
 ### **Python3**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```python
-
+class Solution:
+    def canConstruct(self, ransomNote: str, magazine: str) -> bool:
+        chars = {}
+        for i in magazine:
+            chars[i] = chars.get(i, 0) + 1
+        for i in ransomNote:
+            if not chars.get(i):
+                return False
+            chars[i] -= 1
+        return True
 ```
 
 ### **Java**
 
 <!-- 这里可写当前语言的特殊实现逻辑 -->
 
 ```java
-
+class Solution {
+    public boolean canConstruct(String ransomNote, String magazine) {
+        int[] chars = new int[26];
+        for (int i = 0, n = magazine.length(); i < n; ++i) {
+            int idx = magazine.charAt(i) - 'a';
+            ++chars[idx];
+        }
+        for (int i = 0, n = ransomNote.length(); i < n; ++i) {
+            int idx = ransomNote.charAt(i) - 'a';
+            if (chars[idx] == 0) return false;
+            --chars[idx];
+        }
+        return true;
+    }
+}
 ```
 
 ### **...**

solution/0300-0399/0383.Ransom Note/README_EN.md

@@ -41,13 +41,36 @@ canConstruct("aa", "aab") -> true
 ### **Python3**
 
 ```python
-
+class Solution:
+    def canConstruct(self, ransomNote: str, magazine: str) -> bool:
+        chars = {}
+        for i in magazine:
+            chars[i] = chars.get(i, 0) + 1
+        for i in ransomNote:
+            if not chars.get(i):
+                return False
+            chars[i] -= 1
+        return True
 ```
 
 ### **Java**
 
 ```java
-
+class Solution {
+    public boolean canConstruct(String ransomNote, String magazine) {
+        int[] chars = new int[26];
+        for (int i = 0, n = magazine.length(); i < n; ++i) {
+            int idx = magazine.charAt(i) - 'a';
+            ++chars[idx];
+        }
+        for (int i = 0, n = ransomNote.length(); i < n; ++i) {
+            int idx = ransomNote.charAt(i) - 'a';
+            if (chars[idx] == 0) return false;
+            --chars[idx];
+        }
+        return true;
+    }
+}
 ```
 
 ### **...**

solution/0300-0399/0383.Ransom Note/Solution.java

@@ -0,0 +1,15 @@
+class Solution {
+    public boolean canConstruct(String ransomNote, String magazine) {
+        int[] chars = new int[26];
+        for (int i = 0, n = magazine.length(); i < n; ++i) {
+            int idx = magazine.charAt(i) - 'a';
+            ++chars[idx];
+        }
+        for (int i = 0, n = ransomNote.length(); i < n; ++i) {
+            int idx = ransomNote.charAt(i) - 'a';
+            if (chars[idx] == 0) return false;
+            --chars[idx];
+        }
+        return true;
+    }
+}

solution/0300-0399/0383.Ransom Note/Solution.py

@@ -0,0 +1,10 @@
+class Solution:
+    def canConstruct(self, ransomNote: str, magazine: str) -> bool:
+        chars = {}
+        for i in magazine:
+            chars[i] = chars.get(i, 0) + 1
+        for i in ransomNote:
+            if not chars.get(i):
+                return False
+            chars[i] -= 1
+        return True