1213. Intersection of Three Sorted Arrays

https://leetcode.com/problems/intersection-of-three-sorted-arrays/

https://github.com/openset/leetcode/tree/master/problems/intersection-of-three-sorted-arrays

Given three integer arrays arr1, arr2 and arr3 sorted in strictly increasing order, return a sorted array of only the integers that appeared in all three arrays.

 

Example 1:

Input: arr1 = [1,2,3,4,5], arr2 = [1,2,5,7,9], arr3 = [1,3,4,5,8]
Output: [1,5]
Explanation: Only 1 and 5 appeared in the three arrays.

 

Constraints:

• 1 <= arr1.length, arr2.length, arr3.length <= 1000
• 1 <= arr1[i], arr2[i], arr3[i] <= 2000

	class Solution {
	public List<Integer> arraysIntersection(int[] arr1, int[] arr2, int[] arr3) {
	List<Integer> ans = new ArrayList<Integer>();
	if (arr1 == null || arr2 == null || arr3 == null) {
	return ans;
	}
	int i = 0, j = 0, k = 0;
	while (i < arr1.length && j < arr2.length && k < arr3.length) {
	if (arr1[i] == arr2[j] && arr2[j] == arr3[k]) {
	ans.add(arr1[i]);
	i++;
	j++;
	k++;
	} else if (arr1[i] < arr2[j]) {
	i++;
	} else if (arr2[j] < arr3[k]) {
	j++;
	} else {
	k++;
	}
	}
	return ans;
	}
	}

view raw 1213.IntersectionOfThreeSortedArrays.java hosted with ❤ by GitHub