205. 判断两个字符串的模式是否相同 Isomorphic Strings

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.

1. public class Solution {
2. public bool IsIsomorphic(string s, string t) {
3. if (s.Length != t.Length) {
4. return false;
5. }
6. Dictionary<char, int> set = new Dictionary<char, int>();
7. List<int> parS = new List<int>();
8. int num = 1;
9. foreach(var i in s) {
10. int val;
11. set.TryGetValue(i, out val);
12. if (val != 0) {
13. parS.Add(set[i]);
14. } else {
15. set[i] = num;
16. parS.Add(set[i]);
17. num++;
18. }
19. }
21. List<int> parT = new List<int>();
22. set.Clear();
23. num = 1;
24. foreach (var i in t) {
25. int val;
26. set.TryGetValue(i, out val);
27. if (val != 0) {
28. parT.Add(set[i]);
29. } else {
30. set[i] = num;
31. parT.Add(set[i]);
32. num++;
33. }
34. }
36. for (var i = 0; i < parS.Count; i++) {
37. if (parT[i] != parS[i]) {
38. return false;
39. }
40. }
41. return true;
42. }
43. }

null

转载于:https://www.cnblogs.com/xiejunzhao/p/bd6d51f34f6d8d1c43ad4abada327833.html