0
点赞
收藏
分享

微信扫一扫

【C++11】多线程

phpworkerman 2023-09-30 阅读 22

解题思路:哈希

力扣(LeetCode)官网 - 全球极客挚爱的技术成长平台 

代码如下:

class Solution {
    public boolean wordPattern(String pattern, String s) {
        String[] arr2 = s.split(" ");
        if(arr2.length != pattern.length()){
            return false;
        }
        String[] arr1 = pattern.split("");
        HashMap<String,String> map1 = new HashMap<>();
        HashMap<String,String> map2 = new HashMap<>();
        for(int i = 0; i < arr1.length;i++){
            String key1 = arr1[i], value1 = arr2[i];
            if((map1.containsKey(key1) && !map1.get(key1).equals(value1)) || (map2.containsKey(value1) && !map2.get(value1).equals(key1))){
                return false;
            }
            map1.put(key1,value1);
            map2.put(value1,key1);
        }
        return true;

    }
}
举报

相关推荐

0 条评论