FilesExpand file tree

 master

/

MergeSortedArray.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

33 lines (25 loc) · 749 Bytes

 master

/

MergeSortedArray.java

Copy path

Top

File metadata and controls

• Code
• Blame

33 lines (25 loc) · 749 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

package Algorithms.array;

public class MergeSortedArray {

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

int cur = m + n - 1;

// 指向A的尾部

int pA = m - 1;

// 指向B的尾部

int pB = n - 1;

while (cur >= 0) {

if (pA < 0 || pB < 0) {

break;

}

// 从尾部往前比较

if (A[pA] > B[pB]) {

A[cur] = A[pA--];

} else {

A[cur] = B[pB--];

}

cur--;

}

// copy the left over elements in B to A.

System.arraycopy(B, 0, A, 0, pB + 1);

return;

}

}