-
Notifications
You must be signed in to change notification settings - Fork 213
/
MergeSortedArray.h
28 lines (26 loc) · 798 Bytes
/
MergeSortedArray.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
/*
Author: Annie Kim, [email protected]
Date: Apr 10, 2013
Update: Aug 7, 2013
Problem: Merge Sorted Array
Difficulty: Easy
Source: https://leetcode.com/onlinejudge#question_88
Notes:
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.
Solution: From back to forth.
*/
class Solution {
public:
void merge(int A[], int m, int B[], int n) {
int i = m - 1;
int j = n - 1;
int x = m + n - 1;
while (i >= 0 && j >= 0)
if (A[i] >= B[j]) A[x--] = A[i--];
else A[x--] = B[j--];
while (j >= 0) A[x--] = B[j--];
}
};