FilesExpand file tree

 master

/

MergeSortedArray.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

21 lines (20 loc) · 519 Bytes

 master

/

MergeSortedArray.java

Copy path

Top

File metadata and controls

• Code
• Blame

21 lines (20 loc) · 519 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

/**

* Given two sorted integer arrays A and B, merge B into A as one sorted array.

*

* Note:

*

* You may assume that A has enough space to hold additional elements from B.

* The number of elements initialized in A and B are m and n respectively.

*/

public class MergeSortedArray {

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

int i = m - 1, j = n - 1;

int k = m + n - 1;

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

A[k--] = A[i] >= B[j] ? A[i--] : B[j--];

}

while (j >= 0) {

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

}

}

}