题目描述:
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]
中文理解:将两个有序的数组合并到第一个数组中去,最简单的思路就是开辟一个ArrayList动态数组,将nums1[i]和nums2[j]中小的数字装入动态数组中,最后将动态数组的元素装入nums1中。
代码(java):
class Solution {
public void merge(int[] nums1, int m, int[] nums2, int n) {
ArrayList<Integer> lst=new ArrayList<Integer>();
int i=0,j=0;
while(i<m&&j<n){
if(nums1[i]<nums2[j]){
lst.add(nums1[i]);
i++;
}
else{
lst.add(nums2[j]);
j++;
}
}
while(i<m){
lst.add(nums1[i]);
i++;
}
while(j<n){
lst.add(nums2[j]);
j++;
}
i=0;
for(int val : lst){
nums1[i]=val;
i++;
}
}
}