fork(1) download
  1. /* package whatever; // don't place package name! */
  2.  
  3. import java.util.*;
  4. import java.lang.*;
  5. import java.io.*;
  6.  
  7. class Ideone
  8. {
  9. private static int intersect(int[] a, int alen, int[] b) {
  10. int resLen = 0, bIndex = 0;
  11. for (int aIndex = 0; aIndex < alen; ++aIndex) {
  12. while (bIndex < b.length && a[aIndex] > b[bIndex]) ++bIndex;
  13. if (bIndex == b.length) break;
  14.  
  15. if (a[aIndex] == b[bIndex]) {
  16. a[resLen] = a[aIndex];
  17. ++resLen;
  18. ++bIndex;
  19. }
  20. }
  21. return resLen;
  22. }
  23.  
  24. private static int intersectArrays(int[][] arrays) {
  25. int len = arrays[0].length;
  26. for (int i = 1; i < arrays.length; ++i) {
  27. len = intersect(arrays[0], len, arrays[i]);
  28. }
  29. return len;
  30. }
  31.  
  32. public static void main (String[] args) throws java.lang.Exception
  33. {
  34. int[][] arr = {{1,2,3,3,4},{2,3,3,5},{1,2,3,3,5,6,7},{1,2,3,3,6,7,8,9}};
  35. int len = intersectArrays(arr);
  36. for (int i = 0; i < len; ++i)
  37. System.out.print(arr[0][i] + " ");
  38. }
  39. }
Success #stdin #stdout 0.06s 2841600KB
stdin
Standard input is empty
stdout
2 3 3