Commit 578c077

authored

Merge pull request greyireland#30 from Promacanthus/improve

IMPROVE: optimize the reverse function

2 parents 2741c8c + 158486d commit 578c077Copy full SHA for 578c077

File tree

-6

lines changed

-6

lines changed

Lines changed: 1 addition & 3 deletions

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`	```

Lines changed: 4 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -83,8 +83,9 @@ func (this *MinStack) GetMin() int {`
`83`	`83`
`84`	`84`	`[evaluate-reverse-polish-notation](https://leetcode-cn.com/problems/evaluate-reverse-polish-notation/)`
`85`	`85`
`86`		`-> 波兰表达式计算 > 输入: ["2", "1", "+", "3", ""] > 输出:* 9`
`87`		`-> 解释: ((2 + 1) \* 3) = 9`
	`86`	+> 波兰表达式计算 > 输入: `["2", "1", "+", "3", ""]` > 输出:* 9
	`87`	`+>`
	`88`	+> 解释: `((2 + 1) * 3) = 9`
`88`	`89`
`89`	`90`	`思路:通过栈保存原来的元素,遇到表达式弹出运算,再推入结果,重复这个过程`
`90`	`91`
`@@ -100,7 +101,7 @@ func evalRPN(tokens []string) int {`
`100`	`101`	`if len(stack)<2{`
`101`	`102`	`return -1`
`102`	`103`	`}`
`103`		`- // 注意:a为除数,b为被除数`
	`104`	`+ // 注意:a为被除数,b为除数`
`104`	`105`	`b:=stack[len(stack)-1]`
`105`	`106`	`a:=stack[len(stack)-2]`
`106`	`107`	`stack=stack[:len(stack)-2]`

Comments

(0)