목록코딩테스트/프로그래머스 (64)
bdfgdfg
#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")..
#include #include #include using namespace std; int solution(vector scoville, int K) { int answer = 0; priority_queue pq; int len = scoville.size(),i; for(i = 0; i = K) return answer = -1; while(true) { int firstSco = pq.top(); pq.pop(); int secondSco = pq.top(); pq.pop(); if(firstSco >= K) break; else { int res = firs..