-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcontest1.java
65 lines (37 loc) · 1.13 KB
/
contest1.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
57
58
59
60
61
62
63
64
65
import java.util.Arrays;
public class contest1 {
public static void main(String[] args) {
int[] arr1 = {4,3,2,3,1};
int[] arr2 = {2,2,5,2,3,6};
System.out.println(Arrays.toString(findIntersectionValues(arr1,arr2)));
}
public static int[] findIntersectionValues(int[] nums1, int[] nums2) {
int ans1 = common1(nums1,nums2);
int ans2 = common2(nums2, nums1);
return new int[]{ans1,ans2};
}
private static int common2(int[] nums2, int[] nums1) {
int count =0;
for(int i=0; i<nums2.length; i++){
for(int j=0; j<nums1.length; j++){
if(nums2[i] == nums1[j]){
count++;
break;
}
}
}
return count;
}
private static int common1(int[] nums1, int[] nums2) {
int ans =0;
for(int i=0; i<nums1.length; i++){
for(int j=0; j<nums2.length; j++){
if(nums1[i] == nums2[j]){
ans++;
break;
}
}
}
return ans;
}
}