const assert = require('assert');

/**
 * 9宮格數字序列對應的字母組合
 * @param digits
 */
function letterCombinations(digits) {
  const letterMap = {
    0: ' ',
    1: '',
    2: 'abc',
    3: 'def',
    4: 'ghi',
    5: 'jkl',
    6: 'mno',
    7: 'pqrs',
    8: 'tuv',
    9: 'wxys'
  };

  const resCombs = [];

  /**
   *
   *  尋找和 digits[index]匹配的字母，獲得digits[0...index]翻譯得到的解
   * @param digits
   * @param index
   * @param s 儲存了此時從 digits[0...index-1] 翻譯得到的一個字母字串
   */
 

  function findCombination(digits, index, s) {
    if (index === digits.length) {
      resCombs.push(s);
      return;
    }

    const char = digits[index];
    assert(char >= '0' && char <= '9' && char !== '1');
    const letters = letterMap[char];
    for (let i = 0; i < letters.
 
length; i++) {
      findCombination(digits, index + 1, s + letters[i]);
    }

    return;
  }


  // 計算邏輯
  if (digits === '') return resCombs;

  findCombination(digits, 0, '');

  return resCombs;
}

console.log(letterCombinations('045'));