【Leetcode 1832 】 判断句子是否为全字母句 —— 忙忙碌碌哈希表不如一行代码速度快

全字母句 指包含英语字母表中每个字母至少一次的句子。

给你一个仅由小写英文字母组成的字符串 sentence ，请你判断 sentence 是否为 全字母句 。

如果是，返回 true ；否则，返回 false 。

示例 1：

输入：sentence = "thequickbrownfoxjumpsoverthelazydog"
输出：true
解释：sentence 包含英语字母表中每个字母至少一次。

示例 2：

输入：sentence = "leetcode"
输出：false

提示：

• 1 <= sentence.length <= 1000
• sentence 由小写英语字母组成

哈希表

function checkIfPangram1(sentence: string): boolean {const charSet = new Set(["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z",]);for (const char of sentence) {if (charSet.has(char)) {charSet.delete(char);}if (charSet.size === 0) {return true;}}return false;
}

一行代码

function checkIfPangram(sentence: string): boolean {return new Set(sentence).size === 26;
}