@Test public void randomTest3Linear() { int N = 5; for (int i = 0; i < 1000; i++) { int m = i % 100; if (m == 99) N <<= 1; int[] input = Shuffler.getRandomArray(N, -m * m, m * m); assertEquals(Arrays.toString(input), threeLinear(input), Reduction.threeLinear(input)); } }
public static boolean threeLinear(int[] A) { int max = 0; for (int i : A) { max = Math.max(max, Math.abs(i)); } max = max + 1; int[] newA = new int[2 * A.length]; for (int i = 0; i < A.length; i++) newA[i] = 8 * max + A[i]; for (int i = A.length; i < newA.length; i++) newA[i] = -8 * (A[i - A.length] + 2 * max); return threeSumNotDistinct(newA); }
Reduction { public static boolean threeLinear(int[] A) { int max = 0; for (int i : A) { max = Math.max(max, Math.abs(i)); } max = max + 1; int[] newA = new int[2 * A.length]; for (int i = 0; i < A.length; i++) newA[i] = 8 * max + A[i]; for (int i = A.length; i < newA.length; i++) newA[i] = -8 * (A[i - A.length] + 2 * max); return threeSumNotDistinct(newA); } }
Reduction { public static boolean threeLinear(int[] A) { int max = 0; for (int i : A) { max = Math.max(max, Math.abs(i)); } max = max + 1; int[] newA = new int[2 * A.length]; for (int i = 0; i < A.length; i++) newA[i] = 8 * max + A[i]; for (int i = A.length; i < newA.length; i++) newA[i] = -8 * (A[i - A.length] + 2 * max); return threeSumNotDistinct(newA); }  }
Reduction { public static boolean threeLinear(int[] A) { int max = 0; for (int i : A) { max = Math.max(max, Math.abs(i)); } max = max + 1; int[] newA = new int[2 * A.length]; for (int i = 0; i < A.length; i++) newA[i] = 8 * max + A[i]; for (int i = A.length; i < newA.length; i++) newA[i] = -8 * (A[i - A.length] + 2 * max); return threeSumNotDistinct(newA); }  static boolean threeSum(int[] A); static boolean threeLinear(int[] A); }
Reduction { public static boolean threeLinear(int[] A) { int max = 0; for (int i : A) { max = Math.max(max, Math.abs(i)); } max = max + 1; int[] newA = new int[2 * A.length]; for (int i = 0; i < A.length; i++) newA[i] = 8 * max + A[i]; for (int i = A.length; i < newA.length; i++) newA[i] = -8 * (A[i - A.length] + 2 * max); return threeSumNotDistinct(newA); }  static boolean threeSum(int[] A); static boolean threeLinear(int[] A);  }