Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commitc297b60

Browse files
committed
🐛 FIX: expression display error
1 parent4b2f02f commitc297b60

File tree

1 file changed

+3
-2
lines changed

1 file changed

+3
-2
lines changed

‎data_structure/stack_queue.md

Lines changed: 3 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -83,8 +83,9 @@ func (this *MinStack) GetMin() int {
8383

8484
[evaluate-reverse-polish-notation](https://leetcode-cn.com/problems/evaluate-reverse-polish-notation/)
8585

86-
>**波兰表达式计算** >**输入:**["2", "1", "+", "3", "*"] >**输出:** 9
87-
>**解释:** ((2 + 1)\* 3) = 9
86+
>**波兰表达式计算** >**输入:**`["2", "1", "+", "3", "*"]` >**输出:** 9
87+
>
88+
>**解释:**`((2 + 1) * 3) = 9`
8889
8990
思路:通过栈保存原来的元素,遇到表达式弹出运算,再推入结果,重复这个过程
9091

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp