FilesExpand file tree

master

/

MergeSortedArray.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

23 lines (22 loc) · 618 Bytes

master

/

MergeSortedArray.java

Copy path

Top

File metadata and controls

• Code
• Blame

23 lines (22 loc) · 618 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

package com.dbc;

public class MergeSortedArray {

public void merge(int[] nums1, int m, int[] nums2, int n) {

int cur = m + n - 1;

while (m > 0 || n > 0) {

if (m == 0) {

nums1[cur] = nums2[n - 1];

n--;

} else if (n == 0) {

nums1[cur] = nums1[m - 1];

m--;

} else if (nums1[m - 1] >= nums2[n - 1]) {

nums1[cur] = nums1[m - 1];

m--;

} else {

nums1[cur] = nums2[n - 1];

n--;

}

cur--;

}

}

}