refactor 277

fishercoder1534 · fishercoder1534 · commit 7ee0e55a2f78 · 2018-11-21T07:57:37.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_277.java b/src/main/java/com/fishercoder/solutions/_277.java
@@ -1,30 +1,38 @@
 package com.fishercoder.solutions;
 
 /**
- * Suppose you are at a party with n people (labeled from 0 to n - 1) and among them, there may exist one celebrity. The definition of a celebrity is that all the other n - 1 people know him/her but he/she does not know any of them.
- Now you want to find out who the celebrity is or verify that there is not one. The only thing you are allowed to do is to ask questions like: "Hi, A. Do you know B?" to get information of whether A knows B. You need to find out the celebrity (or verify there is not one) by asking as few questions as possible (in the asymptotic sense).
- You are given a helper function bool knows(a, b) which tells you whether A knows B. Implement a function int findCelebrity(n), your function should minimize the number of calls to knows.
- Note: There will be exactly one celebrity if he/she is in the party. Return the celebrity's label if there is a celebrity in the party. If there is no celebrity, return -1.
+ * 277. Find the Celebrity
+ *
+ * Suppose you are at a party with n people (labeled from 0 to n - 1) and among them, there may exist one celebrity.
+ * The definition of a celebrity is that all the other n - 1 people know him/her but he/she does not know any of them.
+ * Now you want to find out who the celebrity is or verify that there is not one.
+ * The only thing you are allowed to do is to ask questions like: "Hi, A. Do you know B?" to get information of whether A knows B.
+ * You need to find out the celebrity (or verify there is not one) by asking as few questions as possible (in the asymptotic sense).
+ * You are given a helper function bool knows(a, b) which tells you whether A knows B. Implement a function int findCelebrity(n), your function should minimize the number of calls to knows.
+ *
+ * Note: There will be exactly one celebrity if he/she is in the party. Return the celebrity's label if there is a celebrity in the party. If there is no celebrity, return -1.
  */
 public class _277 {
 
-    public int findCelebrity(int n) {
-        int candidate = 0;
-        for (int i = 1; i < n; i++) {
-            if (knows(candidate, i)) {
-                candidate = i;
+    public static class Solution1 {
+        public int findCelebrity(int n) {
+            int candidate = 0;
+            for (int i = 1; i < n; i++) {
+                if (knows(candidate, i)) {
+                    candidate = i;
+                }
             }
-        }
-        for (int i = 0; i < n; i++) {
-            if (i != candidate && (knows(candidate, i) || !knows(i, candidate))) {
-                return -1;
+            for (int i = 0; i < n; i++) {
+                if (i != candidate && (knows(candidate, i) || !knows(i, candidate))) {
+                    return -1;
+                }
             }
+            return candidate;
         }
-        return candidate;
-    }
 
-    //this is a mock-up method to make IDE happy.s
-    private boolean knows(int i, int candidate) {
-        return false;
+        //this is a mock-up method to make IDE happy.s
+        private boolean knows(int i, int candidate) {
+            return false;
+        }
     }
 }
