Isomorphic Strings

原创 2015年07月07日 16:55:15

1 题目描述

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.

题目出处:https://leetcode.com/problems/isomorphic-strings/


2 解题思路

1.使用hashmap来解决,通过比较


3 源代码

package com.larry.easy;

import java.util.HashMap;

public class IsomorphicStrings {
	public boolean isIsomorphic(String s, String t) {
		if(s.length() != t.length()) return false;
		
		boolean retn = true;
		HashMap<Character, Character> hm = new HashMap<Character, Character>();
		for(int i = 0; i < s.length(); i++){
			char fir = s.charAt(i);
			char secd = t.charAt(i);
			
			boolean retn1 = hm.containsKey(fir);//该字符在s中是否出现过
			if(retn1){//出现过
				char temp = hm.get(fir);
				if(temp == secd) continue;
				else {
					retn = false;
					break;
				}
			}else{//没出现过
				boolean retn2 = hm.containsValue(secd);
				if(retn2){
					retn = false;
					break;
				}else {
					hm.put(fir, secd);
					continue;
				}
			}
		}
        return retn;
    }
	public static void main(String[] args) {
		/*String s1 = "egg";
		String t1 = "add";*/
		/*String s1 = "foo";
		String t1 = "bar";*/
		/*String s1 = "paper";
		String t1 = "title";*/
		String s1 = "paper";
		String t1 = "tttle";
		String s = s1;
		String t = t1;
		IsomorphicStrings is = new IsomorphicStrings();
		System.out.println(is.isIsomorphic(s, t));
	}
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

Leetcode28: Isomorphic Strings

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

[leetcode]Isomorphic Strings

Isomorphic Strings   Given two strings s and t, determine if they are isomorphic. Two strin...

LeetCode | Isomorphic Strings

题目 Given two strings s and t, determine if they are isomorphic. Two strings are isomorph...

LeetCode 205 Isomorphic Strings(同构的字符串)(string、vector、map)(*)

翻译给定两个字符串s和t,决定它们是否是同构的。如果s中的元素被替换可以得到t,那么称这两个字符串是同构的。在用一个字符串的元素替换另一个字符串的元素的过程中,所有字符的顺序必须保留。 没有两个字符可...
  • NoMasp
  • NoMasp
  • 2016-01-30 14:16
  • 2661

<LeetCode><Easy> 205 Isomorphic Strings --HashTable

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

Isomorphic Strings——同构结构判断

问题描述:求两个字符串是否同构 Given two strings s and t, determine if they are isomorphic.

leetcode 205. Isomorphic Strings-字符匹配|哈希表

原题链接:205. Isomorphic Strings 【思路】 需要用到一个 HashMap数据结构, map 中存储这样一对映射:用 s 中的每个字符作为 map 的 key, t 中的每个字符...

【leetcode】Isomorphic Strings

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

Leetcode 205. Isomorphic Strings

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

LeetCode_Isomorphic Strings

Isomorphic Strings Given two strings s and t, determine if they are isomorphic. Two strings are ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)