👌 IMPROVE: optimize the reverse function

promacanthus · promacanthus · commit 4b2f02fa7cee · 2020-08-11T14:27:49.000+08:00
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]
 	}
 }
 ```

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