[프로그래머스] Lv.2 영어 끝말잇기

 

[문제]

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

프로그래머스

 

 

[소스 코드]

import java.util.*;
class Solution {
    public int[] solution(int n, String[] words) {
        int[] answer = {0,0};
        int order = 1;
        int total = words.length;
        Set<String> hs = new HashSet<>();
        hs.add(words[0]);
        for(int i=1;i<words.length;i++){
            String w1 = words[i-1];
            String w2 = words[i];
            if(hs.contains(w2) || w1.charAt(w1.length() - 1)!=w2.charAt(0)){
                answer[0] = order % n + 1;
                answer[1] = order / n + 1;
                break;
            }
            hs.add(w2);
            order++;
        }

        return answer;
    }
}