641. 设计循环双端队列-CSDN博客

本文链接：https://blog.csdn.net/weixin_45569785/article/details/105116501

641. 设计循环双端队列

难度
中等

设计实现双端队列。
你的实现需要支持以下操作：
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

提示：
所有值的范围为 [1, 1000]
操作次数的范围为 [1, 1000]
请不要使用内置的双端队列库。

python

class MyCircularDeque:

    def __init__(self, k: int):
        """
        Initialize your data structure here. Set the size of the deque to be k.
        """
        self.start=0
        self.end=0
        self.length=0
        self.p=[0]*(k)
        self.maxlen=k
        

    def insertFront(self, value: int) -> bool:
        """
        Adds an item at the front of Deque. Return true if the operation is successful.
        """
        if self.isFull():
            return False
        if self.length==0:
            self.end=(self.end+1)%self.maxlen
            self.p[self.start]=value
            self.start=(self.start-1)%self.maxlen
        else:
            self.p[self.start]=value
            self.start=(self.start-1)%self.maxlen
        self.length+=1
        return True 

    def insertLast(self, value: int) -> bool:
        """
        Adds an item at the rear of Deque. Return true if the operation is successful.
        """
        if self.isFull():
            return False
        if self.length==0:
            self.start=(self.start-1)%self.maxlen
            self.p[self.end]=value
            self.end=(self.end+1)%self.maxlen
        else:
            self.p[self.end]=value
            self.end=(self.end+1)%self.maxlen
        self.length+=1
        return True


        

    def deleteFront(self) -> bool:
        """
        Deletes an item from the front of Deque. Return true if the operation is successful.
        """
        if self.length==0:
            return False
        if self.length==1:
            self.end=(self.end-1)%self.maxlen
        self.start=(self.start+1)%self.maxlen
        self.length -=1
        return True

    def deleteLast(self) -> bool:
        """
        Deletes an item from the rear of Deque. Return true if the operation is successful.
        """
        if self.length==0:
            return False
        if self.length==1:
            self.start=(self.start+1)%self.maxlen
        self.end=(self.end-1)%self.maxlen
        self.length -=1
        return True 

    def getFront(self) -> int:
        """
        Get the front item from the deque.
        """
        if self.length ==0:
            return -1
        return self.p[(self.start+1)%self.maxlen]
        

    def getRear(self) -> int:
        """
        Get the last item from the deque.
        """
        if self.length ==0:
            return -1
        return self.p[(self.end-1)%self.maxlen]
    def isEmpty(self) -> bool:
        """
        Checks whether the circular deque is empty or not.
        """
        return  self.length ==0

    def isFull(self) -> bool:
        """
        Checks whether the circular deque is full or not.
        """
        return self.length==self.maxlen
        
# Your MyCircularDeque object will be instantiated and called as such:
# obj = MyCircularDeque(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()

这个就是按照双端队列的思路来写就好了，
但是要注意数组只有1个元素的时候时的删除
和数组为空时的插入要单独拿出来讨论一下
这个问题刚开始我忽略了调试了半天才发现

class MyCircularDeque:

    def __init__(self, k: int):
        """
        Initialize your data structure here. Set the size of the deque to be k.
        """
        self.p=[]
        self.k=k
        

    def insertFront(self, value: int) -> bool:
        """
        Adds an item at the front of Deque. Return true if the operation is successful.
        """
        if len(self.p)==self.k:
            return False
        self.p.insert(0,value)
        return True 

    def insertLast(self, value: int) -> bool:
        """
        Adds an item at the rear of Deque. Return true if the operation is successful.
        """
        if len(self.p)==self.k:
            return False
        self.p.append(value)
        return True
        

    def deleteFront(self) -> bool:
        """
        Deletes an item from the front of Deque. Return true if the operation is successful.
        """
        if not self.p:
            return False
        del self.p[0]
        return True 

    def deleteLast(self) -> bool:
        """
        Deletes an item from the rear of Deque. Return true if the operation is successful.
        """
        if not self.p:
            return False
        del self.p[-1]
        return True 

    def getFront(self) -> int:
        """
        Get the front item from the deque.
        """
        if not self.p:
            return -1
        return self.p[0]
        

    def getRear(self) -> int:
        """
        Get the last item from the deque.
        """
        if not self.p:
            return -1
        return self.p[-1]

    def isEmpty(self) -> bool:
        """
        Checks whether the circular deque is empty or not.
        """
        return  not  self.p

    def isFull(self) -> bool:
        """
        Checks whether the circular deque is full or not.
        """
        return len(self.p)==self.k
        


# Your MyCircularDeque object will be instantiated and called as such:
# obj = MyCircularDeque(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()

列表实现

c#

public class MyCircularDeque {
    private int _start;
    private int _end;
    private int _len;
    private int _max;
    private int []_p;
    /** Initialize your data structure here. Set the size of the deque to be k. */
    public MyCircularDeque(int k) {
        _start=0;
        _end=0;
        _len=0;
        _max=k;
        _p=new int [k];

    }
    
    /** Adds an item at the front of Deque. Return true if the operation is successful. */
    public bool InsertFront(int value) {
        if (_len==_max)
            return false;
        if (_len==0)
        {
            _end=(_max+_end+1)%_max;

        }
        _p[_start]=value;
        _start=(_max+_start-1)%_max;
        _len+=1;
        return true;
    }
    
    /** Adds an item at the rear of Deque. Return true if the operation is successful. */
    public bool InsertLast(int value) {
        if (IsFull()){
            return false;
        }
        if (_len==0)
        {
            _start=(_max+_start-1)%_max;
        }
        _p[_end]=value;
        _end=(_max+_end+1)%_max;
        _len+=1;
        return true;

    }
    
