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.

思考：怎么才能一一映射

想法：

• 1、用两个char数组存放每一位的char（ASCII码），并且将相对应位上得char值映射到同一数值
• 2、如果以相应的ascii码为索引得到的数字不同，则证明不同构。

代码

public class Solution {
    public boolean isIsomorphic(String s, String t) {
        int[] tranS = new int[256];
        int[] tranT = new int[256];
        for(int i = 0; i < s.length(); i++){
            int sIndex = (int)s.charAt(i);
            int tIndex = (int)t.charAt(i);
            //没有赋值之前都为0
            if(tranS[sIndex] != tranT[tIndex])
                return false;
            //赋值之后每一元素都不为0，只有没有遍历的元素才为0，将赋值之后的元素与赋值之前区分
            tranS[sIndex] = i + 1;
            tranT[tIndex] = i + 1;  
        }
        return true;   
    }
}