refactor 117

fishercoder1534 · fishercoder1534 · commit 36de3ae37fc7 · 2018-03-31T07:33:50.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_117.java b/src/main/java/com/fishercoder/solutions/_117.java
@@ -27,10 +27,8 @@
 
 public class _117 {
     public static class Solution1 {
-        //copied this post: https://discuss.leetcode.com/topic/1106/o-1-space-o-n-complexity-iterative-solution
-        //very clever and concise to make it in O(1) space
-
-        //based on level order traversal
+        /**credit: https://discuss.leetcode.com/topic/1106/o-1-space-o-n-complexity-iterative-solution
+        O(1) space, based on level order traversal*/
         public void connect(TreeLinkNode root) {
 
             TreeLinkNode head = null; //head of the next level
@@ -69,4 +67,4 @@ public void connect(TreeLinkNode root) {
             }
         }
     }
-}
+}
diff --git a/src/test/java/com/fishercoder/_117Test.java b/src/test/java/com/fishercoder/_117Test.java
@@ -6,24 +6,23 @@
 import org.junit.Test;
 
 public class _117Test {
-    private static _117.Solution1 solution1;
-    private static TreeLinkNode root;
+  private static _117.Solution1 solution1;
+  private static TreeLinkNode root;
 
-    @BeforeClass
-    public static void setup() {
-        solution1 = new _117.Solution1();
-    }
+  @BeforeClass
+  public static void setup() {
+    solution1 = new _117.Solution1();
+  }
 
-    @Test
-    public void test1() {
-        root = new TreeLinkNode(1);
-        root.left = new TreeLinkNode(2);
-        root.right = new TreeLinkNode(3);
-        root.left.left = new TreeLinkNode(4);
-        root.left.right = new TreeLinkNode(5);
-        root.right.right = new TreeLinkNode(7);
+  @Test
+  public void test1() {
+    root = new TreeLinkNode(1);
+    root.left = new TreeLinkNode(2);
+    root.right = new TreeLinkNode(3);
+    root.left.left = new TreeLinkNode(4);
+    root.left.right = new TreeLinkNode(5);
+    root.right.right = new TreeLinkNode(7);
 
-        solution1.connect(root);
-    }
-
-}
+    solution1.connect(root);
+  }
+}

Original file line number	Diff line number	Diff line change
`@@ -27,10 +27,8 @@`
`27`	`27`
`28`	`28`	`public class _117 {`
`29`	`29`	`public static class Solution1 {`
`30`		`- //copied this post: https://discuss.leetcode.com/topic/1106/o-1-space-o-n-complexity-iterative-solution`
`31`		`- //very clever and concise to make it in O(1) space`
`32`		`-`
`33`		`- //based on level order traversal`
	`30`	`+ /**credit: https://discuss.leetcode.com/topic/1106/o-1-space-o-n-complexity-iterative-solution`
	`31`	`+ O(1) space, based on level order traversal*/`
`34`	`32`	`public void connect(TreeLinkNode root) {`
`35`	`33`
`36`	`34`	`TreeLinkNode head = null; //head of the next level`
`@@ -69,4 +67,4 @@ public void connect(TreeLinkNode root) {`
`69`	`67`	`}`
`70`	`68`	`}`
`71`	`69`	`}`
`72`		`-}`
	`70`	`+}`