Deep_Dev

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

 

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

์ฝ”๋“œ ์ค‘์‹ฌ์˜ ๊ฐœ๋ฐœ์ž ์ฑ„์šฉ. ์Šคํƒ ๊ธฐ๋ฐ˜์˜ ํฌ์ง€์…˜ ๋งค์นญ. ํ”„๋กœ๊ทธ๋ž˜๋จธ์Šค์˜ ๊ฐœ๋ฐœ์ž ๋งž์ถคํ˜• ํ”„๋กœํ•„์„ ๋“ฑ๋กํ•˜๊ณ , ๋‚˜์™€ ๊ธฐ์ˆ  ๊ถํ•ฉ์ด ์ž˜ ๋งž๋Š” ๊ธฐ์—…๋“ค์„ ๋งค์นญ ๋ฐ›์œผ์„ธ์š”.

programmers.co.kr

 

 

 


์‹ ๊ฒฝ์จ์•ผ ํ•  ๊ฒƒ 

1. 1๊ธ€์ž ๋‹จ์–ด๋Š” ์•ˆ๋œ๋‹ค.

2. ์ด๋ฏธ ๋‚˜์˜จ ๋‹จ์–ด๋ฉด ์•ˆ๋œ๋‹ค.

3. ๋๋ง์ด ์ด์–ด์ ธ์•ผํ•œ๋‹ค.

 

 

๋กœ์ง ์ˆœ์„œ

1. ์ด๋ฏธ ๋‚˜์˜จ ๋‹จ์–ด์ธ์ง€ ์•„๋‹Œ์ง€ ์ฒดํฌ, -> ๋‚˜์™”์œผ๋ฉด ํƒˆ๋ฝ์ด๋ฏ€๋กœ ์ˆœ์„œ์™€ ์ฐจ๋ก€ ์ฆ๊ฐ์‹œํ‚ค๊ณ  ์ข…๋ฃŒ

2. ์•ˆ๋‚˜์˜จ ๋‹จ์–ด๋ฉด ์ถ”๊ฐ€ํ•˜๊ธฐ

3. ๋‹จ์–ด๋ฅผ ์ถ”๊ฐ€ํ–ˆ๋Š”๋ฐ, ๋‹จ์–ด๊ฐ€ ์ด์–ด์ง€์ง€ ์•Š์œผ๋ฉด ํƒˆ๋ฝ์ด๋ฏ€๋กœ ์ˆœ์„œ์™€ ์ฐจ๋ก€ ์ฆ๊ฐ์‹œํ‚ค๊ณ  ์ข…๋ฃŒ

 

 

import java.util.*;
class Solution {
    public int[] solution(int n, String[] words) {
        int[] answer = {0,0};

        ArrayList<String> list = new ArrayList<>();

        for(int i=0; i<words.length; i++){

            if(list.contains(words[i])){
                answer[0] = (i%n) + 1;
                answer[1] = (i/n) + 1;
                break;
            }

            list.add(words[i]);

            if( i>0 && words[i].charAt(0) != words[i-1].charAt(words[i-1].length()-1)){
                answer[0] = (i%n) + 1;
                answer[1] = (i/n) +1;
                break;
            }
        }
        return answer;
    }
}