-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathmatchArray.java
56 lines (48 loc) · 1.02 KB
/
matchArray.java
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
package mumTestPackage;
import static org.junit.jupiter.api.Assertions.*;
import java.util.Arrays;
import org.junit.jupiter.api.Test;
class MumTest5 {
@Test
void test() {
assertArrayEquals(new int[] {1, 2}, matchArray(new int[] {1, 8, 3, 2}, new int[] {4, 2, 6, 1}));
}
static int[] matchArray(int[] first, int[] second) {
if(first == null || second == null ) {
return null;
}
System.out.println(Arrays.toString(first));
if(first.length == 0 || second.length == 0)
return new int[0];
int min = (first.length < second.length) ? first.length : second.length;
int[] a, b;
if (min == first.length)
{
a = first;
b = second;
}
else
{
a = second;
b = first;
}
int[] c = new int[min];
int k = 0;
for (int i = 0; i < a.length; i++)
{
for (int j = 0; j < b.length; j++)
{
if (a[i] == b[j])
{
c[k] = a[i];
k++;
}
}
}
int[] retArray = new int[k];
for (int t = 0; t < retArray.length; t++) {
retArray[t] = c[t];
}
return retArray;
}
}