chang_sheng1的博客

PYTHON实现 栈 class Solution: def calPoints(self, ops: List[str]) -> int: Stack=[] for op in ops: if op=="+": Stack.append(Stack[-1]+Stack[-2]) ...

PYTHON实现 # Definition for singly-linked list. # class ListNode: # def __init__(self, x): # self.val = x # self.next = None class Solution: def addTwoNumbers(self, l1: ListNode...