[LEET-133] add unit test for 133

fishercoder1534 · fishercoder1534 · commit 8949bfed3882 · 2017-02-11T10:06:09.000-08:00
diff --git a/leetcode-algorithms/README.md b/leetcode-algorithms/README.md
@@ -212,7 +212,7 @@
 |138|[Copy List with Random Pointer](https://leetcode.com/problems/copy-list-with-random-pointer/)|[Solution](../../master/leetcode-algorithms/src/main/java/com/stevesun/solutions/CopyListWithRandomPointer.java)| O(?)|O(?) | Medium| 
 |137|[Single Number II](https://leetcode.com/problems/single-number-ii/)|[Solution](../../master/leetcode-algorithms/src/main/java/com/stevesun/solutions/SingleNumberII.java)| O(n)|O(n) | Medium|
 |135|[Candy](https://leetcode.com/problems/candy/)|[Solution](../../master/leetcode-algorithms/src/main/java/com/stevesun/solutions/Candy.java)| O(n)|O(1) | Hard| Greedy
-|133|[Clone Graph](https://leetcode.com/problems/clone-graph/)|[Solution](../../master/leetcode-algorithms/src/main/java/com/stevesun/solutions/CloneGraph.java)| O(n)|O(n) | Medium| HashMap, BFS 
+|133|[Clone Graph](https://leetcode.com/problems/clone-graph/)|[Solution](../../master/leetcode-algorithms/src/main/java/com/stevesun/solutions/CloneGraph.java)| O(n)|O(n) | Medium| HashMap, BFS, Graph 
 |132|[Implement Queue using Stacks](https://leetcode.com/problems/implement-queue-using-stacks/)|[Solution](../../master/leetcode-algorithms/src/main/java/com/stevesun/solutions/ImplementQueueUsingStacks.java)| O(n)|O(n) | Easy| Stack, Queue
 |130|[Surrounded Regions](https://leetcode.com/problems/surrounded-regions/)|[Solution](../../master/leetcode-algorithms/src/main/java/com/stevesun/solutions/SurroundedRegionsBFS.java)| O(?)|O(?) | Medium|
 |129|[Sum Root to Leaf Numbers](https://leetcode.com/problems/sum-root-to-leaf-numbers/)|[Solution](../../master/leetcode-algorithms/src/main/java/com/stevesun/solutions/SumRootToLeafNumbers.java)| O(n)|O(h) | Medium| DFS
diff --git a/leetcode-algorithms/src/main/java/com/stevesun/common/classes/UndirectedGraphNode.java b/leetcode-algorithms/src/main/java/com/stevesun/common/classes/UndirectedGraphNode.java
@@ -9,5 +9,24 @@
 public class UndirectedGraphNode {
     public int label;
     public List<UndirectedGraphNode> neighbors;
+
+    @Override
+    public boolean equals(Object o) {
+        if (this == o) return true;
+        if (o == null || getClass() != o.getClass()) return false;
+
+        UndirectedGraphNode that = (UndirectedGraphNode) o;
+
+        if (label != that.label) return false;
+        return neighbors != null ? neighbors.equals(that.neighbors) : that.neighbors == null;
+    }
+
+    @Override
+    public int hashCode() {
+        int result = label;
+        result = 31 * result + (neighbors != null ? neighbors.hashCode() : 0);
+        return result;
+    }
+
     public UndirectedGraphNode(int x) { label = x; neighbors = new ArrayList<UndirectedGraphNode>(); }
 }
diff --git a/leetcode-algorithms/src/main/java/com/stevesun/solutions/MinimumUniqueWordAbbreviation.java b/leetcode-algorithms/src/main/java/com/stevesun/solutions/MinimumUniqueWordAbbreviation.java
@@ -24,6 +24,7 @@ public String minAbbreviation(String target, String[] dictionary) {
          * This is NOT going to work due to TLE.
          * Tags are backtracking and bit manipulation.*/
         return null;
+
     }
 
 }
diff --git a/leetcode-algorithms/src/test/java/com/stevesun/CloneGraphTest.java b/leetcode-algorithms/src/test/java/com/stevesun/CloneGraphTest.java
@@ -0,0 +1,43 @@
+package com.stevesun;
+
+import com.stevesun.common.classes.UndirectedGraphNode;
+import com.stevesun.solutions.CloneGraph;
+import org.junit.Before;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static junit.framework.Assert.assertEquals;
+
+/**
+ * Created by stevesun on 1/15/17.
+ */
+public class CloneGraphTest {
+    private static CloneGraph test;
+    private static UndirectedGraphNode expected;
+    private static UndirectedGraphNode actual;
+
+    @BeforeClass
+    public static void setup(){
+        test = new CloneGraph();
+    }
+
+    @Before
+    public void setupForEachTest(){
+        expected = null;
+        actual = null;
+    }
+
+    @Test
+    public void test1(){
+        UndirectedGraphNode node0 = new UndirectedGraphNode(0);
+        UndirectedGraphNode node1 = new UndirectedGraphNode(1);
+        UndirectedGraphNode node2 = new UndirectedGraphNode(2);
+        node0.neighbors.add(node1);
+        node0.neighbors.add(node2);
+        node1.neighbors.add(node2);
+
+        expected = node0;
+        actual = test.cloneGraph(expected);
+        assertEquals(expected, actual);
+    }
+}

Original file line number	Diff line number	Diff line change
`@@ -24,6 +24,7 @@ public String minAbbreviation(String target, String[] dictionary) {`
`24`	`24`	`* This is NOT going to work due to TLE.`
`25`	`25`	`* Tags are backtracking and bit manipulation.*/`
`26`	`26`	`return null;`
	`27`	`+`
`27`	`28`	`}`
`28`	`29`
`29`	`30`	`}`