Add Solution.java to problems 1347

Author: huaxu1024

solution/1347. Minimum Number of Steps to Make Two Strings Anagram/README_EN.md

@@ -0,0 +1,37 @@
+# Minimum Number of Steps to Make Two Strings Anagram
+
+Given two equal-size strings s and t. In one step you can choose any character of t and replace it with another character.
+
+Return the minimum number of steps to make t an anagram of s.
+
+An Anagram of a string is a string that contains the same characters with a different (or the same) ordering.
+
+## Example 1:
+```
+    Input: s = "bab", t = "aba"
+    Output: 1
+    Explanation: Replace the first 'a' in t with b, t = "bba" which is anagram of s.
+ 
+```
+
+## Example 2:
+```
+    Input: s = "leetcode", t = "practice"
+    Output: 5
+    Explanation: Replace 'p', 'r', 'a', 'i' and 'c' from t with proper characters to make t anagram of s.
+
+```
+
+## Example 3:
+```
+    Input: s = "anagram", t = "mangaar"
+    Output: 0
+    Explanation: "anagram" and "mangaar" are anagrams. 
+    
+```
+
+
+## Constraints:
+   * 1 <= s.length <= 50000
+   * s.length == t.length
+   * s and t contain lower-case English letters only.

solution/1347. Minimum Number of Steps to Make Two Strings Anagram/Solution.java

@@ -0,0 +1,19 @@
+import java.util.*;
+
+class Solution {
+    public int minSteps(String s, String t) {
+        Map<Character, Integer> map = new HashMap<>();
+        for (char c : t.toCharArray()) {
+            if (map.containsKey(c)) {
+                map.put(c, map.get(c) + 1);
+            } else map.put(c, 1);
+        }
+        int res = 0;
+        for (char c : s.toCharArray()) {
+            if (map.containsKey(c) && map.get(c) > 0) {
+                map.put(c, map.get(c) - 1);
+            } else res ++;
+        }
+        return res;
+    }
+}