数据结构课程设计之停车场管理

#include "stdafx.h"
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define max 5       
#define pri 2

typedef struct time{    
int year;
int day;
int month;
int hour;
int min;
}Time;

typedef struct node{    
char num[10];
    Time reach;
    Time leave;
}Carinfo;

typedef struct car{
Carinfo *data;
    struct car *next;
}queue;

typedef struct Node{
queue *lead;
    queue *end;
}link;

typedef struct NODE{
Carinfo *b[max+1];
    int top;
}Zhan;


void Zhaninit(Zhan *s){   
 
     int i;
     s->top=0;
     for(i=0;i<=max;i++)
 s->b[s->top]=NULL;
}

int queueinit(link *U){     
U->lead=(queue *)malloc(sizeof(queue));
if(U->lead!=NULL)
{
U->lead->next=NULL;
        U->end=U->end;
        return(1);
}
    else return(-1);
}

   
int Arrival(Zhan *into,link *R){    

Carinfo *p;