分割一个整数数组,使得奇数在前偶数在后。
解题思路:前后指针向中间靠
一刷ac
public class Solution {
/**
* @param nums: an array of integers
* @return: nothing
*/
public void partitionArray(int[] nums) {
if(nums == null || nums.length == 0) return;
int left = 0;
int right = nums.length - 1;
while(left < right){
if(nums[left] % 2 == 0 && nums[right] % 2 == 1){
int tmp = nums[left];
nums[left] = nums[right];
nums[right] = tmp;
left++;
right--;
}else if(nums[left] % 2 == 1 && nums[right] % 2 == 0){
left++;
right--;
}else if(nums[left] % 2 == 1 && nums[right] % 2 == 1){
left++;
}else if(nums[left] % 2 == 0 && nums[right] % 2 == 0){
right--;
}
}
}
}
public class Solution {
/**
* @param nums: an array of integers
* @return: nothing
*/
public void partitionArray(int[] nums) {
if ( nums.length == 0) return;
int left = 0;
int right = nums.length - 1;
while (left < right){
while (left < right && nums[left]%2 != 0){
left++;
}
while (left < right && nums[right]%2 == 0){
right--;
}
if(left < right){
int temp = nums[left];
nums[left] = nums[right];
nums[right] = temp;
}
}
}
}