refactor 160

fishercoder1534 · fishercoder1534 · commit 7825710319df · 2018-05-19T07:11:09.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_160.java b/src/main/java/com/fishercoder/solutions/_160.java
@@ -5,9 +5,9 @@
 import java.util.HashSet;
 import java.util.Set;
 
-/**160. Intersection of Two Linked Lists
- *
- * Write a program to find the node at which the intersection of two singly linked lists begins.
+/**
+ * 160. Intersection of Two Linked Lists
+ Write a program to find the node at which the intersection of two singly linked lists begins.
 
 
  For example, the following two linked lists:
diff --git a/src/test/java/com/fishercoder/_160Test.java b/src/test/java/com/fishercoder/_160Test.java
@@ -3,35 +3,54 @@
 import com.fishercoder.common.classes.ListNode;
 import com.fishercoder.solutions._160;
 import org.junit.BeforeClass;
+import org.junit.Ignore;
 import org.junit.Test;
 
 import static org.junit.Assert.assertEquals;
 
 public class _160Test {
-    private static _160.Solution1 solution1;
-    private static _160.Solution2 solution2;
-    private static _160.Solution3 solution3;
-    private static ListNode headA;
-    private static ListNode headB;
-    private static ListNode expected;
+  private static _160.Solution1 solution1;
+  private static _160.Solution2 solution2;
+  private static _160.Solution3 solution3;
+  private static ListNode headA;
+  private static ListNode headB;
+  private static ListNode expected;
 
-    @BeforeClass
-    public static void setup() {
-        solution1 = new _160.Solution1();
-        solution2 = new _160.Solution2();
-        solution3 = new _160.Solution3();
-    }
+  @BeforeClass
+  public static void setup() {
+    solution1 = new _160.Solution1();
+    solution2 = new _160.Solution2();
+    solution3 = new _160.Solution3();
+  }
 
-    @Test
-    public void test1() {
-        headA = new ListNode(3);
-        headB = new ListNode(2);
-        headB.next = new ListNode(3);
-        expected = new ListNode(3);
-        /**TODO: both solution1 and solution2 are ACCEPTED on OJ, but somehow it's not passing in this unit test.*/
-//        assertEquals(expected, solution1.getIntersectionNode(headA, headB));
-//        assertEquals(expected, solution2.getIntersectionNode(headA, headB));
-        assertEquals(expected, solution3.getIntersectionNode(headA, headB));
-    }
+  @Test
+  @Ignore
+  public void test1() {
+    headA = new ListNode(3);
+    headB = new ListNode(2);
+    headB.next = new ListNode(3);
+    expected = new ListNode(3);
+    /**TODO: both solution1 and solution2 are ACCEPTED on OJ, but somehow it's not passing in this unit test.*/
+    assertEquals(expected, solution1.getIntersectionNode(headA, headB));
+  }
 
+  @Test
+  @Ignore
+  public void test2() {
+    headA = new ListNode(3);
+    headB = new ListNode(2);
+    headB.next = new ListNode(3);
+    expected = new ListNode(3);
+    /**TODO: both solution1 and solution2 are ACCEPTED on OJ, but somehow it's not passing in this unit test.*/
+    assertEquals(expected, solution2.getIntersectionNode(headA, headB));
+  }
+
+  @Test
+  public void test3() {
+    headA = new ListNode(3);
+    headB = new ListNode(2);
+    headB.next = new ListNode(3);
+    expected = new ListNode(3);
+    assertEquals(expected, solution3.getIntersectionNode(headA, headB));
+  }
 }
