【LeetCode】Merge Sorted Array

题目描述：

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.

从前往后排序的话，需要用个queue来储存替换出来的A中的元素，比较麻烦。从后往前遍历比较简洁一点。

代码如下：

class Solution {public:    void merge(int A[], int m, int B[], int n){for (int i = m - 1, j = n - 1, index = m + n - 1; index >= 0; index--){if (j < 0) return;if (i < 0 || A[i] <= B[j])A[index] = B[j--];elseA[index] = A[i--];}}};