Word Pattern

原创 2015年11月19日 13:21: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:

  1. pattern = "abba", str = "dog cat cat dog" should return true.
  2. pattern = "abba", str = "dog cat cat fish" should return false.
  3. pattern = "aaaa", str = "dog cat cat dog" should return false.
  4. pattern = "abba", str = "dog dog dog dog" should return false.

public class Solution {
    public boolean wordPattern(String pattern, String str) {
        String[] strArray = str.split(" ");
        if(pattern.length() != strArray.length)
            return false;
        
        Map<Character, String> map = new HashMap<>();
        Map<String, Character> reverseMap = new HashMap<>();
        for(int i = 0; i < strArray.length; i++){
            Character currentChar = pattern.charAt(i);
            String currentString = strArray[i];
            if(!map.containsKey(currentChar)){
                if(reverseMap.containsKey(currentString))
                    return false;
                else{
                    map.put(currentChar, currentString);
                    reverseMap.put(currentString, currentChar);
                }
            }
            else{
                if( !map.get(currentChar).equals(currentString))
                    return false;
            }
        }
        return true;
    }
}

reverseMap 可以用set来代替。

public class Solution {
    public boolean wordPattern(String pattern, String str) {
        String[] strArray = str.split(" ");
        if(pattern.length() != strArray.length)
            return false;
        
        Map<Character, String> map = new HashMap<>();
        Set<String> reverseRecord = new HashSet<>();
        for(int i = 0; i < strArray.length; i++){
            Character currentChar = pattern.charAt(i);
            String currentString = strArray[i];
            if(!map.containsKey(currentChar)){
                //when we reach this step, we know that currentChar has never appeared before, so we expect that currentString
                //has not appeated either. If it has appeared, then it must not map to currentChar
                if(reverseRecord.contains(currentString))
                    return false;
                else{
                    map.put(currentChar, currentString);
                    reverseRecord.add(currentString);
                }
            }
            else{
                if( !map.get(currentChar).equals(currentString))
                    return false;
            }
        }
        return true;
    }
}



相关文章推荐

Word Pattern

  • 2016年05月15日 23:48
  • 981B
  • 下载

Leetocde_290_Word Pattern

http://blog.csdn.net/pistolove/article/details/49717803 Given a pattern and a string str, fi...

290-e-Word Pattern

判断字符与字符串是否成对对应,例如pattern = "abba", str = "dog cat cat dog" 返回true,如果str = “dog cat cat cat”则返回false,...

leetcode 哈希表专题-Word Pattern

记录下leetcode的题目:word pattern

LeetCode笔记:290. Word Pattern

判断字符串中的单词是否匹配模型

Word Pattern - JS

Given a pattern and a string str, find if str follows the same pattern. Here follow means a ful...

290. Word Pattern(技巧:记录当前位置来判断两个字符串是否符合)

Given a pattern and a string str, find if str follows the same pattern. Here follow means a ful...

leetcode题解-205.Isomorphic Strings && 290. Word Pattern

题目:Given two strings s and t, determine if they are isomorphic. Two strings are isomorphic if the c...

290. Word Pattern

Given a pattern and a string str, find if str follows the same pattern. Here follow means a ful...
  • x_shuck
  • x_shuck
  • 2016年03月25日 17:20
  • 73

<LeetCode OJ> 290. Word Pattern

290. Word Pattern My Submissions Question Total Accepted: 24989 Total Submissions: 89440 Difficu...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Word Pattern
举报原因:
原因补充:

(最多只允许输入30个字)