[C++] 로또의 최고 순위와 최저 순위

 

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

프로그래머스

 

 

입출력 예

[44, 1, 0, 0, 31, 25]	[31, 10, 45, 1, 6, 19]	[3, 5]
[0, 0, 0, 0, 0, 0]	[38, 19, 20, 40, 15, 25]	[1, 6]
[45, 4, 35, 20, 3, 9]	[20, 9, 3, 45, 4, 35]	[1, 1]

 

 

풀이

#include <string>
#include <vector>

using namespace std;

vector<int> solution(vector<int> lottos, vector<int> win_nums) {
    vector<int> answer;
    int rank[7] = {6,6,5,4,3,2,1};
    int zeroCount = 0, correctCount = 0;
    
    
    for(int i = 0; i < lottos.size(); i++){
        if(lottos[i] == 0) zeroCount++;
        else{
            for(int j = 0; j < win_nums.size(); j++){
                if(lottos[i] == win_nums[j]) correctCount++;
            }
        }
    }
    answer.push_back(rank[zeroCount + correctCount]);
    answer.push_back(rank[correctCount]);
    return answer;
}