您当前位置：首页 > php开源 > php教程 > leetcode 205: Isomorphic Strings

leetcode 205: Isomorphic Strings

来源：程序员人生发布时间：2015-05-27 07:54:28 阅读次数：2339次

Given two strings s and t, determine if they are isomorphic.

Two strings are isomorphic if the characters in s can be replaced to gett.

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.

[思路]

建1个map保存映照关系, 同时用1个set保持被映照的char, 保证同1个char 不会被映照两次.

[CODE]

public class Solution { //test case: "egg", "add" public boolean isIsomorphic(String s, String t) { //init check if(s==null || t==null) return false; if(s.length() != t.length()) return false; Map<Character, Character> map = new HashMap<Character, Character>(); Set<Character> set = new HashSet<Character>(); for(int i=0; i<s.length(); i++) { char c1 = s.charAt(i); char c2 = t.charAt(i); if(map.containsKey(c1)) { if(map.get(c1) != c2) return false; } else { if(set.contains(c2)) return false; else { map.put(c1, c2); set.add(c2); } } } return true; } }

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

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

上一篇 [exgcd] zzu oj 10402 C.机器人

下一篇 iOS开发中常用的轮子第三篇炫酷的控件和特效

分享到:

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

为码而活

积分：4237

15粉丝

7关注

栏目热点