Skip to content

Commit 264b870

Browse files
diguagediguage
committed
add source to note
1 parent 1bf54b3 commit 264b870

File tree

1,342 files changed

+10638
-6
lines changed

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

1,342 files changed

+10638
-6
lines changed

‎docs/0001-two-sum.adoc

+7
Original file line numberDiff line numberDiff line change
@@ -15,3 +15,10 @@ Because nums[*0*] + nums[*1*] = 2 + 7 = 9,
1515
return [*0*, *1*].
1616
----
1717

18+
19+
[[src-0001]]
20+
[source,{java_source_attr}]
21+
----
22+
include::{sourcedir}/_0001_TwoSum.java[]
23+
----
24+

‎docs/0002-add-two-numbers.adoc

+7
Original file line numberDiff line numberDiff line change
@@ -14,3 +14,10 @@ You may assume the two numbers do not contain any leading zero, except the numbe
1414
*Explanation:* 342 + 465 = 807.
1515
----
1616

17+
18+
[[src-0002]]
19+
[source,{java_source_attr}]
20+
----
21+
include::{sourcedir}/_0002_AddTwoNumbers.java[]
22+
----
23+

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

+5-1
Original file line numberDiff line numberDiff line change
@@ -33,5 +33,9 @@ Given a string, find the length of the *longest substring* without repeating cha
3333
----
3434

3535

36-
36+
[[src-0003]]
37+
[source,{java_source_attr}]
38+
----
39+
include::{sourcedir}/_0003_LongestSubstringWithoutRepeatingCharacters.java[]
40+
----
3741

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

+7
Original file line numberDiff line numberDiff line change
@@ -26,3 +26,10 @@ nums2 = [3, 4]
2626
The median is (2 + 3)/2 = 2.5
2727
----
2828

29+
30+
[[src-0004]]
31+
[source,{java_source_attr}]
32+
----
33+
include::{sourcedir}/_0004_MedianOfTwoSortedArrays.java[]
34+
----
35+

‎docs/0005-longest-palindromic-substring.adoc

+7
Original file line numberDiff line numberDiff line change
@@ -37,3 +37,10 @@ Given a string *s*, find the longest palindromic substring in *s*. You may assum
3737
* https://blog.csdn.net/dyx404514/article/details/42061017[Manacher算法总结_ddyyxx的程序员之路-CSDN博客]
3838
* https://www.jianshu.com/p/6db44081a155[Manacher算法详解 - 简书]
3939

40+
41+
[[src-0005]]
42+
[source,{java_source_attr}]
43+
----
44+
include::{sourcedir}/_0005_LongestPalindromicSubstring.java[]
45+
----
46+

‎docs/0006-zigzag-conversion.adoc

+7
Original file line numberDiff line numberDiff line change
@@ -41,3 +41,10 @@ Y A H R
4141
P I
4242
----
4343

44+
45+
[[src-0006]]
46+
[source,{java_source_attr}]
47+
----
48+
include::{sourcedir}/_0006_ZigZagConversion.java[]
49+
----
50+

‎docs/0007-reverse-integer.adoc

+7
Original file line numberDiff line numberDiff line change
@@ -29,3 +29,10 @@ Given a 32-bit signed integer, reverse digits of an integer.
2929

3030
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.
3131

32+
33+
[[src-0007]]
34+
[source,{java_source_attr}]
35+
----
36+
include::{sourcedir}/_0007_ReverseInteger.java[]
37+
----
38+

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

+7
Original file line numberDiff line numberDiff line change
@@ -60,3 +60,10 @@ If no valid conversion could be performed, a zero value is returned.
6060
Thefore INT_MIN (-2^31^) is returned.
6161
----
6262

63+
64+
[[src-0008]]
65+
[source,{java_source_attr}]
66+
----
67+
include::{sourcedir}/_0008_StringToIntegerAtoi.java[]
68+
----
69+

‎docs/0009-palindrome-number.adoc

+7
Original file line numberDiff line numberDiff line change
@@ -31,3 +31,10 @@ Determine whether an integer is a palindrome. An integer is a palindrome when it
3131

3232
Coud you solve it without converting the integer to a string?
3333

34+
35+
[[src-0009]]
36+
[source,{java_source_attr}]
37+
----
38+
include::{sourcedir}/_0009_PalindromeNumber.java[]
39+
----
40+

