ZOJ_1004/HDOJ_1515_Anagrams by Stack stack ve...

最新推荐文章于 2019-10-28 16:29:30 发布

转载最新推荐文章于 2019-10-28 16:29:30 发布 · 129 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：https://my.oschina.net/dianpaopao/blog/124805

文章标签：

#python

本文介绍了一个使用递归方法解决括号匹配问题的C++程序实现。该程序通过构建栈结构来跟踪括号的开闭状态，并利用向量记录操作过程，最终输出所有可能的操作序列。

2019独角兽企业重金招聘Python工程师标准>>>

O和o的区别又把我坑

#include <stdio.h>
#include <iostream>
#include <string>
#include <stack>
#include <vector>
using namespace std;

int length;
string a, b;
vector<char>operate;
stack<char>build;
//freopen("in", "r", stdin);
//freopen("out", "w", stdout);
    
void
dfs(int ipush, int ipop)
{
    if(ipush==length && ipop==length){
        for(int i=0; i<operate.size(); i++)
            cout<<operate[i]<<" ";
        cout<<endl;   
    }    
    if(ipush+1<=length){
        build.push(a[ipush]);
        operate.push_back('i');
        dfs(ipush+1, ipop);
        build.pop();
        operate.pop_back(); 
    }
    if(ipop+1<=ipush && ipop+1<=length && build.top()==b[ipop]){
        char tc=build.top();
        build.pop();
        operate.push_back('o');
        dfs(ipush, ipop+1);
        build.push(tc);
        operate.pop_back();    
    }
}

int
main()
{
    while(cin>>a>>b){
        
        operate.clear();
        while(build.empty()!=1) 
            build.pop();
            
        length=a.length();
        cout<<"["<<endl;
        dfs(0, 0);
        cout<<"]"<<endl;  
    }    
    return 0;
}

转载于:https://my.oschina.net/dianpaopao/blog/124805