205. Isomorphic Strings

题目描述【Leetcode】

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.

这道题其实用字母作为数组下标，然后每次存储时进行比较，存入的是此时的i+1,比较同位置的，代码如下：

class Solution {public:    bool isIsomorphic(string s, string t) {         int sc[200] = {0};         int tc[200] = {0};         for (int i = 0; i < s.length();  i++) {            if (sc[s[i]] != tc[t[i]]) return false;            sc[s[i]] = i + 1;            tc[t[i]] = i + 1;        }        return true;    }};