https://leetcode-cn.com/problems/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof/
class Solution {
/*
双指针法
*/
public int[] exchange(int[] nums) {
int left=0;
int right=nums.length-1;
while(left<right){
while(left<right&&nums[left]%2 == 1){ //左边遇到的第一个偶数
left++;
}
while(left<right&&nums[right]%2 == 0){ //右边遇到的第一个奇数
right--;
}
if(left<right){
int temp = nums[left];
nums[left]=nums[right];
nums[right]=temp;
}
}
return nums;
}
}