-
Notifications
You must be signed in to change notification settings - Fork 0
/
test19.cpp
50 lines (42 loc) · 818 Bytes
/
test19.cpp
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
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
#include<iostream>
#include<vector>
#include<stdlib.h>
#include<algorithm>
#include<stdio.h>
using namespace std;
void merge(vector<int>& A, vector<int>& B) {
int m = A.size(),
n = B.size();
for (int i = 0; i < n; i++)
A.push_back(0);
int i = m - 1, j = 0, k = m + n - 1;
while (i >= 0 && j < n) {
if (A[i] > B[j]) {
A[k--] = A[i--];
}
else {
A[k--] = B[j++];
}
}
while (i >= 0) {
A[k--] = A[i--];
}
while (j < n) {
A[k--] = B[j++];
}
}
void print(vector<int> a, int m)
{
for (size_t i = 0; i < m; i++)
{
cout << a[i] << ' ';
}
cout << endl;
}
int main()
{
vector<int> a{ 1,3,5,9,69 };
vector<int> b{ 62,36,13,3,2 };
merge(a, b);
print(a, 10);
}