우주의WouldYou

#include <string>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;

string solution(vector<string> participant, vector<string> completion) {
    string answer = "";
    string name = "";
    int num = 0;
    int flag = 0;
    sort(participant.begin(), participant.end());
    sort(completion.begin(), completion.end());
    for(int i = 0;i < completion.size(); i++){
        name = participant[i];
        if(participant[i] != completion[i]){
            answer = participant[i];
            flag = 1;
            break;
        }
        
    }
    if (flag ==0)
        answer = participant[participant.size()-1];
    return answer;
}

이거 전에 풀 때는 진짜 큐?인가 그런거 써서 풀려다가 포기했었다. 너무 어렵게 생각하지 말자!

#include <string>
#include <vector>

using namespace std;

bool solution(vector<string> phone_book) {
    bool answer = true;
    int min = phone_book[0].length();
    int min_num=0;
    for(int i=1; i < phone_book.size(); i++){
        if(phone_book[i].length() < min){
            min_num = i;
            min= phone_book[i].length();
        }
    }
    string min_s = phone_book[min_num];
    string tmp;
    
    for(int i=0; i < phone_book.size(); i++){
        if(i == min_num)
            continue;
        int cnt = 0;
        answer = true;
        
        tmp = phone_book[i];
        for(int j = 0; j < min_s.length(); j++){
            if(tmp[j] != min_s[j])
                break;
            else{
                cnt++;
            }
        }
        if(cnt == min_s.length())
        {
            answer = false;
            break;
        }
        
    }
    return answer;
}