數(shù)據(jù)結(jié)構(gòu)(計(jì)算機(jī)科學(xué)與技術(shù))-資料下載頁
2025-07-13 23:45本頁面
【正文】 ll(CirQueue*Q)61. {62. returnQlength==QUEUE_SIZE。63. }64. /*入隊(duì)列*/65. voidEnQueue(CirQueue*Q,intdata)66. {67. if(QueueFull(Q))68. printf(隊(duì)列已經(jīng)滿了.\n)。69. Qlength++。/*隊(duì)列元素個(gè)數(shù)加1*/70. Qdata[Qrear]=data。/*將新元素插入隊(duì)尾*/71. Qrear=(Qrear+1)%QUEUE_SIZE。/*將隊(duì)尾加1*/72. }73. /*出隊(duì)列*/74. intDequeue(CirQueue*Q)75. {76. inttemp。77. if(QueueEmpty(Q))78. printf(隊(duì)列已經(jīng)為空!\n)。79. temp=Qdata[Qfront]。80. Qlength。/*隊(duì)列元素個(gè)數(shù)減1*/81. Qfront=(Qfront+1)%QUEUE_SIZE。/*隊(duì)列頭加1*/82. returntemp。83. }84. /*測試程序*/85. intmain()86. {87. CirQueueQ。88. intinput=0。/*入隊(duì)數(shù)據(jù)，由用戶輸入*/89. /*初始化隊(duì)列*/90. initQueue(amp。Q)。91. printf(請輸入入隊(duì)數(shù)據(jù):\n)。92. /*入隊(duì)操作*/93. while(!QueueFull(amp。Q))94. {95. scanf(%d\n,amp。input)。96. EnQueue(amp。Q,input)。97. }98. printf(出隊(duì)數(shù)據(jù):\n)。99. /*出隊(duì)操作*/100. while(!QueueEmpty(amp。Q))101. {102. printf(%d,Dequeue(amp。Q))。103. }104. printf(\n)。105. return0。106. }
研究報(bào)告相關(guān)推薦
鄂ICP備17016276號-1