refactor 465

fishercoder1534 · fishercoder1534 · commit d93d92c36267 · 2019-04-25T07:30:12.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_465.java b/src/main/java/com/fishercoder/solutions/_465.java
@@ -1,6 +1,5 @@
 package com.fishercoder.solutions;
 
-
 import java.util.ArrayList;
 import java.util.Collections;
 import java.util.HashMap;
@@ -54,60 +53,64 @@ A transaction will be given as a tuple (x, y, z). Note that x ? y and z > 0.
  Therefore, person #1 only need to give person #0 $4, and all debt is settled.
  */
 public class _465 {
-    /**Reference: https://discuss.leetcode.com/topic/68948/easy-java-solution-with-explanation*/
-    public int minTransfers(int[][] transactions) {
-        if (transactions == null || transactions.length == 0) {
-            return 0;
-        }
-        Map<Integer, Integer> acc = new HashMap<>();
-        for (int i = 0; i < transactions.length; i++) {
-            int id1 = transactions[i][0];
-            int id2 = transactions[i][1];
-            int m = transactions[i][2];
-            acc.put(id1, acc.getOrDefault(id1, 0) - m);
-            acc.put(id2, acc.getOrDefault(id2, 0) + m);
-        }
-        List<Integer> negs = new ArrayList<>();
-        List<Integer> poss = new ArrayList<>();
-        for (Integer key : acc.keySet()) {
-            int m = acc.get(key);
-            if (m == 0) {
-                continue;
-            }
-            if (m < 0) {
-                negs.add(-m);
-            } else {
-                poss.add(m);
-            }
-        }
-        int ans = Integer.MAX_VALUE;
-        Stack<Integer> stNeg = new Stack<>();
-        Stack<Integer> stPos = new Stack<>();
-        for (int i = 0; i < 1000; i++) {
-            for (Integer num : negs) {
-                stNeg.push(num);
+    public static class Solution1 {
+        /**
+         * Credit: https://discuss.leetcode.com/topic/68948/easy-java-solution-with-explanation
+         */
+        public int minTransfers(int[][] transactions) {
+            if (transactions == null || transactions.length == 0) {
+                return 0;
             }
-            for (Integer num : poss) {
-                stPos.push(num);
+            Map<Integer, Integer> acc = new HashMap<>();
+            for (int i = 0; i < transactions.length; i++) {
+                int id1 = transactions[i][0];
+                int id2 = transactions[i][1];
+                int m = transactions[i][2];
+                acc.put(id1, acc.getOrDefault(id1, 0) - m);
+                acc.put(id2, acc.getOrDefault(id2, 0) + m);
             }
-            int cur = 0;
-            while (!stNeg.isEmpty()) {
-                int n = stNeg.pop();
-                int p = stPos.pop();
-                cur++;
-                if (n == p) {
+            List<Integer> negs = new ArrayList<>();
+            List<Integer> poss = new ArrayList<>();
+            for (Integer key : acc.keySet()) {
+                int m = acc.get(key);
+                if (m == 0) {
                     continue;
                 }
-                if (n > p) {
-                    stNeg.push(n - p);
+                if (m < 0) {
+                    negs.add(-m);
                 } else {
-                    stPos.push(p - n);
+                    poss.add(m);
+                }
+            }
+            int ans = Integer.MAX_VALUE;
+            Stack<Integer> stNeg = new Stack<>();
+            Stack<Integer> stPos = new Stack<>();
+            for (int i = 0; i < 1000; i++) {
+                for (Integer num : negs) {
+                    stNeg.push(num);
+                }
+                for (Integer num : poss) {
+                    stPos.push(num);
+                }
+                int cur = 0;
+                while (!stNeg.isEmpty()) {
+                    int n = stNeg.pop();
+                    int p = stPos.pop();
+                    cur++;
+                    if (n == p) {
+                        continue;
+                    }
+                    if (n > p) {
+                        stNeg.push(n - p);
+                    } else {
+                        stPos.push(p - n);
+                    }
                 }
+                ans = Math.min(ans, cur);
+                Collections.shuffle(negs);
+                Collections.shuffle(poss);
             }
-            ans = Math.min(ans, cur);
-            Collections.shuffle(negs);
-            Collections.shuffle(poss);
+            return ans;
         }
-        return ans;
     }
 }
