输入一个整数数组,实现一个函数来调整该数组中数字的顺序,使得所有奇数位于数组的前半部分,所有偶数位于数组的后半部分。
示例:
输入:nums = [1,2,3,4]
输出:[1,3,2,4]
注:[3,1,2,4] 也是正确的答案之一。
提示:
0 <= nums.length <= 50000
1 <= nums[i] <= 10000
来源:力扣(LeetCode)
链接: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 slow = 0;
int fast = 1;
while(fast < nums.length) {
if(nums[fast] % 2 == 1 && nums[slow] % 2 == 0) {
int temp = nums[slow];
nums[slow] = nums[fast];
nums[fast] = temp;
slow++;
fast++;
} else if(nums[fast] % 2 == 1 && nums[slow] % 2 == 1){
slow = fast + 1;
fast += 2;
} else if(nums[fast] % 2 == 0 && nums[slow] % 2 == 1) {
slow++;
fast++;
} else{
fast++;
}
}
return nums;
}
}
简化版,跟好想了,也是双指针同向
class Solution {
public int[] exchange(int[] nums) {
int slow = 0;
int fast = 0;
while(fast < nums.length) {
if(nums[fast] % 2 == 1) {
int temp = nums[slow];
nums[slow] = nums[fast];
nums[fast] = temp;
slow++;
}
fast++;
}
return nums;
}
}
双指针异向,快指针找到奇数,慢指针找到偶树,然后互换即可
class Solution {
public int[] exchange(int[] nums) {
int slow = 0;
int fast = nums.length - 1;
while(slow < fast) {
while(nums[fast] % 2 == 0 && slow < fast) {
fast--;
}
while(nums[slow] % 2 == 1 && slow < fast) {
slow++;
}
if(slow < fast) {
int temp = nums[fast];
nums[fast] = nums[slow];
nums[slow] = temp;
slow++;
fast--;
}
}
return nums;
}
}