    /** Deletes an item from the front of Deque. Return true if the operation is successful. */
    public bool DeleteFront() {
        if (_len==0)
        {
            return false;
        }
        if (_len==1)
        {
            _end=(_max+_end-1)%_max;
            
        }
        _start=(_max+_start+1)%_max;
        _len-=1;
        return true;
    }
    
    /** Deletes an item from the rear of Deque. Return true if the operation is successful. */
    public bool DeleteLast() {
        if (_len==0)
        {
            return false;
        }
        if (_len==1)
        {
           _start=(_max+_start+1)%_max;
        }
         _end=(_max+_end-1)%_max;
         _len-=1;
        return true;

    }
    
    /** Get the front item from the deque. */
    public int GetFront() {
        if (_len==0){return -1;}
        return _p[(_max+_start+1)%_max];

    }
    
    /** Get the last item from the deque. */
    public int GetRear() {
        if (_len==0){return -1;}
        return _p[(_max+_end-1)%_max];

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

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

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

c#里面没有负的索引所以我们加一个小改进取余的是的加上_max问题解决。

另一种思路

public class MyCircularDeque {
    private int _start;
    private int _end;
    private int _len;
    private int _max;
    private int []_p;
    /** Initialize your data structure here. Set the size of the deque to be k. */
    public MyCircularDeque(int k) {
        _start=0;
        _end=0;
        _max=k+1;
        _p=new int [k+1];
    }
    
    /** Adds an item at the front of Deque. Return true if the operation is successful. */
    public bool InsertFront(int value) {
        if( IsFull())
            return false;
        _start=(_max+_start-1)%_max;
        _p[_start]=value;
        return true;
    }
    
    /** Adds an item at the rear of Deque. Return true if the operation is successful. */
    public bool InsertLast(int value) {
        if (IsFull()){
            return false;
        }
        _p[_end]=value;
        _end=(_end+1)%_max;
        
        return true;

    }
    
    /** Deletes an item from the front of Deque. Return true if the operation is successful. */
    public bool DeleteFront() {
        if (IsEmpty())
        {
            return false;
        }
        _start=(_start+1)%_max;
        return true;
    }
    
    /** Deletes an item from the rear of Deque. Return true if the operation is successful. */
    public bool DeleteLast() {
        if (IsEmpty())
        {
            return false;
        }
        _end=(_max+_end-1)%_max;
        return true;

    }
    
    /** Get the front item from the deque. */
    public int GetFront() {
        if (IsEmpty()){return -1;}
        return _p[_start];
    }
    
    /** Get the last item from the deque. */
    public int GetRear() {
        if (IsEmpty()){return -1;}
        return _p[(_max+_end-1)%_max];

    }
    
    /** Checks whether the circular deque is empty or not. */
    public bool IsEmpty() {
        return _start==_end;
    }
    
    /** Checks whether the circular deque is full or not. */
    public bool IsFull() {
        return (_end+1)%_max==_start;
    }
}

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

该思路关于对队列是否存满的判断那个地方跟队列是否为空的地方判断十分的巧妙
而且因为他这里的思路对于start和end的处加减元素的处理并不一样更是增加了难度
设置max为k+1更是神来之笔，学到了

二刷

class MyCircularDeque:

    def __init__(self, k: int):
        """
        Initialize your data structure here. Set the size of the deque to be k.
        """
        self.max_len=k
        self.len=0
        self.start=0
        self.end=1
        self.lis=[0]*k
        

    def insertFront(self, value: int) -> bool:
        """
        Adds an item at the front of Deque. Return true if the operation is successful.
        """
        if self.len==self.max_len:
            return False
        # if self.len==0 and  self.start==self.end:
        #     self.end=(self.end+1)%self.max_len
        self.lis[self.start]=value
        self.start=(self.start-1+self.max_len)%self.max_len
        self.len+=1
        return True

        

    def insertLast(self, value: int) -> bool:
        """
        Adds an item at the rear of Deque. Return true if the operation is successful.
        """
        if self.len==self.max_len:
            return False
        # if self.len==0 and  self.start==self.end:
        #     self.start=(self.start-1+self.max_len)%self.max_len
        self.lis[self.end]=value
        self.end=(self.end+1)%self.max_len
        self.len+=1
        return True
        

    def deleteFront(self) -> bool:
        """
        Deletes an item from the front of Deque. Return true if the operation is successful.
        """
        if self.len==0:
            return False
        self.start=(self.start+1)%self.max_len
        self.len-=1
        return True
        

    def deleteLast(self) -> bool:
        """
        Deletes an item from the rear of Deque. Return true if the operation is successful.
        """
        if self.len==0:
            return False
        self.end=(self.end-1+self.max_len)%self.max_len
        self.len-=1
        return True

        

    def getFront(self) -> int:
        """
        Get the front item from the deque.
        """
        if self.len==0:
            return -1
        return self.lis[(self.start+1)%self.max_len]

        

    def getRear(self) -> int:
        """
        Get the last item from the deque.
        """
        if self.len==0:
            return -1
        return self.lis[(self.end-1+self.max_len)%self.max_len]
        

    def isEmpty(self) -> bool:
        """
        Checks whether the circular deque is empty or not.
        """
        return self.len==0

    def isFull(self) -> bool:
        """
        Checks whether the circular deque is full or not.
        """
        return self.len==self.max_len


# Your MyCircularDeque object will be instantiated and called as such:
# obj = MyCircularDeque(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()