LeetCode – 383. 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 class Solution {
    public boolean canConstruct(String ransomNote, String magazine) {
        int[] chars = new int[26];
        for(int i=0;i<magazine.length();i++){
            chars[magazine.charAt(i) - 'a'] ++;
        }
        for(int i=0;i<ransomNote.length();i++){
            chars[ransomNote.charAt(i) - 'a'] --;
            if(chars[ransomNote.charAt(i) - 'a'] <0){
                return false;
            }
        }        
        return true;
    }
}

邮件订阅,随时获取更新信息

发表评论

电子邮件地址不会被公开。

This site uses Akismet to reduce spam. Learn how your comment data is processed.