Leetcode(1684)--统计一致字符串的数目

文章目录

题目

1684.统计一致字符串的数目
给你一个由不同字符组成的字符串 allowed 和一个字符串数组 words 。如果一个字符串的每一个字符都在 allowed 中,就称这个字符串是 一致字符串 。
请你返回 words 数组中 一致字符串 的数目。

示例 1:

输入:allowed = "ab", words = ["ad","bd","aaab","baa","badab"]
输出:2
解释:字符串 "aaab""baa" 都是一致字符串,因为它们只包含字符 'a''b'

示例 2:

输入:allowed = "abc", words = ["a","b","c","ab","ac","bc","abc"]
输出:7
解释:所有字符串都是一致的。

示例 3:

输入:allowed = "cad", words = ["cc","acd","b","ba","bac","bad","ac","d"]
输出:4
解释:字符串 "cc""acd""ac""d" 是一致字符串。

提示:

1 <= words.length <= 104
1 <= allowed.length <= 26
1 <= words[i].length <= 10
allowed 中的字符 互不相同 。
words[i] 和 allowed 只包含小写英文字母。

题解(Java)

class Solution 
{
    
    
    public int countConsistentStrings(String allowed, String[] words)
    {
    
    
        int count = 0;
        for(int index = 0;index < words.length;index++)
        {
    
    
            if(contained(words[index],allowed))
            {
    
    
                count++;
            }
        }
        return count;
    }
    //判断s中的每一个字母是否都在allowed中
    public boolean contained(String s, String allowed)
    {
    
    
        int count = 0;
        for(int index = 0;index < s.length();index++)
        {
    
    
            char c = s.charAt(index);
            for(int scan = 0;scan < allowed.length();scan++)
            {
    
    
                if(c == allowed.charAt(scan))
                {
    
    
                    count++;
                    break;
                }
            }
        }
        return count == s.length();
    }
}

猜你喜欢

转载自blog.csdn.net/weixin_46841376/article/details/114664270