‎docs/0010-regular-expression-matching.adoc

+7
Original file line numberDiff line numberDiff line change
@@ -73,3 +73,10 @@ p = "mis*is*p*."
7373
*Output:* false
7474
----
7575

76+
77+
[[src-0010]]
78+
[source,{java_source_attr}]
79+
----
80+
include::{sourcedir}/_0010_RegularExpressionMatching.java[]
81+
----
82+

‎docs/0011-container-with-most-water.adoc

+8
Original file line numberDiff line numberDiff line change
@@ -21,3 +21,11 @@ image::https://s3-lc-upload.s3.amazonaws.com/uploads/2018/07/17/question_11.jpg[
2121
*Input:* [1,8,6,2,5,4,8,3,7]
2222
*Output:* 49
2323
----
24+
25+
26+
[[src-0011]]
27+
[source,{java_source_attr}]
28+
----
29+
include::{sourcedir}/_0011_ContainerWithMostWater.java[]
30+
----
31+

‎docs/0012-integer-to-roman.adoc

+7
Original file line numberDiff line numberDiff line change
@@ -70,3 +70,10 @@ Given an integer, convert it to a roman numeral. Input is guaranteed to be withi
7070
*Explanation:* M = 1000, CM = 900, XC = 90 and IV = 4.
7171
----
7272

73+
74+
[[src-0012]]
75+
[source,{java_source_attr}]
76+
----
77+
include::{sourcedir}/_0012_IntegerToRoman.java[]
78+
----
79+

‎docs/0013-roman-to-integer.adoc

+7
Original file line numberDiff line numberDiff line change
@@ -71,3 +71,10 @@ Given a roman numeral, convert it to an integer. Input is guaranteed to be withi
7171
*Explanation:* M = 1000, CM = 900, XC = 90 and IV = 4.
7272
----
7373

74+
75+
[[src-0013]]
76+
[source,{java_source_attr}]
77+
----
78+
include::{sourcedir}/_0013_RomanToInteger.java[]
79+
----
80+

‎docs/0014-longest-common-prefix.adoc

+7
Original file line numberDiff line numberDiff line change
@@ -27,3 +27,10 @@ If there is no common prefix, return an empty string `""`.
2727

2828
All given inputs are in lowercase letters `a-z`.
2929

30+
31+
[[src-0014]]
32+
[source,{java_source_attr}]
33+
----
34+
include::{sourcedir}/_0014_LongestCommonPrefix.java[]
35+
----
36+

‎docs/0015-3sum.adoc

+8
Original file line numberDiff line numberDiff line change
@@ -20,3 +20,11 @@ A solution set is:
2020
[-1, -1, 2]
2121
]
2222
----
23+
24+
25+
[[src-0015]]
26+
[source,{java_source_attr}]
27+
----
28+
include::{sourcedir}/_0015_3Sum.java[]
29+
----
30+

‎docs/0016-3sum-closest.adoc

+7
Original file line numberDiff line numberDiff line change
@@ -13,3 +13,10 @@ Given array nums = [-1, 2, 1, -4], and target = 1.
1313
The sum that is closest to the target is 2. (-1 + 2 + 1 = 2).
1414
----
1515

16+
17+
[[src-0016]]
18+
[source,{java_source_attr}]
19+
----
20+
include::{sourcedir}/_0016_3SumClosest.java[]
21+
----
22+

‎docs/0017-letter-combinations-of-a-phone-number.adoc

+7
Original file line numberDiff line numberDiff line change
@@ -20,3 +20,10 @@ image::http://upload.wikimedia.org/wikipedia/commons/thumb/7/73/Telephone-keypad
2020

2121
Although the above answer is in lexicographical order, your answer could be in any order you want.
2222

23+
24+
[[src-0017]]
25+
[source,{java_source_attr}]
26+
----
27+
include::{sourcedir}/_0017_LetterCombinationsOfAPhoneNumber.java[]
28+
----
29+

‎docs/0018-4sum.adoc

+7
Original file line numberDiff line numberDiff line change
@@ -22,3 +22,10 @@ A solution set is:
2222
]
2323
----
2424

25+
26+
[[src-0018]]
27+
[source,{java_source_attr}]
28+
----
29+
include::{sourcedir}/_0018_4Sum.java[]
30+
----
31+

