Leetcode

= LeetCode ifdef::env-github[] :tip-caption: :bulb: :note-caption: :information_source: :important-caption: :heavy_exclamation_mark: :caution-caption: :fire: :warning-caption: :warning: endif::[] :leetcode_base_url: https://leetcode.com/problems :source_base_url: link:./src/main/java/com/diguage/algo/leetcode :doc_base_url: link:./docs

== 友情支持

如果觉得对您有所帮助，看在D瓜哥码这么多字的辛苦上，请友情支持一下，D瓜哥感激不尽，😜

[cols="2*^",frame=none] |=== | image:docs/images/alipay.png[title="支付宝", alt="支付宝", width="90%"] | image:docs/images/wxpay.jpg[title="微信", alt="微信", width="90%"] |===

有些打赏的朋友希望可以加个好友，欢迎关注D瓜哥的微信公众号，这样就可以通过公众号的回复直接给我发信息。

image::docs/images/wx-jikerizhi.png[align="center",width=98%]

TIP: 公众号的微信号是: jikerizhi。因为众所周知的原因，有时图片加载不出来。如果图片加载不出来可以直接通过搜索微信号来查找我的公众号。

== LeetCode Problems

[cols="8,38,8,9,10,27",options="header"] |=== |序号 |标题 |代码 |题解 |难度 |备注

|{counter:codes} |{leetcode_base_url}/two-sum/[1. Two Sum^] |{source_base_url}/_0001_TwoSum.java[Java] |{doc_base_url}/0001-two-sum.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/add-two-numbers/[2. Add Two Numbers^] |{source_base_url}/_0002_AddTwoNumbers.java[Java] |{doc_base_url}/0002-add-two-numbers.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/longest-substring-without-repeating-characters/[3. Longest Substring Without Repeating Characters^] |{source_base_url}/_0003_LongestSubstringWithoutRepeatingCharacters.java[Java] |{doc_base_url}/0003-longest-substring-without-repeating-characters.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/median-of-two-sorted-arrays/[4. Median of Two Sorted Arrays^] |{source_base_url}/_0004_MedianOfTwoSortedArrays.java[Java] |{doc_base_url}/0004-median-of-two-sorted-arrays.adoc[题解] |Hard |

|{counter:codes} |{leetcode_base_url}/longest-palindromic-substring/[5. Longest Palindromic Substring^] |{source_base_url}/_0005_LongestPalindromicSubstring.java[Java] |{doc_base_url}/0005-longest-palindromic-substring.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/zigzag-conversion/[6. ZigZag Conversion^] |{source_base_url}/_0006_ZigZagConversion.java[Java] |{doc_base_url}/0006-zigzag-conversion.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/reverse-integer/[7. Reverse Integer^] |{source_base_url}/_0007_ReverseInteger.java[Java] |{doc_base_url}/0007-reverse-integer.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/string-to-integer-atoi/[8. String to Integer (atoi)^] |{source_base_url}/_0008_StringToIntegerAtoi.java[Java] |{doc_base_url}/0008-string-to-integer-atoi.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/palindrome-number/[9. Palindrome Number^] |{source_base_url}/_0009_PalindromeNumber.java[Java] |{doc_base_url}/0009-palindrome-number.adoc[题解] |Easy |

//|{counter:codes} //|{leetcode_base_url}/regular-expression-matching/[10. Regular Expression Matching^] //|{source_base_url}/_0010_RegularExpressionMatching.java[Java] //|{doc_base_url}/0010-regular-expression-matching.adoc[题解] //|Hard //|

|{counter:codes} |{leetcode_base_url}/container-with-most-water/[11. Container With Most Water^] |{source_base_url}/_0011_ContainerWithMostWater.java[Java] |{doc_base_url}/0011-container-with-most-water.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/integer-to-roman/[12. Integer to Roman^] |{source_base_url}/_0012_IntegerToRoman.java[Java] |{doc_base_url}/0012-integer-to-roman.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/roman-to-integer/[13. Roman to Integer^] |{source_base_url}/_0013_RomanToInteger.java[Java] |{doc_base_url}/0013-roman-to-integer.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/longest-common-prefix/[14. Longest Common Prefix^] |{source_base_url}/_0014_LongestCommonPrefix.java[Java] |{doc_base_url}/0014-longest-common-prefix.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/3sum/[15. 3Sum^] |{source_base_url}/_0015_3Sum.java[Java] |{doc_base_url}/0015-3sum.adoc[题解] |Medium |双指针

|{counter:codes} |{leetcode_base_url}/3sum-closest/[16. 3Sum Closest^] |{source_base_url}/_0016_3SumClosest.java[Java] |{doc_base_url}/0016-3sum-closest.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/letter-combinations-of-a-phone-number/[17. Letter Combinations of a Phone Number^] |{source_base_url}/_0017_LetterCombinationsOfAPhoneNumber.java[Java] |{doc_base_url}/0017-letter-combinations-of-a-phone-number.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/4sum/[18. 4Sum^] |{source_base_url}/_0018_4Sum.java[Java] |{doc_base_url}/0018-4sum.adoc[题解] |Medium |双指针

