LeetCode[205] 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.

分析:

这道题思路跟 LeetCode[290] Word Pattern 一模一样。

代码:

public class Solution {
public boolean isIsomorphic(String s, String t) {
char a,b;
HashMap<Character,Character> map = new HashMap<Character,Character>();
for(int i = 0; i < s.length(); i++){
a = s.charAt(i);
b = t.charAt(i);
if(map.containsKey(a)){
if(map.get(a) != b)
return false;
}else if(map.containsValue(b))
return false;
else
map.put(a,b);
}
return true;
}
}

欢迎关注公众号: FullStackPlan 获取更多干货

Copyright © 2016 - 2017 LBD All Rights Reserved.

访客数 : | 访问量 :