


How do I use the deque data structure from the collections module in Python?
Jun 22, 2025 am 12:56 AMPython's deque is suitable for scenarios where two-end operations need to be handled efficiently. 1. You can pass in a list or string when creating, or initialize it to empty before adding elements; 2. Use append() and appendleft() to add elements at the right and left ends respectively; 3. Use pop() and popleft() to remove elements from the right and left ends respectively; 4. The rotate(n) method moves the element to the right (positive number) or to the left (negative number) cycle; 5. After setting the maxlen parameter, the old elements on the side will be automatically discarded when the capacity exceeds the capacity; 6. Suitable for use in queues, sliding windows, history and other scenarios. Compared with the list, deque has O(1) time complexity in the header operation and has better performance.
The deque
(double-ended queue) from Python's collections
module is a versatile and efficient data structure, especially when you need fast appends and pops from both ends. If you're used to working with lists, switching to deque
can give you performance boosts in certain situations.
Let's break down how to use it effectively.
Creating and Initializing a Deque
To start using deque
, you first need to import it from the collections
module. Then you can create one by passing in an iterable like a list or string.
from collections import deque d = deque([1, 2, 3])
You can also initialize it empty and add elements later. It's pretty flexible — strings, tuples, and even other deques work as input.
If you're starting from scratch:
- Use
append()
to add to the right end - Use
appendleft()
to add to the left end
d = deque() d.append(1) # deque([1]) d.appendleft(0) # deque([0, 1])
Adding and Removeing ??Elements Efficiently
One of the main advantages of deque
over regular lists is its speed for operations at both ends. With a normal list, inserting or removing from the front ( pop(0)
or insert(0, x)
) takes O(n) time, which gets slow for large data sets. deque
does these operations in O(1) time.
Here are some common operations:
- Add to the right :
append(x)
- Add to the left :
appendleft(x)
- Remove from the right :
pop()
- Remove from the left :
popleft()
d = deque([1, 2, 3]) d.append(4) # deque([1, 2, 3, 4]) d.popleft() # returns 1 → deque([2, 3, 4])
This makes deque
perfect for things like queues or sliding window problems.
Rotating and Managing Elements
Another handy feature is the rotate()
method. It shifts elements in place to the right (or left if given a negative number).
For example:
d = deque([1, 2, 3, 4, 5]) d.rotate(1) # deque([5, 1, 2, 3, 4])
That moves each element one position to the right, wrapping around the end. A negative rotation goes the other way:
d.rotate(-1) # back to deque([1, 2, 3, 4, 5])
Also, if you ever need to limit the size of your deque, you can set the maxlen
parameter when creating it. Once full, adding new items will automatically drop the oldest ones from the opposite end.
d = deque(maxlen=3) d.append(1) d.append(2) d.append(3) d.append(4) # now contains [2, 3, 4]
This is super useful for tracking recent values ??or implementing fixed-size buffers.
When to Use Deque instead of List
In most cases, you'll still want to use a regular list. But if you find yourself frequently doing:
- Insertions/removals at the beginning
- Implementing queues or stacks
- Maintaining a history or buffer of recent items
Then deque
is the better choice.
Even though they look similar and support many of the same methods, their performance characteristics different. So if you're building something that needs high efficiency on both ends, switch to deque
.
Basically that's it. After mastering a few common methods, you will find that it is more suitable than a list in many scenarios and is not complicated to use.
The above is the detailed content of How do I use the deque data structure from the collections module in Python?. For more information, please follow other related articles on the PHP Chinese website!

Hot AI Tools

Undress AI Tool
Undress images for free

Undresser.AI Undress
AI-powered app for creating realistic nude photos

AI Clothes Remover
Online AI tool for removing clothes from photos.

Clothoff.io
AI clothes remover

Video Face Swap
Swap faces in any video effortlessly with our completely free AI face swap tool!

Hot Article

Hot Tools

Notepad++7.3.1
Easy-to-use and free code editor

SublimeText3 Chinese version
Chinese version, very easy to use

Zend Studio 13.0.1
Powerful PHP integrated development environment

Dreamweaver CS6
Visual web development tools

SublimeText3 Mac version
God-level code editing software (SublimeText3)

Hot Topics

