[프로그래머스] 카드 뭉치(java)

문제

https://school.programmers.co.kr/learn/courses/30/lessons/159994

프로그래머스

---

나의 풀이

class Solution {
    public String solution(String[] cards1, String[] cards2, String[] goal) {
        String answer = "Yes";
        int idx1 = 0;
        int idx2 = 0;
        for (int i = 0; i < goal.length; i++) {
            if (idx1 < cards1.length && cards1[idx1].equals(goal[i])) {
                idx1++;
                continue;
            }
            if (idx2 < cards2.length && cards2[idx2].equals(goal[i])) {
                idx2++;
                continue;
            }
            answer = "No";
            break;
        }
        return answer;
    }
}

O(n), 선형