FilesExpand file tree

master

/

S88.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

32 lines (30 loc) · 922 Bytes

master

/

S88.java

Copy path

Top

File metadata and controls

• Code
• Blame

32 lines (30 loc) · 922 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

/**

* LC#88. Merge Sorted Array

* https://leetcode-cn.com/problems/merge-sorted-array/

*/

public class S88 {

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

//三指针替换

int oneIndex = m - 1;

int twoIndex = n - 1;

int mergeIndex = m + n - 1;

//从后往前，指针比较交换排序

while (oneIndex >= 0 && twoIndex >= 0) {

//比较排序

if(nums1[oneIndex] > nums2[twoIndex]) {

nums1[mergeIndex--] = nums1[oneIndex--];

} else {

nums1[mergeIndex--] = nums2[twoIndex--];

}

}

while (twoIndex >= 0) {

nums1[mergeIndex--] = nums2[twoIndex--];

}

}

public static void main(String[] args) {

int[] nums1 = {1,2,3,0,0,0};

int[] nums2 = {2,5,6};

S88 m = new S88();

m.merge(nums1, 3, nums2, 3);

}

}