[leetcode]Isomorphic Strings

最新推荐文章于 2020-07-13 12:47:51 发布

雨中鹰

最新推荐文章于 2020-07-13 12:47:51 发布

阅读量446

点赞数

分类专栏： leetcode 文章标签： leetcode Isomorphic Strings

本文链接：https://blog.csdn.net/menglinaoxiang/article/details/45399477

版权

leetcode 专栏收录该内容

78 篇文章 0 订阅

订阅专栏

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.

题目表述：给两个字符串S与T，判断他们是否为同构的字符串。

如果字符串s中的字符被替换可以成为字符串t则这两个字符串就是同构的。

所有出现的字符必须被另一个字符替换但要保持字符顺序。不能存在两个字符映射到同一个字符，但允许字符映射到自身。

解题思路：用两个数组记录映射关系，然后判断两组映射关系是否是相互的。

public class Solution {
    public boolean isIsomorphic(String s, String t) {
        char[] st = new char[256]; //用两个数组来记录相互的映射关系
        char[] tt = new char[256];
        
        for(int i = 0; i < s.length(); i++){
            char sc = s.charAt(i);
            char tc = t.charAt(i);
            
            //a->b的映射 与 b->a的映射不匹配  其中一个有一个没
            if(st[sc] == '\0' && tt[tc] != '\0' || st[sc] != '\0' && tt[tc] == '\0'){
                return false;
            }
            //s t还未在 两个表中记录映射关系
            if(st[sc] == '\0' && tt[tc] == '\0'){
                st[sc] = tc;
                tt[tc] = sc; 
                continue;
            }
            //a->b与b->a都有映射关系，但是不匹配
            if(st[sc] != tc || tt[tc] != sc) {
                return false;
            }
        }
        return true;
    }
}