标签:count return 队列 items Queue isEmpty lowestCount
/* 队列 */
class Queue {
constructor() {
this.count = 0
this.lowestCount = 0
this.items = {}
}
/* 向队列添加元素 */
enqueue(element) {
this.items[this.count] = element
this.count++
}
/* 从队列移除元素 */
dequeue() {
if (this.isEmpty()) {
return undefined
}
const result = this.items[this.lowestCount]
delete this.items[this.lowestCount]
this.lowestCount++
return result
}
/* 查看队头元素 */
peek() {
if (this.isEmpty()) {
return undefined
}
return this.items[this.lowestCount]
}
/* 检查队列是否为空 */
isEmpty() {
return this.count - this.lowestCount === 0
}
/* 获取队列的长度 */
size() {
return this.count - this.lowestCount
}
/* 清空队列 */
clear() {
this.items = {}
this.count = 0
this.lowestCount = 0
}
}
/* 双端队列 */
class Deque {
constructor() {
this.count = 0
this.lowestCount = 0
this.items = {}
}
/* 检查队列是否为空 */
isEmpty() {
return this.count - this.lowestCount === 0
}
/* 获取队列的长度 */
size() {
return this.count - this.lowestCount
}
/* 清空队列 */
clear() {
this.items = {}
this.count = 0
this.lowestCount = 0
}
/* 在双端队列前端添加新的元素 */
addFront(element) {
if (this.isEmpty()) {
this.addBack(element)
} else if (this.lowestCount > 0) {
this.lowestCount--
this.items[this.lowestCount] = element
} else {
for (let i = this.count; i > 0; i--) {
this.items[i] = this.items[i - 1]
}
this.count++
this.lowestCount = 0
this.items[0] = element
}
}
/* 在双端队列后端添加新的元素 */
addBack(element) {
this.items[this.count] = element
this.count++
}
/* 移除双端队列前端的元素 */
removeFront() {
if (this.isEmpty()) {
return undefined
}
const result = this.items[this.lowestCount]
delete this.items[this.lowestCount]
this.lowestCount++
return result
}
/* 移除双端队列后端的元素 */
removeBack() {
if (this.isEmpty()) {
return undefined
}
this.count--
const result = this.items[this.count]
delete this.items[this.count]
return result
}
peekFront() {
if (this.isEmpty()) {
return undefined
}
return this.items[this.lowestCount]
}
peekBack() {
if (this.isEmpty()) {
return undefined
}
return this.items[this.count - 1]
}
}
标签:count,return,队列,items,Queue,isEmpty,lowestCount 来源: https://blog.csdn.net/weixin_47952737/article/details/121129861
本站声明: 1. iCode9 技术分享网(下文简称本站)提供的所有内容,仅供技术学习、探讨和分享; 2. 关于本站的所有留言、评论、转载及引用,纯属内容发起人的个人观点,与本站观点和立场无关; 3. 关于本站的所有言论和文字,纯属内容发起人的个人观点,与本站观点和立场无关; 4. 本站文章均是网友提供,不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属;如您发现该文章侵犯了您的权益,可联系我们第一时间进行删除; 5. 本站为非盈利性的个人网站,所有内容不会用来进行牟利,也不会利用任何形式的广告来间接获益,纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。