关闭

leetcode-205 Isomorphic Strings

210人阅读 评论(0) 收藏 举报
分类:

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;
    }
};
0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:37054次
    • 积分:986
    • 等级:
    • 排名:千里之外
    • 原创:64篇
    • 转载:0篇
    • 译文:0篇
    • 评论:3条
    文章分类