Python's unittest and pytest are two widely used testing frameworks that simplify the writing, organizing and running of automated tests. 1. Both support automatic discovery of test cases and provide a clear test structure: unittest defines tests by inheriting the TestCase class and starting with test\_; pytest is more concise, just need a function starting with test\_. 2. They all have built-in assertion support: unittest provides assertEqual, assertTrue and other methods, while pytest uses an enhanced assert statement to automatically display the failure details. 3. All have mechanisms for handling test preparation and cleaning: un

PythonisidealfordataanalysisduetoNumPyandPandas.1)NumPyexcelsatnumericalcomputationswithfast,multi-dimensionalarraysandvectorizedoperationslikenp.sqrt().2)PandashandlesstructureddatawithSeriesandDataFrames,supportingtaskslikeloading,cleaning,filterin

Dynamic programming (DP) optimizes the solution process by breaking down complex problems into simpler subproblems and storing their results to avoid repeated calculations. There are two main methods: 1. Top-down (memorization): recursively decompose the problem and use cache to store intermediate results; 2. Bottom-up (table): Iteratively build solutions from the basic situation. Suitable for scenarios where maximum/minimum values, optimal solutions or overlapping subproblems are required, such as Fibonacci sequences, backpacking problems, etc. In Python, it can be implemented through decorators or arrays, and attention should be paid to identifying recursive relationships, defining the benchmark situation, and optimizing the complexity of space.

To implement a custom iterator, you need to define the __iter__ and __next__ methods in the class. ① The __iter__ method returns the iterator object itself, usually self, to be compatible with iterative environments such as for loops; ② The __next__ method controls the value of each iteration, returns the next element in the sequence, and when there are no more items, StopIteration exception should be thrown; ③ The status must be tracked correctly and the termination conditions must be set to avoid infinite loops; ④ Complex logic such as file line filtering, and pay attention to resource cleaning and memory management; ⑤ For simple logic, you can consider using the generator function yield instead, but you need to choose a suitable method based on the specific scenario.

Future trends in Python include performance optimization, stronger type prompts, the rise of alternative runtimes, and the continued growth of the AI/ML field. First, CPython continues to optimize, improving performance through faster startup time, function call optimization and proposed integer operations; second, type prompts are deeply integrated into languages ??and toolchains to enhance code security and development experience; third, alternative runtimes such as PyScript and Nuitka provide new functions and performance advantages; finally, the fields of AI and data science continue to expand, and emerging libraries promote more efficient development and integration. These trends indicate that Python is constantly adapting to technological changes and maintaining its leading position.

Python's socket module is the basis of network programming, providing low-level network communication functions, suitable for building client and server applications. To set up a basic TCP server, you need to use socket.socket() to create objects, bind addresses and ports, call .listen() to listen for connections, and accept client connections through .accept(). To build a TCP client, you need to create a socket object and call .connect() to connect to the server, then use .sendall() to send data and .recv() to receive responses. To handle multiple clients, you can use 1. Threads: start a new thread every time you connect; 2. Asynchronous I/O: For example, the asyncio library can achieve non-blocking communication. Things to note

Polymorphism is a core concept in Python object-oriented programming, referring to "one interface, multiple implementations", allowing for unified processing of different types of objects. 1. Polymorphism is implemented through method rewriting. Subclasses can redefine parent class methods. For example, the spoke() method of Animal class has different implementations in Dog and Cat subclasses. 2. The practical uses of polymorphism include simplifying the code structure and enhancing scalability, such as calling the draw() method uniformly in the graphical drawing program, or handling the common behavior of different characters in game development. 3. Python implementation polymorphism needs to satisfy: the parent class defines a method, and the child class overrides the method, but does not require inheritance of the same parent class. As long as the object implements the same method, this is called the "duck type". 4. Things to note include the maintenance

The core answer to Python list slicing is to master the [start:end:step] syntax and understand its behavior. 1. The basic format of list slicing is list[start:end:step], where start is the starting index (included), end is the end index (not included), and step is the step size; 2. Omit start by default start from 0, omit end by default to the end, omit step by default to 1; 3. Use my_list[:n] to get the first n items, and use my_list[-n:] to get the last n items; 4. Use step to skip elements, such as my_list[::2] to get even digits, and negative step values ??can invert the list; 5. Common misunderstandings include the end index not
