Merge Sorted Array LeetCode solution in C++

1
class Solution {
2
 public:
3
  void merge(vector<int> &nums1, int m, vector<int> &nums2, int n) {
4
    vector<int> temp(n + m);
5
    int i = 0, j = 0, k = 0;
6
    while (i < m && j < n) { // select smaller element from both vector
7
      if (nums1[i] < nums2[j]) {
8
        temp[k] = nums1[i];
9
        i++;
10
        k++;
11
      } else {
12
        temp[k] = nums2[j];
13
        j++;
14
        k++;
15
      }
16
    }
17
    while (i < m) { // insert remaining nums1 element
18
      temp[k] = nums1[i];
19
      i++;
20
      k++;
21
    }
22
    while (j < n) { // insert remaining nums2 element
23
      temp[k] = nums2[j];
24
      j++;
25
      k++;
26
    }
27
    nums1 = temp;
28
    return;
29
  }
30
};