88. Merge Sorted Array

88. Merge Sorted Array

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，没想到AC了。。。

       

class Solution {
public:
	void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
		vector<int> t;
		int i, j;
		i = j = 0;
		while (i != m||j != n) {
			if (i == m&&j!=n) t.push_back(nums2[j++]);
			else if (j == n&&i!=m) t.push_back(nums2[i++]);
			else t.push_back(nums1[i] < nums2[j] ? nums1[i++] : nums2[j++]);
		}
		nums1 = t;
	}
};

        看了答案感觉确实大神思路广一些，大神是从后向前排序。

     

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