88.Merge Sorted Array

发表于 | 分类于 ， | 评论数： | 阅读次数：
字数统计: 211 | 阅读时间 ≈ 1

题目描述

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]

我的解法

解题思路

从nums1和nums2有数字的最后开始比较大小，将大的放到nums1的最后。

实现代码

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
class Solution {
public:
    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {
        if (n == 0) return;
        int i = m + n -1, j = m - 1, k = n - 1;
        while(j >= 0  && k >= 0){
            if (nums1[j] > nums2[k]){
                nums1[i] = nums1[j];
                j--;
            }
            else{
                nums1[i] = nums2[k];
                k--;
            }
            i--;
        }
        if (k >= 0 && j <= 0){
            while(k >= 0){
                nums1[i--] = nums2[k--];
            }  
        }
    }
};