Leetcode 88. Merge Sorted Array

文章作者：Tyan
博客：noahsnail.com  |  CSDN  |  简书

1. Description

2. Solution

• Version 1

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

Reference

1. https://leetcode.com/problems/sort-list/description/