refactor 291

fishercoder1534 · fishercoder1534 · commit cf7d1c3a5a57 · 2020-05-28T10:24:45.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_291.java b/src/main/java/com/fishercoder/solutions/_291.java
@@ -5,20 +5,6 @@
 import java.util.Map;
 import java.util.Set;
 
-/**
- * 291. Word Pattern II
- *
- * 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 substring in str.
-
- Examples:
- pattern = "abab", str = "redblueredblue" should return true.
- pattern = "aaaa", str = "asdasdasdasd" should return true.
- pattern = "aabb", str = "xyzabcxzyabc" should return false.
-
- Notes:
- You may assume both pattern and str contains only lowercase letters.
- */
 public class _291 {
 
     public static class Solution1 {
@@ -30,7 +16,7 @@ public static class Solution1 {
          * "a" matches "red"
          * "b" matches "blue"
          * then we'll just finish the str check based on this pattern
-         * */
+         */
         public boolean wordPatternMatch(String pattern, String str) {
             Map<Character, String> map = new HashMap();
             Set<String> set = new HashSet();
