1.3字符串 确定两串乱序同构

 1 class Same {
 2 public:
 3     bool checkSam(string stringA, string stringB) {
 4         // write code here
 5         if(stringA.size()!=stringB.size())
 6             return false;
 7         sort(stringA.begin(),stringA.end());
 8         sort(stringB.begin(),stringB.end());
 9         return stringA==stringB;
10  
11     }
12 };

 1 class Same {
 2 public:
 3     bool checkSam(string stringA, string stringB) {
 4         // write code here
 5         int count[256]={0};
 6         if(stringA.size()!=stringB.size())
 7             return false;
 8         for(string::size_type i=0;i<stringA.size();i++)
 9         {
10             int n=stringA[i];
11             count[n]++;    
12         }
13         for(string::size_type j=0;j<stringB.size();j++)
14         {
15             int m=stringB[j];
16             count[m]--;
17             if(count[m]<0)
18                 return false;
19         }
20         return true;
21     }
22 };