【leetcode】【205】Isomorphic Strings

xiaoliucool1314

于 2016-03-15 16:30:06 发布

阅读量321

点赞数

CC 4.0 BY-SA版权

分类专栏：算法 Java 文章标签： java leetcode Hash Table

本文链接：https://blog.csdn.net/xiaoliucool1314/article/details/50897587

Java 同时被 2 个专栏收录

150 篇文章

订阅专栏

算法

144 篇文章

订阅专栏

本文介绍了一种通过使用HashMap实现的简单方法，用于判断两个字符串是否为同构字符串。同构字符串意味着第一个字符串中的字符可以被替换得到第二个字符串，且替换要保持字符出现的顺序不变。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

一、问题描述

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.

二、问题分析

显然是一种map的关系，可以使用HashMap来处理，比较简单。

三、Java AC代码

public boolean isIsomorphic(String s, String t) {
        HashMap<Character, Character> map = new HashMap<Character, Character>();
		if (s.length()!=t.length()) {
			return false;
		}
		char chs;
		char cht;
		for(int i=0;i<s.length();i++){
			chs = s.charAt(i);
			cht = t.charAt(i);
			if (!map.containsKey(chs)) {
				if (map.values().contains(cht)) {
					return false;
				}
				map.put(chs, cht);
			}else {
				if (map.get(chs).equals(cht)) {
					continue;
				}else {
					return false;
				}
			}
		}
		return true;
    }