leetcode 同构字符串

#include <unordered_map>
using namespace std;
class Solution {
public:
    bool isIsomorphic(string s, string t)
    {
        unordered_map<char,char> mymap;
      for(int i=0;i<s.size();i++)
      {
          if(mymap.find(s[i])==mymap.end())
          {
              for(unordered_map<char,char>::iterator iter=mymap.begin();iter!=mymap.end();iter++)
              {
                  if(iter->second == t[i])
                  {
                      return false;
                  }
              }
              mymap[s[i]] = t[i];
          }
          else
          {
              if(mymap[s[i]]==t[i])
                continue;
              else
                return false;
          }
      }
      return true;
    }
};