[Programmers] 영어 끝말잇기 (JAVA, PYTHON)

https://school.programmers.co.kr/learn/courses/30/lessons/12981?language=python3

프로그래머스

Algorithm

Idea

return 값은 번호 = (i%n)+1, 차례 = (i//n)+1

끝말잇기의 비교는 words[i][0] != words[i-1][-1]

---

Python

def solution(n, words):
    for i in range(1,len(words)):
        if words[i][0] != words[i-1][-1] or words[i] in words[:i]:
            return [(i%n)+1,(i//n)+1]
    else:
            return [0,0]

Java

import java.util.HashSet;

class Solution {
    public int[] solution(int n, String[] words) {
        int[] answer = {0, 0};
        HashSet<String> wordSet = new HashSet<>();
        wordSet.add(words[0]);
        char lastChar = words[0].charAt(words[0].length() - 1);
        char currChar;
        
        for (int i = 1; i < words.length; i++) {
            currChar = words[i].charAt(0);
            
            if (lastChar != currChar || wordSet.contains(words[i])) {
                answer[0] = (i % n) + 1;
                answer[1] = (i / n) + 1;
                break;
            }
            wordSet.add(words[i]);
            lastChar = words[i].charAt(words[i].length() - 1);
        }
        return answer;
    }
}