#include<iostream>
#include<stdlib.h>
#include<time.h>
#include<math.h>
#include<cstring>
#include<stdio.h>
using namespace std;
class Node
{
private:
int num;
char str[10];
public:
void Init(Node node);
void Init(int num,char *str);
int getNum();
char* getStr();
};
void Node::Init(Node node)
{
this ->num = node.getNum();
strcpy(this ->str,node.getStr());
}
void Node::Init(int num,char *Str)
{
this -> num = num;
strcpy(this -> str,Str);
}
int Node::getNum()
{
return num;
}
char* Node::getStr()
{
return str;
}
istream& operator>>(istream & in,Node& node)
{
char str[10];
int n;
char Str[20];
in >> str;
if (!strcmp(str,"()"))
{
//当输入为()时,设置cin的状态为错误,停止读入数据
cin.clear(ios::badbit);
return in;
}
sscanf(str,"(%d,%s)",&n,Str);
Str[strlen(Str)-1] = '\0';
node.Init(n,Str);
//cout << node.getStr() << endl;
return in;
}
int main()
{
while (true)
{
Node N;
Node node[260];
int count = 0;
int flag = 0;
while (cin >> N)
node[count++].Init(N);
for (int i = 0; i < count; i++)
{
for (int j = 0; j < count - 1; j++)
{
if (strlen(node[j].getStr()) > strlen(node[j+1].getStr()))
{
Node temp(node[j]);
node[j].Init(node[j+1]);
node[j+1].Init(temp);
}
if (strlen(node[j].getStr()) == strlen(node[j+1].getStr()))
{
if (strcmp(node[j].getStr(),node[j+1].getStr()) > 0)
{
Node temp(node[j]);
node[j].Init(node[j+1]);
node[j+1].Init(temp);
}
if (strcmp(node[j].getStr(),node[j+1].getStr()) == 0)
{
flag = 1;
//cout << "在同一位置存在重复的结点!" << endl;
}
}
}
}
for (int i = 0; i < count; i++)
cout << "第" << i << "个节点为:" << node[i].getNum() << " " << node[i].getStr() << endl;
for (int i = 1; i < count; i++)
{
if ((node[0].getNum() >= 0)&&(strcmp(node[0].getStr(),"") != 0))
{
flag = 1;
//cout << "缺少根节点!" << endl;
break;
}
else
{
char S[10];
strcpy(S,node[i].getStr());
int m = strlen(node[i].getStr());
S[m - 1] = '\0';
cout << "S is :" << S << endl;
int n = 0;
for (int j = 0; j <= i; j++)
{
if (strcmp(S,node[j].getStr()) == 0)
{
n = j;
//cout << "找到匹配在第" << j << "项" << endl;
break;
}
else
{
n = j;
continue;
}
}
if (n == i)
{
flag = 1;
//cout << "缺少路径上的结点!" << endl;
break;
}
}
}
if (flag == 0)
{
for (int i = 0; i < count; i++)
cout << node[i].getNum() << " ";
cout << endl;
}
else
cout << -1 << endl;
cin.clear();
}
system("pause");
return 0;
}
转载于:https://my.oschina.net/u/2286203/blog/374406