|
| 1 | +packageeasy; |
| 2 | + |
| 3 | +importjava.util.HashMap; |
| 4 | +importjava.util.HashSet; |
| 5 | +importjava.util.Map; |
| 6 | +importjava.util.Set; |
| 7 | +/** |
| 8 | + * 383 Ransom Note: |
| 9 | + * Note: |
| 10 | +You may assume that both strings contain only lowercase letters. |
| 11 | +
|
| 12 | +canConstruct("a", "b") -> false |
| 13 | +canConstruct("aa", "ab") -> false |
| 14 | +canConstruct("aa", "aab") -> true |
| 15 | +*/ |
| 16 | +publicclassRansomNote { |
| 17 | +publicbooleancanConstruct(StringransomNote,Stringmagazine) { |
| 18 | +Map<Character,Integer>ransomMap =newHashMap(); |
| 19 | +Set<Character>ransomSet =newHashSet(); |
| 20 | +Map<Character,Integer>magazineMap =newHashMap(); |
| 21 | +Set<Character>magazineSet =newHashSet(); |
| 22 | +char[]ransom =ransomNote.toCharArray(); |
| 23 | +char[]maga =magazine.toCharArray(); |
| 24 | +for(inti =0;i <ransom.length;i++){ |
| 25 | +ransomSet.add(ransom[i]); |
| 26 | +ransomMap.put(ransom[i],ransomMap.getOrDefault(ransom[i],0)+1); |
| 27 | + } |
| 28 | +for(inti =0;i <maga.length;i++){ |
| 29 | +magazineSet.add(maga[i]); |
| 30 | +magazineMap.put(maga[i],magazineMap.getOrDefault(maga[i],0)+1); |
| 31 | + } |
| 32 | + |
| 33 | +for(charc :ransomSet){ |
| 34 | +if(!magazineSet.contains(c))returnfalse; |
| 35 | + } |
| 36 | +for(charc :ransomMap.keySet()){ |
| 37 | +if(!magazineMap.containsKey(c))returnfalse; |
| 38 | +if(magazineMap.get(c) <ransomMap.get(c))returnfalse; |
| 39 | + } |
| 40 | +returntrue; |
| 41 | + } |
| 42 | + |
| 43 | +publicstaticvoidmain(String...strings){ |
| 44 | +RansomNotetest =newRansomNote(); |
| 45 | +StringransomNote ="aa"; |
| 46 | +Stringmagazine ="aab"; |
| 47 | +System.out.println(test.canConstruct(ransomNote,magazine)); |
| 48 | + } |
| 49 | +} |