题目:
Given two sorted integer arrays nums1 and nums2, merge nums2 into nums1 as one sorted array.
Note:
You may assume that nums1 has enough space (size that is greater or equal to m + n) to hold additional elements from nums2. The number of elements initialized in nums1 and nums2 are m and n respectively.
题解:
对nums1从后向前填入元素即可。
public class Solution {
public void merge(int[] nums1, int m, int[] nums2, int n) {
int end1 = m-1;
int end2 = n-1;
int end = m+n-1;
int num = 0;
while(end1>=0&&end2>=0){
if(nums1[end1]>=nums2[end2]){
nums1[end--] = nums1[end1--];
}
else{
nums1[end--] = nums2[end2--];
}
}
//若nums1[]已经全部加入nums1[];若nums2[]已经全部加入nums1[],直接返回(public void,不用return语句,直接结束)
if(end1<0){
for(int i=0;i<=end2;i++){
nums1[i]=nums2[i];
}
}
/*这段网上找的
int i = m - 1;
int j = n - 1;
int k = m + n - 1;
while (k >= 0) {
if (j < 0 || (i >= 0 && nums1[i] > nums2[j]))
nums1[k--] = nums1[i--];
<span style="white-space:pre"> </span> else
<span style="white-space:pre"> </span>nums1[k--] = nums2[j--];
<span style="white-space:pre"> </span>}*/
}
}