FilesExpand file tree

 master

/

ArrayPartitionI.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

54 lines (46 loc) · 1.13 KB

 master

/

ArrayPartitionI.java

Copy path

Top

File metadata and controls

• Code
• Blame

54 lines (46 loc) · 1.13 KB

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

44

45

46

47

48

49

50

51

52

53

54

package leetcode;

public class ArrayPartitionI {

public static void main(String[] args) {

// TODO Auto-generated method stub

}

public int arrayPairSum(int[] nums) {

mergeSort(nums,0, nums.length-1);

int sum=0;

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

sum= sum+ nums[i];

}

return sum;

}

public void mergeSort(int[] nums, int l, int p){

if(l==p){

return;

}

int mid = (l+p)/2;

mergeSort(nums, l, mid);

mergeSort(nums, mid+1, p);

merge(nums, l, mid+1, p);

}

public void merge(int[] nums, int left, int mid, int rightEnd){

int right = mid;

int k=0;

int n= rightEnd-left+1;

int lower =left;

int[] temp= new int[n];

while(left<=mid-1 && right<= rightEnd){

if(nums[left]<=nums[right]){

temp[k++]= nums[left++];

}else{

temp[k++]= nums[right++];

}

}

while(left<=mid-1){

temp[k++]= nums[left++];

}

while(right<=rightEnd){

temp[k++]= nums[right++];

}

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

nums[lower+i] = temp[i];

}

}

}