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.
class Solution { public: bool isIsomorphic(string s, string t) { int arry[256]={0}; int arry2[256]={0}; for(int i=0;i<s.size();i++){ if(arry[s[i]]==0){ if(arry2[t[i]]){ return false; } arry[s[i]] = t[i]; arry2[t[i]] = 1; }else if(arry[s[i]]!=0){ if(arry[s[i]] != t[i]){ return false; } } } return true; } };
原文：http://www.cnblogs.com/zengzy/p/5051740.html