지방에서 서울까지

def solution(cards1, cards2, goal): while True: if len(goal) == 0: return "Yes" if len(cards1) != 0: if cards1[0] == goal[0]: cards1.remove(cards1[0]) goal.remove(goal[0]) continue if len(cards2) != 0: if cards2[0] == goal[0]: cards2.remove(cards2[0]) goal.remove(goal[0]) continue return "No"

def solution(nums): answer = 0 lens = len(nums)/2 uq = set(nums) if lens >= len(uq): answer = len(uq) elif lens < len(uq): answer = lens return int(answer)

def solution(k, m, score): answer = 0 score = sorted(score, reverse = True) for i in range(0, len(score), m): tmp = score[i:i+m] if len(tmp) == m: answer += min(tmp) * m return answer

def solution(N, stages): answer = {} fail = len(stages) for i in range(1, N+1): cnt = 0 if stages.count(i) > 0: cnt += stages.count(i) answer[i] = cnt/fail fail-=cnt else: answer[i] = 0 return sorted(answer, key=lambda x : answer[x], reverse=True)

def solution(babbling): answer = 0 talk = ["aya", "ye", "woo", "ma"] for t in babbling: for c in talk: if c * 2 not in t: t = t.replace(c, ' ') if len(t.strip()) == 0: answer += 1 print(t) return answer

def solution(lottos, win_nums): answer = [] yes = 0 zero = 0 win = {0:6, 1:6, 2:5, 3:4, 4:3, 5:2, 6:1} for i in range(6): if lottos[i] in win_nums: yes += 1 elif lottos[i] == 0: zero += 1 answer.append(win[yes+zero]) answer.append(win[yes]) return answer