【leetcode】Merge Sorted Array

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.

从后往前，比较A[i]和B[j]，把更大的元素放在A的末尾即可

class Solution {
public:
void merge(int A[], int m, int B[], int n) {

int last=m+n-1;
int i=m-1;
int j=n-1;
while(i>=0||j>=0)
{
if(i<0)
{
A[last]=B[j];
j--;
last--;
continue;
}

if(j<0)
{
A[last]=A[i];
i--;
last--;
continue;
}

if(A[i]>B[j])
{
A[last]=A[i];
i--;
}
else
{
A[last]=B[j];
j--;
}
last--;
}
}
};