Happy Tree Friend!(递归模拟) - 拼多多2018提前批笔试-服务器端开发工程师

解题思路：vector+结构体 模拟，递归输出。调试了很久，注意|–(此处有空格)name，前面空格每4个一组。

#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
using namespace std;
const int Maxn = 1005;

typedef struct Node
{
    string name;
    vector<int> Vec;
};

Node node[Maxn];
string stringStruct;

bool cmp(const int& a, const int& b)
{
    return node[a].name<node[b].name;
}

void Print(int id, bool last)
{
    cout << node[id].name << endl;
    if(node[id].Vec.size()==0)
        return;
    sort(node[id].Vec.begin(), node[id].Vec.end(), cmp);
    if(id>0)
    {
        stringStruct+="|   ";
        if(last)
            stringStruct[stringStruct.length()-4] = ' ';
    }
    for(int i = 0; i < node[id].Vec.size(); ++i)
    {
        if(i==node[id].Vec.size()-1)
        {
            cout << stringStruct << "`-- ";
            Print(node[id].Vec[i], true);
        }
        else
        {
            cout << stringStruct << "|-- ";
            Print(node[id].Vec[i], false);
        }
    }
    if(id>0)
        stringStruct = stringStruct.substr(0, stringStruct.length()-4);
}

int main()
{
    int n, fa;
    string stringStruct;
    while(cin >> n)
    {
        for(int i = 0; i < n; ++i)
            node[i].Vec.clear();
        for(int i = 0; i < n; ++i)
        {
            cin >> node[i].name >> fa;
            node[fa].Vec.push_back(i);
        }
        Print(0, true);
    }
    return 0;
}
/*
10
my-app -1
src 0
main 1
java 2
resource 2
webapp 2
test 1
java 6
resource 6
pom.xml 0
*/