목록코딩테스트/프로그래머스 (64)
bdfgdfg
#include #include #include using namespace std; int solution(string dartResult) { int answer = 0; int len = dartResult.size(); vector ret; ret.reserve(len); int retIndex = -1; for (int i = 0; i = '0' && dartResult[i]
#include #include using namespace std; int solution(vector sizes) { int maxX = - 987654321,maxY = -987654321; int len = sizes.size(); for(int i = 0; i sizes[i][1]) { int temp = sizes[i][0]; sizes[i][0] = sizes[i][1]; sizes[i][1] = temp; } } for(int i = 0; i < len; ++i) { if(maxX < sizes[i][0]) maxX = sizes[i][0]; if(maxY < sizes[i][1]) maxY = sizes[i][1]; } return ..
#include #include #include using namespace std; int solution(vector board, vector moves) { int answer = 0; stack s; //N*N크기 int boardSize = board.size(); int len = moves.size(); int firstIndex, i, j; for (i = 0; i < len; ++i) // 이건 맞음. { int x = moves[i] - 1; // x값은 고정 y값만 이동 for (j = 0; j < boardSize; ++j) { if (board[j][x] != 0) { if (!s.empty()) { if (s.top() == board[j][x]) { s.pop(); answer..
#include #include using namespace std; bool IsPrime(int num) { for(int prime = 2; prime < num; ++prime) { if(num % prime == 0) return false; } return true; } int solution(vector nums) { int answer = 0; int len = nums.size(); // 2 3 5 7 int i,j,k,num; for(i = 0; i < len; ++i) { for(j = i + 1; j < len; ++j) { for(k = j + 1; k < len; ++k) { if(IsPrime(num = nums[i] + nums[j] + nums[k])) ++answer; }..