LeetCode_205. Isomorphic Strings
2024-08-26 20:43:23
205. Isomorphic Strings
Easy
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.
Example 1:
Input: s ="egg",t ="add"
Output: true
Example 2:
Input: s ="foo",t ="bar"
Output: false
Example 3:
Input: s ="paper",t ="title"
Output: true
Note:
You may assume both s and t have the same length.
package leetcode.easy;
import java.util.HashMap;
public class IsomorphicStrings {
public boolean isIsomorphic(String s, String t) {
if (s.length() != t.length()) {
return false;
}
HashMap<Character, Character> map = new HashMap<Character, Character>();
for (int i = 0; i < s.length(); i++) {
char a = s.charAt(i);
char b = t.charAt(i);
if (map.containsKey(a)) {
if (map.get(a).equals(b)) {
continue;
} else {
return false;
}
} else {
if (!map.containsValue(b)) {
map.put(a, b);
} else {
return false;
}
}
}
return true;
}
@org.junit.Test
public void test() {
String s1 = "egg";
String t1 = "add";
String s2 = "foo";
String t2 = "bar";
String s3 = "paper";
String t3 = "title";
System.out.println(isIsomorphic(s1, t1));
System.out.println(isIsomorphic(s2, t2));
System.out.println(isIsomorphic(s3, t3));
}
}
最新文章
- PHP Windows环境部署
- <<< html5本地储存
- Docker入门教程（五）Docker安全
- libcurl安装
- Flyweight 模式
- POJ 1236 Network of Schools（强连通 Tarjan+缩点）
- HDU 5613 Baby Ming and Binary image
- 一元线性回归分析及java实现
- CLI子命令扩展-插件机制实现
- PyTorch教程之Neural Networks
- git学习笔记5-撤销操作
- 带着萌新看springboot源码05
- Unity3D 粒子系统 属性
- MySQL安装 8.0.15版本
- python学习笔记：深浅拷贝的使用和原理
- Gradle基本使用（1）：安装、IDEA使用
- Java开发之JDK配置
- linux清理磁盘
- Problem I. Increasing or Decreasing MIPT-2016 Pre-Finals Workshop, Taiwan NTU Contest, Sunday, March 27, 2016
- Git回滚到历史节点(SourceTree篇)