42 lines
1.2 KiB
C++
42 lines
1.2 KiB
C++
// Source : https://leetcode.com/problems/check-if-the-sentence-is-pangram/
|
|
// Author : Hao Chen
|
|
// Date : 2021-04-20
|
|
|
|
/*****************************************************************************************************
|
|
*
|
|
* A pangram is a sentence where every letter of the English alphabet appears at least once.
|
|
*
|
|
* Given a string sentence containing only lowercase English letters, return true if sentence is a
|
|
* pangram, or false otherwise.
|
|
*
|
|
* Example 1:
|
|
*
|
|
* Input: sentence = "thequickbrownfoxjumpsoverthelazydog"
|
|
* Output: true
|
|
* Explanation: sentence contains at least one of every letter of the English alphabet.
|
|
*
|
|
* Example 2:
|
|
*
|
|
* Input: sentence = "leetcode"
|
|
* Output: false
|
|
*
|
|
* Constraints:
|
|
*
|
|
* 1 <= sentence.length <= 1000
|
|
* sentence consists of lowercase English letters.
|
|
******************************************************************************************************/
|
|
|
|
class Solution {
|
|
public:
|
|
bool checkIfPangram(string sentence) {
|
|
bool stat[26] = {false};
|
|
for(auto& c: sentence) {
|
|
stat[c - 'a'] = true;
|
|
}
|
|
for(auto& s : stat) {
|
|
if (!s) return false;
|
|
}
|
|
return true;
|
|
}
|
|
};
|