Leetcode 205 Isomorphic Strings 字符串处理

判断两个字符串是否同构

hs，ht就是每个字符出现的顺序

"egg" 与"add"的数字都是122

"foo"是122, 而"bar"是123

 class Solution {
 public:
     bool isIsomorphic(string s, string t) {
         int hs[] = {};
         int ht[] = {};
         if (s.size() != t.size()) return false;
         int o = ;
         for (int i =;i<s.size(); ++i)
         {
             if(hs[s[i]] == )  hs[s[i]] = ++o;
         }
         o = ;
         for (int i =;i<t.size(); ++i)
         {
             if(ht[t[i]] == )  ht[t[i]] = ++o;
         }
         for (int i = ;i<s.size(); ++i){
             if(hs[s[i]] != ht[t[i]])  return false;
         }
         return true;
     }
 };