In situ merging of two arrays with two pointers

A daily topic ing, Today is a day easy topic 88. Merge Sorted Array

class Solution {
    
public:
    void merge(vector<int>& nums1, int m, vector<int>& nums2, int n) 
    {
    
        int pos=nums1.size()-1;
        int i=m-1,j=n-1;
        while(i>=0&&j>=0)
        {
    
            int temp=max(nums1[i],nums2[j]);
            if(nums1[i]>nums2[j]) i--;
            else j--;
            nums1[pos]=temp;
            pos--;
        }
        while(j>=0&&pos>=0){
    
                nums1[pos]=nums2[j];
                j--;pos--;
        }
    }
};