205. Isomorphic Strings

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


阅读更多
文章标签: c++ hashtable
个人分类: leetcode c++
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

不良信息举报

205. Isomorphic Strings

最多只允许输入30个字

加入CSDN,享受更精准的内容推荐,与500万程序员共同成长!
关闭
关闭