FilesExpand file tree

 master

/

mergeSortedArray.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

37 lines (30 loc) · 828 Bytes

 master

/

mergeSortedArray.java

Copy path

Top

File metadata and controls

• Code
• Blame

37 lines (30 loc) · 828 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

/**

* Created by codingBoy on 17/2/7.

*/

public class mergeSortedArray

{

/**

* Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.

Note:

You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2. The number of elements initialized in nums1 and nums2 are m and n respectively.

*

*

*/

public static void main(String[] args)

{

}

public static void merge(int[] A, int m, int[] B, int n) {

int i=m-1;

int j=n-1;

int k = m+n-1;

while(i >=0 && j>=0)

{

if(A[i] > B[j])

A[k--] = A[i--];

else

A[k--] = B[j--];

}

while(j>=0)

A[k--] = B[j--];

}

}