-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMergeSortedArrays.java
More file actions
66 lines (45 loc) · 1.47 KB
/
MergeSortedArrays.java
File metadata and controls
66 lines (45 loc) · 1.47 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
package com.company;
import java.util.Arrays;
public class Main {
public static int[] mergeSortedArrays(int[] array1, int[] array2) {
if(array1 == null || array2 == null) {
throw new IllegalArgumentException("Passed in arrays must be non null");
}
int array1Length = array1.length;
int array2Length = array2.length;
int[] mergedArray = new int[ array1Length + array2Length ];
int i=0, j=0, k=0;
while(i < array1Length && j < array2Length) {
int array1_val = array1[i];
int array2_val = array2[j];
if( array1_val == array2_val) {
mergedArray[k++] = array1_val;
mergedArray[k++] = array2_val;
j++;
i++;
}
else if( array1_val > array2_val) {
mergedArray[k++] = array2_val;
j++;
}
else {
mergedArray[k++] = array1_val;
i++;
}
}
while (i < array1Length) {
mergedArray[k] = array1[i];
i++;
}
while (j < array2Length) {
mergedArray[k++] = array2[j];
j++;
}
return mergedArray;
}
public static void main(String[] args) {
int[] array1 = {1, 2, 3, 50};
int[] array2 = {10, 20, 30, 40};
System.out.println(Arrays.toString(mergeSortedArrays(array1, array2)));
}
}