FilesExpand file tree

master

/

[88]合并两个有序数组.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

40 lines (36 loc) · 876 Bytes

master

/

[88]合并两个有序数组.java

Copy path

Top

File metadata and controls

• Code
• Blame

40 lines (36 loc) · 876 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

38

39

40

import java.util.Arrays;

//leetcode submit region begin(Prohibit modification and deletion)

class Solution {

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

for (int i = 0; i != n; ++i) {

nums1[m + i] = nums2[i];

}

//临时数组

int[] temp = new int[m + n];

//nums1指针

int i = 0;

//mums2指针

int j = m;

int k = 0;

while (i <= m-1 && j <= m+n-1) {

if (nums1[i] <= nums1[j]) {

temp[k++] = nums1[i++];

} else {

temp[k++] = nums1[j++];

}

}

// 把左边剩余的数移入数组

while (i <= m-1) {

temp[k++] = nums1[i++];

}

// 把右边边剩余的数移入数组

while (j <= m+n-1) {

temp[k++] = nums1[j++];

}

// 把新数组中的数覆盖nums数组

for (int k2 = 0; k2 < temp.length; k2++) {

nums1[k2 ] = temp[k2];

}

}

}

//leetcode submit region end(Prohibit modification and deletion)