LeetCode:Isomorphic Strings

Isomorphic Strings

Total Accepted: 41849 Total
Submissions: 150148 Difficulty: Easy

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.

Subscribe to see which companies asked this question

Hide Tags
Hash Table

code:

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