您当前位置：首页 > php开源 > php教程 > [LeetCode 205]Isomorphic Strings

[LeetCode 205]Isomorphic Strings

来源：程序员人生发布时间：2015-06-27 08:02:34 阅读次数：2348次

题目链接：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; } }

生活不易，码农辛苦
如果您觉得本网站对您的学习有所帮助,可以手机扫描二维码进行捐赠
程序员人生

------分隔线----------------------------

上一篇 小胖说事5------iOS CATransition的用法

下一篇 javac: target release 1.5 conflicts with default source release 1.7

分享到:

------分隔线----------------------------

为码而活

积分：4237

15粉丝

7关注

栏目热点