菜单
×
×
正确!
练习缺少什么? class Stack: def __init__(self): self.stack = [] def push(self, element): self.stack.append(element) def pop(self): if self.@(9): return "Stack is empty" return self.stack.pop() def peek(self): if self.@(9): return "Stack is empty" return self.stack[-1] def isEmpty(self): return len(self.stack) == 0 def size(self): return len(self.stack)
class Stack: def __init__(self): self.stack = [] def push(self, element): self.stack.append(element) def pop(self): if self.isEmpty(): return "Stack is empty" return self.stack.pop() def peek(self): if self.isEmpty(): return "Stack is empty" return self.stack[-1] def isEmpty(self): return len(self.stack) == 0 def size(self): return len(self.stack) 不正确点击此处重新尝试。 正确!下一题 ❯ |
这将重置所有 43 道练习的分数。
您确定要继续吗?