290. Word Pattern一个击败了100C++用户的代码-CSDN博客

本文链接：https://blog.csdn.net/qq_41731507/article/details/136479493

题目描述

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.

Example 1：

Input: pattern = “abba”, s = “dog cat cat dog”
Output: true

Example 2:

Input: pattern = “abba”, s = “dog cat cat fish”
Output: false

Example 3:

Input: pattern = “aaaa”, s = “dog cat cat dog”
Output: false

Example 4:

Input: pattern = “jquery”, s = “jquery”
Output: false

Constrains:

1 <= pattern.length <= 300
pattern contains only lower-case English letter.
1 <= s.length <= 3000
s contains only lowercase English letters ans spaces ’ '.
s does not contain any leading or trailing spaces.

解答思路

这题需要s包含的单词与pattern逐字母的进行映射，比如pattern是abba，那么s包含的字符也需要是对称的。这里需要注意当pattern与s一样的时候，输出为false，因为s应该与pattern每一个字母做映射，而不是整体。
思路类似205. Isomorphic String，做双向的映射。pattern每个字母与s里的每个单词做映射，单向的还不够，因为有可能出现abc，与"dog cat dog"对应时，a和c都对应上dog了。

class Solution {
   
   
public:
   bool wordPattern(string pattern, const string& s) {
   
          
        return wordPatternHelp(patter