欢迎您访问程序员文章站本站旨在为大家提供分享程序员计算机编程知识!
您现在的位置是: 首页

Leecode 641.设计循环双端队列

程序员文章站 2022-04-04 08:30:50
...

题目描述

Leecode 641.设计循环双端队列

示例

Leecode 641.设计循环双端队列
添加链接描述

代码实现

public class deque
    {
        private  int[] _dataset;
        public int MaxSize { get; private set; }
        public int Length { get; private set; }
         /** Initialize your data structure here. Set the size of the deque to be k. */
    public deque(int k) {
        if (k <= 0)
            throw new ArgumentException();
        MaxSize = k;
        _dataset = new int[MaxSize];
        Length = 0;

    }
    //头插
    /** Adds an item at the front of Deque. Return true if the operation is successful. */
    public bool InsertFront(int value) {
        if (Length == MaxSize)
            return false;
        else
        {
            for (int i = Length; i > 0; i--)
            {
                _dataset[i] = _dataset[i - 1];
            }
            _dataset[0] = value;
            Length++;
            return true;
        }
    }
    //头除
    /** Deletes an item from the front of Deque. Return true if the operation is successful. */
    public bool DeleteFront() {
        if (Length == 0)
            return false;
        else
        {
            for (int i = 0; i < Length - 1; i++)
            {
                _dataset[i] = _dataset[i + 1];
            }
            Length--;
            return true;
        }

    }
    //尾除
    /** Deletes an item from the rear of Deque. Return true if the operation is successful. */
    public bool DeleteLast() {
        if (Length == 0)
            return false;
        else
        {
            _dataset[Length - 1] = 0;
            Length--;
            return true;
        }
    }
    
    /** Get the front item from the deque. */
    public int GetFront() {
        if (Length == 0)
            return -1;
        else
            return _dataset[0];

    }
    
    /** Get the last item from the deque. */
    public int GetRear() {
        if (Length == 0)
            return -1;
        else
            return _dataset[Length-1];

    }
    
    /** Checks whether the circular deque is empty or not. */
    public bool IsEmpty() {
        return Length == 0;

    }
    
    /** Checks whether the circular deque is full or not. */
    public bool IsFull() {
        return Length == MaxSize;

    }
}
    

Leecode 641.设计循环双端队列