leetcode/MergeSortedArray/MergeSortedArray.cpp at master · diligentTiger/leetcode

25 lines (23 loc) · 784 Bytes

//============================================================================

// 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 to hold additional elements from B.

// The number of elements initialized in A and B are m and n respectively.

//============================================================================

class Solution {

public:

void merge(int A[], int m, int B[], int n) {

int i = m - 1, j = n - 1;

int k = m + n - 1;

while (i >= 0 && j >= 0) {

if (A[i] >= B[j]) A[k--] = A[i--];

else A[k--] = B[j--];

}

while (i >= 0) A[k--] = A[i--];

while (j >= 0) A[k--] = B[j--];

}

};

int main() {

return 0;

}

Provide feedback