From 656d6ba79d52e1ca34ef123e8092c191c6f5027e Mon Sep 17 00:00:00 2001 From: "huangge1199@hotmail.com" Date: Thu, 8 Jul 2021 22:58:35 +0800 Subject: [PATCH] =?UTF-8?q?88:=E5=90=88=E5=B9=B6=E4=B8=A4=E4=B8=AA?= =?UTF-8?q?=E6=9C=89=E5=BA=8F=E6=95=B0=E7=BB=84?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- .../leetcode/editor/cn/MergeSortedArray.java | 27 +++---------------- 1 file changed, 4 insertions(+), 23 deletions(-) diff --git a/src/main/java/leetcode/editor/cn/MergeSortedArray.java b/src/main/java/leetcode/editor/cn/MergeSortedArray.java index 6c82e64..b88926e 100644 --- a/src/main/java/leetcode/editor/cn/MergeSortedArray.java +++ b/src/main/java/leetcode/editor/cn/MergeSortedArray.java @@ -35,6 +35,8 @@ package leetcode.editor.cn; +import java.util.Arrays; + //88:合并两个有序数组 public class MergeSortedArray { public static void main(String[] args) { @@ -49,29 +51,8 @@ public class MergeSortedArray { //leetcode submit region begin(Prohibit modification and deletion) class Solution { public void merge(int[] nums1, int m, int[] nums2, int n) { - int i = 0, j = 0; - if (m == 0) { - 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++; - } + if (m + n - m >= 0) System.arraycopy(nums2, 0, nums1, m, m + n - m); + Arrays.sort(nums1); } } //leetcode submit region end(Prohibit modification and deletion)