Open dlehdanakf opened 3 years ago
function solution(strs, t) { let answer = -1; const traverse = (s, i) => { if(s.length === 0) { answer = i; return; } if(answer !== -1 && i >= answer) { return; } const candidates = strs.filter(e => s.indexOf(e) === 0); for(const c of candidates) { traverse(s.substring(c.length), i + 1); } }; traverse(t, 0); return answer; }
단어퍼즐