205. Isomorphic Strings

发表于 | 分类于 ， | 阅读次数:

Total Accepted: 47679
Total Submissions: 165936
Difficulty: 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.

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:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
public class Solution {
    public boolean isIsomorphic(String s, String t) {
        int[] times1 = new int[128], times2 = new int[128];
        int len = s.length();
        for (int i = 0, smax = 0, tmax = 0; i < len; ++i) {
            char sc = s.charAt(i);
            char tc = t.charAt(i);
            if (times1[sc] == 0) {
                times1[sc] = ++smax;
            }
            if (times2[tc] == 0) {
                times2[tc] = ++tmax;
            }
            if (times1[sc] != times2[tc])
                return false;
        }
        return true;
    }
}

打个小广告

欢迎加入我的小专栏「基你太美」一起学习。