목록전체 글 (253)
bdfgdfg
#include #include #include using namespace std; vector solution(vector lottos, vector win_nums) { vector answer; answer.reserve(2); int high = 0, low = 0, cor = 0, cnt = 0; //sort(lottos.begin(), lottos.end()); //sort(win_nums.begin(), win_nums.end()); for (int i = 0; i < 6; ++i) { if (lottos[i] == 0) ++cnt; for (int j = 0; j < 6; ++j) { if (lottos[i] == win_nums[j]) ++cor; } } low = cor; high =..
#include #include using namespace std; int arr[200001]; int solution(vector nums) { int answer = 0; int len = nums.size(); for(int i = 0; i (len / 2)) return answer = (len / 2); return answer; } set을 이용하여 (이진탐색트리 - 중복키 허용x) 푸는 방법도 괜찮을듯 하다. #include #include using namespace std; int solution(vector nums) { int..
#include #include #include using namespace std; int solution(vector numbers) { int answer = 0,len = numbers.size(); int arr[10] = {0,}; for(int i = 0; i < len; ++i) { arr[numbers[i]] = 1; } for(int i = 0; i < 10; ++i) { if(arr[i] == 0) answer += i; } return answer; }
#include #include #include #include using namespace std; bool compare(string& left, string& right) { string ret = left + right; string ret2 = right + left; return atoi(ret.c_str()) > atoi(ret2.c_str()); } string solution(vector numbers) { string answer = ""; vector cmpNum; for (auto num : numbers) cmpNum.push_back(to_string(num)); sort(cmpNum.begin(), cmpNum.end(), compare); if(cmpNum[0] == "0")..