【LeetCode】 88. Merge Sorted Array 合并两个有序数组(Easy)(JAVA)
题目地址: https://leetcode.com/problems/merge-sorted-array/
题目描述:
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
Note:
- The number of elements initialized in nums1 and nums2 are m and n respectively.
- You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2.
Example:
Input:
nums1 = [1,2,3,0,0,0], m = 3
nums2 = [2,5,6], n = 3
Output: [1,2,2,3,5,6]
题目大意
给你两个有序整数数组 nums1 和 nums2,请你将 nums2 合并到 nums1 中,使 num1 成为一个有序数组。
解题方法
因为 num1 的容量是足够的,为了不是用额外的空间,可以采用从后往前的遍历
class Solution {
public void merge(int[] nums1, int m, int[] nums2, int n) {
while (m > 0 || n > 0) {
if (m <= 0) {
nums1[n + m - 1] = nums2[n - 1];
n--;
} else if (n <= 0) {
nums1[n + m - 1] = nums1[m - 1];
m--;
} else if (nums1[m - 1] > nums2[n - 1]) {
nums1[n + m - 1] = nums1[m - 1];
m--;
} else {
nums1[n + m - 1] = nums2[n - 1];
n--;
}
}
}
}
执行耗时: 0 ms,击败了 100.00% 的Java用户
内存消耗: 39.6 MB,击败了 5.94% 的Java用户