国产探花免费观看_亚洲丰满少妇自慰呻吟_97日韩有码在线_资源在线日韩欧美_一区二区精品毛片,辰东完美世界有声小说,欢乐颂第一季,yy玄幻小说排行榜完本

首頁 > 學院 > 開發設計 > 正文

290. Word Pattern

2019-11-11 04:43:22
字體:
來源:轉載
供稿:網友

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: pattern = “abba”, str = “dog cat cat dog” should return true. pattern = “abba”, str = “dog cat cat fish” should return false. pattern = “aaaa”, str = “dog cat cat dog” should return false. 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.

class Solution {public: bool wordPattern(string pattern, string str) { map<char, string> m; map<string, char> m1; istringstream ss(str); string word; int i = 0; while(ss >> word){ if(m.count(pattern[i]) != 0){ if(word != m[pattern[i]]) return false; } else m[pattern[i]] = word; if(m1.count(word) != 0){ if(pattern[i] != m1[word]) return false; } else m1[word] = pattern[i]; ++i; } if(i != pattern.length()) return false; return true; }};
發表評論 共有條評論
用戶名: 密碼:
驗證碼: 匿名發表
主站蜘蛛池模板: 九龙县| 陇西县| 台湾省| 清涧县| 麦盖提县| 泰宁县| 襄城县| 邯郸县| 新巴尔虎左旗| 红安县| 资溪县| 鄂尔多斯市| 延川县| 博乐市| 忻州市| 五常市| 巴彦县| 麟游县| 龙口市| 庆安县| 深水埗区| 久治县| 江源县| 墨脱县| 康保县| 亳州市| 华宁县| 彭州市| 达州市| 布尔津县| 通化县| 紫阳县| 老河口市| 襄樊市| 磐安县| 惠水县| 昭通市| 陇川县| 海原县| 曲麻莱县| 搜索|