golang刷leetcode 经典（7） 设计双端队列

MyCircularDeque(k)：构造函数,双端队列的大小为k。
insertFront()：将一个元素添加到双端队列头部。如果操作成功返回 true。
insertLast()：将一个元素添加到双端队列尾部。如果操作成功返回 true。
deleteFront()：从双端队列头部删除一个元素。如果操作成功返回 true。
deleteLast()：从双端队列尾部删除一个元素。如果操作成功返回 true。
getFront()：从双端队列头部获得一个元素。如果双端队列为空，返回 -1。
getRear()：获得双端队列的最后一个元素。如果双端队列为空，返回 -1。
isEmpty()：检查双端队列是否为空。
isFull()：检查双端队列是否满了。
示例：


MyCircularDeque circularDeque = new MycircularDeque(3); // 设置容量大小为3
circularDeque.insertLast(1);              // 返回 true
circularDeque.insertLast(2);              // 返回 true
circularDeque.insertFront(3);              // 返回 true
circularDeque.insertFront(4);              // 已经满了，返回 false
circularDeque.getRear();          // 返回 2
circularDeque.isFull();                // 返回 true
circularDeque.deleteLast();              // 返回 true
circularDeque.insertFront(4);              // 返回 true
circularDeque.getFront();        // 返回 4

type MyCircularDeque struct {
    length int
    data []int
    head int
    rear int
}


/** Initialize your data structure here. Set the size of the deque to be k. */
func Constructor(k int) MyCircularDeque {
    return MyCircularDeque{
        length:k+1,
        data:make([]int,k+1), //空一个位置区分满和空
        head:0,
        rear:0,
    }
}
/** Adds an item at the front of Deque. Return true if the operation is successful. */
func (this *MyCircularDeque) InsertFront(value int) bool {
    if this.IsFull(){
       return false
   }
   if this.IsEmpty(){
       if this.rear==this.length-1{
           this.rear=0
       }else{
           this.rear++
       }
       this.data[this.head]=value
       return true
   }
   
   if this.head==0{
       this.head=this.length-1
   }else{
       this.head--
   }
    this.data[this.head]=value
   return true
}


/** Adds an item at the rear of Deque. Return true if the operation is successful. */
func (this *MyCircularDeque) InsertLast(value int) bool {
  if this.IsFull(){
      return false
  }
  if this.IsEmpty(){
      this.data[this.rear]=value
     if this.rear==this.length-1{
          this.rear=0
     }else{
         this.rear++
     }
     return true
  }
  
  this.data[this.rear]=value
  if this.rear==this.length-1{
      this.rear=0
  }else{
      this.rear++
  }
  return true
}


/** Deletes an item from the front of Deque. Return true if the operation is successful. */
func (this *MyCircularDeque) DeleteFront() bool {
  if this.IsEmpty(){
      return false
  }
  if this.head==this.length-1{
      this.head=0
  }else{
      this.head++
  }
  return true
}


/** Deletes an item from the rear of Deque. Return true if the operation is successful. */
func (this *MyCircularDeque) DeleteLast() bool {
    if this.IsEmpty(){
        return false
    }
    if this.rear==0{
        this.rear=this.length-1
    }else{
        this.rear--
    }
    return true
}


/** Get the front item from the deque. */
func (this *MyCircularDeque) GetFront() int {
        if this.IsEmpty(){
            return -1
        }
        return this.data[this.head]
  
}


/** Get the last item from the deque. */
func (this *MyCircularDeque) GetRear() int {
        if this.IsEmpty(){
            return -1
        }
        if this.rear==0{
            return this.data[this.length-1]
        }
      return this.data[this.rear-1]
}


/** Checks whether the circular deque is empty or not. */
func (this *MyCircularDeque) IsEmpty() bool {
    return this.head==this.rear
}


/** Checks whether the circular deque is full or not. */
func (this *MyCircularDeque) IsFull() bool {
    return (this.rear+1)%this.length==this.head
}


/**
 * Your MyCircularDeque object will be instantiated and called as such:
 * obj := Constructor(k);
 * param_1 := obj.InsertFront(value);
 * param_2 := obj.InsertLast(value);
 * param_3 := obj.DeleteFront();
 * param_4 := obj.DeleteLast();
 * param_5 := obj.GetFront();
 * param_6 := obj.GetRear();
 * param_7 := obj.IsEmpty();
 * param_8 := obj.IsFull();
 */