-
Notifications
You must be signed in to change notification settings - Fork 0
/
Solution.cs
45 lines (37 loc) · 1.29 KB
/
Solution.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
namespace LeetCode.Problem205{
//205. Isomorphic Strings
//https://leetcode.com/problems/isomorphic-strings/
/*
Given two strings s and t, determine if they are isomorphic.
Two strings s and t 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.
*/
// Definition for a binary tree node.
public class Solution {
public bool IsIsomorphic(string s, string t) {
Dictionary<char,int> sdic = new Dictionary<char,int>();
Dictionary<char,int> tdic = new Dictionary<char,int>();
for (int i = 0; i < s.Length; i++)
{
var svalue = s[i];
var tvalue = t[i];
if (!sdic.ContainsKey(svalue))
{
sdic.Add(svalue,i);
if (tdic.ContainsKey(tvalue))
return false;
tdic.Add(tvalue,i);
}
else
{
if (t[i] != t[sdic[svalue]])
return false;
sdic[svalue] = i;
tdic[tvalue] = i;
}
}
return true;
}
}
}