Design a Stack With Increment Operation LeetCode solution in Python

1
	class CustomStack:
2

3
		def __init__(self, maxSize: int):
4
			self.size = maxSize
5
			self.stack = []
6

7
		def push(self, x: int) -> None:
8
			if self.size > len(self.stack):
9
				self.stack.append(x)
10

11
		def pop(self) -> int:
12
			if self.stack:
13
				return self.stack.pop()
14
			return -1
15

16
		def increment(self, k: int, val: int) -> None:
17
			len_stack = len(self.stack)
18

19
			if len_stack < k:
20
				self.stack[:] = [i + val for i in self.stack]
21
				return
22

23
			for i in range(k):
24
				self.stack[i] += val