LeetCode-88.Merge Sorted Array

https://leetcode.com/problems/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 nums1and nums2 are m and n respectively.

顺序操作，需要迭代移动nums1中元素，麻烦

public void Merge(int[] nums1, int m, int[] nums2, int n) 
    {
        int p = 0;
        bool flag;
        for (int i = 0; i < n; i++)
        {
            flag = false;
            for (int j = p; j < m+i; j++)
            {
                if (nums1[j] > nums2[i])
                {
                    for (int k = m+i; k > j; k--)
                    {
                        nums1[k] = nums1[k - 1];
                    }
                    nums1[j] = nums2[i];
                    flag = true;
                    p++;
                    break;
                }
            }
            if (!flag)
                nums1[m+i] = nums2[i];
        }
    }

倒序操作，无需移动元素，简单

public void Merge(int[] nums1, int m, int[] nums2, int n) 
    {
        int p = m + n - 1, i = m - 1, j = n - 1;
        while (i >= 0 && j >= 0)
        {
            if (nums1[i] > nums2[j])
                nums1[p--] = nums1[i--];
            else
                nums1[p--] = nums2[j--];
        }
        while (j >= 0)
            nums1[p--] = nums2[j--];
    }