python-algorithms/data-structures/src/stack/stack_with_limited_list.py at main · david-legend/python-algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
#methods 1. pop, push, peek, isEmpty, isFull, delete

class Stack:
    def __init__(self, size):
        super().__init__()
        self.size = size
        self.list = []

    def __str__(self):
        values = self.list.reverse()
        values = [str(x) for x in self.list]
        return '\n'.join(values)

    def push(self, value):
        if self.isFull():
            print("Stack is full")

        self.list.append(value)

    def pop(self):
        if self.list != [] and len(self.list) > 0:
            return self.list.pop()

        return None

    def peek(self):
        lastIndex = len(self.list) - 1
        if self.isEmpty():
            return None
        else:
            return self.list[lastIndex]


    def isEmpty(self):
        if self.list == []:
            return True

        return False

    def isFull(self):
        if len(self.list) == self.size:
            return True

        return False

    def delete(self):
        self.list = None


stack = Stack(3)

# Check if stack is empty
print("is empty? ", stack.isEmpty())

# Check if stack is Full
print("is full? ", stack.isFull())

# Adding values to stack
stack.push(2)
stack.push(5)
stack.push(8)

# Check if stack is empty
print("is empty? ", stack.isEmpty())

# Check if stack is Full
print("is full? ", stack.isFull())

# Peek at element from stack
print(stack.peek())

# Pop element from stack
print(stack.pop())

print(stack.peek())

stack.delete()