(Easy) Ransom Note - LeetCode

Description:

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

Accepted

122,871

Submissions

242,605

Solution:

class Solution {
    public boolean canConstruct(String ransomNote, String magazine) {

            if((magazine==null|| magazine.length()==0)&&(ransomNote==null || ransomNote.length()==0)){
                return true;
            }

            if(ransomNote==null||ransomNote.length()==0){
                return true;
            }

        for(int i = 0; i < ransomNote.length(); i++){

            if(Count(ransomNote, ransomNote.charAt(i)) > Count(magazine, ransomNote.charAt(i))){
                return false;
            }
        }

        return true;

    }

    static int Count(String str, Character a){

        int count = 0; 

        for(int i = 0; i < str.length(); i++){

            if(str.charAt(i)==a){
                count++;
            }
        }

        return count;
    }
}

原文地址：https://www.cnblogs.com/codingyangmao/p/11495871.html