十大题型算法全实现——（六）文件管理[9]

}

// 创建目录

void MD(char dirName[])

{

int flag;

dirNode *p*q;

q=new dirNode;

strcpy(q>namedirName);

q>sub=NULL;

q>type=;

q>next=NULL;

q>father=workDir;

q>size=;

p=workDir>sub;

if(p==NULL){

workDir>sub=q;

cout<<\<

}

else{

flag=0;

while(p){

if(p->type==0){

if(!strcmp(p->name,dirName)){

flag=1;

cout<<"错误,\""<

}

}

p=p->next;

}

if(flag==0){

p=workDir->sub;

while(p->next){

p=p->next;

}

p->next=q;

[1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13]