/
ReOrderArray.java
56 lines (47 loc) · 1.29 KB
/
ReOrderArray.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
package codingInterviews;
import org.junit.Test;
public class ReOrderArray {
public void reOrderArray(int[] array) {
int len = array.length;
int first = 0;
int last = len - 1;
while (first < last) {
while (first < last && !even(array[first])) {
first++;
}
while (first < last && even(array[last])) {
last--;
}
int temp = array[first];
array[first] = array[last];
array[last] = temp;
}
}
public void reOrderArray2(int[] array) {
int len = array.length;
int[] odd = new int[len];
int[] even = new int[len];
int oddIndex = 0;
int evenIndex = 0;
for (int i = 0; i < len; i++) {
if (even(array[i])) {
even[evenIndex++] = array[i];
} else {
odd[oddIndex++] = array[i];
}
}
for (int i = 0; i < oddIndex; i++) {
array[i] = odd[i];
}
for (int i = oddIndex; i < len; i++) {
array[i] = even[i-oddIndex];
}
}
private boolean even(int n) {
return (n & 1) == 0;
}
@Test
public void test() {
reOrderArray2(new int[]{1, 2, 3, 4, 5});
}
}