add source to note

Author: diguage

docs/0001-two-sum.adoc

@@ -15,3 +15,10 @@ Because nums[*0*] + nums[*1*] = 2 + 7 = 9,
 return [*0*, *1*].
 ----
 
+
+[[src-0001]]
+[source,{java_source_attr}]
+----
+include::{sourcedir}/_0001_TwoSum.java[]
+----
+

docs/0002-add-two-numbers.adoc

@@ -14,3 +14,10 @@ You may assume the two numbers do not contain any leading zero, except the numbe
 *Explanation:* 342 + 465 = 807.
 ----
 
+
+[[src-0002]]
+[source,{java_source_attr}]
+----
+include::{sourcedir}/_0002_AddTwoNumbers.java[]
+----
+

docs/0003-longest-substring-without-repeating-characters.adoc

@@ -33,5 +33,9 @@ Given a string, find the length of the *longest substring* without repeating cha
 ----
 
 
-
+[[src-0003]]
+[source,{java_source_attr}]
+----
+include::{sourcedir}/_0003_LongestSubstringWithoutRepeatingCharacters.java[]
+----
 

docs/0004-median-of-two-sorted-arrays.adoc

@@ -26,3 +26,10 @@ nums2 = [3, 4]
 The median is (2 + 3)/2 = 2.5
 ----
 
+
+[[src-0004]]
+[source,{java_source_attr}]
+----
+include::{sourcedir}/_0004_MedianOfTwoSortedArrays.java[]
+----
+

docs/0005-longest-palindromic-substring.adoc

@@ -37,3 +37,10 @@ Given a string *s*, find the longest palindromic substring in *s*. You may assum
 * https://blog.csdn.net/dyx404514/article/details/42061017[Manacher算法总结_ddyyxx的程序员之路-CSDN博客]
 * https://www.jianshu.com/p/6db44081a155[Manacher算法详解 - 简书]
 
+
+[[src-0005]]
+[source,{java_source_attr}]
+----
+include::{sourcedir}/_0005_LongestPalindromicSubstring.java[]
+----
+

docs/0006-zigzag-conversion.adoc

@@ -41,3 +41,10 @@ Y A   H R
 P     I
 ----
 
+
+[[src-0006]]
+[source,{java_source_attr}]
+----
+include::{sourcedir}/_0006_ZigZagConversion.java[]
+----
+

docs/0007-reverse-integer.adoc

@@ -29,3 +29,10 @@ Given a 32-bit signed integer, reverse digits of an integer.
 
 Assume we are dealing with an environment which could only store integers within the 32-bit signed integer range: [-2^31^,  2^31^- 1]. For the purpose of this problem, assume that your function returns 0 when the reversed integer overflows.
 
+
+[[src-0007]]
+[source,{java_source_attr}]
+----
+include::{sourcedir}/_0007_ReverseInteger.java[]
+----
+

docs/0008-string-to-integer-atoi.adoc

@@ -60,3 +60,10 @@ If no valid conversion could be performed, a zero value is returned.
              Thefore INT_MIN (-2^31^) is returned.
 ----
 
+
+[[src-0008]]
+[source,{java_source_attr}]
+----
+include::{sourcedir}/_0008_StringToIntegerAtoi.java[]
+----
+

docs/0009-palindrome-number.adoc

@@ -31,3 +31,10 @@ Determine whether an integer is a palindrome. An integer is a palindrome when it
 
 Coud you solve it without converting the integer to a string?
 
+
+[[src-0009]]
+[source,{java_source_attr}]
+----
+include::{sourcedir}/_0009_PalindromeNumber.java[]
+----
+

docs/0010-regular-expression-matching.adoc

@@ -73,3 +73,10 @@ p = "mis*is*p*."
 *Output:* false
 ----
 
+
+[[src-0010]]
+[source,{java_source_attr}]
+----
+include::{sourcedir}/_0010_RegularExpressionMatching.java[]
+----
+