leetcode-1/MergeSortedArray/MergeSortedArray.cpp at master · zwxalgorithm/leetcode-1 · GitHub

21 lines (20 loc) · 517 Bytes

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

class Solution {

public:

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

// Start typing your C/C++ solution below

// DO NOT write int main() function

int end = m + n - 1;

m -= 1;

n -= 1;

while (m >= 0 && n >= 0) {

if (A[m] > B[n])

A[end--] = A[m--];

else

A[end--] = B[n--];

}

while (m >= 0)

A[end--] = A[m--];

while (n >= 0)

A[end--] = B[n--];

}

};