word-pattern

java

python

python3

mysql

mssql

oraclesql

csharp

javascript

typescript

bash

swift

kotlin

dart

golang

ruby

scala

rust

racket

erlang

elixir

pythondata

postgresql

cangjie

Algorithms

Given a <code>pattern</code> and a string <code>s</code>, find if <code>s</code>&nbsp;follows the same pattern.

Here follow means a full match, such that there is a bijection between a letter in <code>pattern</code> and a non-empty word in <code>s</code>. Specifically:

<ul>
	<li>Each letter in <code>pattern</code> maps to exactly one unique word in <code>s</code>.</li>
	<li>Each unique word in <code>s</code> maps to exactly one letter in <code>pattern</code>.</li>
	<li>No two letters map to the same word, and no two words map to the same letter.</li>
</ul>

&nbsp;
Example 1:

<div class="example-block">
Input: pattern = &quot;abba&quot;, s = &quot;dog cat cat dog&quot;

Output: true

Explanation:

The bijection can be established as:

<ul>
	<li><code>&#39;a&#39;</code> maps to <code>&quot;dog&quot;</code>.</li>
	<li><code>&#39;b&#39;</code> maps to <code>&quot;cat&quot;</code>.</li>
</ul>
</div>

Example 2:

<div class="example-block">
Input: pattern = &quot;abba&quot;, s = &quot;dog cat cat fish&quot;

Output: false
</div>

Example 3:

<div class="example-block">
Input: pattern = &quot;aaaa&quot;, s = &quot;dog cat cat dog&quot;

Output: false
</div>

&nbsp;
Constraints:

<ul>
	<li><code>1 &lt;= pattern.length &lt;= 300</code></li>
	<li><code>pattern</code> contains only lower-case English letters.</li>
	<li><code>1 &lt;= s.length &lt;= 3000</code></li>
	<li><code>s</code> contains only lowercase English letters and spaces <code>&#39; &#39;</code>.</li>
	<li><code>s</code> does not contain any leading or trailing spaces.</li>
	<li>All the words in <code>s</code> are separated by a single space.</li>
</ul>

wordPattern

Word Pattern

Isomorphic Strings

isomorphic-strings

同构字符串

Word Pattern II

word-pattern-ii

单词规律 II

Find and Replace Pattern

find-and-replace-pattern

查找和替换模式

Hash Table

String

给定一种规律 <code>pattern</code>&nbsp;和一个字符串&nbsp;<code>s</code>&nbsp;，判断 <code>s</code>&nbsp;是否遵循相同的规律。

这里的&nbsp;遵循&nbsp;指完全匹配，例如，&nbsp;<code>pattern</code>&nbsp;里的每个字母和字符串&nbsp;<code>s</code>&nbsp;中的每个非空单词之间存在着双向连接的对应规律。

&nbsp;

示例1:

<pre>
输入: pattern = <code>"abba"</code>, s = <code>"dog cat cat dog"</code>
输出: true</pre>

示例 2:

<pre>
输入:pattern = <code>"abba"</code>, s = <code>"dog cat cat fish"</code>
输出: false</pre>

示例 3:

<pre>
输入: pattern = <code>"aaaa"</code>, s = <code>"dog cat cat dog"</code>
输出: false</pre>

&nbsp;

提示:

<ul>
	<li><code>1 &lt;= pattern.length &lt;= 300</code></li>
	<li><code>pattern</code>&nbsp;只包含小写英文字母</li>
	<li><code>1 &lt;= s.length &lt;= 3000</code></li>
	<li><code>s</code>&nbsp;只包含小写英文字母和&nbsp;<code>' '</code></li>
	<li><code>s</code>&nbsp;不包含 任何前导或尾随对空格</li>
	<li><code>s</code>&nbsp;中每个单词都被 单个空格 分隔</li>
</ul>