programmers_영어 끝말잇기_java

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};
        
        Set<String> set = new HashSet<String>();
        
        int wordsSize = words.length;
        int num = 0;
        int turn = 1;
       
        for(int i = 0; i<wordsSize; i++){
            if(set.contains(words[i])){
                answer[0] = num%n +1;
                answer[1] = turn;
                return answer;
            }
            if(i > 0){
                if(words[i-1].charAt(words[i-1].length() -1) != words[i].charAt(0)){
                    answer[0] = num%n +1;
                    answer[1] = turn;
                    return answer;
                }
            }
            set.add(words[i]); 
            num++;
            if(num%n == 0) turn++;
        }
        
    
        return answer;
    }
}