NC22 合并两个有序的数组（C++）- 简单、数组、双指针

题目链接：https://www.nowcoder.com/practice/89865d4375634fc484f3a24b7fe65665?tpId=196&rp=1&ru=%2Fexam%2Foj&qru=%2Fexam%2Foj&sourceUrl=%2Fexam%2Foj%3Fpage%3D2%26tab%3D%25E7%25AE%2597%25E6%25B3%2595%25E7%25AF%2587%26topicId%3D196&difficulty=&judgeStatus=&tags=&title=22&gioEnter=menu
题目如下：

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

    }
};