๋ณธ๋ฌธ ๋ฐ”๋กœ๊ฐ€๊ธฐ

๐Ÿ“ ์•Œ๊ณ ๋ฆฌ์ฆ˜/Programmers

[Javascript/PGS] Lv.2 : ์˜์–ด ๋๋ง์ž‡๊ธฐ

728x90
๋ฐ˜์‘ํ˜•

 

https://school.programmers.co.kr/learn/courses/30/lessons/12981#

 

ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค

SW๊ฐœ๋ฐœ์ž๋ฅผ ์œ„ํ•œ ํ‰๊ฐ€, ๊ต์œก, ์ฑ„์šฉ๊นŒ์ง€ Total Solution์„ ์ œ๊ณตํ•˜๋Š” ๊ฐœ๋ฐœ์ž ์„ฑ์žฅ์„ ์œ„ํ•œ ๋ฒ ์ด์Šค์บ ํ”„

programmers.co.kr


ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค ๋ ˆ๋ฒจ2.

๋‚˜๋ˆ—์…ˆ, ๋‚˜๋จธ์ง€ ์—ฐ์‚ฐ์„ ์ž˜ ๊ณ ๋ คํ•ด์„œ ์ ์ ˆํ•œ ์‹์„ ์„ค๊ณ„ํ•ด์•ผ ํ•œ๋‹ค!

 

 

 

๋‚˜์˜ ํ’€์ด

function solution(n, words) {
    var answer = [];
    let wordset = new Set();
    let wordsize = 0;
    
    wordset.add(words[0]);
    let lastword = words[0][words[0].length-1];
    for(let i=1; i<words.length; ++i){
        wordsize = wordset.size;
        wordset.add(words[i]);
        if(lastword!==words[i][0] || wordset.size === wordsize){
            answer.push(i%n+1);
            answer.push(Math.ceil((i+1)/n));
            break;
        }
        lastword = words[i][words[i].length-1];
    }
    if(answer.length===0) return [0,0];
    return answer;
}

 

728x90
๋ฐ˜์‘ํ˜•