Partition an integers array into odd number first and even number second.
Have you met this question in a real interview?
Yes
Example
Given [1, 2, 3, 4], return [1, 3, 2, 4]
Challenge
Do it in-place.
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 start = 0 ; int end = nums.length - 1; while(start < end){ while(start < end && nums[start] % 2 != 0){ start++; } while(start < end && nums[end] % 2 == 0){ end--; } if (start < end) { int temp = nums[start]; nums[start++] = nums[end]; nums[end--] = temp; } } } }