refactor 364

fishercoder1534 · fishercoder1534 · commit 539782478c5b · 2019-02-02T07:56:21.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_364.java b/src/main/java/com/fishercoder/solutions/_364.java
@@ -6,7 +6,10 @@
 import java.util.List;
 import java.util.Queue;
 
-/**Given a nested list of integers, return the sum of all integers in the list weighted by their depth.
+/**
+ * 364. Nested List Weight Sum II
+ *
+ * Given a nested list of integers, return the sum of all integers in the list weighted by their depth.
 
  Each element is either an integer, or a list -- whose elements may also be integers or other lists.
 
@@ -19,32 +22,34 @@
  Given the list [1,[4,[6]]], return 17. (one 1 at depth 3, one 4 at depth 2, and one 6 at depth 1; 1*3 + 4*2 + 6*1 = 17)*/
 public class _364 {
 
-    public int depthSumInverse(List<NestedInteger> nestedList) {
-        Queue<NestedInteger> q = new LinkedList<NestedInteger>();
-        for (NestedInteger next : nestedList) {
-            q.offer(next);
-        }
-        int prev = 0;
-        int total = 0;
-
-        while (!q.isEmpty()) {
-            int size = q.size();
-            int levelSum = 0;
-            for (int i = 0; i < size; i++) {
-                NestedInteger next = q.poll();
-                if (next.isInteger()) {
-                    levelSum += next.getInteger();
-                } else {
-                    List<NestedInteger> list = next.getList();
-                    for (NestedInteger n : list) {
-                        q.offer(n);
+    public static class Solution1 {
+        public int depthSumInverse(List<NestedInteger> nestedList) {
+            Queue<NestedInteger> q = new LinkedList<>();
+            for (NestedInteger next : nestedList) {
+                q.offer(next);
+            }
+            int prev = 0;
+            int total = 0;
+
+            while (!q.isEmpty()) {
+                int size = q.size();
+                int levelSum = 0;
+                for (int i = 0; i < size; i++) {
+                    NestedInteger next = q.poll();
+                    if (next.isInteger()) {
+                        levelSum += next.getInteger();
+                    } else {
+                        List<NestedInteger> list = next.getList();
+                        for (NestedInteger n : list) {
+                            q.offer(n);
+                        }
                     }
                 }
+                prev += levelSum;
+                total += prev;
             }
-            prev += levelSum;
-            total += prev;
+            return total;
         }
-        return total;
     }
 
 }
