1
#include <algorithm>
2
#include <vector>
3
#include <iostream>
4
vector<int> target;
5
int i = 0;
6

7
auto res = find(target.begind(), target.end(), i);
8
if (res != target.end()) cout << "find" << endl;

1
// 복사
2
dest.assign(source.begin(), source.end());
3

4
// 삭제
5
dest.erase(idx);

1
#include <string>
2
#include <vector>
3
#include <algorithm>
4
#include <iostream>
5
using namespace std;
6

7
int get_rank(int correct) {
8
    int rank;
9
    if (correct >= 2) {
10
        rank = 7 - correct;
11
    }
12
    else {
13
        rank = 6;
14
    }
15

16
    return rank;
17
}
18

19
void print_vector(vector<int> target) {
20
    for (auto i: target) {
21
        cout << i << ' ';
22
    }
23
    cout << endl;
24
}
25
vector<int> solution(vector<int> lottos, vector<int> win_nums) {
26
    vector<int> answer;
27

28
    // worst: lottos와 win_nums를 비교
29
    // best: worst + 0의 개수
30

31
    int zero_cnt = 0, cnt = 0;
32

33
    for (auto& i: lottos) {
34
        // count zero
35
        if (i == 0) {
36
            zero_cnt++;
37
            continue;
38
        }
39

40
        // check
41
        auto res = find(win_nums.begin(), win_nums.end(), i);
42
        if (res != win_nums.end()) {
43
            cnt++;
44
        }
45
    }
46

47
    int best = get_rank(cnt + zero_cnt), worst = get_rank(cnt);
48
    answer.push_back(best);
49
    answer.push_back(worst);
50
    return answer;
51
}