leetcode RansomNote
z
 2019-04-09 10:36:27   
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
public class RansomNote {
  /**
   * Given an arbitrary ransom note string and another string containing letters from all the magazines,
   * write a function that will return true if the ransom note can be constructed from the magazines ;
   * otherwise, it will return false.
   *
   * Each letter in the magazine string can only be used once in your ransom note.
   *
   * Note:
   * You may assume that both strings contain only lowercase letters.
   *
   * canConstruct("a", "b") -> false
   * canConstruct("aa", "ab") -> false
   * canConstruct("aa", "aab") -> true
   */
  public boolean canConstruct(String ransomNote, String magazine) {
    int[] l = new int[26];
    for (char c: magazine.toCharArray()){
      l[c-'a'] ++;
    }

    for (char c: ransomNote.toCharArray()){
      if (--l[c-'a']<0)
        return false;
    }

    return true;
  }
}