网站大量收购独家精品文档,联系QQ:2885784924

数据结构 停车场管理系统(Data structure parking management system).doc

数据结构 停车场管理系统(Data structure parking management system).doc

  1. 1、本文档共22页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
数据结构 停车场管理系统(Data structure parking management system)

数据结构 停车场管理系统(Data structure parking management system) # include conio. H # include malloc. H # include stdio, h # include stdlib. H # include Windows. H / / empty the current screen # define ClearScreen () system ( CLS ) / / display string szPrompt and wait for the user to press any key Define Pause (szPrompt) printf ( % s , szPrompt), getch () Typedef struct carinformation / / vehicle information { Char szRegistrationMark [64]. / / license plate number Char szArrivalTime [16]. / / arrival time Char szEntranceTime [16]. / / enter the parking lot (start billing) time Char szDepartureTime [16]. / / leave time } TCARINFORMATION, * LPTCARINFORMATION; Typedef struct carstack { LPTCARINFORMATION lpCarInformation; / / vehicle information Int the nTop; / / stack top element subscript Int nStackSize; / / stack capacity } TCARSTACK, * LPTCARSTACK; / / initialize stack lpCarStack, setting its capacity to nSize Void InitStack (LPTCARSTACK lpCarStack, int nSize) { LpCarStack = (LPTCARSTACK) malloc (sizeof (TCARSTACK)); Lpcarstack- lpCarInformation = (LPTCARINFORMATION) malloc ( N size of sizeof (TCARINFORMATION) ); LpCarStack - nTop = 1; LpCarStack - nStackSize = nSize; } / / vehicle information carinfo entry stack lpCarStack Void Push (LPTCARSTACK lpCarStack, TCARINFORMATION carinfo) { LpCarStack - nTop++; LpCarStack - lpCarInformation [lpCarStack - nTop] = carinfo; } / / vehicle information is ejected from the stack lpCarStack and stored in carinfo Void Pop (LPTCARSTACK lpCarStack, TCARINFORMATION carinfo) { Carinfo = lpCarStack - lpCarInformation [lpCarStack - nTop]; LpCarStack - nTop --; } / / if stack lpCarstack is empty, return TRUE; Otherwise, return FALSE BOOL IsStackEmpty (LPTCARSTACK lpCarStack) { Return lpCarStack - nTop = = 1; } / / if stack lpStackFull is full, returns TRUE; Otherwise, return FALSE BOOL IsStackFull (LPTCARSTACK lpCarStack) { Return lpCarStack - nTop = = (lpCarStack - nStackSize - 1); } / / destroy stack lpCarStack and set p

您可能关注的文档

文档评论(0)

f8r9t5c + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

版权声明书
用户编号:8000054077000003

1亿VIP精品文档

相关文档