2023.6.7 Problem: 290. Word Pattern

[umdreamer]

290. Word Pattern Problem Link 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

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.

[zxm-1235]

[Lggg1234]

[24zlx]

[yeyuxq]

[ZWJ2212061008]

[123lrb]

[huangyumei1]

[sjh397]

[tangyexi]

[PinkyLame]

[promisewith7]

[syr2212061031]

[shylieisme]

[mafanjia]

[daowuwu]

[zhjingyan]

[cuixiao02]

[bedauern]

[naqianqpg]

[wangshiqi7]

[1125766961]

[gusuning]

[liuhuanyu6]

[liu-si-han]

[12baoxingyu-6]

[686xiaozhang]

[xkqwww]

[zyhzxy99]

[FXL1006]

[zangfushuo]

[htywan]

[xiaolu2002]

[foxbou]