ransom note

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

Solution

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

近期文章

近期评论

标签

热门

文章归档

分类目录

功能