https://leetcode-cn.com/problems/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof/
首尾指针
func exchange(nums []int) []int {
l, r := 0, len(nums)-1
for {
if l >= r {
return nums
}
if nums[l] % 2 == 1 { // 奇
l++
continue
}
if nums[r] % 2 == 0 { // 偶
r--
continue
}
nums[l], nums[r] = nums[r], nums[l]
l++ // 非必要
r--
}
}