Using my leet skillz I have created the ultimate:
PHP Code:
//Returns array containing sets of 3 numbers both arrays have ing common
function ex1(arr1, arr2) {
temp.result = {};
temp.pos = 0;
while (temp.pos < temp.arr1.size() - 2) { //Make sure there's 3 elements left
temp.check = {temp.arr1[temp.pos], temp.arr1[temp.pos + 1], temp.arr1[temp.pos + 2]};
if (temp.result.pos(temp.check) < 0 && searchArr(temp.arr2, temp.check)) {
temp.result.add(temp.check);
temp.pos += 3; //Set is found, jump over whole set
}
else {
temp.pos++; //Set not found, go to next number
}
}
return temp.result;
}
function ArrayComp(array1,array2) {
if (temp.array1.size > 2 || temp.array2.size > 2) {
temp.checkarray = temp.array2;
temp.checkarray.delete(temp.array2.size - 1);
temp.checkarray.delete(temp.array2.size - 2);
temp.failarray = new [0];
for (temp.i = 0; temp.i < temp.array1.size - 3; temp.i++) {
if (temp.failarray.index(temp.array1[temp.i]) == -1) {
temp.var = temp.checkarray.index(temp.array1[temp.i]);
if (temp.var == -1) {
temp.failarray.add(temp.array1[temp.i]);
}
else {
temp.dupecheck = temp.checkarray;
while (temp.var != -1) {
if (temp.array1[temp.i + 1] == temp.array2[temp.var + 1]) {
if (temp.array1[temp.i + 2] == temp.array2[temp.var + 2]) {
temp.returnvar++;
}
}
temp.dupecheck.replace(temp.var,"x");
temp.var = temp.dupecheck.index(temp.array1[temp.i]);
}
}
}
}
}
return temp.returnvar;
}
function ex1(a1, a2) {
temp.out = {};
temp.i = 0;
temp.sub = 0;
for (temp.i = 0; i < a.size() - 2; i++) {
if (!(a[i] in b)) continue;
for (temp.j = i + 1; j < a.size() - 1; j++) {
if (!(a[j] in b)) continue;
for (temp.k = j + 1; k < a.size(); k++) {
if (a[k] in b) list.add({a[i], a[j], a[k]});
function S3(arrA,arrB) {
temp.intersect.clear();
temp.sets.clear();
if (arrA.size() > arrB.size()) temp.c = {arrB,arrA};
else temp.c = {arrA,arrB};
function getSets()
{
return {{2,3,5}, {2,3,6}, {2,3,10}, {2,5,6}, {2,5,10}, {2,6,10}, {3,5,6}, {3,5,10}, {3,6,10}, {5,6,10}};
}
i SO did not copy paste bits from everyone else's scripts