leetcode(88):；两个数组排序合并

题目

88. Merge Sorted Array
    Easy

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]

思路

从后往前比较
如果数组1先到0，将数组2剩余直接按照次序放入数组1
如果数组2先到0，不用处理，保持即可

class Solution {
public:
	void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
		if (n == 0) {
			return;
		}
		int k = m + n - 1;
		int i = m - 1;
		int j = n - 1;
		while (j >= 0&&i>=0) {
			if (nums2[j] >= nums1[i]) {
				nums1[k--] = nums2[j--];
			}
			else {
				nums1[k--] = nums1[i--];
			}

		}
		while (j >= 0)
		{
			nums1[k--] = nums2[j--];
		}
	}

};