add a solution for 997

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/_997.java

@@ -25,6 +25,9 @@ public int findJudge(int n, int[][] trust) {
     public static class Solution2 {
         /**
          * Credit: https://leetcode.com/problems/find-the-town-judge/solution/ solution 2
+         * Also, note: is it possible to have more than one town judges?
+         * No! It's impossible! If it's possible, suppose there are two town judges, then both of them have to be trusted by everyone else which includes the other judge.
+         * Otherwise, we'ld have a town judge not trusted by everybody.
          */
         public int findJudge(int n, int[][] trust) {
             if (trust.length < n - 1) {