[LeetCode] Isomorphic Strings

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

Note:
You may assume both s and t have the same length.

 

 

public class Solution {    public boolean isIsomorphic(String s, String t) {        Map
 
   map = new HashMap<>();        Map
  
    reMap = new HashMap<>();        for(int i=0;i