|{counter:codes} |{leetcode_base_url}/remove-nth-node-from-end-of-list/[19. Remove Nth Node From End of List^] |{source_base_url}/_0019_RemoveNthNodeFromEndOfList.java[Java] |{doc_base_url}/0019-remove-nth-node-from-end-of-list.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/valid-parentheses/[20. Valid Parentheses^] |{source_base_url}/_0020_ValidParentheses.java[Java] |{doc_base_url}/0020-valid-parentheses.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/merge-two-sorted-lists/[21. Merge Two Sorted Lists^] |{source_base_url}/_0021_MergeTwoSortedLists.java[Java] |{doc_base_url}/0021-merge-two-sorted-lists.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/generate-parentheses/[22. Generate Parentheses^] |{source_base_url}/_0022_GenerateParentheses.java[Java] |{doc_base_url}/0022-generate-parentheses.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/merge-k-sorted-lists/[23. Merge k Sorted Lists^] |{source_base_url}/_0023_MergeKSortedLists.java[Java] |{doc_base_url}/0023-merge-k-sorted-lists.adoc[题解] |Hard |

|{counter:codes} |{leetcode_base_url}/swap-nodes-in-pairs/[24. Swap Nodes in Pairs^] |{source_base_url}/_0024_SwapNodesInPairs.java[Java] |{doc_base_url}/0024-swap-nodes-in-pairs.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/reverse-nodes-in-k-group/[25. Reverse Nodes in k-Group^] |{source_base_url}/_0025_ReverseNodesInKGroup.java[Java] |{doc_base_url}/0025-reverse-nodes-in-k-group.adoc[题解] |Hard |

|{counter:codes} |{leetcode_base_url}/remove-duplicates-from-sorted-array/[26. Remove Duplicates from Sorted Array^] |{source_base_url}/_0026_RemoveDuplicatesFromSortedArray.java[Java] |{doc_base_url}/0026-remove-duplicates-from-sorted-array.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/remove-element/[27. Remove Element^] |{source_base_url}/_0027_RemoveElement.java[Java] |{doc_base_url}/0027-remove-element.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/find-the-index-of-the-first-occurrence-in-a-string/[28. 找出字符串中第一个匹配项的下标] |{source_base_url}/_0028_FindTheIndexOfTheFirstOccurrenceInAString.java[Java] |{doc_base_url}/0028-find-the-index-of-the-first-occurrence-in-a-string.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/divide-two-integers/[29. Divide Two Integers^] |{source_base_url}/_0029_DivideTwoIntegers.java[Java] |{doc_base_url}/0029-divide-two-integers.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/substring-with-concatenation-of-all-words/[30. Substring with Concatenation of All Words^] |{source_base_url}/_0030_SubstringWithConcatenationOfAllWords.java[Java] |{doc_base_url}/0030-substring-with-concatenation-of-all-words.adoc[题解] |Hard |

|{counter:codes} |{leetcode_base_url}/next-permutation/[31. Next Permutation^] |{source_base_url}/_0031_NextPermutation.java[Java] |{doc_base_url}/0031-next-permutation.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/longest-valid-parentheses/[32. Longest Valid Parentheses^] |{source_base_url}/_0032_LongestValidParentheses.java[Java] |{doc_base_url}/0032-longest-valid-parentheses.adoc[题解] |Hard |

|{counter:codes} |{leetcode_base_url}/search-in-rotated-sorted-array/[33. Search in Rotated Sorted Array^] |{source_base_url}/_0033_SearchInRotatedSortedArray.java[Java] |{doc_base_url}/0033-search-in-rotated-sorted-array.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/find-first-and-last-position-of-element-in-sorted-array/[34. Find First and Last Position of Element in Sorted Array^] |{source_base_url}/_0034_FindFirstAndLastPositionOfElementInSortedArray.java[Java] |{doc_base_url}/0034-find-first-and-last-position-of-element-in-sorted-array.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/search-insert-position/[35. Search Insert Position^] |{source_base_url}/_0035_SearchInsertPosition.java[Java] |{doc_base_url}/0035-search-insert-position.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/valid-sudoku/[36. Valid Sudoku^] |{source_base_url}/_0036_ValidSudoku.java[Java] |{doc_base_url}/0036-valid-sudoku.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/sudoku-solver/[37. Sudoku Solver^] |{source_base_url}/_0037_SudokuSolver.java[Java] |{doc_base_url}/0037-sudoku-solver.adoc[题解] |Hard |

|{counter:codes} |{leetcode_base_url}/count-and-say/[38. Count and Say^] |{source_base_url}/_0038_CountAndSay.java[Java] |{doc_base_url}/0038-count-and-say.adoc[题解] |Easy |

|{counter:codes} |{leetcode_base_url}/combination-sum/[39. Combination Sum^] |{source_base_url}/_0039_CombinationSum.java[Java] |{doc_base_url}/0039-combination-sum.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/combination-sum-ii/[40. Combination Sum II^] |{source_base_url}/_0040_CombinationSumII.java[Java] |{doc_base_url}/0040-combination-sum-ii.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/first-missing-positive/[41. First Missing Positive^] |{source_base_url}/_0041_FirstMissingPositive.java[Java] |{doc_base_url}/0041-first-missing-positive.adoc[题解] |Hard |

|{counter:codes} |{leetcode_base_url}/trapping-rain-water/[42. Trapping Rain Water^] |{source_base_url}/_0042_TrappingRainWater.java[Java] |{doc_base_url}/0042-trapping-rain-water.adoc[题解] |Hard |单调栈

|{counter:codes} |{leetcode_base_url}/multiply-strings/[43. Multiply Strings^] |{source_base_url}/_0043_MultiplyStrings.java[Java] |{doc_base_url}/0043-multiply-strings.adoc[题解] |Medium |

|{counter:codes} |{leetcode_base_url}/wildcard-matching/[44. Wildcard Matching^] |{source_base_url}/_0044_Wildca