mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-01-11 02:58:13 +08:00
23 lines
1009 B
HTML
23 lines
1009 B
HTML
<p>Given two strings <code>ransomNote</code> and <code>magazine</code>, return <code>true</code><em> if </em><code>ransomNote</code><em> can be constructed from </em><code>magazine</code><em> and </em><code>false</code><em> otherwise</em>.</p>
|
|
|
|
<p>Each letter in <code>magazine</code> can only be used once in <code>ransomNote</code>.</p>
|
|
|
|
<p> </p>
|
|
<p><strong>Example 1:</strong></p>
|
|
<pre><strong>Input:</strong> ransomNote = "a", magazine = "b"
|
|
<strong>Output:</strong> false
|
|
</pre><p><strong>Example 2:</strong></p>
|
|
<pre><strong>Input:</strong> ransomNote = "aa", magazine = "ab"
|
|
<strong>Output:</strong> false
|
|
</pre><p><strong>Example 3:</strong></p>
|
|
<pre><strong>Input:</strong> ransomNote = "aa", magazine = "aab"
|
|
<strong>Output:</strong> true
|
|
</pre>
|
|
<p> </p>
|
|
<p><strong>Constraints:</strong></p>
|
|
|
|
<ul>
|
|
<li><code>1 <= ransomNote.length, magazine.length <= 10<sup>5</sup></code></li>
|
|
<li><code>ransomNote</code> and <code>magazine</code> consist of lowercase English letters.</li>
|
|
</ul>
|