您的位置 首页 JAVA(2017)

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;
    }
}
看完了?留个评分呗?
[0人评了分,平均: 0/5]

本站原创文章皆遵循“署名-非商业性使用-相同方式共享 3.0 (CC BY-NC-SA 3.0)”。转载请保留以下标注:

原文来源:《LeetCode – 383. Ransom Note》

发表评论

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

返回顶部