-
Notifications
You must be signed in to change notification settings - Fork 14
Expand file tree
/
Copy pathMergeTwoSortedArrays.java
More file actions
88 lines (69 loc) · 1.93 KB
/
MergeTwoSortedArrays.java
File metadata and controls
88 lines (69 loc) · 1.93 KB
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
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
//function
public class Solution {
public static int[] merge(int arr1[], int arr2[]) {
//Your code goes here
int[] newarr = new int[arr1.length+arr2.length];
int i=0;
int j=0;
int k=0;
while(i<arr1.length && j<arr2.length){
if(arr1[i]<arr2[j]){
newarr[k]=arr1[i];
i++;
k++;
}
else{
newarr[k]=arr2[j];
j++;
k++;
}
}
while(i<arr1.length){
newarr[k]=arr1[i];
i++;
k++;
}
while(j<arr2.length){
newarr[k]=arr2[j];
j++;
k++;
}
return newarr;
}
}
//main
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
public class Runner {
static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
public static int[] takeInput() throws IOException {
int size = Integer.parseInt(br.readLine().trim());
int[] input = new int[size];
if (size == 0) {
return input;
}
String[] strNums;
strNums = br.readLine().split("\\s");
for (int i = 0; i < size; ++i) {
input[i] = Integer.parseInt(strNums[i]);
}
return input;
}
public static void printArray(int[] arr) {
for (int element : arr) {
System.out.print(element + " ");
}
System.out.println();
}
public static void main(String[] args) throws NumberFormatException, IOException {
int t = Integer.parseInt(br.readLine().trim());
while(t > 0) {
int[] input1 = takeInput();
int[] input2 = takeInput();
int[] ans = Solution.merge(input1, input2);
printArray(ans);
t -= 1;
}
}
}