JS排列組合算法

CHANGELOG

2019-07-01

• init

const permutation = (source) => {
  const result = [];
  const _result = {};
  const convert = (arr, index) => {
    for (let i = 0; i < source[arr[index]].length; i++) {
      if (source[arr[index]][i]) {
        _result[arr[index]] = source[arr[index]][i]
        if (index === arr.length - 1) {
          result.push(JSON.parse(JSON.stringify(_result)));
        } else {
          convert(arr, index + 1);
        }
      }
    }
  };
  convert(Object.keys(source), 0);
  return result;
};

// 測試
permutation({
  name: ['張三','李四','王二'],
  age: [18, 16],
  sex: ['男', '女']
});

測試結果以下