[LeetCode 205]Isomorphic Strings
來源:程序員人生 發(fā)布時(shí)間:2015-06-27 08:02:34 閱讀次數(shù):2534次
題目鏈接: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.
// 29 / 29 test cases passed.
// Status: Accepted
// Runtime: 390 ms
// Submitted: 1 minute ago
public class Solution {
public boolean isIsomorphic(String s, String t) {
Map<Character, Character> sm = new HashMap<Character, Character>();
Map<Character, Character> tm = new HashMap<Character, Character>();
for (int i = 0; i < s.length(); i++) {
char char_s = s.charAt(i);
char char_t = t.charAt(i);
if(sm.get(char_s) == null) {
if(tm.get(char_t) == null) {
sm.put(char_s, char_t);
tm.put(char_t, char_s);
} else return false;
} else {
if(tm.get(char_t) == null) return false;
if(!(sm.get(char_s) == char_t && tm.get(char_t) == char_s))
return false;
}
}
return true;
}
}
生活不易,碼農(nóng)辛苦
如果您覺得本網(wǎng)站對您的學(xué)習(xí)有所幫助,可以手機(jī)掃描二維碼進(jìn)行捐贈(zèng)