🐛 FIX: expression display error

promacanthus · promacanthus · commit c297b6045026 · 2020-08-11T16:22:20.000+08:00
diff --git a/data_structure/stack_queue.md b/data_structure/stack_queue.md
@@ -83,8 +83,9 @@ func (this *MinStack) GetMin() int {
 
 [evaluate-reverse-polish-notation](https://leetcode-cn.com/problems/evaluate-reverse-polish-notation/)
 
-> **&#27874;&#20848;&#34920;&#36798;&#24335;&#35745;&#31639;** > **&#36755;&#20837;:** ["2", "1", "+", "3", "*"] > **&#36755;&#20986;:** 9
-> **&#35299;&#37322;:** ((2 + 1) \* 3) = 9
+> **&#27874;&#20848;&#34920;&#36798;&#24335;&#35745;&#31639;** > **&#36755;&#20837;:** `["2", "1", "+", "3", "*"]` > **&#36755;&#20986;:** 9
+>
+> **&#35299;&#37322;:** `((2 + 1) * 3) = 9`
 
 &#24605;&#36335;&#65306;&#36890;&#36807;&#26632;&#20445;&#23384;&#21407;&#26469;&#30340;&#20803;&#32032;&#65292;&#36935;&#21040;&#34920;&#36798;&#24335;&#24377;&#20986;&#36816;&#31639;&#65292;&#20877;&#25512;&#20837;&#32467;&#26524;&#65292;&#37325;&#22797;&#36825;&#20010;&#36807;&#31243;
 

-Original file line number
+Diff line change
 [evaluate-reverse-polish-notation](https://leetcode-cn.com/problems/evaluate-reverse-polish-notation/)
 -> **波兰表达式计算** > **输入:** ["2", "1", "+", "3", "*"] > **输出:** 9
 -> **解释:** ((2 + 1) \* 3) = 9
 +> **波兰表达式计算** > **输入:** `["2", "1", "+", "3", "*"]` > **输出:** 9
 +>
 +> **解释:** `((2 + 1) * 3) = 9`
 思路：通过栈保存原来的元素，遇到表达式弹出运算，再推入结果，重复这个过程