解题思路
-
我们定义一个数组，如果数组的长度与要求的队列长度长度相同则
isFull -
如果数组的长度为
0，则满足isEmpty -
insertLast其实就是往数组中第一项插入元素 -
insertLast其实就是往数组中push元素 -
deleteFront其实就是移除数组的第一项元素 -
deleteLast其实就是移除数组的最后一项元素 -
getRear获取最后一项也就是获取数组的第length-1项 -
getFront获取数组第0项
/**
* @param {number} k
*/
var MyCircularDeque = function(k) {
this.maxLen = k
this.arr = []
};
/**
* @param {number} value
* @return {boolean}
*/
MyCircularDeque.prototype.insertFront = function(value) {
if(this.isFull()) return false
this.arr = [value,...this.arr]
return true
};
/**
* @param {number} value
* @return {boolean}
*/
MyCircularDeque.prototype.insertLast = function(value) {
if(this.isFull()) return false
this.arr.push(value)
return true
};
/**
* @return {boolean}
*/
MyCircularDeque.prototype.deleteFront = function() {
if(this.isEmpty()) return false
let [a,...args] = this.arr
this.arr = [...args]
return true
};
/**
* @return {boolean}
*/
MyCircularDeque.prototype.deleteLast = function() {
if(this.isEmpty()) return false
this.arr = this.arr.slice(0,this.arr.length-1)
return true
};
/**
* @return {number}
*/
MyCircularDeque.prototype.getFront = function() {
if(this.isEmpty()) return -1
return this.arr[0]
};
/**
* @return {number}
*/
MyCircularDeque.prototype.getRear = function() {
if(!this.arr.length) return -1
return this.arr[this.arr.length-1]
};
/**
* @return {boolean}
*/
MyCircularDeque.prototype.isEmpty = function() {
return this.arr.length == 0
};
/**
* @return {boolean}
*/
MyCircularDeque.prototype.isFull = function() {
return this.arr.length == this.maxLen
};
/**
* Your MyCircularDeque object will be instantiated and called as such:
* var obj = new MyCircularDeque(k)
* var param_1 = obj.insertFront(value)
* var param_2 = obj.insertLast(value)
* var param_3 = obj.deleteFront()
* var param_4 = obj.deleteLast()
* var param_5 = obj.getFront()
* var param_6 = obj.getRear()
* var param_7 = obj.isEmpty()
* var param_8 = obj.isFull()
*/
