开始刷leetcode day1：Isomorphic Strings

最新推荐文章于 2023-06-01 20:09:33 发布

原创最新推荐文章于 2023-06-01 20:09:33 发布 · 227 阅读

0 ·

CC 4.0 BY-SA版权

leetcode 专栏收录该内容

88 篇文章

订阅专栏

本文探讨了如何通过映射字符之间的关系来判断两个字符串是否为同构字符串。详细介绍了字符串同构性的定义、判别方法，并通过Java版本实现了一个简单而高效的解决方案。

题目：

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.

Java version

public class Solution {
public boolean isIsomorphic(String s, String t) {
HashMap<Character, Character> hashmap = new HashMap<Character,Character>();
HashMap<Character, Character> hashmap2 = new HashMap<Character,Character>();

char[] slist = s.toCharArray();
char[] tlist = t.toCharArray();

for(int i = 0; i< s.length(); i++)
{
if(hashmap.get(slist[i]) == null)
{
if(hashmap2.get(tlist[i]) != null)
return false;
hashmap.put(slist[i],tlist[i]);
hashmap2.put(tlist[i],slist[i]);
}
else if(hashmap.get(slist[i]) != tlist[i])
{
return false;
}else
{
//doing nothing when equals
}
}
return true;
}
}