refactor 517

Author: fishercoder1534

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

@@ -42,36 +42,26 @@ For each move, you could choose any m (1 ? m ? n) washing machines, and pass one
 
  */
 public class _517 {
-    /**Reference: https://discuss.leetcode.com/topic/79938/super-short-easy-java-o-n-solution*/
-    public int findMinMoves(int[] machines) {
-        int total = 0;
-        for (int i : machines) {
-            total += i;
-        }
-        if (total % machines.length != 0) {
-            return -1;
-        }
-        int avg = total / machines.length;
-        int cnt = 0;
-        int max = 0;
-        for (int load : machines) {
-            cnt += load - avg; //load-avg is "gain/lose"
-            max = Math.max(Math.max(max, Math.abs(cnt)), load - avg);
-        }
-        return max;
-    }
-
-    public static class Solution2 {
-        /**TODO: finish it.*/
+    public static class Solution1 {
+        /**
+         * Reference: https://discuss.leetcode.com/topic/79938/super-short-easy-java-o-n-solution
+         */
         public int findMinMoves(int[] machines) {
-            int totalDresses = 0;
-            for (int i = 0; i < machines.length; i++) {
-                totalDresses += machines[i];
+            int total = 0;
+            for (int i : machines) {
+                total += i;
             }
-            if (totalDresses / machines.length == 0 || totalDresses % machines.length != 0) {
+            if (total % machines.length != 0) {
                 return -1;
             }
-            return -1;
+            int avg = total / machines.length;
+            int cnt = 0;
+            int max = 0;
+            for (int load : machines) {
+                cnt += load - avg; //load-avg is "gain/lose"
+                max = Math.max(Math.max(max, Math.abs(cnt)), load - avg);
+            }
+            return max;
         }
     }
 }