edit 261

fishercoder1534 · fishercoder1534 · commit 07058a2c017b · 2017-07-22T15:27:12.000-07:00
diff --git a/README.md b/README.md
@@ -319,7 +319,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |265|[Paint House II](https://leetcode.com/problems/paint-house-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/PaintHouseII.java)| ?|? | Hard| 
 |264|[Ugly Number II](https://leetcode.com/problems/ugly-number-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_264.java)| O(n)|O(n) | Medium| DP
 |263|[Ugly Number](https://leetcode.com/problems/ugly-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_263.java)| O(n)|O(1) | Easy|
-|261|[Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/GraphValidTree.java)| O(V+E)|O(V+E) | Medium|
+|261|[Graph Valid Tree](https://leetcode.com/problems/graph-valid-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_261.java)| O(V+E)|O(V+E) | Medium|
 |260|[Single Number III](https://leetcode.com/problems/single-number-iii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_260.java)| O(n)|O(n) | Medium|
 |259|[3Sum Smaller](https://leetcode.com/problems/3sum-smaller/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_259.java)| O(n^2)|O(1) | Medium|
 |258|[Add Digits](https://leetcode.com/problems/add-digits/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_258.java)| O(1)|O(1) | Easy|
diff --git a/src/main/java/com/fishercoder/solutions/_261.java b/src/main/java/com/fishercoder/solutions/_261.java
@@ -1,7 +1,10 @@
 package com.fishercoder.solutions;
 
 /**
- * Given n nodes labeled from 0 to n - 1 and a list of undirected edges (each edge is a pair of nodes), write a function to check whether these edges make up a valid tree.
+ *261. Graph Valid Tree
+ *Given n nodes labeled from 0 to n - 1 and a list of undirected edges
+ * (each edge is a pair of nodes),
+ * write a function to check whether these edges make up a valid tree.
 
  For example:
 
@@ -12,10 +15,14 @@
  Hint:
 
  Given n = 5 and edges = [[0, 1], [1, 2], [3, 4]], what should your return? Is this case a valid tree?
- According to the definition of tree on Wikipedia: “a tree is an undirected graph in which any two vertices are connected by exactly one path. In other words, any connected graph without simple cycles is a tree.”
- Note: you can assume that no duplicate edges will appear in edges. Since all edges are undirected, [0, 1] is the same as [1, 0] and thus will not appear together in edges.
+ According to the definition of tree on Wikipedia:
+ “a tree is an undirected graph in which any two vertices are connected by exactly one path.
+ In other words, any connected graph without simple cycles is a tree.”
+
+ Note: you can assume that no duplicate edges will appear in edges.
+ Since all edges are undirected, [0, 1] is the same as [1, 0] and thus will not appear together in edges.
  */
-public class GraphValidTree {
+public class _261 {
 
     public boolean validTree(int n, int[][] edges){
         int[] nums = new int[n];
