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 class Solution {
    public boolean canConstruct(String ransomNote, String magazine) {
        if(ransomNote.equals("")){
            return true;
        }
        String[] mag = magazine.split("");
        String[] ran = ransomNote.split("");
        ArrayList<String> m = new ArrayList<String>();
        for(String i:mag){
            m.add(i);
        }
        boolean res = true;
        for(String i:ran){
            boolean temp = false;
            for(int j = 0;j<m.size();j++){
                if(i.equals(m.get(j))){
                    temp = true;
                    m.remove(j);
                    break;
                }
            }
                if(!temp){
                    res = false;
                    break;
                }
        }
        return res;
    }
}

383. ransom note 解答

解答

近期文章

近期评论

标签

热门

文章归档

分类目录

功能