zoj_1004-Anagrams by stack

zoj 1004

#include <iostream>
#include <stack>
#include <vector>
#include <string>
using namespace std;
#define NUM 58 

string srcStr;
string destStr;
int srcStrLength;
stack<char> container;
vector<char> operate;//保存操作

//************************************
//回溯法查找
//@param srcIndex  当前要操作的源字符串的位置
//@param destIndex 当前已经匹配的目的字符串的位置
//************************************

void _findTheSequence(int srcIndex,int destIndex)
{
    if(destIndex == srcStrLength){
        for(vector<char>::iterator it = operate.begin();it!=operate.end();++it){
            cout<<*it<<" ";
        }
        cout<<endl;
        return;
    }

    if(srcIndex<srcStrLength)
    {
        container.push(srcStr[srcIndex]);
        operate.push_back('i');
        _findTheSequence(srcIndex+1,destIndex);
        container.pop();
        operate.pop_back();
    }

    if(srcIndex>destIndex && !container.empty())
    {
        char ch = container.top();
        if(ch == destStr[destIndex])
        {
            container.pop();
            operate.push_back('o');
            _findTheSequence(srcIndex,destIndex+1);
            container.push(ch);//恢复状态,因为container和operate都是全局变量
            operate.pop_back();
        }
    }
}


//************************************
//判断源字符串和目的字符串含有的字符以及其个数是否相同
//不加这个判断有可能会超时
//************************************
bool isSame()
{
    if(srcStrLength != destStr.length()) return false;

    int hash[NUM] = {0};
    for(int i=0;i<srcStrLength;++i) {
        ++hash[srcStr[i]-'A'];
        --hash[destStr[i]-'A'];
    }

    for(int i=0;i<srcStrLength;++i){
        if(hash[srcStr[i]-'A']) return false;
    }

    return true;
}


void findTheSequence()
{
    srcStrLength = srcStr.length();
    cout<<"["<<endl;
    if(isSame()) _findTheSequence(0,0);
    cout<<"]"<<endl;
}


int main()
{
    while(cin>>srcStr>>destStr){
        findTheSequence();
    }
    return 0;
}