mirror of https://github.com/doocs/leetcode.git
20 lines
532 B
Java
20 lines
532 B
Java
class Solution {
|
|
public List<Integer> twoOutOfThree(int[] nums1, int[] nums2, int[] nums3) {
|
|
int[] s1 = get(nums1), s2 = get(nums2), s3 = get(nums3);
|
|
List<Integer> ans = new ArrayList<>();
|
|
for (int i = 1; i <= 100; ++i) {
|
|
if (s1[i] + s2[i] + s3[i] > 1) {
|
|
ans.add(i);
|
|
}
|
|
}
|
|
return ans;
|
|
}
|
|
|
|
private int[] get(int[] nums) {
|
|
int[] s = new int[101];
|
|
for (int num : nums) {
|
|
s[num] = 1;
|
|
}
|
|
return s;
|
|
}
|
|
} |