
정렬

문자열로 이루어진 배열 cards1, cards2와 원하는 단어 배열 goal이 매개변수로 주어질 때, cards1과 cards2에 적힌 단어들로 goal를 만들 있다면 "Yes"를, 만들 수 없다면 "No"를 return하는 solution 함수를 완성해주세요.
def solution(cards1, cards2, goal):
idx1=0
idx2=0
for word in goal:
if word == cards1[idx1]:
idx1 += 1
elif word == cards2[idx2]:
idx2 += 1
else:
return "No"
return "Yes"
def solution(cards1, cards2, goal):
idx1=0
idx2=0
for word in goal:
if idx1 < len(cards1) and word == cards1[idx1]:
idx1 += 1
elif idx2 < len(cards2) and word == cards2[idx2]:
idx2 += 1
else:
return "No"
return "Yes"
def solution(cards1, cards2, goal):
answer = 'No'
cards1_subset = []
cards2_subset = []
for w in goal:
if w in cards1:
cards1_subset.append(w)
elif w in cards2:
cards2_subset.append(w)
if cards1_subset == cards1[:len(cards1_subset)] and cards2_subset == cards2[:len(cards2_subset)]:
answer = 'Yes'
return answer