1
class Solution {
2

3
  public int[] sortArrayByParity(int[] nums) {
4
    int i = 0;
5
    int j = 0;
6

7
    while (i < nums.length) {
8
      if (nums[i] % 2 == 1) {
9
        i++;
10
      } else {
11
        int temp = nums[i];
12
        nums[i] = nums[j];
13
        nums[j] = temp;
14

15
        i++;
16
        j++;
17
      }
18
    }
19

20
    return nums;
21
  }
22
}