數據結構課程設計停車場問題

❶ 數據結構課程設計--用棧建立一個停車場管理系統

#include<stdio.h>
#include<stdlib.h>
#include<string.h>

#define MAX 20
#define price 0.05

typedef struct time{
int hour;
int min;
}Time;

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

typedef struct NODE{
CarNode *stack[MAX+1];
int top;
}SeqStackCar;

typedef struct car{
CarNode *data;
struct car *next;
}QueueNode;

typedef struct Node{
QueueNode *head;
QueueNode *rear;
}LinkQueueCar;

void InitStack(SeqStackCar *);
int InitQueue(LinkQueueCar *);
int Arrival(SeqStackCar *,LinkQueueCar *);
void Leave(SeqStackCar *,SeqStackCar *,LinkQueueCar *);
void List(SeqStackCar,LinkQueueCar);

void main()
{
SeqStackCar Enter,Temp;
LinkQueueCar Wait;
int ch;
InitStack(&Enter);
InitStack(&Temp);
InitQueue(&Wait);
while(1)
{
printf("\n1. 車輛到達登記");
printf(" 2. 車輛離開登記");
printf(" 3. 車輛列表顯示");
printf(" 4. 退出系統\n");
while(1)
{
scanf("%d",&ch);
if(ch>=1&&ch<=4)break;
else printf("\n請選擇： 1~4.");
}
switch(ch)
{
case 1:Arrival(&Enter,&Wait);break;
case 2:Leave(&Enter,&Temp,&Wait);break;
case 3:List(Enter,Wait);break;
case 4:exit(0);
default: break;
}
}
}

void InitStack(SeqStackCar *s){

int i;
s->top=0;
for(i=0;i<=MAX;i++)
s->stack[s->top]=NULL;
}
int InitQueue(LinkQueueCar *Q){

Q->head=(QueueNode *)malloc(sizeof(QueueNode));
if(Q->head!=NULL)
{
Q->head->next=NULL;
Q->rear=Q->head;
return(1);
}
else return(-1);
}
void PRINT(CarNode *p,int room){

int A1,A2,B1,B2;
printf("\n車輛離開的時間:");
scanf("%d:%d",&(p->leave.hour),&(p->leave.min));
printf("\n離開車輛的車牌號為:");
puts(p->num);
printf("\n其到達時間為: %d:%d",p->reach.hour,p->reach.min);
printf("離開時間為: %d:%d",p->leave.hour,p->leave.min);
A1=p->reach.hour;
A2=p->reach.min;
B1=p->leave.hour;
B2=p->leave.min;
printf("\n應交費用為: %2.1f元",((B1-A1)*60+(B2-A2))*price);
free(p);
}
int Arrival(SeqStackCar *Enter,LinkQueueCar *W){

CarNode *p;
QueueNode *t;
p=(CarNode *)malloc(sizeof(CarNode));
flushall();
printf("\n請輸入車牌號(例:豫B1234):");
gets(p->num);
if(Enter->top<MAX)
{
Enter->top++;
printf("\n車輛在車場第%d位置.",Enter->top);
printf("\n車輛到達時間:");
scanf("%d:%d",&(p->reach.hour),&(p->reach.min));
Enter->stack[Enter->top]=p;
return(1);
}
else
{
printf("\n該車須在便道等待!有車位時進入車場");
t=(QueueNode *)malloc(sizeof(QueueNode));
t->data=p;
t->next=NULL;
W->rear->next=t;
W->rear=t;
return(1);
}
}
void Leave(SeqStackCar *Enter,SeqStackCar *Temp,LinkQueueCar *W)
{
int room;
CarNode *p,*t;
QueueNode *q;

if(Enter->top>0)
{
while(1)
{
printf("\n請輸入車在車場的位置/1--%d/：",Enter->top);
scanf("%d",&room);
if(room>=1&&room<=Enter->top) break;
}
while(Enter->top>room)
{
Temp->top++;
Temp->stack[Temp->top]=Enter->stack[Enter->top];
Enter->stack[Enter->top]=NULL;
Enter->top--;
}
p=Enter->stack[Enter->top];
Enter->stack[Enter->top]=NULL;
Enter->top--;
while(Temp->top>=1)
{
Enter->top++;
Enter->stack[Enter->top]=Temp->stack[Temp->top];
Temp->stack[Temp->top]=NULL;
Temp->top--;
}
PRINT(p,room);

if((W->head!=W->rear)&&Enter->top<MAX)
{
q=W->head->next;
t=q->data;
Enter->top++;
printf("\n便道的%s號車進入車場第%d位置.",t->num,Enter->top);
printf("\n請輸入%s號車進入車場的時間:");
scanf("%d:%d",&(t->reach.hour),&(t->reach.min));
W->head->next=q->next;
if(q==W->rear) W->rear=W->head;
Enter->stack[Enter->top]=t;
free(q);
}
else printf("\n便道里沒有車.\n");
}
else printf("\n車場里沒有車.");
}
void List1(SeqStackCar *S)
{
int i;
if(S->top>0)
{
printf("\n車場:");
printf("\n 位置到達時間 車牌號\n");
for(i=1;i<=S->top;i++)
{
printf(" %d ",i);
printf(" %d:%d ",S->stack[i]->reach.hour,S->stack[i]->reach.min);
puts(S->stack[i]->num);
}
}
else printf("\n車場里沒有車");
}
void List2(LinkQueueCar *W)
{
QueueNode *p;
p=W->head->next;
if(W->head!=W->rear)
{
printf("\n等待車輛的號碼為:");
while(p!=NULL)
{
puts(p->data->num);
p=p->next;
}
}
else printf("\n便道里沒有車.");
}
void List(SeqStackCar S,LinkQueueCar W)
{
int flag,tag;
flag=1;
while(flag)
{
printf("\n請選擇 1|2|3:");
printf("\n1.車場列表\n2.便道列表\n3.返回主菜單\n");
while(1)
{
scanf("%d",&tag);
if(tag>=1||tag<=3) break;
else printf("\n請選擇 1~3:");
}
switch(tag)
{
case 1:List1(&S);break;
case 2:List2(&W);break;
case 3:flag=0;break;
default: break;
}
}
}