‎docs/0019-remove-nth-node-from-end-of-list.adoc

+7
Original file line numberDiff line numberDiff line change
@@ -21,3 +21,10 @@ Given _n_ will always be valid.
2121

2222
Could you do this in one pass?
2323

24+
25+
[[src-0019]]
26+
[source,{java_source_attr}]
27+
----
28+
include::{sourcedir}/_0019_RemoveNthNodeFromEndOfList.java[]
29+
----
30+

‎docs/0020-valid-parentheses.adoc

+7
Original file line numberDiff line numberDiff line change
@@ -53,3 +53,10 @@ Note that an empty string is also considered valid.
5353
*Output:* true
5454
----
5555

56+
57+
[[src-0020]]
58+
[source,{java_source_attr}]
59+
----
60+
include::{sourcedir}/_0020_ValidParentheses.java[]
61+
----
62+

‎docs/0021-merge-two-sorted-lists.adoc

+7
Original file line numberDiff line numberDiff line change
@@ -11,3 +11,10 @@ Merge two sorted linked lists and return it as a new list. The new list should b
1111
*Output:* 1->1->2->3->4->4
1212
----
1313

14+
15+
[[src-0021]]
16+
[source,{java_source_attr}]
17+
----
18+
include::{sourcedir}/_0021_MergeTwoSortedLists.java[]
19+
----
20+

‎docs/0022-generate-parentheses.adoc

+8
Original file line numberDiff line numberDiff line change
@@ -21,3 +21,11 @@ For example, given _n_ = 3, a solution set is:
2121
"()()()"
2222
]
2323
----
24+
25+
26+
[[src-0022]]
27+
[source,{java_source_attr}]
28+
----
29+
include::{sourcedir}/_0022_GenerateParentheses.java[]
30+
----
31+

‎docs/0023-merge-k-sorted-lists.adoc

+7
Original file line numberDiff line numberDiff line change
@@ -17,3 +17,10 @@ Merge _k_ sorted linked lists and return it as one sorted list. Analyze and desc
1717
*Output:* 1->1->2->3->4->4->5->6
1818
----
1919

20+
21+
[[src-0023]]
22+
[source,{java_source_attr}]
23+
----
24+
include::{sourcedir}/_0023_MergeKSortedLists.java[]
25+
----
26+

‎docs/0024-swap-nodes-in-pairs.adoc

+7
Original file line numberDiff line numberDiff line change
@@ -32,3 +32,10 @@ You may *not* modify the values in the list's nodes, only nodes itself may be ch
3232
Given `1->2->3->4`, you should return the list as `2->1->4->3`.
3333
----
3434

35+
36+
[[src-0024]]
37+
[source,{java_source_attr}]
38+
----
39+
include::{sourcedir}/_0024_SwapNodesInPairs.java[]
40+
----
41+

‎docs/0025-reverse-nodes-in-k-group.adoc

+6
Original file line numberDiff line numberDiff line change
@@ -24,3 +24,9 @@ For _k_ = 3, you should return: `3->2->1->4->5`
2424
* You may not alter the values in the list's nodes, only nodes itself may be changed.
2525
2626
27+
[[src-0025]]
28+
[source,{java_source_attr}]
29+
----
30+
include::{sourcedir}/_0025_ReverseNodesInKGroup.java[]
31+
----
32+

‎docs/0026-remove-duplicates-from-sorted-array.adoc

+8
Original file line numberDiff line numberDiff line change
@@ -48,3 +48,11 @@ for (int i = 0; i < len; i++) {
4848
print(nums[i]);
4949
}
5050
----
51+
52+
53+
[[src-0026]]
54+
[source,{java_source_attr}]
55+
----
56+
include::{sourcedir}/_0026_RemoveDuplicatesFromSortedArray.java[]
57+
----
58+

‎docs/0027-remove-element.adoc

+8
Original file line numberDiff line numberDiff line change
@@ -52,3 +52,11 @@ for (int i = 0; i < len; i++) {
5252
print(nums[i]);
5353
}
5454
----
55+
56+
57+
[[src-0027]]
58+
[source,{java_source_attr}]
59+
----
60+
include::{sourcedir}/_0027_RemoveElement.java[]
61+
----
62+

‎docs/0028-implement-strstr.adoc

+7
Original file line numberDiff line numberDiff line change
@@ -28,3 +28,10 @@ What should we return when `needle` is an empty string? This is a great question
2828

