lintcode-easy-Partition Array by Odd and Even

[1, 2, 3, 4]

[1, 3, 2, 4]

public class Solution {
/**
* @param nums: an array of integers
* @return: nothing
*/
public void partitionArray(int[] nums) {
// write your code here;

if(nums == null || nums.length <= 1)
return;

int left = 0;
int right = nums.length - 1;

while(true){
while(left < right && nums[left] % 2 != 0)
left++;
while(left < right && nums[right] % 2 == 0)
right--;

if(left == right)
break;
swap(nums, left, right);
}

return;
}

public void swap(int[] nums, int i, int j){
int temp = nums[i];
nums[i] = nums[j];
nums[j] = temp;

return;
}

}