邀請好友加入騰訊云自媒體分享計劃
給好友發(fā)送邀請鏈接，好友成功加入計劃后你和好友都分別獲得 30 / 100 / 180 元云服務(wù)器代金
#include
#include
#include
#include
struct stackstruct /棧的結(jié)構(gòu)體/
{
int id;
int time;
struct stackstruct pre;
struct stackstruct next;
};

創(chuàng)新互聯(lián)公司服務(wù)項(xiàng)目包括陽西網(wǎng)站建設(shè)、陽西網(wǎng)站制作、陽西網(wǎng)頁制作以及陽西網(wǎng)絡(luò)營銷策劃等。多年來，我們專注于互聯(lián)網(wǎng)行業(yè)，利用自身積累的技術(shù)優(yōu)勢、行業(yè)經(jīng)驗(yàn)、深度合作伙伴關(guān)系等，向廣大中小型企業(yè)、政府機(jī)構(gòu)等提供互聯(lián)網(wǎng)行業(yè)的解決方案，陽西網(wǎng)站推廣取得了明顯的社會效益與經(jīng)濟(jì)效益。目前，我們服務(wù)的客戶以成都為中心已經(jīng)輻射到陽西省份的部分城市，未來相信會繼續(xù)擴(kuò)大服務(wù)區(qū)域并繼續(xù)獲得客戶的支持與信任！

struct queuestruct //隊(duì)列結(jié)構(gòu)體
{
int id;
struct queuestruct *next;
};

struct stackstruct stackhead1, stackend1;
struct stackstruct stackhead2, stackend2;
struct queuestruct queuehead, queueend;
int stack1count, stack2count; /棧中元素總數(shù)/
int queuecount; /隊(duì)列中元素總數(shù)/

void push(int flag, struct stackstruct p)
{
struct stackstruct stack;
if (flag == 0) /棧1進(jìn)棧操作/
{
if (stack1count == 0)//棧1空
{
stackhead1 = (struct stackstruct )malloc(sizeof(struct stackstruct));
stackhead1->id = p->id;
stackhead1->time = p->time;
stackhead1->next = NULL;
stackhead1->pre = NULL;
stackend1 = stackhead1;
}
else
{
stack = (struct stackstruct )malloc(sizeof(struct stackstruct));
stack->id = p->id;
stack->time = p->time;
stackend1->next = stack;
stack->pre = stackend1;
stack->next = NULL;
stackend1 = stack;
}
stack1count++;
}
else if (flag == 1) /棧2進(jìn)棧操作，棧1出棧/
{
if (stack2count == 0)//棧2空
{
stackhead2 = (struct stackstruct )malloc(sizeof(struct stackstruct));
stackhead2->id = p->id;
stackhead2->time = p->time;
stackhead2->next = NULL;
stackhead2->pre = NULL;
stackend2 = stackhead2;
}
else
{
stack = (struct stackstruct )malloc(sizeof(struct stackstruct));
stack->id = p->id;
stack->time = p->time;
stackend2->next = stack;
stack->pre = stackend2;
stack->next = NULL;
stackend2 = stack;
}
stack2count++;
}
}

struct stackstruct pop(int id, int time)
{
struct stackstruct stack;
stack = (struct stackstruct *)malloc(sizeof(struct stackstruct));

if (stackend1->id != id)
{
    stack->id = stackend1->id;
    stack->time = stackend1->time;
    stack->pre = stackend1->pre;
    stackend1=NULL;
    stackend1 = stack->pre;
    stackend1->next = NULL;
    stack1count--;
}
else
{
    stack->id = stackend1->id;
    stack->time = stackend1->time;
    stack->pre = stackend1->pre;
    printf("%d號汽車出停車場\n",id);
    printf("停車場停留時間: %d\n",time - stack->time);
    printf("應(yīng)該繳納的費(fèi)用(單價: 5): %d\n", 5 * (time - stack->time));
    stackend1=NULL;
    if (--stack1count == 0)
        stackend1 = stackhead1 = NULL;
    else
    {
        stackend1 = stack->pre;
        stackend1->next = NULL;
    }
    stack = NULL;
}
return stack;

}

struct stackstruct pop1()//棧2元素出棧
{
struct stackstruct stack;
stack = (struct stackstruct *)malloc(sizeof(struct stackstruct));

stack->id = stackend2->id;
stack->time = stackend2->time;
stack->pre = stackend2->pre;
free(stackend2);
stackend2 = stack->pre;
stack2count--;

return stack;

}

void Enqueue(struct stackstruct p)//入隊(duì)
{
struct queuestruct queue;
if (queuecount == 0)
{
queuehead = (struct queuestruct )malloc(sizeof(struct queuestruct));
queuehead->id = p->id;
queuehead->next = NULL;
queueend = queuehead;
}
else
{
queue = (struct queuestruct )malloc(sizeof(struct queuestruct));
queue->id = p->id;
queue->next = NULL;
queueend->next = queue;
queueend = queue;
}
queuecount++;
}

struct stackstruct Dequeue(int time)//出隊(duì)
{
struct stackstruct stack;
stack = (struct stackstruct *)malloc(sizeof(struct stackstruct));

stack->id = queuehead->id;
stack->time = time;
if (--queuecount == 0)
{
    queuehead = NULL;
    queueend = NULL;
}
else
    queuehead = queuehead->next;
return stack;

}
int main()
{
int n;
char s = {0};
struct stackstruct p;
printf("輸入狹長通道可停放汽車數(shù)量: ");
scanf_s("%d", &n);
getchar();
stack1count = stack2count = queuecount = 0;
p = (struct stackstruct )malloc(sizeof(struct stackstruct));
printf("輸入停車信息:(動作，車牌號，時間)\n");
while (scanf_s("%c,%d%d", &s,1, &p->id, &p->time) != EOF)
{
if (s =='E')
{
printf("End");
break;
}
if (s =='A') /汽車到達(dá)/
{
if (stack1count < n) /棧未滿，進(jìn)棧操作/
{
push(0, p);
printf("%d號汽車進(jìn)入停車場\n",p->id);
printf("進(jìn)入停車場時間: %d\n",stackend1->time);
printf("停車位置: %d\n",stack1count);
}
else /棧滿，進(jìn)隊(duì)列操作/
{
Enqueue(p);
printf("%d號汽車進(jìn)入便道\n",p->id);
printf("進(jìn)入便道時間: %d\n",p->time);
printf("便道位置: %d\n",queuecount);
}
}
if (s =='D') /汽車離去/
{
struct stackstruct *temp;
while ((temp = pop(p->id, p->time)) != NULL)
{
push(1, temp);
}
while (stack2count != 0)
{
push(0, pop1());
}
if (queuecount != 0)
{
push(0, Dequeue(p->time));
printf("%d號汽車進(jìn)入停車場\n",stackend1->id);
printf("進(jìn)入時間: %d\n",stackend1->time);
printf("停車位置: %d\n",stack1count);
}
}
}
return 0;
}
我的博客即將同步至騰訊云+社區(qū)，邀請大家一同入駐：https://cloud.tencent.com/developer/support-plan?invite_code=hiyc3ueo3ntk