290. Word Pattern【LeetCode by java】
今天发现LintCode页面刷新不出来了，所以就转战LeetCode。还是像以前一样，做题顺序：难度从低到高，每天至少一题。 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 . Example 1: Input: pattern = "abba" , str = "dog cat cat dog" Output: true Example 2: Input:pattern = "abba" , str = "dog cat cat fish" Output: false Example 3: Input: pattern = "aaaa" , str = "dog cat cat dog" Output: false Example 4: Input: pattern = "abba" , str = "dog dog dog dog" Output: false Notes: You may assume pattern contains only