通過(guò)JS實(shí)現(xiàn)隊(duì)列的數(shù)據(jù)結(jié)構(gòu)，首先是最普通的隊(duì)列，先入先出

// 隊(duì)列 function createQueue() {// 隊(duì)列let queue = []// 入隊(duì)const enQueue = (data) => {if(data == null) returnqueue.push(data)}// 出隊(duì)const deQueue = () => {if(queue.length === 0) return const data = queue.shift()return data}// 獲取列表const getQueue = () => {// 返回一個(gè)克隆的數(shù)組，避免外界直接操作return Array.from(queue)}return {enQueue,deQueue,getQueue} }

還有就是循環(huán)隊(duì)列

// 循環(huán)隊(duì)列 function cirQueue (n) {// 設(shè)置隊(duì)列大小if(!n) return console.error('創(chuàng)建失敗，請(qǐng)按照cirQueue(n: number)格式傳入')// 隊(duì)尾let tial = 0// 隊(duì)頭let head = 0// 隊(duì)列let queue = []// 入隊(duì)function enQueue(data) {try {// 判斷隊(duì)列是否已滿if((tial + 1) % n === head) return console.error('隊(duì)列已滿')tial = (tial + 1) % nqueue.push(data)} catch(error) {console.log('error----', error)}}// 出隊(duì)function deQueue() {try {// 判斷空隊(duì)列if(head === tial) return console.log('隊(duì)列為空')head = (head + 1) % nlet item = queue.shift()return item} catch(error) {console.log('error------', error)}}// 獲取隊(duì)列function getQueue() {try {return Array.from(queue)} catch(error) {console.log('error-----', error)}}// 獲取隊(duì)頭、尾function getQueueHeadAndTial() {return {tial,head}}return {enQueue,deQueue,getQueue,getQueueHeadAndTial} }

正常隊(duì)列可能存在存滿的情況，因此需要一定容錯(cuò)機(jī)制，當(dāng)隊(duì)列滿了，可以先把任務(wù)存儲(chǔ)下來(lái)

// 循環(huán)阻塞隊(duì)列 function cirBlockQueue (n) {// 設(shè)置隊(duì)列大小if(!n) return console.error('創(chuàng)建失敗，請(qǐng)按照cirQueue(n: number)格式傳入')// 隊(duì)尾let tial = 0// 隊(duì)頭let head = 0// 隊(duì)列let queue = []// 阻塞隊(duì)列let waitQueue = cirQueue(n)// 入隊(duì)function enQueue(data) {try {// 判斷隊(duì)列是否已滿// 阻塞后不直接返回錯(cuò)誤 把操作存儲(chǔ)下來(lái)// if((tial + 1) % n === head) return console.error('隊(duì)列已滿')if((tial + 1) % n === head) {// 阻塞隊(duì)列未滿const { head: waitQueueHead, tial: waitQueueTial } = waitQueue.getQueueHeadAndTial()if((waitQueueTial + 1) % n !== waitQueueHead) {waitQueue.enQueue(data)return } else {return console.error('隊(duì)列已滿')}}tial = (tial + 1) % nqueue.push(data)} catch(error) {console.log('error----', error)}}// 出隊(duì)function deQueue() {try {// 判斷空隊(duì)列if(head === tial) return console.log('隊(duì)列為空')head = (head + 1) % nlet item = queue.shift()// 阻塞隊(duì)列不為空const { head: waitQueueHead, tial: waitQueueTial } = waitQueue.getQueueHeadAndTial()if(waitQueueHead !== waitQueueTial) {enQueue(waitQueue.deQueue())}return item} catch(error) {console.log('error------', error)}}// 獲取隊(duì)列function getQueue() {try {return Array.from(queue)} catch(error) {console.log('error-----', error)}}return {enQueue,deQueue,getQueue,tial,head} }

總結(jié)

以上是生活随笔為你收集整理的JS 实现队列的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。