【Leetcode】Ransom Note

标签：

题目链接：https://leetcode.com/problems/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

    public boolean canConstruct(String ransomNote, String magazine) {
        int[] map = new int[26];
        for(char mc:magazine.toCharArray()){
            map[mc-'a']++;
        }
        
        for(char rc:ransomNote.toCharArray()){
            if(map[rc-'a']>0){
                map[rc-'a']--;
            }else{
                return false;
            }
        }
        return true;
        
    }

【Leetcode】Ransom Note

标签：

原文地址：http://blog.csdn.net/yeqiuzs/article/details/52188263