❷ 數據結構課程設計 停車場管理(數據結構)

讓我想起了大學數據結構的老師,這個題目就是一個數據結構題目而已.

❸ C++ 停車場管理 數據結構 課程設計

你好朋友，試下這個！希望可以幫到你

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define MAX 2 /*車庫容量*/
typedef struct node
{char num[10];
}CarNode;/*車輛信息結點*/
typedef struct NODE{
CarNode *stack[MAX+1];
int top;
}SeqStackCar; /*模擬車站*/
typedef struct car{
CarNode *data;
struct car *next;
}QueueNode;
typedef struct Node{
QueueNode *head;
QueueNode *rear;
}LinkQueueCar; /*模擬通道*/
void InitStack(SeqStackCar *); /*初始化棧*/
int InitQueue(LinkQueueCar *); /*初始化便道*/
int Arrival(SeqStackCar *,LinkQueueCar *); /*車輛到達*/
void Leave(SeqStackCar *,SeqStackCar *,LinkQueueCar *); /*車輛離開*/
void List(SeqStackCar,LinkQueueCar); /*顯示存車信息*/
void main()
{SeqStackCar Enter,Temp;
LinkQueueCar Wait;
int ch;
InitStack(&Enter); /*初始化車站*/
InitStack(&Temp); /*初始化讓路的臨時棧*/
InitQueue(&Wait); /*初始化通道*/
printf("\n\n\n 題 目：模擬停車場管理問題\n\n");
printf("\n\n\n\n\n-----------按任意鍵繼續---------------");
getch();
clrscr();
while(1)
{ printf("\n1. 車輛到達");
printf(" 2. 車輛離開");
printf(" 3. 列表顯示");
printf(" 4. 退出系統\n");
while(1)
{scanf("%d",&ch);
if(ch>=1&&ch<=4)break;
else printf("\n請選擇： 1|2|3|4.");
}
switch(ch)
{ case 1:Arrival(&Enter,&Wait);break; /*車輛到達*/
case 2:Leave(&Enter,&Temp,&Wait);break; /*車輛離開*/
case 3:List(Enter,Wait);break; /*列表列印信息*/
case 4:exit(0); /*退出主程序*/
default: break;
}}}
void InitStack(SeqStackCar *s) /*初始化棧*/
{ int i;
s->top=0;
for(i=0;i<=MAX;i++)
s->stack[s->top]=NULL;}
int InitQueue(LinkQueueCar *Q) /*初始化便道*/
{Q->head=(QueueNode *)malloc(sizeof(QueueNode));
if(Q->head!=NULL)
{Q->head->next=NULL;
Q->rear=Q->head;
return(1);}
else return(-1);}
void PRINT(CarNode *p) /*列印出站車的信息*/
{
printf("\n離開車輛的車牌號為:");
puts(p->num);
}
int Arrival(SeqStackCar *Enter,LinkQueueCar *W) /*車輛到達*/
{ CarNode *p;
QueueNode *t;
p=(CarNode *)malloc(sizeof(CarNode));
flushall();
printf("\n請輸入車牌號(例:陝A1234):");
gets(p->num);
if(Enter->top<MAX) /*車場未滿，車進車場*/
{Enter->top++;
printf("\n車輛在車場第%d位置.",Enter->top);
Enter->stack[Enter->top]=p;
return(1);}
else /*車場已滿，車進便道*/
{ printf("\n該車須在便道等待!");
t=(QueueNode *)malloc(sizeof(QueueNode));
t->data=p;
t->next=NULL;
W->rear->next=t;
W->rear=t;
return(1); }}
void Leave(SeqStackCar *Enter,SeqStackCar *Temp,LinkQueueCar *W)/*車輛離開*/
{
int i, room;
CarNode *p,*t;
QueueNode *q;
/*判斷車場內是否有車*/
if(Enter->top>0) /*有車*/
{ while(1) /*輸入離開車輛的信息*/
{printf("\n請輸入車在車場的位置/1--%d/：",Enter->top);
scanf("%d",&room);
if(room>=1&&room<=Enter->top) break;}
while(Enter->top>room) /*車輛離開*/
{Temp->top++;
Temp->stack[Temp->top]=Enter->stack[Enter->top];
Enter->stack[Enter->top]=NULL;
Enter->top--;
}
p=Enter->stack[Enter->top];
Enter->stack[Enter->top]=NULL;
Enter->top--;
while(Temp->top>=1)
{Enter->top++;
Enter->stack[Enter->top]=Temp->stack[Temp->top];
Temp->stack[Temp->top]=NULL;
Temp->top--;}
PRINT(p);
/*判斷通道上是否有車及車站是否已滿*/
if((W->head!=W->rear)&&Enter->top<MAX) /*便道的車輛進入車場*/
{ q=W->head->next;
t=q->data;
Enter->top++;
printf("\n便道的%s號車進入車場第%d位置.",t->num,Enter->top);
W->head->next=q->next;
if(q==W->rear) W->rear=W->head;
Enter->stack[Enter->top]=t;
free(q);}
else printf("\n便道里沒有車.\n");}
else printf("\n車場里沒有車."); /*沒車*/ }
void List1(SeqStackCar *S) /*列表顯示車場信息*/
{int i;
if(S->top>0) /*判斷車站內是否有車*/
{printf("\n車場:");
printf("\n 位置 車牌號\n");
for(i=1;i<=S->top;i++)
{printf(" %d ",i);
puts(S->stack[i]->num);}}
else printf("\n車場里沒有車");}
void List2(LinkQueueCar *W) /*列表顯示便道信息*/
{ QueueNode *p;
p=W->head->next;
if(W->head!=W->rear) /*判斷通道上是否有車*/
{printf("\n等待車輛的號碼為:\n");
while(p!=NULL)
{puts(p->data->num);
p=p->next;}}
else printf("\n便道里沒有車."); }
void List(SeqStackCar S,LinkQueueCar W)
{int flag,tag;
flag=1;
while(flag)
{printf("\n請選擇 1|2|3:");
printf("\n1.車場\n2.便道\n3.返回\n");
while(1)
{ scanf("%d",&tag);
if(tag>=1||tag<=3) break;
else printf("\n請選擇 1|2|3:");
}switch(tag)
{case 1:List1(&S);break; /*列表顯示車場信息*/
case 2:List2(&W);break; /*列表顯示便道信息*/
case 3:flag=0;break;
default: break; }}}