In javascript code i would all possible combinations of element that their sum give the number that i want: example:
array = [2, 1, 2, 1];
number = 3;
finalArray = [[2, 1], [2, 1], [1, 2], [2, 1]]
or
array = [5, 5, 4, 4, 2]
number = 10
finalArray = [[5, 5], [4, 4, 2]]
This is my code but i had only first combination! I don't know why when i return recursive function, return also main function and it doesn't continue with another combination. Can you help me, please? I follow this Finding all possible combinations of numbers to reach a given sum
$(document).ready(function() {
var numero = 3;
var array = [2, 1, 2, 1];
var tmpArray = [];
var finalArray = [];
$("#button").click(function() {
combinationTableCard(array, numero, tmpArray);
console.log(finalArray);
})
function combinationTableCard(cardArray, number, partialArray) {
var n;
var s = sumArray(partialArray);
if (s == number) {
finalArray.push(partialArray);
}
if (s >= number) {
return;
}
for (i=0; i<cardArray.length; i++) {
n = cardArray[i];
var remaining = copyArray(cardArray, i+1, cardArray.length-1);
partialArray.push(n);
combinationTableCard(remaining, number, partialArray);
}
}
function sumArray(v) {
var total = 0;
if (v.length == 0) {
return total;
} else {
for (i=0; i<v.length; i++) {
total += v[i];
}
return total;
}
}
function copyArray(v, i, j) {
var newV = new Array();
var k = 0;
for(i; i <= j; i++) {
newV[k] = v[i];
k++;
}
return newV;
}
})