注释

crossoverJie · crossoverJie · commit b4896d69a388 · 2018-01-04T21:49:29.000+08:00
diff --git a/README.md b/README.md
@@ -38,7 +38,8 @@
 ### 数据结构与算法
 - [红包算法](https://github.com/crossoverJie/Java-Interview/blob/master/src/main/java/com/crossoverjie/red/RedPacket.java)
 - [二叉树中序遍历](https://github.com/crossoverJie/Java-Interview/blob/master/src/main/java/com/crossoverjie/algorithm/BinaryNode.java#L76-L101)
-- 是否为快乐数字
+- [是否为快乐数字](https://github.com/crossoverJie/Java-Interview/blob/master/src/main/java/com/crossoverjie/algorithm/HappyNum.java#L38-L55)
+- 链表是否有环
 
 ### 附加技能
 
diff --git a/src/main/java/com/crossoverjie/algorithm/LinkLoop.java b/src/main/java/com/crossoverjie/algorithm/LinkLoop.java
@@ -24,6 +24,11 @@ public Node(Object data) {
         }
     }
 
+    /**
+     * 判断链表是否有环
+     * @param node
+     * @return
+     */
     public boolean isLoop(Node node){
         Node slow = node ;
         Node fast = node.next ;

Original file line number	Diff line number	Diff line change
`@@ -24,6 +24,11 @@ public Node(Object data) {`
`24`	`24`	`}`
`25`	`25`	`}`
`26`	`26`
	`27`	`+ /**`
	`28`	`+ * 判断链表是否有环`
	`29`	`+ * @param node`
	`30`	`+ * @return`
	`31`	`+ */`
`27`	`32`	`public boolean isLoop(Node node){`
`28`	`33`	`Node slow = node ;`
`29`	`34`	`Node fast = node.next ;`