Merge pull request greyireland#30 from Promacanthus/improve

greyireland · web-flow · commit 578c0777a0b3 · 2020-08-14T19:24:14.000+08:00
IMPROVE: optimize the reverse function
diff --git a/data_structure/binary_tree.md b/data_structure/binary_tree.md
@@ -640,9 +640,7 @@ func zigzagLevelOrder(root *TreeNode) [][]int {
 }
 func reverse(nums []int) {
 	for i := 0; i < len(nums)/2; i++ {
-		t := nums[i]
-		nums[i] = nums[len(nums)-1-i]
-		nums[len(nums)-1-i] = t
+		nums[i], nums[len(nums)-1-i] = nums[len(nums)-1-i], nums[i]
 	}
 }
 ```
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/)
 
-> **波兰表达式计算** > **输入:** ["2", "1", "+", "3", "*"] > **输出:** 9
-> **解释:** ((2 + 1) \* 3) = 9
+> **波兰表达式计算** > **输入:** `["2", "1", "+", "3", "*"]` > **输出:** 9
+>
+> **解释:** `((2 + 1) * 3) = 9`
 
 思路：通过栈保存原来的元素，遇到表达式弹出运算，再推入结果，重复这个过程
 
@@ -100,7 +101,7 @@ func evalRPN(tokens []string) int {
             if len(stack)<2{
                 return -1
             }
-            // 注意：a为除数，b为被除数
+            // 注意：a为被除数，b为除数
             b:=stack[len(stack)-1]
             a:=stack[len(stack)-2]
             stack=stack[:len(stack)-2]

Original file line number	Diff line number	Diff line change
`@@ -640,9 +640,7 @@ func zigzagLevelOrder(root *TreeNode) [][]int {`
`640`	`640`	`}`
`641`	`641`	`func reverse(nums []int) {`
`642`	`642`	`for i := 0; i < len(nums)/2; i++ {`
`643`		`- t := nums[i]`
`644`		`- nums[i] = nums[len(nums)-1-i]`
`645`		`- nums[len(nums)-1-i] = t`
	`643`	`+ nums[i], nums[len(nums)-1-i] = nums[len(nums)-1-i], nums[i]`
`646`	`644`	`}`
`647`	`645`	`}`
`648`	`646`	```