LeetCode-Easy部分中标签为Two Pointers 88. 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.

题目分析

归并排序的合并部分，前提是有序数组。
题目中说到nums1控件足够大。

代码实现

尤其注意题目给出的Merge的API，nums1足够大，m代表实际元素数，

        public void Merge(int[] nums1, int m, int[] nums2, int n)
        {
            int i = m - 1; //指向nums1
            int j = n - 1; //指向nums2
            int k = m + n - 1; //指向合并位置
            while (j >= 0)
            {
                if (i >= 0 && nums1[i] > nums2[i])
                    nums1[k--] = nums1[i--];
                else nums1[k--] = nums2[j--];

            }
        }

更多标签题目

http://blog.csdn.net/daigualu/article/details/69236015