LeetCode: 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 和 nums2 的最大值放到 nums1 中应有的位置，如图：

AC 代码

class Solution {
public:
    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
        int i = m, j = n, k = m + n;

        while(i > 0 && j > 0)
        {
            if(nums1[i-1] >= nums2[j-1]) nums1[--k] = nums1[--i];
            else nums1[--k] = nums2[--j];
        }

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

    }
};