剑指Offer21:调整数组顺序使奇数位于偶数前面
1.题目描述
2.示例
3.代码
4.链接
题目描述:
示例:
代码:
//双指针思想:
//左指针从左往右寻找偶数,右指针从右往左寻找奇数
//同时满足的时候,进行交换,否则继续向前或者后寻找
public int[] exchange(int[] nums) {
int i = 0;
int j = nums.length-1;
while(i<=j){
if(nums[i]%2==0 && nums[j]%2==1){
int tmp = nums[i];
nums[i] = nums[j];
nums[j] = tmp;
}else if(nums[i]%2==0){
j--;
}else{
i++;
}
}
return nums;
}
链接:
https://leetcode-cn.com/problems/diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof/