双向循环队列(国外英文资料).docVIP

  1. 1、本文档共24页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  5. 5、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  6. 6、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  7. 7、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  8. 8、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
双向循环队列(国外英文资料)

双向循环队列(国外英文资料) A two-way loop queue. TXT is a smoke that is lonely... Its not that you dont laugh. People are not smart, and they learn to be bald. Dont say my heart doesnt hold my heart! No, no, no, no, no, no, no, no! Be happy when you are alive, because we will die long. Please dont speak English in front of me, OK? # include iostream # include cstrings # # ifndef DataType # define DataType int # endif # # ifndef MaxSize # define MaxSize 5 # endif Typedef struct { DataType list [MaxSize]; Int the front; / / head pointer Int rear; / / tail pointer } BSeqCQueue; Int in_queue (BSeqCQueue * q, DataType * d) { If ((q- rear + 1) % MaxSize! = q- front) {. Q- list. So q minus , thats the same thing as q minus . Return 0; } The else return 1; } Int out_queue (BSeqCQueue * q, DataType * d) { If (q- front! = q- rear) { * d = q- list [q- front]; Q minus front = (q- front + 1). Return 0; } Return 1; } Int main () { BSeqCQueue * Q = new (BSeqCQueue); Memset (Q, 0, sizeof (* Q)); / / initialization is sometimes called q-, which is the same thing as Q - front = 0, Int I; For (I = 0; I 6; I + +) { If (in_queue (Q, i)! = 0) { STD: : cout Error in_queue \ n; } } DataType d; For (I = 0; I 6; I + +) { If ((out_queue (Q, d) = = 0) STD: : cout. } The else { STD: : cout Error out_queue \ n; } } One, circular queue structure When the linear queue is converted into a loop queue, the formula for the rear + 1 is converted to (rear + 1) mod maxq. When you delete the data, the formula for front + 1 is converted to (front + 1) mod maxq. The array of the storage queue is treated as the first tail. The head of the team, the tail pointer of the team is added 1 from maxq directly to 1, and the module of the available language (remainder) is implemented. The head of the team entered 1: front = (front + 1) mod maxq; The tail arm of the team goes to 1: rear + 1 mod maxq. Queue initialization: front = rear = 0; : front = rear; (rear + 1) mod maxq = = front 2. # include iostream. H # inc

您可能关注的文档

文档评论(0)

f8r9t5c + 关注
实名认证
文档贡献者

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

版权声明书
用户编号:8000054077000003

1亿VIP精品文档

相关文档