1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
| class Solution {
public int minNumber(int[] nums1, int[] nums2) {
Set<Integer> set = new HashSet<>();
for (int num : nums1) {
set.add(num);
}
Arrays.sort(nums2);
for (int num : nums2) {
if (set.contains(num)) {
return num;
}
}
Arrays.sort(nums1);
int min = Math.min(nums1[0], nums2[0]);
int max = Math.max(nums1[0], nums2[0]);
return min * 10 + max;
}
}
|
References
2605. Form Smallest Number From Two Digit Arrays