基于数据结构的停车场计时收费系统实现

void StopInput(SqStack *S)            //停车场车辆登记
{
int e;
int i;
int j = 0;
int isReach = FALSE;              //车到达与否
    int isLeave = FALSE;              //车离开与否
int leaveTime = 0;                //即尚未离开
int cost = 0;                     //停车费用
int isEmpty = TRUE;               //车位是否为空
int *p = NULL;
    printf("\n--车辆到达登记--\n");
printf("\n请输入车牌号：(车牌号重复时自动退出)\n");
scanf("%d",&e);
    isReach = TRUE;
if(Search(S,0) && !Search(S,e))                   //车牌号为0时，停车位空出，优先将进入停车场的车辆放置于此
{
if((*S).top != (*S).base) //栈不为空时
{
        for(p= (*S).base;p <= (*S).top-1;p++)
{
        j++;
//printf("\n--%d--\n",j);
        if(j == 4)
{
time(&rawtime);
*p = rawtime;
    timeinfo = localtime (&rawtime);
        printf("到达时间: %s",asctime(timeinfo));
}

        else if(j == 6)
{
    if(*p != NULL)
{
    rawtime = *p;
        timeinfo = localtime (&rawtime);
            printf("离开时间: %s",asctime(timeinfo));
}
    else
    printf("离开时间: 空\n");
}
    else if(j == 7)
{
*p = 0;
    printf("停车费用:%d元\n",*p);
}
    else if(j == 8)
{
*p = FALSE;
    if(*p == FALSE)
        printf("停车位是否为空: 否\n");
    else
                        printf("停车位是否为空: 是\n");
    j = 0;
break;
}
        else if(j == 1 || j == 2 || j == 3 || j == 5)
{
    if(j == 1)
{