leetcode(c++) Isomorphic Strings

leetcode  题目练习

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 gett.

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

C++新手练习，记录一些遇到的问题。

#include <iostream>
#include <cstring>
using namespace std;
class Solution {
public:
    bool isIsomorphic(string s, string t) {
         int num=s.length();  //字符串的长度
        char* lable=new char[num];  //标签标记是否被访问过
        for(int i=0;i<num;i++)
        {
            lable[i]=0;  //初始化为0  表示没有被访问
        }
       char fir; //记录前面一个被覆盖的值
        for(int i=0;i<num;i++)
        {
            if(lable[i]==0)
            {
                fir=s[i];
                s[i]=t[i];
                lable[i]=1;
               for(int m=0;m<i;m++)
                 {
                     if(s[i]==s[m])    //这个操作很关键 排除二对一的情况, 开始的时候忽略了这个考虑，导致错误 
                            {
                                s[m]=0;
                            }
                        }
                for(int j=i+1;j<num;j++)
                {
                    if(s[j]==fir && lable[j]==0)
                    {
                        s[j]=s[i];
                        lable[j]=1;
                          //实现相同字符对应相同的t中的字符
                    }
                }
            }
        }
       if(s.compare(t)==0 )
        {
            return true;
        }
       else
       {
            return false;
       }
    }
};
int main()
{
 Solution m;
 cout<<m.isIsomorphic("ab","aa");
 system("pause");
 return 0;
}

  思路：定义一个数组，用来保存是否被访问过。然后依次用t去替换s，并加以限制条件替换，例如相同的元素要一次全部替换，同时设置label数组的值为1，表示被修改过。整个过程完成之后，加上对s中每个字符都不同的考虑，排除二对一的情况，最终比较s与t是否一样就可以了。