LeetCode #290 Word Pattern 單詞樣板(模式)

public class Solution {
    public bool WordPattern(string pattern, string s) {
        Dictionary<char,string> dict =   new Dictionary<char,string>();
        HashSet<string> hSet = new HashSet<string>();
        string[]res = s.Split(" ");

        if(res.Length != pattern.Length)
        {
            return false;
        }

        for(int i = 0; i< pattern.Length;i++)
        {
            var p = pattern[i];
            var r = res[i];
            if (!dict.ContainsKey(p))
            {
                if(hSet.Contains(r))
                {
                    return false;
                }
                dict.Add(p, r);
                hSet.Add(r);
            }
            else    //check if exists
            {
                if(r != dict[p])
                {
                    return false;
                }
            }
        }

        return true;
    }
}

class Solution {
    public boolean wordPattern(String pattern, String s) {
        Map<Character, String> dict = new HashMap<Character, String>();
        HashSet<String> hSet  = new HashSet<String>();

        String[]res = s.split(" ");

        if(res.length != pattern.length())
        {
            return false;
        }

        for(int i = 0; i< pattern.length();i++)
        {
            char p = pattern.charAt(i);
            String r = res[i];
            if (!dict.containsKey(p))
            {
                if(hSet.contains(r))
                {
                    return false;
                }
                dict.put(p, r);
                hSet.add(r);
            }
            else    //check if exists
            {
                if(!r.equals(dict.get(p)))
                {
                    return false;
                }
            }
        }

        return true;
    }
}

class Solution:
    def wordPattern(self, pattern: str, s: str) -> bool:
        dict = {}
        hSet = set()
        res = s.split(" ")

        if(len(res) != len(pattern)):
            return False

        for i in range (len(pattern)):
            p = pattern[i]
            r = res[i]
            if (p not in dict):
                if(r in hSet):
                    return False
                
                dict[p] = r
                hSet.add(r)
            
            else:    #check if exists
                if(r != dict[p]):
                    return False

        return True