目录树

#include<iostream>
#include<algorithm>
using namespace std;
typedef struct TNode {
	bool type;
	string name;
	struct TNode* Child_file[500];
	struct TNode* Child_mulu[500];
	int file;
	int mulu;
}TNode, * Root;
int n;
Root root;
TNode* Search(Root Node, string s)
{
	for (int i = 0; i < Node->mulu; i++)
		if (Node->Child_mulu[i]->name == s)
			return Node->Child_mulu[i];
	return NULL;
}
TNode* Creat_Mulu(Root& head, string s)
{
	TNode* p = new TNode;
	p->name = s;
	p->type = true;
	p->mulu = 0;
	p->file = 0;
	head->Child_mulu[head->mulu++] = p;
	return p;
}
void Creat_File(Root& head, string s)
{
	TNode* p = new TNode;
	p->name = s;
	p->type = false;
	head->Child_file[head->file++] = p;
}
void Deal(string s)
{
	string str = "";
	TNode* Pre = root;
	int Time = 0;
	Root head = root;
	for (int i = 0; i < s.size(); i++)
	{
		if (s[i] != '\\')
			str += s[i];
		else {
			Pre = Search(head, str);
			if (!Pre)
				head = Creat_Mulu(head, str);
			else
				head = Pre;
			str = "";
		}
	}
	if (s[s.size() - 1] != '\\')
	{
		Pre = Search(head, str);
		if (!Pre)
			Creat_File(head, str);
	}
}
void Initial() {
	root = new TNode;
	root->name = "root";
	root->file = 0;
	root->mulu = 0;
	root->type = true;
	cin >> n;
	for (int i = 0; i < n; i++)
	{
		string s;
		cin >> s;
		Deal(s);
	}
}
bool cmp(TNode* a, TNode* b)
{
	return a->name < b->name;
}
void Show(Root head, int n)
{
	for (int j = 0; j < n; j++)
		cout << "  ";
	cout << head->name << endl;
	if (head->type == false)
		return;
	sort(head->Child_file, (head->Child_file) + head->file, cmp);
	sort(head->Child_mulu, (head->Child_mulu) + head->mulu, cmp);
	for (int i = 0; i < head->mulu; i++)
		Show(head->Child_mulu[i], n + 1);
	for (int i = 0; i < head->file; i++)
		Show(head->Child_file[i], n + 1);
}
int main() {
	Initial();
	Show(root, 0);
}

顾风/中位数

Content Risk Flag

Comments (0)

顾风/中位数 .gitee-modal { width: 500px !important; }

Content Risk Flag

目录树

Comments (0)

Search

顾风/中位数