doc: add finish words

Author: Blankj

note/001/README.md

@@ -1,4 +1,4 @@
-# [Two Sum](https://leetcode.com/problems/two-sum/)
+# [Two Sum][title]
 
 ## Description
 
@@ -58,3 +58,13 @@ class Solution {
     }
 }
 ```
+
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我GitHub上的LeetCode题解：[awesome-java-leetcode][ajl]
+
+
+
+[title]: https://leetcode.com/problems/two-sum
+[ajl]: https://github.com/Blankj/awesome-java-leetcode

note/007/README.md

@@ -1,4 +1,4 @@
-# [Reverse Integer](https://leetcode.com/problems/reverse-integer/)
+# [Reverse Integer][title]
 
 ## Description
 
@@ -42,3 +42,13 @@ public class Solution {
     }
 }
 ```
+
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我GitHub上的LeetCode题解：[awesome-java-leetcode][ajl]
+
+
+
+[title]: https://leetcode.com/problems/reverse-integer
+[ajl]: https://github.com/Blankj/awesome-java-leetcode

note/008/README.md

@@ -1,4 +1,4 @@
-# [String to Integer (atoi)](https://leetcode.com/problems/string-to-integer-atoi/)
+# [String to Integer (atoi)][title]
 
 ## Description
 
@@ -48,3 +48,13 @@ public class Solution {
     }
 }
 ```
+
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我GitHub上的LeetCode题解：[awesome-java-leetcode][ajl]
+
+
+
+[title]: https://leetcode.com/problems/string-to-integer-atoi
+[ajl]: https://github.com/Blankj/awesome-java-leetcode

note/009/README.md

@@ -1,4 +1,4 @@
-# [Palindrome Number](https://leetcode.com/problems/palindrome-number/)
+# [Palindrome Number][title]
 
 ## Description
 
@@ -51,5 +51,14 @@ public boolean isPalindrome(int x) {
     }
     return halfReverseX == x || halfReverseX / 10 == x;
 }
-
 ```
+
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我GitHub上的LeetCode题解：[awesome-java-leetcode][ajl]
+
+
+
+[title]: https://leetcode.com/problems/palindrome-number
+[ajl]: https://github.com/Blankj/awesome-java-leetcode

note/013/README.md

@@ -1,4 +1,4 @@
-# [Roman to Integer](https://leetcode.com/problems/roman-to-integer/)
+# [Roman to Integer][title]
 
 ## Description
 
@@ -43,3 +43,13 @@ public class Solution {
     }
 }
 ```
+
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我GitHub上的LeetCode题解：[awesome-java-leetcode][ajl]
+
+
+
+[title]: https://leetcode.com/problems/roman-to-integer
+[ajl]: https://github.com/Blankj/awesome-java-leetcode

note/014/README.md

@@ -1,4 +1,4 @@
-# [Longest Common Prefix](https://leetcode.com/problems/longest-common-prefix/)
+# [Longest Common Prefix][title]
 
 ## Description
 
@@ -26,3 +26,13 @@ public class Solution {
     }
 }
 ```
+
+
+## 结语
+
+如果你同我一样热爱数据结构、算法、LeetCode，可以关注我GitHub上的LeetCode题解：[awesome-java-leetcode][ajl]
+
+
+
+[title]: https://leetcode.com/problems/longest-common-prefix
+[ajl]: https://github.com/Blankj/awesome-java-leetcode

project/LeetCode/leetcode/src/main/java/com/blankj/easy/_019/Solution.java

@@ -0,0 +1,29 @@
+package com.blankj.easy._019;
+
+import java.util.Arrays;
+import java.util.HashMap;
+
+/**
+ * <pre>
+ *     author: Blankj
+ *     blog  : http://blankj.com
+ *     time  : 2017/04/21
+ *     desc  :
+ * </pre>
+ */
+
+public class Solution {
+
+    class ListNode {
+        int val;
+        ListNode next;
+
+        ListNode(int x) {
+            val = x;
+        }
+    }
+
+    public static void main(String[] args) {
+        Solution solution = new Solution();
+    }
+}