refactor 102

fishercoder1534 · fishercoder1534 · commit 1c88c1ed79ef · 2018-03-15T06:46:30.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_102.java b/src/main/java/com/fishercoder/solutions/_102.java
@@ -31,29 +31,30 @@
 */
 public class _102 {
 
-	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);
-		}
-		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);
+      }
+      return result;
+    }
+  }
 }
