word_pattern

hitzzc · hitzzc · commit b8dd7f9b2dc3 · 2016-10-23T10:10:59.000+08:00
diff --git a/README.md b/README.md
@@ -210,6 +210,7 @@ Golang solution for leetcode. For each problem, there is a simple *_test.go to t
 #### [283. Move Zeroes](https://github.com/hitzzc/go-leetcode/tree/master/expression_add_operators)
 #### [284. Peeking Iterator](https://github.com/hitzzc/go-leetcode/tree/master/peeking_iterator)
 #### [287. Find the Duplicate Number](https://github.com/hitzzc/go-leetcode/tree/master/find_the_duplicate_number)
+#### [290. Word Pattern](https://github.com/hitzzc/go-leetcode/tree/master/word_pattern)
 
 
 
diff --git a/word_pattern/word_pattern.cpp b/word_pattern/word_pattern.cpp
@@ -0,0 +1,34 @@
+#include <unordered_map>
+#include <string>
+#include <vector>
+using namespace std;
+
+class Solution {
+public:
+    bool wordPattern(string pattern, string str) {
+        unordered_map<char, string> pattern_to_str;
+        unordered_map<string, char> str_to_pattern;
+        int i = 0;
+        int start = 0;
+        for (int j = 0; j <= str.size(); ++j){
+        	if (i >= pattern.size()) return false;
+        	if (j == str.size() || str[j] == ' ') {
+        		string sub = str.substr(start, j-start);
+        		if (pattern_to_str.count(pattern[i]) == 0 && str_to_pattern.count(sub) == 0) {
+        			pattern_to_str[pattern[i]] = sub;
+        			str_to_pattern[sub] = pattern[i];
+        		}else if (pattern_to_str.count(pattern[i]) != 0 && str_to_pattern.count(sub) != 0) {
+        			if (pattern_to_str[pattern[i]] != sub || str_to_pattern[sub] != pattern[i]) {
+        				return false;
+        			}
+        		}else {
+        			return false;
+        		}
+        		++i;
+        		start = j+1;
+        	}
+        }
+        if (i != pattern.size()) return false;
+        return true;
+    }
+};
