leetcode 383. Ransom Note

最新推荐文章于 2023-10-30 12:28:05 发布

山月兰华

最新推荐文章于 2023-10-30 12:28:05 发布

阅读量220

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/shanyuelanhua/article/details/60761958

版权

leetcode 专栏收录该内容

37 篇文章 0 订阅

订阅专栏

public class Solution {
    public boolean canConstruct(String ransomNote, String magazine) {
        int[] alphabet1 = new int[26];
    	int[] alphabet2 = new int[26];
    	
    	for (char c: ransomNote.toCharArray()) 
    		alphabet1[(int)(c-'a')] ++;
    	for (char c: magazine.toCharArray()) 
    		alphabet2[(int)(c-'a')] ++;
    	int i = 0;
    	for(; i<26; i++)
    		if (alphabet1[i]>alphabet2[i])
    			break;
    	if (i>=26)
    		return true;
    	return false;
    }
}