프로그래머스 - 체육복

import java.util.Arrays;

class Solution {
    public int solution(int n, int[] lost, int[] reserve) {
        int answer = 0;
        int[] member = new int[n];
        Arrays.fill(member, 1);
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < lost.length; j++) {
                if (lost[j] == (i + 1)) member[i]--;
            }
        }
        Arrays.sort(reserve);
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < reserve.length; j++) {
                if (reserve[j] == (i + 1)) member[i]++;
            }
        }
        for (int i = 0; i < n; i++) {
            if (member[i] == 0)
                if (i > 0 && member[(i - 1)] == 2) {
                member[i] = 1;
                member[(i - 1)] = 1;
            } else if (i < n-1 && member[(i + 1)] == 2) {
                    member[i] = 1;
                    member[(i + 1)] = 1;
                }
        }


        for (int i = 0; i < n; i++) {
            if (member[i] != 0) answer++;
        }
        return answer;
    }
}

예외처리가 중요한 문제!