Diziler, bağlı listeler, yığıtlar ve kuyruklar

class DynamicArray:
    def __init__(self):
        self.cap, self.n, self.copies = 1, 0, 0
        self.data = [None]

    def append(self, x):
        if self.n == self.cap:
            self.cap *= 2
            new = [None] * self.cap
            for i in range(self.n):
                new[i] = self.data[i]
                self.copies += 1
            self.data = new
        self.data[self.n] = x
        self.n += 1

arr = DynamicArray()
for k in range(1, 1025):
    arr.append(k)
    if k in (1, 2, 3, 5, 9, 17, 1024):
        print(k, arr.cap, arr.copies)
print('copies per append:', arr.copies / arr.n)

class Node:
    def __init__(self, value, next=None):
        self.value, self.next = value, next
class LinkedList:
    def __init__(self):
        self.head = None
    def push_front(self, value):
        self.head = Node(value, self.head)
    def reverse(self):
        prev, cur = None, self.head
        while cur:
            nxt = cur.next
            cur.next = prev
            prev, cur = cur, nxt
        self.head = prev
    def items(self):
        cur = self.head
        while cur:
            yield cur.value
            cur = cur.next
lst = LinkedList()
for city in ['Shaki', 'Ganja', 'Baku']: lst.push_front(city)
print(list(lst.items()))
lst.reverse()
print(list(lst.items()))

from collections import deque

def balanced(text):
    pairs = {')': '(', ']': '[', '}': '{'}
    stack = []
    for ch in text:
        if ch in '([{':
            stack.append(ch)
        elif ch in pairs:
            if not stack or stack.pop() != pairs[ch]:
                return False
    return not stack

for s in ['(a[i] + b) * {c}', '(]', '((x)']:
    print(s, balanced(s))

queue = deque(['Aysel', 'Murad', 'Leyla'])
queue.append('Elvin')
print(queue.popleft(), 'is served;', list(queue), 'wait')