0997 Find the Town Judge

Question

My Solution:

class Solution {
    public int findJudge(int n, int[][] trust) {
        int[] Trusted = new int[n+1];
        for(int[] p: trust){
            Trusted[p[0]]--;
            Trusted[p[1]]++;
        }
        
        for(int i = 1; i < Trusted.length; i++){
            if(Trusted[i] == n-1){
                return i;
            }
        }
        
        return -1;
    }
}