#include #include std::vector int> mergesortedArray(const std::vector int>& vi, const std::vector int>& v2);
int main() {
// Tooo; test your code here
return 0;
std::vector int> mergesortedArray(const std::vector int>& vi, const std::vector int>& v2);
return std:: vector():
}
Merge Sorted Vectors
This question is adopted from LeetCode, Merge Sorted Array. The original question can be found here:
Develop a function that takes in two sorted (ascending order) vectors, returns another vector that is formed by merging the given two.
Note that the result vector must be sorted in ascending order.
Note
Ascending order: there might be duplicate elements in input vectors. Strictly speaking this is non-descending order.
Example
Input: v[1, 2, 4, 5, 9], w[2, 5, 7, 8]; output: [1, 2, 2, 4, 5, 7, 8, 9]
Input: v[5, 7], w[100, 200]; output: [5, 7, 100, 200]
Input: v[], w[1, 2, 3]; output: [1, 2, 3]
Input: v[], w[]; output: []