본문 바로가기
Beakjoon&프로그래머스/Java

[프로그래머스/Java] 카드 뭉치

by 현장 2025. 2. 26.

-Code

class Solution {
    public String solution(String[] cards1, String[] cards2, String[] goal) {
        int idx1 = 0, idx2 = 0;
        boolean flag = true;
        
        for (String el : goal) {
            if (idx1 < cards1.length && cards1[idx1].equals(el)) {
                idx1++;
            }
            else if (idx2 < cards2.length && cards2[idx2].equals(el)) {
                idx2++;
            }
            else {
                flag = false;
                break;
            }
        }
        
        return flag ? "Yes" : "No";
    }
}