FilesExpand file tree

 master

/

ReorderArray.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

43 lines (37 loc) · 961 Bytes

 master

/

ReorderArray.java

Top

File metadata and controls

• Code
• Blame

43 lines (37 loc) · 961 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

package _21;

import java.util.Arrays;

public class ReorderArray {

/**

* 实现一个函数来调整数组中的数字，使得所有奇数位于数组的前半部分，偶数位于后半部分。

*

* 使用双指针从两端往中间扫描

*/

public static void reorder(int[] data) {

if (data == null || data.length < 2) {

return;

}

int left = 0;

int right = data.length - 1;

while (left < right) {

while (left < right && !isEven(data[left])) {

left++;

}

while (left < right && isEven(data[right])) {

right--;

}

if (left < right) {

int temp = data[left];

data[left] = data[right];

data[right] = temp;

}

}

}

public static boolean isEven(int value) {

return (value&1) == 0;

}

public static void main(String[] args) {

int[] data = {1,2,3,4,5,7,7};

reorder(data);

System.out.println(Arrays.toString(data));

}

}