“Python Deque” Ответ

Python Deque

# deque -list-like container with fast appends and pops on either end
from collections import deque

queue = deque() # create deque
queue.append(2) # append right
queue.appenleft(1) # append left
queue.clear() # remove all elements --> len = 0
copy_queue = queue.copy() # create a shallow copy of the deque
queue.count(x) # count the number of deque elements equal to x
queue.extend([4, 5, 6]) # extend right by an iterable
queue.extendleft([1, 2, 3]) # extend left by an iterable

# More at: https://docs.python.org/3/library/collections.html#collections.deque
Lovely Lark

Питон заказал

>>> # regular unsorted dictionary
>>> d = {'banana': 3, 'apple': 4, 'pear': 1, 'orange': 2}

>>> # dictionary sorted by key
>>> OrderedDict(sorted(d.items(), key=lambda t: t[0]))
OrderedDict([('apple', 4), ('banana', 3), ('orange', 2), ('pear', 1)])

>>> # dictionary sorted by value
>>> OrderedDict(sorted(d.items(), key=lambda t: t[1]))
OrderedDict([('pear', 1), ('orange', 2), ('banana', 3), ('apple', 4)])

>>> # dictionary sorted by length of the key string
>>> OrderedDict(sorted(d.items(), key=lambda t: len(t[0])))
OrderedDict([('pear', 1), ('apple', 4), ('orange', 2), ('banana', 3)])
rebellion

Counter Most_common

most_common([n])¶
Return a list of the n most common elements and their counts from the most common to the least. If n is omitted or None, most_common() returns all elements in the counter.
Elements with equal counts are ordered arbitrarily:

>>> Counter('abracadabra').most_common(3)
[('a', 5), ('r', 2), ('b', 2)]
Cruel Cheetah

счетчик питона

sum(c.values())                 # total of all counts
c.clear()                       # reset all counts
list(c)                         # list unique elements
set(c)                          # convert to a set
dict(c)                         # convert to a regular dictionary
c.items()                       # convert to a list of (elem, cnt) pairs
Counter(dict(list_of_pairs))    # convert from a list of (elem, cnt) pairs
c.most_common()[:-n-1:-1]       # n least common elements
c += Counter()                  # remove zero and negative counts
Foolish Flamingo

Deque Python

# deque -list-like container with fast appends and pops on either end
from collections import deque

queue = deque() # create deque
queue.append(2) # append right
queue.appenleft(1) # append left
queue.clear() # remove all elements --> len = 0
copy_queue = queue.copy() # create a shallow copy of the deque
queue.count(x) # count the number of deque elements equal to x
queue.extend([4, 5, 6]) # extend right by an iterable
queue.extendleft([1, 2, 3]) # extend left by an iterable
Fierce Flamingo

Ответы похожие на “Python Deque”

Вопросы похожие на “Python Deque”

Больше похожих ответов на “Python Deque” по Python

Смотреть популярные ответы по языку

Смотреть другие языки программирования

Shell/Bash
C#
C++
C
CSS
HTML
Java
JavaScript
Objective-C
PHP
Python
Sql
Swift
Ruby
TypeScript
Go
Kotlin
Assembly
R
VBA
Scala
Rust
Dart
Elixir
Clojure
Haskell
Matlab
Erlang
Cobol
Fortran
Scheme
Perl
Groovy
Lua
Julia
Delphi
Abap
Lisp
Prolog
Pascal
ActionScript
Basic
Solidity
PowerShell
GDScript
Excel