任务描述
思路
- 栈
代码实现
class Solution:
def calPoints(self, ops: List[str]) -> int:
a = ['+','D','C']
stack = []
for i in ops:
if i not in a:
stack.append(int(i))
elif i == '+':
stack.append(stack[-1]+stack[-2])
elif i == 'D':
stack.append(stack[-1]*2)
elif i == 'C':
stack.pop()
# print(stack)
return sum(stack)