本文共 620 字，大约阅读时间需要 2 分钟。

问题：

Given two sorted integer arrays A and B, merge B into A as one sorted array.

Note:
You may assume that A has enough space (size that is greater or equal to m + n) to hold additional elements from B. The number of elements initialized in A and B are m andn respectively.

合并 从后往前合并。

代码：

class Solution {public:    void merge(int A[], int m, int B[], int n) {        int i = m-1; 		int j = n-1;		int k = m+n-1;		while(i >= 0 && j >= 0)		{			if(A[i] > B[j])			{				A[k] = A[i];				--k;				--i;			}			else			{				A[k] = B[j];				--j;				--k;			}		}		if(j >= 0)		{			while(j >= 0)			{				A[k--] = B[j--];			}		}    }};

转载地址：http://wutsi.baihongyu.com/