Питон: хеш

---

What should be the Python program to implement a circular doubly linked queue with a capacity greater than 1 and when the queue is full & another element’s added the queue capacity should be doubled? I tried in Java

Что я уже пробовал:

public ResizingArrayStackOfStrings()
    {
    s=new String[1];
    }
    
    public void push(String item)
    {
    if (N == s.length) resize(2 * s.length);
    s[N++] = item;
    }
    
    private void resize(int capacity)
    {
    String[] copy = new String[capacity];
        for (int i=0; i<N; i++)
    copy[i]=s[i];
    s=copy;
    }

---