leetcode 205:Isomorphic Strings

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

Two strings are isomorphic if the characters in s can be replaced to get t.

All occurrences of a character must be replaced with another character while preserving the order of characters. No two characters may map to the same character but a character may map to itself.

For example,
Given “egg”, “add”, return true.

Given “foo”, “bar”, return false.

Given “paper”, “title”, return true.

Note:
You may assume both s and t have the same length.
分析:
题目主要考察两个字符串结构是否相同,如果相应字符一一映射,那么就认为结构相同,在这里可以采用map存放字符串中相应字符,key为第一个字符串相应字符,value为第二个字符串相应字符,key和value应该一一对映的;再用set存储第二个字符串的字符,做相应判断。
代码:

import java.util.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.Set;

public class IsomorphicStrings {
    /**
     * 
     * @param s
     * @param t
     * @return
     */
    public static boolean isIsomorphic(String s,String t){
        if(s==null || t==null) return false;
        if(s.length()!=t.length()) return false;
        Map<Character,Character> map=new HashMap<Character,Character>();
        Set<Character> set=new HashSet<Character>();
        for(int i=0;i<s.length();i++){
            char c1=s.charAt(i);
            char c2=t.charAt(i);
            if(map.containsKey(c1)){
                if(map.get(c1)!=c2) return false;
            }else{
                if(set.contains(c2)) return false;
                else{
                    map.put(c1, c2);
                    set.add(c2);
                }
            }
        }
        return true;
    }
        public static void main(String[] args){
        String s="egg";
        String t="adb";
        boolean result=isIsomorphic(s,t);
        System.out.println("result:"+result);
    }

}
阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/tuobadon/article/details/46789611
文章标签: leetcode
个人分类: leetcode
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

leetcode 205:Isomorphic Strings

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