FazBrowse GitHub Viewer | Trending | | Home

Tools: [Download Repo ZIP] [View Raw Code] [Original HTTPS Page]

algorithm/Week_01/id_108/LeetCode_905_108.java at master · isnotnull/algorithm · GitHub

51 lines (49 loc) · 1.35 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

/**

* @author zhangruihao.zhang

* @version v1.0.0

* @since 2019/04/20

*/

public class LeetCode_905_108 {

class Solution1 {

public int[] sortArrayByParity(int[] A) {

int left = 0;

int right = A.length - 1;

while(left < right){

while( left< A.length && (A[left] & 1) == 0){

left ++;

}

while( right>0 && (A[right] & 1) == 1){

right --;

}

if(left < right) {

swap(A,left,right);

}

}

return A;

}

private void swap(int[] A,int left,int right){

int tmp = A[left];

A[left] = A[right];

A[right] = tmp;

}

}

class Solution2 {

public int[] sortArrayByParity(int[] A) {

int[] even = new int[A.length];

int[] odd = new int[A.length];

int evenIndex = 0;

int oddIndex = 0;

for(int i=0 ;i<A.length;i++){

if((A[i] & 1) == 0){

even[evenIndex ++] = A[i];

}else{

odd[oddIndex ++] = A[i];

}

}

for(int i=0 ;i<oddIndex;i++){

even[evenIndex ++] = odd[i];

}

return even;

}

}

}

Back | FazBrowse Home | New Git URL