huangge1199/leet-code
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

88:合并两个有序数组

Browse Source
This commit is contained in:
huangge1199@hotmail.com 2021-07-08 22:58:35 +08:00
parent 4f53c6b2d0
commit 656d6ba79d
1 changed files with 4 additions and 23 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

27
src/main/java/leetcode/editor/cn/MergeSortedArray.java
View File

@ -35,6 +35,8 @@
package leetcode.editor.cn; package leetcode.editor.cn;
import java.util.Arrays;
//88:合并两个有序数组 //88:合并两个有序数组
public class MergeSortedArray { public class MergeSortedArray {
public static void main(String[] args) { public static void main(String[] args) {
@ -49,29 +51,8 @@ public class MergeSortedArray {
//leetcode submit region begin(Prohibit modification and deletion) //leetcode submit region begin(Prohibit modification and deletion)
class Solution { class Solution {
public void merge(int[] nums1, int m, int[] nums2, int n) { public void merge(int[] nums1, int m, int[] nums2, int n) {
int i = 0, j = 0; if (m + n - m >= 0) System.arraycopy(nums2, 0, nums1, m, m + n - m);
if (m == 0) { Arrays.sort(nums1);
nums1 = nums2;
return;
}
if (n == 0) {
return;
}
while (j < n) {
if (i >= m) {
nums1[i] = nums2[j];
j++;
} else if (nums1[i] > nums2[j]) {
if (m - i - i >= 0) {
if (m + n - 1 - i - i >= 0) {
System.arraycopy(nums1, i, nums1, i + 1, m + n - 1 - i - i);
}
}
nums1[i] = nums2[j];
j++;
}
i++;
}
} }
} }
//leetcode submit region end(Prohibit modification and deletion) //leetcode submit region end(Prohibit modification and deletion)