题解 | #找到满足条件的牛群组合#

/**
 * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
 *
 *
 * @param nums int整型一维数组
 * @param target int整型
 * @return int整型二维数组
 */
function findThreeCows(nums, target) {
    let res = [];

    // write code here
    for (let i = 0; i < nums.length; i++) {
        let temp = [nums[i]];
        for (let j = 0; j < nums.length; j++) {
            if (i === j) {
                continue;
            }
            temp.push(nums[j]);

            for (let k = 0; k < nums.length; k++) {
                if (i === k || j === k) {
                    continue;
                }

                temp.push(nums[k]);
                console.log("temp", temp);

                if (temp[0] <= temp[1] && temp[1] <= temp[2]) {
                    if (temp.reduce((a, b) => a + b) === target) {
                        res.push([...temp]);
                    }
                }

                temp.pop();
            }

            temp.pop();
        }
        temp.pop();
    }

    let arr = [...new Set(res.map((item) => item.join(" ")))]
        .map((item) => item.split(" "))
        .sort((a, b) => sortFun(a, b));

    return arr;
}


function sortFun(a, b) {
    if (a[0] < b[0]) {
        return a[0] - b[0]
    } else if (a[0] === b[0]) {
        return a[1] - b[1]
    } else if (a[1] === b[1]) {
        return a[2] - b[2]
    }
}

module.exports = {
    findThreeCows: findThreeCows,
};