thảo luận Leetcode mỗi ngày

class Solution {
public:
    int countConsistentStrings(string allowed, vector<string>& words) {
        return accumulate(words.begin(), words.end(), 0, [s = set(allowed.begin(), allowed.end())] (int acc, const string& word) {
            return acc + all_of(word.begin(), word.end(), [&s] (int c) { return s.count(c); });
        });
    }
};

class Solution {
    public int minimumLength(String s) {
        int[] map = new int[26];
        int len = s.length();

        for(int i = 0; i < s.length(); i++) {
            map[s.charAt(i) - 'a']++;
        }

        for(int i : map) {
            if (i == 0)
                continue;
        
            len -= i % 2 == 1 ? i - 1 : i - 2;
        }

        return len;
    }
}

class Solution {
    public int countConsistentStrings(String s, String[] w) {
        int count = 0;
        int[] a = new int[26];
        for (char c : s.toCharArray())
            a[c - 'a'] = 1;
        for (String str : w) {
            boolean check = true;
            for (char c : str.toCharArray()) {
                if (a[c - 'a'] == 0) {
                    check = false;
                    break;
                }
            }
            count += check ? 1 : 0;
        }
        return count;
    }
}

class Solution:
    def minimumLength(self, s: str) -> int:
        return sum(0 if c == 0 else 1 if c % 2 == 1 else 2 for c in Counter(s).values())

class Solution {

    /**
     * @param String $allowed
     * @param String[] $words
     * @return Integer
     */
    function countConsistentStrings($allowed, $words) {
        // create set
        $set = [];
        for ($i=0; $i<strlen($allowed); $i++) {
            $set[$allowed[$i]] = true;
        }

        // count consistent
        $count = 0;
        foreach ($words as $w) {
            $consistent = 1;
            for ($i=0; $i<strlen($w); $i++) {
                if (isset($set[$w[$i]])) continue;

                $consistent = 0;
                break;
            }

            $count += $consistent;
        }

        return $count;
    }
}

class Solution:
    def countConsistentStrings(self, allowed: str, words: List[str]) -> int:
        res = 0
        set_string = set(allowed)
        for word in words:
            check = True
            for c in word:
                if c not in set_string:
                    check = False
                    break
            
            if check: res += 1
        
        return res

class Solution {
    public int countConsistentStrings(String allowed, String[] words) {
        int set =0;
        int cnt = words.length;
        for(char c:allowed.toCharArray()){
            set = set|(1<<(c-'a'));//set (c-'a')th bit to 1
        }
        for(String word:words){
            for(char c: word.toCharArray()){
                if((set&(1<<(c-'a')))==0) {//check (c-'a')th bit
                    cnt--;
                    break;
                }
            }
        }
        return cnt;
    }
}