997. 找到小镇的法官

题目：

https://leetcode-cn.com/problems/find-the-town-judge/

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

public class _997_FindJudge {
    public int findJudge(int n, int[][] trust) {
        if (n == 1) {
            return 1;
        }
        List<Integer> peoples = new ArrayList<>();
        Map<Integer, List<Integer>> map = new HashMap<>();
        for (int i = 0; i < trust.length; i++) {
            int people = trust[i][0];
            int judge = trust[i][1];
            List<Integer> list = map.getOrDefault(judge, new ArrayList<>());
            list.add(people);
            map.put(judge, list);
            peoples.add(people);
        }
        for (Map.Entry<Integer, List<Integer>> entry : map.entrySet()) {
            if (entry.getValue().size() == n - 1 && !peoples.contains(entry.getKey())) {
                return entry.getKey();
            }
        }
        return -1;
    }
}