목록코딩테스트/프로그래머스 (64)
bdfgdfg
#include #include #include using namespace std; int res; void DFS(vector& numbers, int target, int sum, int count, int idx) { if (sum == target && count == numbers.size()) { ++res; return; } if (idx >= numbers.size()) return; DFS(numbers, target, sum + numbers[idx], count + 1,idx + 1); DFS(numbers, target, sum - numbers[idx], count + 1,idx + 1); } int solution(vector numbers, int target) { strin..
#include #include using namespace std; vector solution(vector prices) { vector answer; bool exit; int count,Len = prices.size(),i,j; for(i = 0; i prices[j]) break; else ++count; } if(j == Len) // 마지막 주가. 비교대상이 없으므로 0 { answer.push_back(0); break; } answer.push_back(count); } return answer; }
#include #include using namespace std; int solution(int n) { int answer = 0; int nCount = 0,nextNumCount = 0; int temp = n,nextNum = n; while(temp > 0) { if(temp % 2 == 1) ++nCount; temp /= 2; } int i = 0; while(true) { if(nCount == nextNumCount) { answer = nextNum; break; } else nextNumCount = 0; nextNum++; temp = nextNum; while(temp > 0) { if(temp % 2 == 1) ++nextNumCount; temp /= 2; } ++i; } ..
#include #include #include using namespace std; int solution(vector land) { int answer = 0; int yLen = land.size(),y,x; for(y = 1; y < yLen; ++y) { land[y][0] += max({land[y - 1][1],land[y - 1][2],land[y - 1][3]}); land[y][1] += max({land[y - 1][0],land[y - 1][2],land[y - 1][3]}); land[y][2] += max({land[y - 1][0],land[y - 1][1],land[y - 1][3]}); land[y][3] += max({land[y - 1][0],land[y - 1][1],..