字符串排列后匹配

 1 #include <iostream>
 2 #include <map>
 3 using namespace std;
 4 
 5 map<char,int>mp_model;
 6 map<char,int>mp_goal;
 7 map<char,int>::iterator it_goal;
 8 map<char,int>::iterator it_model;
 9 const int size = 1010;
10 char model[size];
11 char goal[size];
12 
13 bool judge( )
14 {
15     for( it_model = mp_model.begin() , it_goal = mp_goal.begin() ; it_model!=mp_model.end()&& it_goal!=mp_goal.end() ; it_model++ , it_goal++ )
16     {
17         if( it_model->first != it_goal->first || it_model->second!= it_goal->second )
18             return false;
19     }
20     if( it_model != mp_model.end() || it_goal != mp_goal.end() )
21         return false;
22     return true;
23 }
24 
25 int main()
26 {
27     bool flag;
28     int len_model , len_goal;
29     while( cin >> model >> goal )
30     {
31         mp_model.clear();
32         mp_goal.clear();
33         flag = false;
34         len_model = strlen(model);
35         len_goal = strlen(goal);
36         if( len_model < len_goal )
37         {
38             cout << "False" << endl;
39         }
40         else
41         {
42             for( int i = 0 ; i<len_goal ; i++ )
43             {
44                 mp_goal[ goal[i] ] ++;
45                 mp_model[ model[i] ] ++;
46             }
47             for( int j = len_goal-1 ; j<len_model ; j++ )
48             {
49                 flag = judge( );
50                 if( flag )
51                 {
52                     break;
53                 }
54                 else
55                 {
56                     mp_model[ j+1-len_goal] --;
57                     mp_goal[j] ++;
58                 }
59             }
60             if(flag)
61                 cout << "True" << endl;
62             else
63                 cout << "False" << endl;
64         }
65     }
66     return 0;
67 }