1 #include<iostream>
 2 #include<vector>
 3 #include<algorithm>
 4 using namespace std;
 5 class Solution {
 6 public:
 7     void reOrderArray(vector<int> &array) {
 8         vector<int> odd;
 9         vector<int> ji;
10         for (int i = 0; i < array.size(); i++)
11         {
12             if (array[i] % 2 == 0)
13             {
14                 odd.push_back(array[i]);
15             }
16             else
17             {
18                 ji.push_back(array[i]);
19             }
20         }
21         ji.insert(ji.end(),odd.begin(),odd.end());
22         array.assign(ji.begin(), ji.end());
23         /*
24         for (int i = 0; i < ji.size(); i++)
25         {
26             cout << array[i] << endl;
27         }
28         */
29     }
30 };
31 int main()
32 {
33     Solution so;
34     vector<int> te = { 1,2,3,4,5,6,7};
35     so.reOrderArray(te);
36     return 0;
37 }