383. Ransom Note

JIAKAOBO

LeetCode

感谢赞助!

• ㊗️
• 大家
• offer
• 多多！

Problem

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.

Example 1:

Input: ransomNote = "a", magazine = "b"
Output: false

Example 2:

Input: ransomNote = "aa", magazine = "ab"
Output: false

Example 3:

Input: ransomNote = "aa", magazine = "aab"
Output: true

Code

class Solution {
    public boolean canConstruct(String ransomNote, String magazine) {
        int[] dict = new int[26];

        for(char c : magazine.toCharArray()){
            dict[c - 'a']++;
        }

        for(char c : ransomNote.toCharArray()){
            dict[c - 'a']--;
        }

        for(int i = 0; i < 26; i++){
            if(dict[i] < 0) return false;
        }

        return true;
    }
}