[java] 프로그래머스 - 전력망을 둘로 나누기

[문제링크 - 프로그래머스 - 전력망을 둘로 나누기] https://school.programmers.co.kr/learn/courses/30/lessons/86971

import java.util.*;

class Solution {
    public int solution(int n, int[][] wires) {
        int answer = n;
        ArrayList<ArrayList<Integer>> list = new ArrayList<ArrayList<Integer>>();

        for(int i=0; i<=n; i++){
            list.add(new ArrayList<Integer>());
        }

        for(int i=0; i<wires.length; i++){
            list.get(wires[i][0]).add(wires[i][1]);
            list.get(wires[i][1]).add(wires[i][0]);
        }

        for(int i=0; i<wires.length; i++){
            list.get(wires[i][0]).remove(Integer.valueOf(wires[i][1]));
            list.get(wires[i][1]).remove(Integer.valueOf(wires[i][0]));

            answer = Math.min(answer, bfs(wires[i][0], list, n));

            list.get(wires[i][0]).add(wires[i][1]);
            list.get(wires[i][1]).add(wires[i][0]);

        }
        return answer;
    }

    public int bfs(int start, ArrayList<ArrayList<Integer>> list, int n){
        boolean[] visit = new boolean[n+1];
        int cnt = 1;
        Queue<Integer> queue = new LinkedList<>();

        queue.offer(start);
        visit[start] = true;
        while(!queue.isEmpty()){
            int size = queue.size();
            for(int i=0; i<size; i++){
                int now = queue.poll();
                for(int j=0; j<list.get(now).size(); j++){
                    if(!visit[list.get(now).get(j)]) {
                        visit[list.get(now).get(j)] = true;
                        queue.offer(list.get(now).get(j));
                        cnt++;
                    }
                }
            }
        }
        return (int)Math.abs(cnt-(n-cnt));
    }
}