苏嵌 项目实战
姓名:唐茂华
日期: 2018.9.6
今日学习任务:学习编写关于停车场车辆出入,停留的知识。
今日任务完成情况:不太成功地完成关于停车场车辆信息记录的任务。
课后作业:
main.c
#include "park.h"
int main()
{
char choice[16] = {0};
stack park_stack,leaving_stack;
queue wait_queue;
welcome();
init(&park_stack,&leaving_stack,&wait_queue);
while(1)
{
menu();
printf("选择功能:\n");
memset(choice,0,8); //清空
scanf("%s",choice);
switch(choice[0])
{
case '1':
EnterPark(&park_stack,&wait_queue);
break;
case '2':
OutPark(&park_stack,&leaving_stack,&wait_queue);
break;
case '3':
ShowParkInfo(&park_stack);
break;
case '4':
ShowWaitInfo(&wait_queue);
break;
case '5':
bye();
break;
}
}
return 0;
}
park.c
#include <stdio.h>
#include "park.h"
void welcome()
{
system("clear");
printf("\n\n\n");
printf("****************************\n");
printf("**********welcome***********\n");
printf("****************************\n");
sleep(2);
}
void menu()
{
system("clear");
printf("\n\n\n");
printf("\t\t 1.car in\n");
printf("\t\t 2.car out\n");
printf("\t\t 3.inside carinfo\n");
printf("\t\t 4.waiting carinfo\n");
printf("\t\t 5.quit system\n");
}
void bye()
{
system("clear");
printf("\t\t\t byebye!!!\n");
exit(1);
}
void init(stack *s1, stack *s2, queue *q)
{
int ret;
ret = InitStack(s1);
if (FAILURE == ret)
{
printf("init Stack Failure!\n");
}
ret = InitStack(s2);
if (FAILURE == ret)
{
printf("init Stack Failure!\n");
}
ret = InitQueue(q);
if (FAILURE == ret)
{
printf("init Queue Failure!\n");
}
}
void EnterPark(stack *s, queue*q)
{
char id[32] = {0};
int ret;
printf("key car id: \n");
scanf("%s", id);
ret = push(s, id);
if(ret == FAILURE)
{
printf("push failure!\n");
}
else if (ret == FULL)
{
printf("parking is full,please wait.\n");
sleep(2);
EnterQueue(q, id);
}
}
void ShowParkInfo(stack *s)
{
if (NULL ==s)
{
return;
}
if (s->top == -1)
{
printf("no car!\n");
sleep(2);
return;
}
int i;
for(i = 0; i<= s->top; i++)
{
printf("car id: %s\n", s->CarData[i].id);
printf("parking time: %d\n", (int)(time(NULL) - s->CarData[i].t));
printf("***************\n");
}
printf("Press Enter Continue...\n");
getchar();
getchar();
}
void ShowWaitInfo(queue *q)
{
if(NULL ==q)
{
return;
}
node *p = q->front->next;
while(p)
{
printf("car id: %s\n", p->id);
p = p->next;
}
printf("Press Enter Continue...\n");
getchar();
getchar();
}
void OutPark(stack *s1, stack *s2, queue *q)
{
char *str;
char id[32] = {0};
int i = 0;
if(NULL == s1 || NULL == s2 || NULL == q)
{
return;
}
printf("key car id : \n");
scanf("%s", id);
while(1)
{
if(!strcmp(s1->CarData[s1->top].id, id)) //che pai hao xiang tong
{
str = pop(s1);
while(EmptyStack(s2) != SUCCESS)
{
str = pop(s2);
push(s1, str);
free(str);
}
if(EmptyQueue(q) != SUCCESS)
{
str = DelQueue(q);
push(s1, str);
free(str);
}
break;
}
else
{
str = pop(s1);
push(s2, str);
free(str);
}
if(EmptyStack(s1) == SUCCESS)
{
printf("car not exist!\n");
sleep(2);
while(EmptyStack(s2) != SUCCESS)
{
str = pop(s2);
push(s1, str);
free(str);
}
break;
}
}
}
queue.c
#include "park.h"
int InitQueue(queue *q)
{
if (NULL == q)
{
return FAILURE;
}
node *p = (node *)malloc(sizeof(node));
if (NULL == p)
{
return FAILURE;
}
p->next = NULL;
q->front = q->rear = p;
return SUCCESS;
}
int EnterQueue(queue *q, char *id)
{
if(NULL == q || NULL == id)
{
return FAILURE;
}
node * p = (node *)malloc(sizeof(node));
if (NULL == p)
{
return FAILURE;
}
strcpy(p->id, id);
p->next = NULL;
q->rear->next = p;
q->rear = p;
return SUCCESS;
}
int EmptyQueue(queue *q)
{
if(NULL == q)
{
return FAILURE;
}
return (q->front == q->rear) ? SUCCESS :FAILURE;
}
char *DelQueue(queue *q)
{
if(NULL == q)
{
return NULL;
}
char *id = (char*)malloc(32);
if(NULL == id)
{
return NULL;
}
node *p = q->front->next;
q->front->next = p->next;
strcpy(id, p->id);
free(p);
if(p == q->rear)
{
q->rear = q->front;
}
return id;
}
park.h
#ifndef PARK_H
#define PARK_H
#include <time.h>
#include <unistd.h>
#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#define MAXSIZE 2
#define SUCCESS 10000
#define FAILURE 10001
#define FULL 10002
struct CarInfo
{
char id[32];
time_t t;
};
typedef struct CarInfo info;
struct Stack
{
info CarData[MAXSIZE];
int top;
};
typedef struct Stack stack;
struct Node
{
char id[32];
struct Node *next;
};
typedef struct Node node;
struct Queue
{
node *front;
node *rear;
};
typedef struct Queue queue;
void welcome();
void menu();
void bye();
int InitQueue(queue *q);
int InitStack(stack *s);
void init(stack *s1, stack *s2, queue *q);
int EnterQueue(queue *q, char *id);
int push(stack *s, char *id);
void EnterPark(stack *s, queue*q);
void ShowParkInfo(stack *s);
void ShowWaitInfo(queue *q);
char *pop(stack *s);
int EmptyStack(stack *s);
char *DelQueue(queue *q);
void OutPark(stack *s1, stack *s2, queue *q);
#endif
stack.c
#include "park.h"
int InitStack(stack *s)
{
if (NULL == s)
{
return FAILURE;
}
s->top = -1;
return SUCCESS;
}
int push(stack *s, char *id)
{
if(NULL == s || NULL == id)
{
return FAILURE;
}
if(s->top == MAXSIZE -1 )
{
return FULL;
}
strcpy(s->CarData[s->top + 1].id, id);
s->CarData[s->top + 1].t = time(NULL);
s->top++;
return SUCCESS;
}
char *pop(stack *s)
{
char *id = (char *)malloc(32);
if(NULL == id)
{
return NULL;
}
if(NULL == s)
{
return NULL;
}
if(s->top == -1)
{
return NULL;
}
strcpy(id, s->CarData[s->top].id);
s->top--;
return id;
}
int EmptyStack(stack *s)
{
if(NULL ==s)
{
return FAILURE;
}
return (s->top == -1) ?SUCCESS : FAILURE;
}
今日未解决问题:程序有bug。
今日收获:做了一个完整的工程。
自我评价: