【Leetcode】word pattern

Since I have an interview tomorrow, I decide to brush some easy level question of Leetcode and it turns out to be really hard for me right now! Oh my, crush my confidence.

The problem is as follow:

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.

Notes:
You may assume pattern contains only lowercase letters, and str contains lowercase letters separated by a single space.

The first thing coming to my mind is to use HashMap, whose main point summary I will upload later. My naive thought was if we find this element appears for the first time, put it in the map such the string "dog" as the key and the pattern "a" as the value. And if it's not the first time this element come out, we would basically check whether this element's mapping inside map is exactly the same as corresponding pattern. Then I wrote this code as follow:

package testAndfun;

import java.util.HashMap;
import java.util.Map;

public class wordPattern {
	 public static void main(String[] args){
		 String str = new String("dog dog cat cat");
		 String pat = new String("aabb");
		 System.out.println(wordpattern(pat,str));
	 }
	
	 public static boolean wordpattern(String pattern, String str) {
	        String[] strs = str.split(" ");
	        if(pattern.length()!=strs.length){
	        	return false;
	        }
	        Map<String, Character> map = new HashMap<String, Character>();
	        for(int i = 0; i<strs.length;i++){
	        	if(!map.containsKey(strs[i])){
	        		map.put(strs[i], pattern.charAt(i));
	        	}
	        	else{
	        		if(!map.get(strs[i]).equals(pattern.charAt(i))){
	        			return false;
	        		}
	        	}
	        }
	        
		 
		 	return true;
	    }
}

However, then I came across some dilemma. What if the input is "cat dog fish goat" and the pattern is "abba"? Well, due to every element only appears once so we will finish the for loop and return true! which is a big mistake.

Thus, I have to re-write it by use another way that use pattern as key while using string as value, as below:

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

Bingo!