剑指offer--调整数组顺序使奇数位于偶数前面

class Solution {
public:
    void reOrderArray(vector<int> &array) {
        int len = array.size();
        if(len == 0){
            return;
        }
        vector<int> even;
        vector<int> odd;
        for(int i = 0 ; i < len ; i++){
            if(array[i] % 2 == 0){
                even.push_back(array[i]);
            }else{
                odd.push_back(array[i]);
            }
        }
        int cnt = 0; 
        for(int i = 0 ; i < odd.size() ; i++){
            array[cnt++] = odd[i];
        }
        for(int i = 0 ; i < even.size() ; i++){
            array[cnt++] = even[i];
        }
    }
};

import java.util.ArrayList;

public class Solution {
    public void reOrderArray(int [] array) {
        int len =array.length;
        ArrayList<Integer> odd = new ArrayList<>();
        ArrayList<Integer> even = new ArrayList<>();

        for ( int i = 0 ; i < len ; i++){
            if (array[i] % 2 == 0){
                even.add(array[i]);
            }else{
                odd.add(array[i]);
            }
        }

        int i;
        for ( i = 0 ; i < odd.size() ; i++){
            array[i] = odd.get(i);
        }
        for (int j = 0 ; j < even.size() ; j++){
            array[i++] = even.get(j);
        }
    }
}