LeetCode题解：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.

题意：判断两个字符串是否为同构字符串

思路：由于重复字符必须与前面的对应关系一致（例如先有p-t映射，后面再出现p时，对应位置必须是t），所以用两个数组建立每一个位置字符的映射就好了

代码：

public class Solution {
    public boolean isIsomorphic(String s, String t) {
        int[] sChars = new int[256];
        int[] tChars = new int[256];

        for(int i = 0;i < s.length();++i){
            if(sChars[s.charAt(i)] != tChars[t.charAt(i)]){
                return false;
            }else{
                sChars[s.charAt(i)] = tChars[t.charAt(i)] = t.charAt(i);
            }
        }

        return true;
    }
}