leetcode-205 Isomorphic Strings

最新推荐文章于 2015-08-11 21:02:26 发布

原创最新推荐文章于 2015-08-11 21:02:26 发布 · 452 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

leetcode 专栏收录该内容

15 篇文章

订阅专栏

本文介绍了一种算法，用于判断两个字符串是否为同构字符串。即一个字符串中的字符是否可以替换得到另一个字符串，要求所有出现的字符都必须用另一个字符替换，并保持字符顺序不变。文章通过一个示例代码展示了如何实现这一功能。

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.

主要考察匹配映射。字符最多256个。
代码：

class Solution {
public:
    bool isIsomorphic(string s, string t) {
        int m[256]={0};
        int n[256]={0};
        int l=s.size();
        for(int i=0; i < l; i++)
        {
            if(m[s[i]] != n[t[i]])
            return false;
            m[s[i]] = n[t[i]] = i+1;
        }
        return true;
    }
};