IntersectionOfThreeSortedArrays.java

Latest commit

History

61 lines (54 loc) * 1.65 KB

package Leetcode;

import java.util.ArrayList;

import java.util.List;

/**

* @author kalpak

* 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.

* Example 2:

* Input: arr1 = [197,418,523,876,1356], arr2 = [501,880,1593,1710,1870], arr3 = [521,682,1337,1395,1764]

* Output: []

* Constraints:

* 1 <= arr1.length, arr2.length, arr3.length <= 1000

* 1 <= arr1[i], arr2[i], arr3[i] <= 2000

public class IntersectionOfThreeSortedArrays {

public static List<Integer> arraysIntersection(int[] arr1, int[] arr2, int[] arr3) {

List<Integer> result = new ArrayList<>();

int p1 = 0;

int p2 = 0;

int p3 = 0;

while(p1 < arr1.length && p2 < arr2.length && p3 < arr3.length) {

if(arr1[p1] == arr2[p2] && arr2[p2] == arr3[p3]) {

result.add(arr1[p1]);

p1++;

p2++;

p3++;

} else {

if (arr1[p1] < arr2[p2])

p1++;

else if (arr2[p2] < arr3[p3])

p2++;

else

p3++;

}

return result;

}

public static void main(String[] args) {

int[] arr1 = new int[]{1,2,3,4,5};

int[] arr2 = new int[]{1,2,5,7,9};

int[] arr3 = new int[]{1,3,4,5,8};

System.out.println(arraysIntersection(arr1, arr2, arr3));

}

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

IntersectionOfThreeSortedArrays.java

Latest commit

History

IntersectionOfThreeSortedArrays.java

File metadata and controls

FilesExpand file tree

IntersectionOfThreeSortedArrays.java

Latest commit

History

IntersectionOfThreeSortedArrays.java

File metadata and controls