로또의 최고 순위와 최저 순위

count와 find 함수 사용

#include <string>
#include <vector>
#include <iostream>
#include <algorithm>

using namespace std;

vector<int> solution(vector<int> lottos, vector<int> win_nums) {
    vector<int> answer;
    int min=0;
    int max=0;
    for(int i=0;i<win_nums.size();i++){
        if(find(lottos.begin(),lottos.end(),win_nums[i])!=lottos.end()){
            min++;
            lottos[find(lottos.begin(),lottos.end(),win_nums[i])-lottos.begin()]=0;
        } 
    }
    max=count(lottos.begin(),lottos.end(),0);
    
    if(max>1)
        max=7-max;
    else
        max=6;
    if(min>1)
        min=7-min;
    else
        min=6;
    answer.push_back(max);
    answer.push_back(min);
    
    return answer;
}