88. Merge Sorted Array

class Solution {public:    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) {        vector<int> nums_zip;        int m_p = 0;        int n_p = 0;        while (m_p < m && n_p < n) {            if (nums1[m_p] > nums2[n_p]) {                nums_zip.push_back(nums2[n_p]);                n_p++;            } else {                nums_zip.push_back(nums1[m_p]);                m_p++;            }        }        while (m_p < m) {            nums_zip.push_back(nums1[m_p]);            m_p++;        }        while (n_p < n) {            nums_zip.push_back(nums2[n_p]);            n_p++;        }        nums1 = nums_zip;    }};