[프로그래머스]level.2 - 영어 끝말잇기(C++)

문제

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

프로그래머스

 

코드

#include <string>
#include <vector>
#include <iostream>
#include <set>

using namespace std;

vector<int> solution(int n, vector<string> words) {
    vector<int> answer = {0, 0};
    set<string> words_set;
    
    words_set.insert(words[0]);
    
    for(int i = 1; i < words.size(); ++i)
    {
        char c = *(words[i-1].end()-1);       
        
        if(words_set.find(words[i]) == words_set.end())
        {
            words_set.insert(words[i]);
            
            if(c == words[i][0])
                continue;
        }
        
        answer[0] = (i % n) + 1;
        answer[1] = (i / n) + 1;
        
        break;
    }
    
    return answer;
}