Try

출처 https://programmers.co.kr/learn/courses/30/lessons/1845 알고리즘 연습 - 폰켓몬 | 프로그래머스 실행 결과가 여기에 표시됩니다. programmers.co.kr 소스 #include #include using namespace std; int solution(vector nums) { int cnt = 1; int pick = nums.size() / 2; int answer = 0; sort(nums.begin(), nums.end()); for(int i= 0; i pick){ answer = pick; } else{ answer..

출처https://programmers.co.kr/learn/courses/30/lessons/49993?language=python3 소스1234567891011121314151617181920212223242526272829303132def solution(skill, skill_trees): answer = 0 flag = 1 cnt = 0 check = 0 trlen = 0 sklen = 0 trlen = len(skill_trees) for i in range (0, trlen): com = "" com = skill_trees[i] sklen = len(com) for j in range (0, sklen): nDelimiter = 0 nDelimiter = skill.find(com[j]) ..

출처https://programmers.co.kr/learn/courses/30/lessons/49993?language=cpp# 소스123456789101112131415161718192021222324252627282930313233343536#include #include using namespace std; int solution(string skill, vector skill_trees) { int answer = 0; int flag = 1; int cnt = 0; int check = 0; for(int i = 0; i

출처https://programmers.co.kr/learn/courses/30/lessons/12987?language=python3 소스12345678910111213141516171819def solution(A, B): answer = 0 A.sort() B.sort() length = len(A) res1 = 0 k = 0 for i in range (0, length): for j in range(k, length): if (A[i]

출처https://programmers.co.kr/learn/courses/30/lessons/12987 소스12345678910111213141516171819202122232425#include #include #include using namespace std; int solution(vector A, vector B) { int answer = 0; sort(A.begin(), A.end()); sort(B.begin(), B.end()); int res1 = 0; int k = 0; for(int i = 0; i