[LeetCode 290] Word Pattern

Given a pattern and a string str, find if str 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 str.

Examples:

• 1. pattern = "abba", str = "dog cat cat dog" should return true.
• 1. pattern = "abba", str = "dog cat cat fish" should return false.
• 1. pattern = "aaaa", str = "dog cat cat dog" should return false.
• 1. pattern = "abba", str = "dog dog dog dog" should return false.

Notes:
You may assume pattern contains only lowercase letters, and str contains lowercase letters separated by a single space.

Diffculty
Easy

Similar Problems
[LeetCode 205] Isomorphic Strings Easy [LeetCode 291] Word Pattern II Hard

Analysis