LeetCode: 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.

Source Code:

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