{ "type": "code_options", "author": "csdn.net", "source": "solution.md", "exercise_id": "be127eb3d2ef453ab35df80d16cdcd73", "keywords": "数组,双指针,排序", "title": "合并两个有序数组", "desc": [ { "content": "\n

给你两个有序整数数组 nums1 nums2,请你将 nums2 合并到 nums1 使 nums1 成为一个有序数组。

初始化 nums1nums2 的元素数量分别为 mn 。你可以假设 nums1 的空间大小等于 m + n,这样它就有足够的空间保存来自 nums2 的元素。

 

示例 1:

输入:nums1 = [1,2,3,0,0,0], m = 3, nums2 = [2,5,6], n = 3
输出:
[1,2,2,3,5,6]

示例 2:

输入:nums1 = [1], m = 1, nums2 = [], n = 0
输出:
[1]

 

提示:

", "language": "markdown" } ], "answer": [ { "content": "", "language": "java" } ], "prepared": [ [ { "content": "", "language": "java" } ], [ { "content": "", "language": "java" } ], [ { "content": "", "language": "java" } ] ], "template": { "content": "class Solution {\n\tpublic void merge(int[] nums1, int m, int[] nums2, int n) {\n\t\tfor (int i = 0; i < n; i++) {\n\t\t\tnums1[m] = nums2[i];\n\t\t\tm++;\n\t\t}\n\t\tint temp = 0;\n\t\tfor (int i = 0; i < m; i++) {\n\t\t\tfor (int j = i; j < m; j++) {\n\t\t\t\tif (nums1[i] > nums1[j]) {\n\t\t\t\t\ttemp = nums1[j];\n\t\t\t\t\tnums1[j] = nums1[i];\n\t\t\t\t\tnums1[i] = temp;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n}\n", "language": "java" }, "node_id": "dailycode-77f941ad05c44053af905fd80f942bd5", "license": "csdn.net", "created_at": 1637894160, "topic_link": "https://bbs.csdn.net/topics/600470926" }