Leetcod刷题——Graph (997,1042)

997. Find the Town Judge

只要判断有一个人获得其他所有人的信任（times），且自己没有信任任何人（Judge[]）即可

class Solution {
    public int findJudge(int N, int[][] trust) {
        boolean[] Judge  = new boolean[1010];
        int[] times = new int[1010];
        for(int i=0; i<Judge.length; i++){
            Judge[i] = true;
            times[i] = 0;
        }
        
        for(int i=0; i<trust.length; i++){
            Judge[trust[i][0]] = false;
            times[trust[i][1]]++;
        }
        
        for(int i=1; i<=N; i++){
            if(Judge[i] == true && times[i] == N-1){
                return i;
            }
        }
        
        return -1;
    }
}

1042. Flower Planting With No Adjacent

贪心求解：每搜索到一个点，检索周围所有的点，判断周围用了哪些颜色，将未用过的颜色赋值给该点，依次遍历。
（根据四色定理可得，四种颜色一定可以满足要求，所以在寻找可用颜色时，一定能够找到）

class Solution {
    public int[] gardenNoAdj(int N, int[][] paths) {
        int[] answer = new int[N];
        Arrays.fill(answer, 0);
        
        List<Integer>[] list = new List[N+1];
        for(int i=0; i<=N; i++){
            list[i] = new LinkedList<Integer>();
        }
        
        for(int i=0; i<paths.length; i++){
            list[paths[i][0]].add(paths[i][1]);
            list[paths[i][1]].add(paths[i][0]);
        }
        
        
        for(int i=0; i<N; i++){
            boolean[] used = new boolean[4];
            Arrays.fill(used, false);
            //check all the node connected to (i+1) node
            for(int road : list[i+1]){
                if(answer[road - 1]!=0){
                    used[answer[road -1 ] - 1] = true;
                }
            }
            //choose one not used
            for(int j=0; j<4; j++){
                if(!used[j]){
                    answer[i] = j + 1;
                    break;
                }
            }
        }
        
        return answer;
    }
}