关闭

205. Isomorphic Strings

标签: c++hashtable
119人阅读 评论(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.


1.我的答案

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


0
0

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