Ransom Note

383. Ransom Note

 

Question Editorial Solution

  My Submissions

• Total Accepted: 5902
• Total Submissions: 13061
• Difficulty: Easy


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.

public boolean canConstruct(String ransomNote, String magazine) {
        if(ransomNote == null) return true;
        if(magazine == null) return false;
        int[] counts = new int[26];
        for(int i = 0; i < magazine.length(); i++) {
            counts[magazine.charAt(i) - 'a']++;
        }
        for(int i = 0; i < ransomNote.length(); i++){
            int index = ransomNote.charAt(i) - 'a';
            if(--counts[index] < 0) return false;
        }
        return true;
    }