/*
 * @lc app=leetcode.cn id=641 lang=javascript
 *
 * [641] 设计循环双端队列
 */

// @lc code=start
/**
 * @param {number} k
 */
var MyCircularDeque = function (k) {
  this.capacity = k + 1;
  this.rear = this.front = 0;
  this.elements = new Array(k + 1).fill(0);
};

/**
 * @param {number} value
 * @return {boolean}
 */
MyCircularDeque.prototype.insertFront = function (value) {
  if (this.isFull) {
    return false;
  }
  this.front = (this.front-1 + this.capacity) % this.capacity
  this.elements[this.front] = value
  return true
};

MyCircularDeque.prototype.insertLast = function(value) {
  if (this.isFull()) {
      return false;
  }
  this.elements[this.rear] = value;
  this.rear = (this.rear + 1) % this.capacity;
  return true;
};

MyCircularDeque.prototype.deleteFront = function() {
  if (this.isEmpty()) {
      return false;
  }
  this.front = (this.front + 1) % this.capacity;
  return true;
};

MyCircularDeque.prototype.deleteLast = function() {
  if (this.isEmpty()) {
      return false;
  }
  this.rear = (this.rear - 1 + this.capacity) % this.capacity;
  return true;
};

MyCircularDeque.prototype.getFront = function() {
  if (this.isEmpty()) {
      return -1;
  }
  return this.elements[this.front];
};

MyCircularDeque.prototype.getRear = function() {
  if (this.isEmpty()) {
      return -1;
  }
  return this.elements[(this.rear - 1 + this.capacity) % this.capacity];
};

MyCircularDeque.prototype.isEmpty = function() {
  return this.rear == this.front;
};

MyCircularDeque.prototype.isFull = function() {
  return (this.rear + 1) % this.capacity == this.front;
};



/**
 * 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()
 */
// @lc code=end