-
Notifications
You must be signed in to change notification settings - Fork 4
Expand file tree
/
Copy pathReArrange.java
More file actions
65 lines (52 loc) · 1.08 KB
/
Copy pathReArrange.java
File metadata and controls
65 lines (52 loc) · 1.08 KB
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
57
58
59
60
61
62
63
64
65
/**
* Author : wangjinlei
* Email : sea11107@mail.ustc.edu.cn
*/
public class ReArrange {
// odd odd....even even
public static void arrange(int[] data) {
int low = 0;
int high = data.length - 1;
while (low < high) {
if (even(data[low])) {
++low;
}
if (!even(data[high])) {
--high;
}
// not cross
if (low < high)
swap(data, low, high);
}
}
public static void swap(int[] data, int i, int j) {
int t = data[i];
data[i] = data[j];
data[j] = t;
}
// if i is even return true, false, otherwise.
public static boolean even(int i) {
return (i & 1) == 0;
}
public static void print(int[] data) {
for (int i = 0; i < data.length; i++) {
System.out.print(data[i] + " ");
}
System.out.println();
}
public static void main(String[] args) {
int[] data = {1,2,3,4,5,6,7,8,9,10};
// 10 2 8 4 5 6 7 3 9 1
arrange(data);
print(data);
int[] data2 = {1};
arrange(data2);
print(data2);
int[] data3 = {1,3,2,4};
arrange(data3);
print(data3);
int[] data4 = {2,4,1,3};
arrange(data4);
print(data4);
}
}