2929
For the purpose of this problem, we will return 0 when `needle` is an empty string. This is consistent to C's http://www.cplusplus.com/reference/cstring/strstr/[strstr()] and Java's https://docs.oracle.com/javase/7/docs/api/java/lang/String.html#indexOf(java.lang.String)[indexOf()].
3030

31+
32+
[[src-0028]]
33+
[source,{java_source_attr}]
34+
----
35+
include::{sourcedir}/_0028_ImplementStrStr.java[]
36+
----
37+

‎docs/0029-divide-two-integers.adoc

+6
Original file line numberDiff line numberDiff line change
@@ -38,3 +38,9 @@ The integer division should truncate toward zero.
3838
* 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 2^31^ - 1 when the division result overflows.
3939
4040
41+
[[src-0029]]
42+
[source,{java_source_attr}]
43+
----
44+
include::{sourcedir}/_0029_DivideTwoIntegers.java[]
45+
----
46+

‎docs/0030-substring-with-concatenation-of-all-words.adoc

+7
Original file line numberDiff line numberDiff line change
@@ -28,3 +28,10 @@ The output order does not matter, returning [9,0] is fine too.
2828
*Output:* `[]`
2929
----
3030

31+
32+
[[src-0030]]
33+
[source,{java_source_attr}]
34+
----
35+
include::{sourcedir}/_0030_SubstringWithConcatenationOfAllWords.java[]
36+
----
37+

‎docs/0031-next-permutation.adoc

+7
Original file line numberDiff line numberDiff line change
@@ -18,3 +18,10 @@ Here are some examples. Inputs are in the left-hand column and its corresponding
1818

1919
`1,1,5` &rarr; `1,5,1`
2020

21+
22+
[[src-0031]]
23+
[source,{java_source_attr}]
24+
----
25+
include::{sourcedir}/_0031_NextPermutation.java[]
26+
----
27+

‎docs/0032-longest-valid-parentheses.adoc

+7
Original file line numberDiff line numberDiff line change
@@ -22,3 +22,10 @@ Given a string containing just the characters `'('` and `')'`, find the length o
2222
*Explanation:* The longest valid parentheses substring is `"()()"`
2323
----
2424

25+
26+
[[src-0032]]
27+
[source,{java_source_attr}]
28+
----
29+
include::{sourcedir}/_0032_LongestValidParentheses.java[]
30+
----
31+

‎docs/0033-search-in-rotated-sorted-array.adoc

+7
Original file line numberDiff line numberDiff line change
@@ -29,3 +29,10 @@ Your algorithm's runtime complexity must be in the order of _O_(log _n_).
2929
*Output:* -1
3030
----
3131

32+
33+
[[src-0033]]
34+
[source,{java_source_attr}]
35+
----
36+
include::{sourcedir}/_0033_SearchInRotatedSortedArray.java[]
37+
----
38+

‎docs/0034-find-first-and-last-position-of-element-in-sorted-array.adoc

+7
Original file line numberDiff line numberDiff line change
@@ -24,3 +24,10 @@ If the target is not found in the array, return `[-1, -1]`.
2424
*Output:* [-1,-1]
2525
----
2626

27+
28+
[[src-0034]]
29+
[source,{java_source_attr}]
30+
----
31+
include::{sourcedir}/_0034_FindFirstAndLastPositionOfElementInSortedArray.java[]
32+
----
33+

‎docs/0035-search-insert-position.adoc

+7
Original file line numberDiff line numberDiff line change
@@ -38,3 +38,10 @@ You may assume no duplicates in the array.
3838
*Output:* 0
3939
----
4040

41+
42+
[[src-0035]]
43+
[source,{java_source_attr}]
44+
----
45+
include::{sourcedir}/_0035_SearchInsertPosition.java[]
46+
----
47+

‎docs/0036-valid-sudoku.adoc

+6
Original file line numberDiff line numberDiff line change
@@ -69,3 +69,9 @@ The Sudoku board could be partially filled, where empty cells are filled with th
6969
* The given board size is always `9x9`.
7070
7171
72+
[[src-0036]]
73+
[source,{java_source_attr}]
74+
----
75+
include::{sourcedir}/_0036_ValidSudoku.java[]
76+
----
77+

0 commit comments

Comments
 (0)