小镇法官问题

import java.util.HashSet;
import java.util.Iterator;
import java.util.Set;

/**
 * @author shkstart
 * @create 2021-12-07-10:00
 */
public class Test1207 {
    public static void main(String[] args) {
        int m = -1;
        int n = 4;
        int[][] townPeople1 = new int[][]{{1,3},{1,4},{2,3},{2,4},{4,3}};
        Set hs = new HashSet();
        for(int i = 0;i < townPeople1.length;i++){
            hs.add(townPeople1[i][0]);
        }
        Set<Integer> hs1 = new HashSet();
        Set<Integer> hs2 = new HashSet();
        for(int i = 1;i <= n;i++){
            hs1.add(i);
        }
        hs1.removeAll(hs);
        Iterator it = hs.iterator();
        Iterator it1 = hs1.iterator();
        if(it1.hasNext()){
            m = (Integer)it1.next();
        }
        for(int i = 0;i < townPeople1.length;i++){
            if(m == townPeople1[i][1]){
                hs2.add(townPeople1[i][1]);
            }
        }
        if(hs1.equals(hs2)){
            System.out.println(m);
        }
        else if(hs1.isEmpty()) {
            System.out.println("-1");
        }
        else System.out.println("-1");


    }
}