样例:
![在这里插入图片描述](https://img-blog.csdnimg.cn/20200727105645285.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MjcyMTQxMg==,size_16,color_FFFFFF,t_70)
代码:
#include<bits/stdc++.h>
using namespace std;
string s;
vector<vector<int> > vv;
int A[500005];
int f_tree(int &x)
{
if(s[x]=='0')
{
return x;
}
if(s[x]=='2'){
int c=x;
x++;
vv[c].push_back(f_tree(x));
x++;
vv[c].push_back(f_tree(x));
return c;
}
if(s[x]=='1'){
int c=x;
x++;
vv[c].push_back(f_tree(x));
return c;
}
}
int main()
{
cin>>s;
vector<int> v;
for(int i=0;i<s.size();i++) vv.push_back(v);
memset(A,-1,sizeof(A));
int c=0;
f_tree(c);
for(int i=0;i<s.size();i++){
for(int j=0;j<vv[i].size();j++) cout<<vv[i][j]<<' ';
cout<<endl;
}
}
测试:
![在这里插入图片描述](https://img-blog.csdnimg.cn/20200727105707183.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MjcyMTQxMg==,size_16,color_FFFFFF,t_70)