leetcode 205:Isomorphic Strings

原创 2015年07月07日 15:01:13

题目:
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);
    }

}
版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

LeetCode 205 Isomorphic Strings(同构的字符串)(string、vector、map)(*)

翻译给定两个字符串s和t,决定它们是否是同构的。如果s中的元素被替换可以得到t,那么称这两个字符串是同构的。在用一个字符串的元素替换另一个字符串的元素的过程中,所有字符的顺序必须保留。 没有两个字符可...
  • NoMasp
  • NoMasp
  • 2016年01月30日 14:16
  • 2728

<LeetCode><Easy> 205 Isomorphic Strings --HashTable

Given two strings s and t, determine if they are isomorphic. Two strings are isomorphic if the char...
  • awsxsa
  • awsxsa
  • 2015年10月15日 17:08
  • 346

leetcode 205. Isomorphic Strings-字符匹配|哈希表

原题链接:205. Isomorphic Strings 【思路】 需要用到一个 HashMap数据结构, map 中存储这样一对映射:用 s 中的每个字符作为 map 的 key, t 中的每个字符...

Leetcode 205. Isomorphic Strings

Given two strings s and t, determine if they are isomorphic.Two strings are isomorphic if the charac...

leetcode205. isomorphic strings

leetcode205. Isomorphic Stringshash思维Given two strings s and t, determine if they are isomorphic.Two...

<LeetCode OJ> 205. Isomorphic Strings

94. Binary Tree Inorder Traversal My Submissions Question Total Accepted: 102260 Total Submissio...

[LeetCode-205] Isomorphic Strings(同构字符串)

Given two strings s and t, determine if they are isomorphic. Two strings are isomorphic if the char...

LeetCode205 Isomorphic Strings同构字符串

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

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...

【leetcode】205. Isomorphic Strings

一、题目描述 Given two strings s and t, determine if they are isomorphic. Two strings are isomorph...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:leetcode 205:Isomorphic Strings
举报原因:
原因补充:

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