1
class Solution {
2
  public boolean canConstruct(String ransomNote, String magazine) {
3
    char[] rs = ransomNote.toCharArray();
4
    char[] ms = magazine.toCharArray();
5

6
    HashMap<Character, Integer> rm = new HashMap<>();
7
    HashMap<Character, Integer> mz = new HashMap<>();
8

9
    for (char c : rs) {
10
      if (rm.containsKey(c)) {
11
        rm.put(c, rm.get(c) + 1);
12
      } else {
13
        rm.put(c, 1);
14
      }
15
    }
16

17
    for (char c : ms) {
18
      if (mz.containsKey(c)) {
19
        mz.put(c, mz.get(c) + 1);
20
      } else {
21
        mz.put(c, 1);
22
      }
23
    }
24

25
    for (char c : rm.keySet()) {
26
      if (!mz.containsKey(c) || mz.get(c) < rm.get(c)) {
27
        return false;
28
      }
29
    }
30
    return true;
31
  }
32
}