京东2018-9-9 完全多部图

京东2018-9-9 完全多部图
过时交卷后出来的代码，没有测试ac，只是通过了测试用例。大概复杂度会超吧

public static void main(String[] args) {
    Scanner in = new Scanner(System.in); int group = in.nextInt(); boolean[] result = new boolean[group]; for (int i = 0; i int n = in.nextInt(); int m = in.nextInt(); int[][] arr = new int[m][2]; for (int j = 0; j < m; j++) {
            arr[j][0] = in.nextInt();
            arr[j][1] = in.nextInt();
        }
        result[i] = check(n, m, arr);
    } for (int i = 0; i < group; i++) {
        System.out.println(result[i]);
    }
} public static boolean check(int n, int m, int[][] arr) {
    List> list = new ArrayList();
    String[] edge = new String[n]; for (int i = 1; i <= n; i++) {
        edge[i - 1] = String.valueOf(i);
        edge[i - 1] += ","; for (int j = 0; j if (arr[j][0] == i) {
                edge[i - 1] += arr[j][1];
                edge[i - 1] += ",";
            } if (arr[j][1] == i) {
                edge[i - 1] += arr[j][0];
                edge[i - 1] += ",";
            }
        }
    } for (int i = 1; i <= n; i++) {
        List list_group = new ArrayList();
        list_group.add(i); for (int j = 1; j if (!edge[i - 1].contains(String.valueOf(j))) {
                list_group.add(j);
            }
        } if (list_group.size() == 1) { continue;
        } for (int j = 1; j for (int q = j + 1; q if (edge[list_group.get(j) - 1].contains(String.valueOf(list_group.get(q)))) { return false;
                }
            }
        }
    } return true;
}