Given two sorted integer arrays A and B, merge B into A as one sorted array.Problem Constraints
Note: You have to modify the array A to contain the merge of A and B. Do not output anything in your code.
TIP: C users, please malloc the result into a new array and return the result.
If the number of elements initialized in A and B is m and n respectively, the resulting size of array A after your code is executed should be m + n
1 <= |A|, |B| <= 105Input Format
The first argument is an integer array A.Output Format
The second argument is an integer array B.
Update the array A.Example Input
A : [1 5 8]Example Output
B : [6 9]
Modified A : [1 5 6 8 9]
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified.
Still have a question? Checkout Sample Codes for more details.