Word Pattern
Given a pattern and a string s, find if s follows the same pattern.
Here follow means a full match, such that there is a bijection between a letter in pattern and a non-empty word in s. Specifically:
- Each letter in
patternmaps to exactly one unique word ins. - Each unique word in
smaps to exactly one letter inpattern. - No two letters map to the same word, and no two words map to the same letter.
Example 1
Input
pattern = "abba", s = "dog cat cat dog"Output
trueThe bijection can be established because 'a' maps to "dog" and 'b' maps to "cat".
Example 2
Input
pattern = "abba", s = "dog cat cat fish"Output
falseThe pattern would require the final word to be "dog", but it is "fish" instead.
Constraints
- 1 <= pattern.length <= 300
- pattern contains only lower-case English letters.
- 1 <= s.length <= 3000
- s contains only lowercase English letters and spaces ' '.
- s does not contain any leading or trailing spaces.
- All the words in s are separated by a single space.