[E].[J].88.MergeSortedArray

class Solution {
    public void merge(int[] nums1, int m, int[] nums2, int n) {
        for (int i = 0; i < n; i++) {
            boolean foundAPlace = false;
            for (int j = 0; j < m; j++) {
                if (nums1[j] >= nums2[i]){
                    for (int k = m; k > j; k--) {
                        nums1[k] = nums1[k-1];
                    }
                    nums1[j] = nums2[i];
                    m++;
                    foundAPlace = true;
                    break;
                }
            }
            if (!foundAPlace) {
                nums1[m] = nums2[i];
                m++;
            }
        }
    }
}