mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
28 lines
993 B
HTML
28 lines
993 B
HTML
<p>A <strong>pangram</strong> is a sentence where every letter of the English alphabet appears at least once.</p>
|
|
|
|
<p>Given a string <code>sentence</code> containing only lowercase English letters, return<em> </em><code>true</code><em> if </em><code>sentence</code><em> is a <strong>pangram</strong>, or </em><code>false</code><em> otherwise.</em></p>
|
|
|
|
<p> </p>
|
|
<p><strong class="example">Example 1:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> sentence = "thequickbrownfoxjumpsoverthelazydog"
|
|
<strong>Output:</strong> true
|
|
<strong>Explanation:</strong> sentence contains at least one of every letter of the English alphabet.
|
|
</pre>
|
|
|
|
<p><strong class="example">Example 2:</strong></p>
|
|
|
|
<pre>
|
|
<strong>Input:</strong> sentence = "leetcode"
|
|
<strong>Output:</strong> false
|
|
</pre>
|
|
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= sentence.length <= 1000</code></li>
|
|
<li><code>sentence</code> consists of lowercase English letters.</li>
|
|
</ul>
|