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.

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