mirror of
https://gitee.com/coder-xiaomo/leetcode-problemset
synced 2025-09-04 15:01:40 +08:00
国外版
This commit is contained in:
37
算法题(国外版)/word-pattern.html
Normal file
37
算法题(国外版)/word-pattern.html
Normal file
@@ -0,0 +1,37 @@
|
||||
<p>Given a <code>pattern</code> and a string <code>s</code>, find if <code>s</code> follows the same pattern.</p>
|
||||
|
||||
<p>Here <b>follow</b> means a full match, such that there is a bijection between a letter in <code>pattern</code> and a <b>non-empty</b> word in <code>s</code>.</p>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Example 1:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> pattern = "abba", s = "dog cat cat dog"
|
||||
<strong>Output:</strong> true
|
||||
</pre>
|
||||
|
||||
<p><strong>Example 2:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> pattern = "abba", s = "dog cat cat fish"
|
||||
<strong>Output:</strong> false
|
||||
</pre>
|
||||
|
||||
<p><strong>Example 3:</strong></p>
|
||||
|
||||
<pre>
|
||||
<strong>Input:</strong> pattern = "aaaa", s = "dog cat cat dog"
|
||||
<strong>Output:</strong> false
|
||||
</pre>
|
||||
|
||||
<p> </p>
|
||||
<p><strong>Constraints:</strong></p>
|
||||
|
||||
<ul>
|
||||
<li><code>1 <= pattern.length <= 300</code></li>
|
||||
<li><code>pattern</code> contains only lower-case English letters.</li>
|
||||
<li><code>1 <= s.length <= 3000</code></li>
|
||||
<li><code>s</code> contains only lowercase English letters and spaces <code>' '</code>.</li>
|
||||
<li><code>s</code> <strong>does not contain</strong> any leading or trailing spaces.</li>
|
||||
<li>All the words in <code>s</code> are separated by a <strong>single space</strong>.</li>
|
||||
</ul>
|
Reference in New Issue
Block a user