본문 바로가기
프로그래머스/1단계

(Python/LV1)카드뭉치

by windy7271 2023. 2. 18.
728x90
반응형

 

문제 출처: https://school.programmers.co.kr/learn/courses/30/lessons/159994?language=python3

풀이:


def solution(cards1, cards2, goal):

    for x in goal:
        print(x)
        if len(cards1)>0 and cards1[0] == x:
            cards1.pop(0)
        elif len(cards2) > 0 and cards2[0] == x:
            cards2.pop(0)
        else:
            return "x"
    return "yes"
print(solution(["i", "drink", "water"], ["want", "to"], ["i", "want", "to", "drink", "water"]))
# print(solution(  ["i", "water", "drink"], ["want", "to"], ["i", "want", "to", "drink", "water"]))
반응형

댓글