프로그래머스
(프로그래머스 Lv2) 영어 끝말잇기
풀이 : const solution = (n, words) => { let word = []; let answer = []; for (let i = 1; i < words.length; i++) { if (words[i].slice(0, 1) !== words[i - 1]?.slice(-1) || word.includes(words[i])) { answer.push( words.lastIndexOf(words[i]) % n + 1, Math.floor(words.lastIndexOf(words[i]) / n + 1) ); break; } word.push(words[i - 1]); } return answer.length == 0 ? [0, 0] : answer; }; 우선 word와 answer의 배열..
