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.
题目链接:https://leetcode.com/problems/isomorphic-strings/
题目大意:判断字符串是否同构
题目分析:对字符串用同样的形式进行hash重组,判断是否相同
题目大意:判断字符串是否同构
题目分析:对字符串用同样的形式进行hash重组,判断是否相同
public class Solution {
public String changeFormat(String s) {
int len = s.length();
StringBuffer ans = new StringBuffer("");
char[] mp = new char[200];
Arrays.fill(mp, '0');
char ch1 = 'a';
for(int i = 0; i < len; i++) {
char cur = s.charAt(i);
if(mp[cur] == '0') {
mp[cur] = ch1;
ch1 ++;
}
ans.append(mp[cur]);
}
return ans.toString();
}
public boolean isIsomorphic(String s, String t) {
s = changeFormat(s);
t = changeFormat(t);
return s.equals(t);
}
}