Java [Leetcode 205]isomorphic Strings

Title Description:

Given strings s and t, determine if they are isomorphic.

The strings is isomorphic if the characters in s can is replaced to get t.

All occurrences of a character must is replaced with another character while preserving the order of characters. No, characters may map to the same character and a character may map to itself.

For example,
Given "egg" , "add" return True.

Given "foo" , "bar" return FALSE.

Given "paper" , "title" return True.

Problem Solving Ideas:

Mapping with arrays. Note that each time the dictionary map is assigned a value of i+1, this is to prevent confusion with the assignment at the time of the first mapping. (because the initialization of the array is assigned a value of 0, if each assignment is I, then the first assignment is also 0, so it is confusing).

The code is as follows:

public class Solution {public    Boolean isisomorphic (string s, String t) {        int[] MapS = new int[128];        int[] mapt = new int[128];        for (int i = 0; i < s.length (); i++) {        if (Maps[s.charat (i)] = Mapt[t.charat (i)])        return false;        Maps[s.charat (i)] = Mapt[t.charat (i)] = i + 1;        }        return true;    }}

　　

Java [Leetcode 205]isomorphic Strings