Leetcode 641.设计循环双端队列

最新推荐文章于 2022-12-22 17:00:13 发布

Pang_ling

最新推荐文章于 2022-12-22 17:00:13 发布

阅读量165

点赞数

分类专栏：数据结构与算法 leetcode

本文链接：https://blog.csdn.net/Pang_ling/article/details/105209754

版权

数据结构与算法同时被 2 个专栏收录

23 篇文章 0 订阅

订阅专栏

leetcode

18 篇文章 0 订阅

订阅专栏

题目描述

在这里插入图片描述

示例

在这里插入图片描述
添加链接描述

代码实现

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;

    }
}