master > master: code py - algorithmen für rucksackproblem
This commit is contained in:
@@ -39,6 +39,13 @@ class Stack:
|
||||
def __contains__(self, value: Any) -> bool:
|
||||
return value in self.elements;
|
||||
|
||||
def __iter__(self) -> Generator[Any, None, None]:
|
||||
for value in self.elements:
|
||||
yield value;
|
||||
|
||||
def __str__(self) -> str:
|
||||
return ', '.join([str(value) for value in self.elements[::-1]]);
|
||||
|
||||
def push(self, value: Any):
|
||||
'''
|
||||
add element to stack
|
||||
@@ -68,3 +75,6 @@ class Stack:
|
||||
checks if element in stack:
|
||||
'''
|
||||
return element in self.elements;
|
||||
|
||||
def empty(self) -> bool:
|
||||
return len(self) == 0;
|
||||
|
||||
Reference in New Issue
Block a user