_1213.java

packagecom.fishercoder.solutions.secondthousand;

importjava.util.ArrayList;
importjava.util.List;

publicclass_1213 {
publicstaticclassSolution1 {
/*
 * credit: https://leetcode.com/problems/intersection-of-three-sorted-arrays/discuss/397603/Simple-Java-solution-beats-100
 */
publicList<Integer> arraysIntersection(int[] arr1, int[] arr2, int[] arr3) {
List<Integer> result = newArrayList();
inti = 0;
intj = 0;
intk = 0;
while (i < arr1.length && j < arr2.length && k < arr3.length) {
if (arr1[i] == arr2[j] && arr1[i] == arr3[k]) {
result.add(arr1[i]);
i++;
j++;
k++;
 } elseif (arr1[i] < arr2[j]) {
i++;
 } elseif (arr2[j] < arr3[k]) {
j++;
 } else {
k++;
 }
 }
returnresult;
 }
 }
}