Method deleteLast

Java/design-circular-deque.java:98–121

Deletes an item from the rear of Deque. Return true if the operation is successful.

()

      /** Deletes an item from the rear of Deque. Return true if the operation is successful. */
      public boolean deleteLast() {

        if(this.size == 0)						//		means queue is empty
          return false;	

        if(this.size == 1) {					//		if there is only one element, then remove it(mark it as 0) and
          arr[rear] = 0;						//		mark rear and front as -1(like it was initially)...
          rear = -1;
          front = -1;
          this.size --;						//		also decrease the size to 0
          return true;						//		and return true to mark this operation as successful ...
        }

        if(rear == 0) {							//		if there are more than one element in the array, 
          arr[rear] = 0;						//		and rear is at 0, then delete the element and reduce rear by 1
          rear = this.capacity - 1;			//		so basically rear will fall back to last position...
          this.size --;
        }else {
          arr[rear] = 0;						//		if rear is not at 0, then decrease rear by 1
          rear --;						
          this.size --;				
        }
        return true;							//		return true to mark the operation as successful
      }

      /** Get the front item from the deque. */
      public int getFront() {