mirror of
https://github.com/youngyangyang04/leetcode-master.git
synced 2025-07-06 23:28:29 +08:00
docs: 150题添加注释
This commit is contained in:
@ -200,6 +200,7 @@ class Solution(object):
|
|||||||
else:
|
else:
|
||||||
op2 = stack.pop()
|
op2 = stack.pop()
|
||||||
op1 = stack.pop()
|
op1 = stack.pop()
|
||||||
|
# 由题意"The division always truncates toward zero",所以使用int()可以天然取整
|
||||||
stack.append(str(int(eval(op1 + token + op2))))
|
stack.append(str(int(eval(op1 + token + op2))))
|
||||||
return int(stack.pop())
|
return int(stack.pop())
|
||||||
```
|
```
|
||||||
|
Reference in New Issue
Block a user