@Test public void testIntersection() { int[] a = { -2, -1, 5, 7, 11 }; int[] b = { 0, 1, 5, 7, 13 }; Assert.assertArrayEquals(new Integer[] { 5, 7 }, intersection(a, b)); }
public static Integer[] intersection(final int[] a, final int[] b) { Integer[] intersection = null; if (a.length < b.length) { intersection = findIntersection(a, b); } else { intersection = findIntersection(b, a); } return intersection; }
PracticeQuestionsCh13 { public static Integer[] intersection(final int[] a, final int[] b) { Integer[] intersection = null; if (a.length < b.length) { intersection = findIntersection(a, b); } else { intersection = findIntersection(b, a); } return intersection; } }
PracticeQuestionsCh13 { public static Integer[] intersection(final int[] a, final int[] b) { Integer[] intersection = null; if (a.length < b.length) { intersection = findIntersection(a, b); } else { intersection = findIntersection(b, a); } return intersection; }  }
PracticeQuestionsCh13 { public static Integer[] intersection(final int[] a, final int[] b) { Integer[] intersection = null; if (a.length < b.length) { intersection = findIntersection(a, b); } else { intersection = findIntersection(b, a); } return intersection; }  static Integer[] intersection(final int[] a, final int[] b); }
PracticeQuestionsCh13 { public static Integer[] intersection(final int[] a, final int[] b) { Integer[] intersection = null; if (a.length < b.length) { intersection = findIntersection(a, b); } else { intersection = findIntersection(b, a); } return intersection; }  static Integer[] intersection(final int[] a, final int[] b); static final Logger LOGGER; }