mirror of
https://github.com/krahets/hello-algo.git
synced 2025-07-25 19:22:27 +08:00
build
This commit is contained in:
@ -345,41 +345,41 @@ comments: true
|
||||
|
||||
def __init__(self):
|
||||
"""构造方法"""
|
||||
self.__peek: ListNode | None = None
|
||||
self.__size: int = 0
|
||||
self._peek: ListNode | None = None
|
||||
self._size: int = 0
|
||||
|
||||
def size(self) -> int:
|
||||
"""获取栈的长度"""
|
||||
return self.__size
|
||||
return self._size
|
||||
|
||||
def is_empty(self) -> bool:
|
||||
"""判断栈是否为空"""
|
||||
return not self.__peek
|
||||
return not self._peek
|
||||
|
||||
def push(self, val: int):
|
||||
"""入栈"""
|
||||
node = ListNode(val)
|
||||
node.next = self.__peek
|
||||
self.__peek = node
|
||||
self.__size += 1
|
||||
node.next = self._peek
|
||||
self._peek = node
|
||||
self._size += 1
|
||||
|
||||
def pop(self) -> int:
|
||||
"""出栈"""
|
||||
num = self.peek()
|
||||
self.__peek = self.__peek.next
|
||||
self.__size -= 1
|
||||
self._peek = self._peek.next
|
||||
self._size -= 1
|
||||
return num
|
||||
|
||||
def peek(self) -> int:
|
||||
"""访问栈顶元素"""
|
||||
if self.is_empty():
|
||||
raise IndexError("栈为空")
|
||||
return self.__peek.val
|
||||
return self._peek.val
|
||||
|
||||
def to_list(self) -> list[int]:
|
||||
"""转化为列表用于打印"""
|
||||
arr = []
|
||||
node = self.__peek
|
||||
node = self._peek
|
||||
while node:
|
||||
arr.append(node.val)
|
||||
node = node.next
|
||||
@ -1111,35 +1111,35 @@ comments: true
|
||||
|
||||
def __init__(self):
|
||||
"""构造方法"""
|
||||
self.__stack: list[int] = []
|
||||
self._stack: list[int] = []
|
||||
|
||||
def size(self) -> int:
|
||||
"""获取栈的长度"""
|
||||
return len(self.__stack)
|
||||
return len(self._stack)
|
||||
|
||||
def is_empty(self) -> bool:
|
||||
"""判断栈是否为空"""
|
||||
return self.__stack == []
|
||||
return self._stack == []
|
||||
|
||||
def push(self, item: int):
|
||||
"""入栈"""
|
||||
self.__stack.append(item)
|
||||
self._stack.append(item)
|
||||
|
||||
def pop(self) -> int:
|
||||
"""出栈"""
|
||||
if self.is_empty():
|
||||
raise IndexError("栈为空")
|
||||
return self.__stack.pop()
|
||||
return self._stack.pop()
|
||||
|
||||
def peek(self) -> int:
|
||||
"""访问栈顶元素"""
|
||||
if self.is_empty():
|
||||
raise IndexError("栈为空")
|
||||
return self.__stack[-1]
|
||||
return self._stack[-1]
|
||||
|
||||
def to_list(self) -> list[int]:
|
||||
"""返回列表用于打印"""
|
||||
return self.__stack
|
||||
return self._stack
|
||||
```
|
||||
|
||||
=== "C++"
|
||||
|
Reference in New Issue
Block a user