jiin / Letter Combinations of a Phone Number

[jiindev]

/**

• @param {string} digits

• @return {string[]}
  */
  const letterCombinations = (digits) => {
  let charNum = {
  '2':['a','b','c'],
  '3':['d','e','f'],
  '4':['g','h','i'],
  '5':['j','k','l'],
  '6':['m','n','o'],
  '7':['p','q','r','s'],
  '8':['t','u','v'],
  '9':['w','x','y','z']
  }
  let result = [];
  let digitsLength = digits.length;
  let firstNum = digits[0];
  let secondNum = digits[1];
  let plusLetter = [];

  let letters = '';
  // for(let i=0; i<digitsLength; i++){
  // letters += charNum[digits[0][0]];
  // letters += charNum[digits[1][0]];
  // letters += charNum[digits[2][0]];

// letters += charNum[digits[0][0]];
// letters += charNum[digits[1][1]];
// letters += charNum[digits[2][0]];

// letters += charNum[digits[0][0]];
// letters += charNum[digits[1][2]];
// letters += charNum[digits[2][0]];

// for(let j=0; j<charNum[i].length; j++){
// letters += charNum[i][j];
// }
// if(letters.length===3){
// result.push(letters);
// letters='';
// }
// }

charNum[firstNum].forEach((item, index)=>{
    letters = '';
    let firstLetter = item
    charNum[secondNum].forEach((item2, index2)=>{
        letters = (item+item2);
        result.push(letters);
    })
})
return result;

};

Letter Combinations of a Phone Number

케이스 한개는 통과했는데 나머지가 통과 안돼서 세이브 ㅠㅠ 내일 이어서 풀겄소

[jiindev]

휴이건..어칸담? 성장하고 다시 데리러가겠어