0373. Partition Array by Odd and Even

public class Solution {
    /*
     * @param nums: an array of integers
     * @return: nothing
     */
    public void partitionArray(int[] nums) {
        int odd = 0;
        int even = nums.length-1;
        while(odd<even){
            if(nums[odd] % 2 == 0 || nums[even] % 2 == 1){  //if either are in the wrong place
                swap(nums, odd, even);
            }
            if(nums[even] % 2 == 0){
                even--;
            }
            if(nums[odd] % 2 == 1){
                odd++;
            }
        }
    }
    
    public void swap(int[] nums, int a, int b){
        int temp = nums[a];
        nums[a] = nums[b];
        nums[b] = temp;
    }
}