refactor 107

fishercoder1534 · fishercoder1534 · commit 418b70a0eb9f · 2020-05-09T13:45:31.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_107.java b/src/main/java/com/fishercoder/solutions/_107.java
@@ -8,55 +8,32 @@
 import java.util.List;
 import java.util.Queue;
 
-/**107. Binary Tree Level Order Traversal II
-
-Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root).
-
-For example:
-Given binary tree [3,9,20,null,null,15,7],
-
-    3
-   / \
-  9  20
-    /  \
-   15   7
-
-return its bottom-up level order traversal as:
-
-[
-  [15,7],
-  [9,20],
-  [3]
-]
-*/
-
 public class _107 {
-	public static class Solution1 {
-		public List<List<Integer>> levelOrder(TreeNode root) {
-			List<List<Integer>> result = new ArrayList();
-			if (root == null) {
-				return result;
-			}
-
-			Queue<TreeNode> q = new LinkedList();
-			q.offer(root);
-			while (!q.isEmpty()) {
-				List<Integer> thisLevel = new ArrayList<Integer>();
-				int qSize = q.size();
-				for (int i = 0; i < qSize; i++) {
-					TreeNode curr = q.poll();
-					thisLevel.add(curr.val);
-					if (curr.left != null) {
-						q.offer(curr.left);
-					}
-					if (curr.right != null) {
-						q.offer(curr.right);
-					}
-				}
-				result.add(thisLevel);
-			}
-			Collections.reverse(result);
-			return result;
-		}
-	}
+    public static class Solution1 {
+        public List<List<Integer>> levelOrder(TreeNode root) {
+            List<List<Integer>> result = new ArrayList();
+            if (root == null) {
+                return result;
+            }
+            Queue<TreeNode> q = new LinkedList();
+            q.offer(root);
+            while (!q.isEmpty()) {
+                List<Integer> thisLevel = new ArrayList<>();
+                int qSize = q.size();
+                for (int i = 0; i < qSize; i++) {
+                    TreeNode curr = q.poll();
+                    thisLevel.add(curr.val);
+                    if (curr.left != null) {
+                        q.offer(curr.left);
+                    }
+                    if (curr.right != null) {
+                        q.offer(curr.right);
+                    }
+                }
+                result.add(thisLevel);
+            }
+            Collections.reverse(result);
+            return result;
+        }
+    }
 }
