https://github.com/diguage/leetcode
LeetCode
https://github.com/diguage/leetcode
algorithm array backtracking backtracking-algorithm data-structures divide-and-conquer dynamic-programming graph greedy-algorithms hash-table interview leetcode list queue stack tree
Last synced: 10 months ago
JSON representation
LeetCode
- Host: GitHub
- URL: https://github.com/diguage/leetcode
- Owner: diguage
- License: apache-2.0
- Created: 2018-07-13T15:12:08.000Z (almost 8 years ago)
- Default Branch: master
- Last Pushed: 2025-07-15T15:15:24.000Z (10 months ago)
- Last Synced: 2025-07-16T09:34:51.997Z (10 months ago)
- Topics: algorithm, array, backtracking, backtracking-algorithm, data-structures, divide-and-conquer, dynamic-programming, graph, greedy-algorithms, hash-table, interview, leetcode, list, queue, stack, tree
- Language: Java
- Homepage: https://diguage.github.io/leetcode/
- Size: 179 MB
- Stars: 9
- Watchers: 2
- Forks: 3
- Open Issues: 1,134
-
Metadata Files:
- Readme: README.adoc
- License: LICENSE
Awesome Lists containing this project
README
= 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}/implement-strstr/[28. Implement strStr()^]
|{source_base_url}/_0028_ImplementStrStr.java[Java]
|{doc_base_url}/0028-implement-strstr.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_WildcardMatching.java[Java]
//|{doc_base_url}/0044-wildcard-matching.adoc[题解]
//|Hard
//|
|{counter:codes}
|{leetcode_base_url}/jump-game-ii/[45. Jump Game II^]
|{source_base_url}/_0045_JumpGameII.java[Java]
|{doc_base_url}/0045-jump-game-ii.adoc[题解]
|Hard
|
|{counter:codes}
|{leetcode_base_url}/permutations/[46. Permutations^]
|{source_base_url}/_0046_Permutations.java[Java]
|{doc_base_url}/0046-permutations.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/permutations-ii/[47. Permutations II^]
|{source_base_url}/_0047_PermutationsII.java[Java]
|{doc_base_url}/0047-permutations-ii.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/rotate-image/[48. Rotate Image^]
|{source_base_url}/_0048_RotateImage.java[Java]
|{doc_base_url}/0048-rotate-image.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/group-anagrams/[49. Group Anagrams^]
|{source_base_url}/_0049_GroupAnagrams.java[Java]
|{doc_base_url}/0049-group-anagrams.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/powx-n/[50. Pow(x, n)^]
|{source_base_url}/_0050_PowXN.java[Java]
|{doc_base_url}/0050-powx-n.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/n-queens/[51. N-Queens^]
|{source_base_url}/_0051_NQueens.java[Java]
|{doc_base_url}/0051-n-queens.adoc[题解]
|Hard
|
|{counter:codes}
|{leetcode_base_url}/n-queens-ii/[52. N-Queens II^]
|{source_base_url}/_0052_NQueensII.java[Java]
|{doc_base_url}/0052-n-queens-ii.adoc[题解]
|Hard
|
|{counter:codes}
|{leetcode_base_url}/maximum-subarray/[53. Maximum Subarray^]
|{source_base_url}/_0053_MaximumSubarray.java[Java]
|{doc_base_url}/0053-maximum-subarray.adoc[题解]
|Easy
|
|{counter:codes}
|{leetcode_base_url}/spiral-matrix/[54. Spiral Matrix^]
|{source_base_url}/_0054_SpiralMatrix.java[Java]
|{doc_base_url}/0054-spiral-matrix.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/jump-game/[55. Jump Game^]
|{source_base_url}/_0055_JumpGame.java[Java]
|{doc_base_url}/0055-jump-game.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/merge-intervals/[56. Merge Intervals^]
|{source_base_url}/_0056_MergeIntervals.java[Java]
|{doc_base_url}/0056-merge-intervals.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/insert-interval/[57. Insert Interval^]
|{source_base_url}/_0057_InsertInterval.java[Java]
|{doc_base_url}/0057-insert-interval.adoc[题解]
|Hard
|
|{counter:codes}
|{leetcode_base_url}/length-of-last-word/[58. Length of Last Word^]
|{source_base_url}/_0058_LengthOfLastWord.java[Java]
|{doc_base_url}/0058-length-of-last-word.adoc[题解]
|Easy
|
|{counter:codes}
|{leetcode_base_url}/spiral-matrix-ii/[59. Spiral Matrix II^]
|{source_base_url}/_0059_SpiralMatrixII.java[Java]
|{doc_base_url}/0059-spiral-matrix-ii.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/permutation-sequence/[60. Permutation Sequence^]
|{source_base_url}/_0060_PermutationSequence.java[Java]
|{doc_base_url}/0060-permutation-sequence.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/rotate-list/[61. Rotate List^]
|{source_base_url}/_0061_RotateList.java[Java]
|{doc_base_url}/0061-rotate-list.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/unique-paths/[62. Unique Paths^]
|{source_base_url}/_0062_UniquePaths.java[Java]
|{doc_base_url}/0062-unique-paths.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/unique-paths-ii/[63. Unique Paths II^]
|{source_base_url}/_0063_UniquePathsII.java[Java]
|{doc_base_url}/0063-unique-paths-ii.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/minimum-path-sum/[64. Minimum Path Sum^]
|{source_base_url}/_0064_MinimumPathSum.java[Java]
|{doc_base_url}/0064-minimum-path-sum.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/valid-number/[65. Valid Number^]
//|{source_base_url}/_0065_ValidNumber.java[Java]
//|{doc_base_url}/0065-valid-number.adoc[题解]
//|Hard
//|
|{counter:codes}
|{leetcode_base_url}/plus-one/[66. Plus One^]
|{source_base_url}/_0066_PlusOne.java[Java]
|{doc_base_url}/0066-plus-one.adoc[题解]
|Easy
|
|{counter:codes}
|{leetcode_base_url}/add-binary/[67. Add Binary^]
|{source_base_url}/_0067_AddBinary.java[Java]
|{doc_base_url}/0067-add-binary.adoc[题解]
|Easy
|
//|{counter:codes}
//|{leetcode_base_url}/text-justification/[68. Text Justification^]
//|{source_base_url}/_0068_TextJustification.java[Java]
//|{doc_base_url}/0068-text-justification.adoc[题解]
//|Hard
//|
|{counter:codes}
|{leetcode_base_url}/sqrtx/[69. Sqrt(x)^]
|{source_base_url}/_0069_SqrtX.java[Java]
|{doc_base_url}/0069-sqrtx.adoc[题解]
|Easy
|
|{counter:codes}
|{leetcode_base_url}/climbing-stairs/[70. Climbing Stairs^]
|{source_base_url}/_0070_ClimbingStairs.java[Java]
|{doc_base_url}/0070-climbing-stairs.adoc[题解]
|Easy
|
|{counter:codes}
|{leetcode_base_url}/simplify-path/[71. Simplify Path^]
|{source_base_url}/_0071_SimplifyPath.java[Java]
|{doc_base_url}/0071-simplify-path.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/edit-distance/[72. Edit Distance^]
|{source_base_url}/_0072_EditDistance.java[Java]
|{doc_base_url}/0072-edit-distance.adoc[题解]
|Hard
|
|{counter:codes}
|{leetcode_base_url}/set-matrix-zeroes/[73. Set Matrix Zeroes^]
|{source_base_url}/_0073_SetMatrixZeroes.java[Java]
|{doc_base_url}/0073-set-matrix-zeroes.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/search-a-2d-matrix/[74. Search a 2D Matrix^]
//|{source_base_url}/_0074_SearchA2DMatrix.java[Java]
//|{doc_base_url}/0074-search-a-2d-matrix.adoc[题解]
//|Medium
//|
|{counter:codes}
|{leetcode_base_url}/sort-colors/[75. Sort Colors^]
|{source_base_url}/_0075_SortColors.java[Java]
|{doc_base_url}/0075-sort-colors.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/minimum-window-substring/[76. Minimum Window Substring^]
|{source_base_url}/_0076_MinimumWindowSubstring.java[Java]
|{doc_base_url}/0076-minimum-window-substring.adoc[题解]
|Hard
|
|{counter:codes}
|{leetcode_base_url}/combinations/[77. Combinations^]
|{source_base_url}/_0077_Combinations.java[Java]
|{doc_base_url}/0077-combinations.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/subsets/[78. Subsets^]
|{source_base_url}/_0078_Subsets.java[Java]
|{doc_base_url}/0078-subsets.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/word-search/[79. Word Search^]
|{source_base_url}/_0079_WordSearch.java[Java]
|{doc_base_url}/0079-word-search.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/remove-duplicates-from-sorted-array-ii/[80. Remove Duplicates from Sorted Array II^]
|{source_base_url}/_0080_RemoveDuplicatesFromSortedArrayII.java[Java]
|{doc_base_url}/0080-remove-duplicates-from-sorted-array-ii.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/search-in-rotated-sorted-array-ii/[81. Search in Rotated Sorted Array II^]
|{source_base_url}/_0081_SearchInRotatedSortedArrayII.java[Java]
|{doc_base_url}/0081-search-in-rotated-sorted-array-ii.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/remove-duplicates-from-sorted-list-ii/[82. Remove Duplicates from Sorted List II^]
|{source_base_url}/_0082_RemoveDuplicatesFromSortedListII.java[Java]
|{doc_base_url}/0082-remove-duplicates-from-sorted-list-ii.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/remove-duplicates-from-sorted-list/[83. Remove Duplicates from Sorted List^]
|{source_base_url}/_0083_RemoveDuplicatesFromSortedList.java[Java]
|{doc_base_url}/0083-remove-duplicates-from-sorted-list.adoc[题解]
|Easy
|
//|{counter:codes}
//|{leetcode_base_url}/largest-rectangle-in-histogram/[84. Largest Rectangle in Histogram^]
//|{source_base_url}/_0084_LargestRectangleInHistogram.java[Java]
//|{doc_base_url}/0084-largest-rectangle-in-histogram.adoc[题解]
//|Hard
//|
//
//|{counter:codes}
//|{leetcode_base_url}/maximal-rectangle/[85. Maximal Rectangle^]
//|{source_base_url}/_0085_MaximalRectangle.java[Java]
//|{doc_base_url}/0085-maximal-rectangle.adoc[题解]
//|Hard
//|
|{counter:codes}
|{leetcode_base_url}/partition-list/[86. Partition List^]
|{source_base_url}/_0086_PartitionList.java[Java]
|{doc_base_url}/0086-partition-list.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/scramble-string/[87. Scramble String^]
//|{source_base_url}/_0087_ScrambleString.java[Java]
//|{doc_base_url}/0087-scramble-string.adoc[题解]
//|Hard
//|
|{counter:codes}
|{leetcode_base_url}/merge-sorted-array/[88. Merge Sorted Array^]
|{source_base_url}/_0088_MergeSortedArray.java[Java]
|{doc_base_url}/0088-merge-sorted-array.adoc[题解]
|Easy
|
|{counter:codes}
|{leetcode_base_url}/gray-code/[89. Gray Code^]
|{source_base_url}/_0089_GrayCode.java[Java]
|{doc_base_url}/0089-gray-code.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/subsets-ii/[90. Subsets II^]
|{source_base_url}/_0090_SubsetsII.java[Java]
|{doc_base_url}/0090-subsets-ii.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/decode-ways/[91. Decode Ways^]
|{source_base_url}/_0091_DecodeWays.java[Java]
|{doc_base_url}/0091-decode-ways.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/reverse-linked-list-ii/[92. Reverse Linked List II^]
|{source_base_url}/_0092_ReverseLinkedListII.java[Java]
|{doc_base_url}/0092-reverse-linked-list-ii.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/restore-ip-addresses/[93. Restore IP Addresses^]
|{source_base_url}/_0093_RestoreIPAddresses.java[Java]
|{doc_base_url}/0093-restore-ip-addresses.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/binary-tree-inorder-traversal/[94. Binary Tree Inorder Traversal^]
|{source_base_url}/_0094_BinaryTreeInorderTraversal.java[Java]
|{doc_base_url}/0094-binary-tree-inorder-traversal.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/unique-binary-search-trees-ii/[95. Unique Binary Search Trees II^]
|{source_base_url}/_0095_UniqueBinarySearchTreesII.java[Java]
|{doc_base_url}/0095-unique-binary-search-trees-ii.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/unique-binary-search-trees/[96. Unique Binary Search Trees^]
|{source_base_url}/_0096_UniqueBinarySearchTrees.java[Java]
|{doc_base_url}/0096-unique-binary-search-trees.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/interleaving-string/[97. Interleaving String^]
//|{source_base_url}/_0097_InterleavingString.java[Java]
//|{doc_base_url}/0097-interleaving-string.adoc[题解]
//|Hard
//|
|{counter:codes}
|{leetcode_base_url}/validate-binary-search-tree/[98. Validate Binary Search Tree^]
|{source_base_url}/_0098_ValidateBinarySearchTree.java[Java]
|{doc_base_url}/0098-validate-binary-search-tree.adoc[题解]
|Medium
|树形DP套路或中序遍历
|{counter:codes}
|{leetcode_base_url}/recover-binary-search-tree/[99. Recover Binary Search Tree^]
|{source_base_url}/_0099_RecoverBinarySearchTree.java[Java]
|{doc_base_url}/0099-recover-binary-search-tree.adoc[题解]
|Medium
|Morris遍历
|{counter:codes}
|{leetcode_base_url}/same-tree/[100. Same Tree^]
|{source_base_url}/_0100_SameTree.java[Java]
|{doc_base_url}/0100-same-tree.adoc[题解]
|Easy
|
|{counter:codes}
|{leetcode_base_url}/symmetric-tree/[101. Symmetric Tree^]
|{source_base_url}/_0101_SymmetricTree.java[Java]
|{doc_base_url}/0101-symmetric-tree.adoc[题解]
|Easy
|
|{counter:codes}
|{leetcode_base_url}/binary-tree-level-order-traversal/[102. Binary Tree Level Order Traversal^]
|{source_base_url}/_0102_BinaryTreeLevelOrderTraversal.java[Java]
|{doc_base_url}/0102-binary-tree-level-order-traversal.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/binary-tree-zigzag-level-order-traversal/[103. Binary Tree Zigzag Level Order Traversal^]
|{source_base_url}/_0103_BinaryTreeZigzagLevelOrderTraversal.java[Java]
|{doc_base_url}/0103-binary-tree-zigzag-level-order-traversal.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/maximum-depth-of-binary-tree/[104. Maximum Depth of Binary Tree^]
|{source_base_url}/_0104_MaximumDepthOfBinaryTree.java[Java]
|{doc_base_url}/0104-maximum-depth-of-binary-tree.adoc[题解]
|Easy
|
|{counter:codes}
|{leetcode_base_url}/construct-binary-tree-from-preorder-and-inorder-traversal/[105. Construct Binary Tree from Preorder and Inorder Traversal^]
|{source_base_url}/_0105_ConstructBinaryTreeFromPreorderAndInorderTraversal.java[Java]
|{doc_base_url}/0105-construct-binary-tree-from-preorder-and-inorder-traversal.adoc[题解]
|Medium
|迭代如何实现？
|{counter:codes}
|{leetcode_base_url}/construct-binary-tree-from-inorder-and-postorder-traversal/[106. Construct Binary Tree from Inorder and Postorder Traversal^]
|{source_base_url}/_0106_ConstructBinaryTreeFromInorderAndPostorderTraversal.java[Java]
|{doc_base_url}/0106-construct-binary-tree-from-inorder-and-postorder-traversal.adoc[题解]
|Medium
|迭代如何实现？
|{counter:codes}
|{leetcode_base_url}/binary-tree-level-order-traversal-ii/[107. Binary Tree Level Order Traversal II^]
|{source_base_url}/_0107_BinaryTreeLevelOrderTraversalII.java[Java]
|{doc_base_url}/0107-binary-tree-level-order-traversal-ii.adoc[题解]
|Easy
|
|{counter:codes}
|{leetcode_base_url}/convert-sorted-array-to-binary-search-tree/[108. Convert Sorted Array to Binary Search Tree^]
|{source_base_url}/_0108_ConvertSortedArrayToBinarySearchTree.java[Java]
|{doc_base_url}/0108-convert-sorted-array-to-binary-search-tree.adoc[题解]
|Easy
|
|{counter:codes}
|{leetcode_base_url}/convert-sorted-list-to-binary-search-tree/[109. Convert Sorted List to Binary Search Tree^]
|{source_base_url}/_0109_ConvertSortedListToBinarySearchTree.java[Java]
|{doc_base_url}/0109-convert-sorted-list-to-binary-search-tree.adoc[题解]
|Medium
|分治+中序遍历
|{counter:codes}
|{leetcode_base_url}/balanced-binary-tree/[110. Balanced Binary Tree^]
|{source_base_url}/_0110_BalancedBinaryTree.java[Java]
|{doc_base_url}/0110-balanced-binary-tree.adoc[题解]
|Easy
|
|{counter:codes}
|{leetcode_base_url}/minimum-depth-of-binary-tree/[111. Minimum Depth of Binary Tree^]
|{source_base_url}/_0111_MinimumDepthOfBinaryTree.java[Java]
|{doc_base_url}/0111-minimum-depth-of-binary-tree.adoc[题解]
|Easy
|Morris解法需要深入研究
|{counter:codes}
|{leetcode_base_url}/path-sum/[112. Path Sum^]
|{source_base_url}/_0112_PathSum.java[Java]
|{doc_base_url}/0112-path-sum.adoc[题解]
|Easy
|
|{counter:codes}
|{leetcode_base_url}/path-sum-ii/[113. Path Sum II^]
|{source_base_url}/_0113_PathSumII.java[Java]
|{doc_base_url}/0113-path-sum-ii.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/flatten-binary-tree-to-linked-list/[114. Flatten Binary Tree to Linked List^]
|{source_base_url}/_0114_FlattenBinaryTreeToLinkedList.java[Java]
|{doc_base_url}/0114-flatten-binary-tree-to-linked-list.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/distinct-subsequences/[115. Distinct Subsequences^]
//|{source_base_url}/_0115_DistinctSubsequences.java[Java]
//|{doc_base_url}/0115-distinct-subsequences.adoc[题解]
//|Hard
//|
|{counter:codes}
|{leetcode_base_url}/populating-next-right-pointers-in-each-node/[116. Populating Next Right Pointers in Each Node^]
|{source_base_url}/_0116_PopulatingNextRightPointersInEachNode.java[Java]
|{doc_base_url}/0116-populating-next-right-pointers-in-each-node.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/populating-next-right-pointers-in-each-node-ii/[117. Populating Next Right Pointers in Each Node II^]
|{source_base_url}/_0117_PopulatingNextRightPointersInEachNodeII.java[Java]
|{doc_base_url}/0117-populating-next-right-pointers-in-each-node-ii.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/pascals-triangle/[118. Pascal's Triangle^]
|{source_base_url}/_0118_PascalSTriangle.java[Java]
|{doc_base_url}/0118-pascals-triangle.adoc[题解]
|Easy
|
|{counter:codes}
|{leetcode_base_url}/pascals-triangle-ii/[119. Pascal's Triangle II^]
|{source_base_url}/_0119_PascalSTriangleII.java[Java]
|{doc_base_url}/0119-pascals-triangle-ii.adoc[题解]
|Easy
|
|{counter:codes}
|{leetcode_base_url}/triangle/[120. Triangle^]
|{source_base_url}/_0120_Triangle.java[Java]
|{doc_base_url}/0120-triangle.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/best-time-to-buy-and-sell-stock/[121. Best Time to Buy and Sell Stock^]
|{source_base_url}/_0121_BestTimeToBuyAndSellStock.java[Java]
|{doc_base_url}/0121-best-time-to-buy-and-sell-stock.adoc[题解]
|Easy
|
|{counter:codes}
|{leetcode_base_url}/best-time-to-buy-and-sell-stock-ii/[122. Best Time to Buy and Sell Stock II^]
|{source_base_url}/_0122_BestTimeToBuyAndSellStockII.java[Java]
|{doc_base_url}/0122-best-time-to-buy-and-sell-stock-ii.adoc[题解]
|Easy
|
|{counter:codes}
|{leetcode_base_url}/best-time-to-buy-and-sell-stock-iii/[123. Best Time to Buy and Sell Stock III^]
|{source_base_url}/_0123_BestTimeToBuyAndSellStockIII.java[Java]
|{doc_base_url}/0123-best-time-to-buy-and-sell-stock-iii.adoc[题解]
|Hard
|
//|{counter:codes}
//|{leetcode_base_url}/binary-tree-maximum-path-sum/[124. Binary Tree Maximum Path Sum^]
//|{source_base_url}/_0124_BinaryTreeMaximumPathSum.java[Java]
//|{doc_base_url}/0124-binary-tree-maximum-path-sum.adoc[题解]
//|Hard
//|
|{counter:codes}
|{leetcode_base_url}/valid-palindrome/[125. Valid Palindrome^]
|{source_base_url}/_0125_ValidPalindrome.java[Java]
|{doc_base_url}/0125-valid-palindrome.adoc[题解]
|Easy
|
//|{counter:codes}
//|{leetcode_base_url}/word-ladder-ii/[126. Word Ladder II^]
//|{source_base_url}/_0126_WordLadderII.java[Java]
//|{doc_base_url}/0126-word-ladder-ii.adoc[题解]
//|Hard
//|
|{counter:codes}
|{leetcode_base_url}/word-ladder/[127. Word Ladder^]
|{source_base_url}/_0127_WordLadder.java[Java]
|{doc_base_url}/0127-word-ladder.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/longest-consecutive-sequence/[128. Longest Consecutive Sequence^]
//|{source_base_url}/_0128_LongestConsecutiveSequence.java[Java]
//|{doc_base_url}/0128-longest-consecutive-sequence.adoc[题解]
//|Hard
//|
|{counter:codes}
|{leetcode_base_url}/sum-root-to-leaf-numbers/[129. Sum Root to Leaf Numbers^]
|{source_base_url}/_0129_SumRootToLeafNumbers.java[Java]
|{doc_base_url}/0129-sum-root-to-leaf-numbers.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/surrounded-regions/[130. Surrounded Regions^]
|{source_base_url}/_0130_SurroundedRegions.java[Java]
|{doc_base_url}/0130-surrounded-regions.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/palindrome-partitioning/[131. Palindrome Partitioning^]
|{source_base_url}/_0131_PalindromePartitioning.java[Java]
|{doc_base_url}/0131-palindrome-partitioning.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/palindrome-partitioning-ii/[132. Palindrome Partitioning II^]
//|{source_base_url}/_0132_PalindromePartitioningII.java[Java]
//|{doc_base_url}/0132-palindrome-partitioning-ii.adoc[题解]
//|Hard
//|
|{counter:codes}
|{leetcode_base_url}/clone-graph/[133. Clone Graph^]
|{source_base_url}/_0133_CloneGraph.java[Java]
|{doc_base_url}/0133-clone-graph.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/gas-station/[134. Gas Station^]
|{source_base_url}/_0134_GasStation.java[Java]
|{doc_base_url}/0134-gas-station.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/candy/[135. Candy^]
|{source_base_url}/_0135_Candy.java[Java]
|{doc_base_url}/0135-candy.adoc[题解]
|Hard
|
|{counter:codes}
|{leetcode_base_url}/single-number/[136. Single Number^]
|{source_base_url}/_0136_SingleNumber.java[Java]
|{doc_base_url}/0136-single-number.adoc[题解]
|Easy
|
|{counter:codes}
|{leetcode_base_url}/single-number-ii/[137. Single Number II^]
|{source_base_url}/_0137_SingleNumberII.java[Java]
|{doc_base_url}/0137-single-number-ii.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/copy-list-with-random-pointer/[138. Copy List with Random Pointer^]
|{source_base_url}/_0138_CopyListWithRandomPointer.java[Java]
|{doc_base_url}/0138-copy-list-with-random-pointer.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/word-break/[139. Word Break^]
|{source_base_url}/_0139_WordBreak.java[Java]
|{doc_base_url}/0139-word-break.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/word-break-ii/[140. Word Break II^]
//|{source_base_url}/_0140_WordBreakII.java[Java]
//|{doc_base_url}/0140-word-break-ii.adoc[题解]
//|Hard
//|
|{counter:codes}
|{leetcode_base_url}/linked-list-cycle/[141. Linked List Cycle^]
|{source_base_url}/_0141_LinkedListCycle.java[Java]
|{doc_base_url}/0141-linked-list-cycle.adoc[题解]
|Easy
|
|{counter:codes}
|{leetcode_base_url}/linked-list-cycle-ii/[142. Linked List Cycle II^]
|{source_base_url}/_0142_LinkedListCycleII.java[Java]
|{doc_base_url}/0142-linked-list-cycle-ii.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/reorder-list/[143. Reorder List^]
//|{source_base_url}/_0143_ReorderList.java[Java]
//|{doc_base_url}/0143-reorder-list.adoc[题解]
//|Medium
//|
|{counter:codes}
|{leetcode_base_url}/binary-tree-preorder-traversal/[144. Binary Tree Preorder Traversal^]
|{source_base_url}/_0144_BinaryTreePreorderTraversal.java[Java]
|{doc_base_url}/0144-binary-tree-preorder-traversal.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/binary-tree-postorder-traversal/[145. Binary Tree Postorder Traversal^]
|{source_base_url}/_0145_BinaryTreePostorderTraversal.java[Java]
|{doc_base_url}/0145-binary-tree-postorder-traversal.adoc[题解]
|Easy
|强化迭代
|{counter:codes}
|{leetcode_base_url}/lru-cache/[146. LRU Cache^]
|{source_base_url}/_0146_LRUCache.java[Java]
|{doc_base_url}/0146-lru-cache.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/insertion-sort-list/[147. Insertion Sort List^]
//|{source_base_url}/_0147_InsertionSortList.java[Java]
//|{doc_base_url}/0147-insertion-sort-list.adoc[题解]
//|Medium
//|
|{counter:codes}
|{leetcode_base_url}/sort-list/[148. Sort List^]
|{source_base_url}/_0148_SortList.java[Java]
|{doc_base_url}/0148-sort-list.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/max-points-on-a-line/[149. Max Points on a Line^]
//|{source_base_url}/_0149_MaxPointsOnALine.java[Java]
//|{doc_base_url}/0149-max-points-on-a-line.adoc[题解]
//|Hard
//|
|{counter:codes}
|{leetcode_base_url}/evaluate-reverse-polish-notation/[150. Evaluate Reverse Polish Notation^]
|{source_base_url}/_0150_EvaluateReversePolishNotation.java[Java]
|{doc_base_url}/0150-evaluate-reverse-polish-notation.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/reverse-words-in-a-string/[151. Reverse Words in a String^]
|{source_base_url}/_0151_ReverseWordsInAString.java[Java]
|{doc_base_url}/0151-reverse-words-in-a-string.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/maximum-product-subarray/[152. Maximum Product Subarray^]
|{source_base_url}/_0152_MaximumProductSubarray.java[Java]
|{doc_base_url}/0152-maximum-product-subarray.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/find-minimum-in-rotated-sorted-array/[153. Find Minimum in Rotated Sorted Array^]
|{source_base_url}/_0153_FindMinimumInRotatedSortedArray.java[Java]
|{doc_base_url}/0153-find-minimum-in-rotated-sorted-array.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/find-minimum-in-rotated-sorted-array-ii/[154. Find Minimum in Rotated Sorted Array II^]
|{source_base_url}/_0154_FindMinimumInRotatedSortedArrayII.java[Java]
|{doc_base_url}/0154-find-minimum-in-rotated-sorted-array-ii.adoc[题解]
|Hard
|
|{counter:codes}
|{leetcode_base_url}/min-stack/[155. Min Stack^]
|{source_base_url}/_0155_MinStack.java[Java]
|{doc_base_url}/0155-min-stack.adoc[题解]
|Easy
|
//|{counter:codes}
//|{leetcode_base_url}/binary-tree-upside-down/[156. Binary Tree Upside Down^]
//|{source_base_url}/_0156_BinaryTreeUpsideDown.java[Java]
//|{doc_base_url}/0156-binary-tree-upside-down.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/read-n-characters-given-read4/[157. Read N Characters Given Read4^]
//|{source_base_url}/_0157_ReadNCharactersGivenRead4.java[Java]
//|{doc_base_url}/0157-read-n-characters-given-read4.adoc[题解]
//|Easy
//|
//
//|{counter:codes}
//|{leetcode_base_url}/read-n-characters-given-read4-ii-call-multiple-times/[158. Read N Characters Given Read4 II - Call multiple times^]
//|{source_base_url}/_0158_ReadNCharactersGivenRead4IICallMultipleTimes.java[Java]
//|{doc_base_url}/0158-read-n-characters-given-read4-ii-call-multiple-times.adoc[题解]
//|Hard
//|
//
//|{counter:codes}
//|{leetcode_base_url}/longest-substring-with-at-most-two-distinct-characters/[159. Longest Substring with At Most Two Distinct Characters^]
//|{source_base_url}/_0159_LongestSubstringWithAtMostTwoDistinctCharacters.java[Java]
//|{doc_base_url}/0159-longest-substring-with-at-most-two-distinct-characters.adoc[题解]
//|Medium
//|
|{counter:codes}
|{leetcode_base_url}/intersection-of-two-linked-lists/[160. Intersection of Two Linked Lists^]
|{source_base_url}/_0160_IntersectionOfTwoLinkedLists.java[Java]
|{doc_base_url}/0160-intersection-of-two-linked-lists.adoc[题解]
|Easy
|
//|{counter:codes}
//|{leetcode_base_url}/one-edit-distance/[161. One Edit Distance^]
//|{source_base_url}/_0161_OneEditDistance.java[Java]
//|{doc_base_url}/0161-one-edit-distance.adoc[题解]
//|Medium
//|
|{counter:codes}
|{leetcode_base_url}/find-peak-element/[162. Find Peak Element^]
|{source_base_url}/_0162_FindPeakElement.java[Java]
|{doc_base_url}/0162-find-peak-element.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/missing-ranges/[163. Missing Ranges^]
//|{source_base_url}/_0163_MissingRanges.java[Java]
//|{doc_base_url}/0163-missing-ranges.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/maximum-gap/[164. Maximum Gap^]
//|{source_base_url}/_0164_MaximumGap.java[Java]
//|{doc_base_url}/0164-maximum-gap.adoc[题解]
//|Hard
//|
//
//|{counter:codes}
//|{leetcode_base_url}/compare-version-numbers/[165. Compare Version Numbers^]
//|{source_base_url}/_0165_CompareVersionNumbers.java[Java]
//|{doc_base_url}/0165-compare-version-numbers.adoc[题解]
//|Medium
//|
|{counter:codes}
|{leetcode_base_url}/fraction-to-recurring-decimal/[166. Fraction to Recurring Decimal^]
|{source_base_url}/_0166_FractionToRecurringDecimal.java[Java]
|{doc_base_url}/0166-fraction-to-recurring-decimal.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/two-sum-ii-input-array-is-sorted/[167. Two Sum II - Input array is sorted^]
|{source_base_url}/_0167_TwoSumIIInputArrayIsSorted.java[Java]
|{doc_base_url}/0167-two-sum-ii-input-array-is-sorted.adoc[题解]
|Easy
|
//|{counter:codes}
//|{leetcode_base_url}/excel-sheet-column-title/[168. Excel Sheet Column Title^]
//|{source_base_url}/_0168_ExcelSheetColumnTitle.java[Java]
//|{doc_base_url}/0168-excel-sheet-column-title.adoc[题解]
//|Easy
//|
|{counter:codes}
|{leetcode_base_url}/majority-element/[169. Majority Element^]
|{source_base_url}/_0169_MajorityElement.java[Java]
|{doc_base_url}/0169-majority-element.adoc[题解]
|Easy
|
//|{counter:codes}
//|{leetcode_base_url}/two-sum-iii-data-structure-design/[170. Two Sum III - Data structure design^]
//|{source_base_url}/_0170_TwoSumIIIDataStructureDesign.java[Java]
//|{doc_base_url}/0170-two-sum-iii-data-structure-design.adoc[题解]
//|Easy
//|
|{counter:codes}
|{leetcode_base_url}/excel-sheet-column-number/[171. Excel Sheet Column Number^]
|{source_base_url}/_0171_ExcelSheetColumnNumber.java[Java]
|{doc_base_url}/0171-excel-sheet-column-number.adoc[题解]
|Easy
|
|{counter:codes}
|{leetcode_base_url}/factorial-trailing-zeroes/[172. Factorial Trailing Zeroes^]
|{source_base_url}/_0172_FactorialTrailingZeroes.java[Java]
|{doc_base_url}/0172-factorial-trailing-zeroes.adoc[题解]
|Easy
|
//|{counter:codes}
//|{leetcode_base_url}/binary-search-tree-iterator/[173. Binary Search Tree Iterator^]
//|{source_base_url}/_0173_BinarySearchTreeIterator.java[Java]
//|{doc_base_url}/0173-binary-search-tree-iterator.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/dungeon-game/[174. Dungeon Game^]
//|{source_base_url}/_0174_DungeonGame.java[Java]
//|{doc_base_url}/0174-dungeon-game.adoc[题解]
//|Hard
//|
|{counter:codes}
|{leetcode_base_url}/combine-two-tables/[175. Combine Two Tables^]
|{source_base_url}/_0175_CombineTwoTables.sql[SQL]
|{doc_base_url}/0175-combine-two-tables.adoc[题解]
|Easy
|
|{counter:codes}
|{leetcode_base_url}/second-highest-salary/[176. Second Highest Salary^]
|{source_base_url}/_0176_SecondHighestSalary.sql[SQL]
|{doc_base_url}/0176-second-highest-salary.adoc[题解]
|Easy
|
//|{counter:codes}
//|{leetcode_base_url}/nth-highest-salary/[177. Nth Highest Salary^]
//|{source_base_url}/_0177_NthHighestSalary.java[Java]
//|{doc_base_url}/0177-nth-highest-salary.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/rank-scores/[178. Rank Scores^]
//|{source_base_url}/_0178_RankScores.java[Java]
//|{doc_base_url}/0178-rank-scores.adoc[题解]
//|Medium
//|
|{counter:codes}
|{leetcode_base_url}/largest-number/[179. Largest Number^]
|{source_base_url}/_0179_LargestNumber.java[Java]
|{doc_base_url}/0179-largest-number.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/consecutive-numbers/[180. Consecutive Numbers^]
//|{source_base_url}/_0180_ConsecutiveNumbers.java[Java]
//|{doc_base_url}/0180-consecutive-numbers.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/employees-earning-more-than-their-managers/[181. Employees Earning More Than Their Managers^]
//|{source_base_url}/_0181_EmployeesEarningMoreThanTheirManagers.java[Java]
//|{doc_base_url}/0181-employees-earning-more-than-their-managers.adoc[题解]
//|Easy
//|
//
//|{counter:codes}
//|{leetcode_base_url}/duplicate-emails/[182. Duplicate Emails^]
//|{source_base_url}/_0182_DuplicateEmails.java[Java]
//|{doc_base_url}/0182-duplicate-emails.adoc[题解]
//|Easy
//|
//
//|{counter:codes}
//|{leetcode_base_url}/customers-who-never-order/[183. Customers Who Never Order^]
//|{source_base_url}/_0183_CustomersWhoNeverOrder.java[Java]
//|{doc_base_url}/0183-customers-who-never-order.adoc[题解]
//|Easy
//|
//
//|{counter:codes}
//|{leetcode_base_url}/department-highest-salary/[184. Department Highest Salary^]
//|{source_base_url}/_0184_DepartmentHighestSalary.java[Java]
//|{doc_base_url}/0184-department-highest-salary.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/department-top-three-salaries/[185. Department Top Three Salaries^]
//|{source_base_url}/_0185_DepartmentTopThreeSalaries.java[Java]
//|{doc_base_url}/0185-department-top-three-salaries.adoc[题解]
//|Hard
//|
//
//|{counter:codes}
//|{leetcode_base_url}/reverse-words-in-a-string-ii/[186. Reverse Words in a String II^]
//|{source_base_url}/_0186_ReverseWordsInAStringII.java[Java]
//|{doc_base_url}/0186-reverse-words-in-a-string-ii.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/repeated-dna-sequences/[187. Repeated DNA Sequences^]
//|{source_base_url}/_0187_RepeatedDNASequences.java[Java]
//|{doc_base_url}/0187-repeated-dna-sequences.adoc[题解]
//|Medium
//|
|{counter:codes}
|{leetcode_base_url}/best-time-to-buy-and-sell-stock-iv/[188. Best Time to Buy and Sell Stock IV^]
|{source_base_url}/_0188_BestTimeToBuyAndSellStockIV.java[Java]
|{doc_base_url}/0188-best-time-to-buy-and-sell-stock-iv.adoc[题解]
|Hard
|
|{counter:codes}
|{leetcode_base_url}/rotate-array/[189. Rotate Array^]
|{source_base_url}/_0189_RotateArray.java[Java]
|{doc_base_url}/0189-rotate-array.adoc[题解]
|Easy
|
|{counter:codes}
|{leetcode_base_url}/reverse-bits/[190. Reverse Bits^]
|{source_base_url}/_0190_ReverseBits.java[Java]
|{doc_base_url}/0190-reverse-bits.adoc[题解]
|Easy
|
|{counter:codes}
|{leetcode_base_url}/number-of-1-bits/[191. Number of 1 Bits^]
|{source_base_url}/_0191_NumberOf1Bits.java[Java]
|{doc_base_url}/0191-number-of-1-bits.adoc[题解]
|Easy
|
//|{counter:codes}
//|{leetcode_base_url}/word-frequency/[192. Word Frequency^]
//|{source_base_url}/_0192_WordFrequency.java[Java]
//|{doc_base_url}/0192-word-frequency.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/valid-phone-numbers/[193. Valid Phone Numbers^]
//|{source_base_url}/_0193_ValidPhoneNumbers.java[Java]
//|{doc_base_url}/0193-valid-phone-numbers.adoc[题解]
//|Easy
//|
//
//|{counter:codes}
//|{leetcode_base_url}/transpose-file/[194. Transpose File^]
//|{source_base_url}/_0194_TransposeFile.java[Java]
//|{doc_base_url}/0194-transpose-file.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/tenth-line/[195. Tenth Line^]
//|{source_base_url}/_0195_TenthLine.java[Java]
//|{doc_base_url}/0195-tenth-line.adoc[题解]
//|Easy
//|
//
//|{counter:codes}
//|{leetcode_base_url}/delete-duplicate-emails/[196. Delete Duplicate Emails^]
//|{source_base_url}/_0196_DeleteDuplicateEmails.java[Java]
//|{doc_base_url}/0196-delete-duplicate-emails.adoc[题解]
//|Easy
//|
//
//|{counter:codes}
//|{leetcode_base_url}/rising-temperature/[197. Rising Temperature^]
//|{source_base_url}/_0197_RisingTemperature.java[Java]
//|{doc_base_url}/0197-rising-temperature.adoc[题解]
//|Easy
//|
|{counter:codes}
|{leetcode_base_url}/house-robber/[198. House Robber^]
|{source_base_url}/_0198_HouseRobber.java[Java]
|{doc_base_url}/0198-house-robber.adoc[题解]
|Easy
|
|{counter:codes}
|{leetcode_base_url}/binary-tree-right-side-view/[199. Binary Tree Right Side View^]
|{source_base_url}/_0199_BinaryTreeRightSideView.java[Java]
|{doc_base_url}/0199-binary-tree-right-side-view.adoc[题解]
|Medium
|递归+DFS解法有意思
|{counter:codes}
|{leetcode_base_url}/number-of-islands/[200. Number of Islands^]
|{source_base_url}/_0200_NumberOfIslands.java[Java]
|{doc_base_url}/0200-number-of-islands.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/bitwise-and-of-numbers-range/[201. Bitwise AND of Numbers Range^]
//|{source_base_url}/_0201_BitwiseANDOfNumbersRange.java[Java]
//|{doc_base_url}/0201-bitwise-and-of-numbers-range.adoc[题解]
//|Medium
//|
|{counter:codes}
|{leetcode_base_url}/happy-number/[202. Happy Number^]
|{source_base_url}/_0202_HappyNumber.java[Java]
|{doc_base_url}/0202-happy-number.adoc[题解]
|Easy
|
//|{counter:codes}
//|{leetcode_base_url}/remove-linked-list-elements/[203. Remove Linked List Elements^]
//|{source_base_url}/_0203_RemoveLinkedListElements.java[Java]
//|{doc_base_url}/0203-remove-linked-list-elements.adoc[题解]
//|Easy
//|
|{counter:codes}
|{leetcode_base_url}/count-primes/[204. Count Primes^]
|{source_base_url}/_0204_CountPrimes.java[Java]
|{doc_base_url}/0204-count-primes.adoc[题解]
|Easy
|
|{counter:codes}
|{leetcode_base_url}/isomorphic-strings/[205. Isomorphic Strings^]
|{source_base_url}/_0205_IsomorphicStrings.java[Java]
|{doc_base_url}/0205-isomorphic-strings.adoc[题解]
|Easy
|
|{counter:codes}
|{leetcode_base_url}/reverse-linked-list/[206. Reverse Linked List^]
|{source_base_url}/_0206_ReverseLinkedList.java[Java]
|{doc_base_url}/0206-reverse-linked-list.adoc[题解]
|Easy
|
|{counter:codes}
|{leetcode_base_url}/course-schedule/[207. Course Schedule^]
|{source_base_url}/_0207_CourseSchedule.java[Java]
|{doc_base_url}/0207-course-schedule.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/implement-trie-prefix-tree/[208. Implement Trie (Prefix Tree)^]
|{source_base_url}/_0208_ImplementTriePrefixTree.java[Java]
|{doc_base_url}/0208-implement-trie-prefix-tree.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/minimum-size-subarray-sum/[209. Minimum Size Subarray Sum^]
//|{source_base_url}/_0209_MinimumSizeSubarraySum.java[Java]
//|{doc_base_url}/0209-minimum-size-subarray-sum.adoc[题解]
//|Medium
//|
|{counter:codes}
|{leetcode_base_url}/course-schedule-ii/[210. Course Schedule II^]
|{source_base_url}/_0210_CourseScheduleII.java[Java]
|{doc_base_url}/0210-course-schedule-ii.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/add-and-search-word-data-structure-design/[211. Add and Search Word - Data structure design^]
//|{source_base_url}/_0211_AddAndSearchWordDataStructureDesign.java[Java]
//|{doc_base_url}/0211-add-and-search-word-data-structure-design.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/word-search-ii/[212. Word Search II^]
//|{source_base_url}/_0212_WordSearchII.java[Java]
//|{doc_base_url}/0212-word-search-ii.adoc[题解]
//|Hard
//|
//
//|{counter:codes}
//|{leetcode_base_url}/house-robber-ii/[213. House Robber II^]
//|{source_base_url}/_0213_HouseRobberII.java[Java]
//|{doc_base_url}/0213-house-robber-ii.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/shortest-palindrome/[214. Shortest Palindrome^]
//|{source_base_url}/_0214_ShortestPalindrome.java[Java]
//|{doc_base_url}/0214-shortest-palindrome.adoc[题解]
//|Hard
//|
|{counter:codes}
|{leetcode_base_url}/kth-largest-element-in-an-array/[215. Kth Largest Element in an Array^]
|{source_base_url}/_0215_KthLargestElementInAnArray.java[Java]
|{doc_base_url}/0215-kth-largest-element-in-an-array.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/combination-sum-iii/[216. Combination Sum III^]
//|{source_base_url}/_0216_CombinationSumIII.java[Java]
//|{doc_base_url}/0216-combination-sum-iii.adoc[题解]
//|Medium
//|
|{counter:codes}
|{leetcode_base_url}/contains-duplicate/[217. Contains Duplicate^]
|{source_base_url}/_0217_ContainsDuplicate.java[Java]
|{doc_base_url}/0217-contains-duplicate.adoc[题解]
|Easy
|
//|{counter:codes}
//|{leetcode_base_url}/the-skyline-problem/[218. The Skyline Problem^]
//|{source_base_url}/_0218_TheSkylineProblem.java[Java]
//|{doc_base_url}/0218-the-skyline-problem.adoc[题解]
//|Hard
//|
//
//|{counter:codes}
//|{leetcode_base_url}/contains-duplicate-ii/[219. Contains Duplicate II^]
//|{source_base_url}/_0219_ContainsDuplicateII.java[Java]
//|{doc_base_url}/0219-contains-duplicate-ii.adoc[题解]
//|Easy
//|
//
//|{counter:codes}
//|{leetcode_base_url}/contains-duplicate-iii/[220. Contains Duplicate III^]
//|{source_base_url}/_0220_ContainsDuplicateIII.java[Java]
//|{doc_base_url}/0220-contains-duplicate-iii.adoc[题解]
//|Medium
//|
|{counter:codes}
|{leetcode_base_url}/maximal-square/[221. Maximal Square^]
|{source_base_url}/_0221_MaximalSquare.java[Java]
|{doc_base_url}/0221-maximal-square.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/count-complete-tree-nodes/[222. Count Complete Tree Nodes^]
|{source_base_url}/_0222_CountCompleteTreeNodes.java[Java]
|{doc_base_url}/0222-count-complete-tree-nodes.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/rectangle-area/[223. Rectangle Area^]
//|{source_base_url}/_0223_RectangleArea.java[Java]
//|{doc_base_url}/0223-rectangle-area.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/basic-calculator/[224. Basic Calculator^]
//|{source_base_url}/_0224_BasicCalculator.java[Java]
//|{doc_base_url}/0224-basic-calculator.adoc[题解]
//|Hard
//|
//
//|{counter:codes}
//|{leetcode_base_url}/implement-stack-using-queues/[225. Implement Stack using Queues^]
//|{source_base_url}/_0225_ImplementStackUsingQueues.java[Java]
//|{doc_base_url}/0225-implement-stack-using-queues.adoc[题解]
//|Easy
//|
|{counter:codes}
|{leetcode_base_url}/invert-binary-tree/[226. Invert Binary Tree^]
|{source_base_url}/_0226_InvertBinaryTree.java[Java]
|{doc_base_url}/0226-invert-binary-tree.adoc[题解]
|Easy
|
|{counter:codes}
|{leetcode_base_url}/basic-calculator-ii/[227. Basic Calculator II^]
|{source_base_url}/_0227_BasicCalculatorIi.java[Java]
|{doc_base_url}/0227-basic-calculator-ii.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/summary-ranges/[228. Summary Ranges^]
//|{source_base_url}/_0228_SummaryRanges.java[Java]
//|{doc_base_url}/0228-summary-ranges.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/majority-element-ii/[229. Majority Element II^]
//|{source_base_url}/_0229_MajorityElementII.java[Java]
//|{doc_base_url}/0229-majority-element-ii.adoc[题解]
//|Medium
//|
|{counter:codes}
|{leetcode_base_url}/kth-smallest-element-in-a-bst/[230. Kth Smallest Element in a BST^]
|{source_base_url}/_0230_KthSmallestElementInABst.java[Java]
|{doc_base_url}/0230-kth-smallest-element-in-a-bst.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/power-of-two/[231. Power of Two^]
|{source_base_url}/_0231_PowerOfTwo.java[Java]
|{doc_base_url}/0231-power-of-two.adoc[题解]
|Easy
|
|{counter:codes}
|{leetcode_base_url}/implement-queue-using-stacks/[232. Implement Queue using Stacks^]
|{source_base_url}/_0232_ImplementQueueUsingStacks.java[Java]
|{doc_base_url}/0232-implement-queue-using-stacks.adoc[题解]
|Easy
|
//|{counter:codes}
//|{leetcode_base_url}/number-of-digit-one/[233. Number of Digit One^]
//|{source_base_url}/_0233_NumberOfDigitOne.java[Java]
//|{doc_base_url}/0233-number-of-digit-one.adoc[题解]
//|Hard
//|
|{counter:codes}
|{leetcode_base_url}/palindrome-linked-list/[234. Palindrome Linked List^]
|{source_base_url}/_0234_PalindromeLinkedList.java[Java]
|{doc_base_url}/0234-palindrome-linked-list.adoc[题解]
|Easy
|
|{counter:codes}
|{leetcode_base_url}/lowest-common-ancestor-of-a-binary-search-tree/[235. Lowest Common Ancestor of a Binary Search Tree^]
|{source_base_url}/_0235_LowestCommonAncestorOfABinarySearchTree.java[Java]
|{doc_base_url}/0235-lowest-common-ancestor-of-a-binary-search-tree.adoc[题解]
|Easy
|二叉搜索树左大右小的特性
|{counter:codes}
|{leetcode_base_url}/lowest-common-ancestor-of-a-binary-tree/[236. Lowest Common Ancestor of a Binary Tree^]
|{source_base_url}/_0236_LowestCommonAncestorOfABinaryTree.java[Java]
|{doc_base_url}/0236-lowest-common-ancestor-of-a-binary-tree.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/delete-node-in-a-linked-list/[237. Delete Node in a Linked List^]
|{source_base_url}/_0237_DeleteNodeInALinkedList.java[Java]
|{doc_base_url}/0237-delete-node-in-a-linked-list.adoc[题解]
|Easy
|
|{counter:codes}
|{leetcode_base_url}/product-of-array-except-self/[238. Product of Array Except Self^]
|{source_base_url}/_0238_ProductOfArrayExceptSelf.java[Java]
|{doc_base_url}/0238-product-of-array-except-self.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/sliding-window-maximum/[239. Sliding Window Maximum^]
|{source_base_url}/_0239_SlidingWindowMaximum.java[Java]
|{doc_base_url}/0239-sliding-window-maximum.adoc[题解]
|Hard
|
|{counter:codes}
|{leetcode_base_url}/search-a-2d-matrix-ii/[240. Search a 2D Matrix II^]
|{source_base_url}/_0240_SearchA2DMatrixII.java[Java]
|{doc_base_url}/0240-search-a-2d-matrix-ii.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/different-ways-to-add-parentheses/[241. Different Ways to Add Parentheses^]
//|{source_base_url}/_0241_DifferentWaysToAddParentheses.java[Java]
//|{doc_base_url}/0241-different-ways-to-add-parentheses.adoc[题解]
//|Medium
//|
|{counter:codes}
|{leetcode_base_url}/valid-anagram/[242. Valid Anagram^]
|{source_base_url}/_0242_ValidAnagram.java[Java]
|{doc_base_url}/0242-valid-anagram.adoc[题解]
|Easy
|
//|{counter:codes}
//|{leetcode_base_url}/shortest-word-distance/[243. Shortest Word Distance^]
//|{source_base_url}/_0243_ShortestWordDistance.java[Java]
//|{doc_base_url}/0243-shortest-word-distance.adoc[题解]
//|Easy
//|
//
//|{counter:codes}
//|{leetcode_base_url}/shortest-word-distance-ii/[244. Shortest Word Distance II^]
//|{source_base_url}/_0244_ShortestWordDistanceII.java[Java]
//|{doc_base_url}/0244-shortest-word-distance-ii.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/shortest-word-distance-iii/[245. Shortest Word Distance III^]
//|{source_base_url}/_0245_ShortestWordDistanceIII.java[Java]
//|{doc_base_url}/0245-shortest-word-distance-iii.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/strobogrammatic-number/[246. Strobogrammatic Number^]
//|{source_base_url}/_0246_StrobogrammaticNumber.java[Java]
//|{doc_base_url}/0246-strobogrammatic-number.adoc[题解]
//|Easy
//|
//
//|{counter:codes}
//|{leetcode_base_url}/strobogrammatic-number-ii/[247. Strobogrammatic Number II^]
//|{source_base_url}/_0247_StrobogrammaticNumberII.java[Java]
//|{doc_base_url}/0247-strobogrammatic-number-ii.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/strobogrammatic-number-iii/[248. Strobogrammatic Number III^]
//|{source_base_url}/_0248_StrobogrammaticNumberIII.java[Java]
//|{doc_base_url}/0248-strobogrammatic-number-iii.adoc[题解]
//|Hard
//|
//
//|{counter:codes}
//|{leetcode_base_url}/group-shifted-strings/[249. Group Shifted Strings^]
//|{source_base_url}/_0249_GroupShiftedStrings.java[Java]
//|{doc_base_url}/0249-group-shifted-strings.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/count-univalue-subtrees/[250. Count Univalue Subtrees^]
//|{source_base_url}/_0250_CountUnivalueSubtrees.java[Java]
//|{doc_base_url}/0250-count-univalue-subtrees.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/flatten-2d-vector/[251. Flatten 2D Vector^]
//|{source_base_url}/_0251_Flatten2DVector.java[Java]
//|{doc_base_url}/0251-flatten-2d-vector.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/meeting-rooms/[252. Meeting Rooms^]
//|{source_base_url}/_0252_MeetingRooms.java[Java]
//|{doc_base_url}/0252-meeting-rooms.adoc[题解]
//|Easy
//|
//
//|{counter:codes}
//|{leetcode_base_url}/meeting-rooms-ii/[253. Meeting Rooms II^]
//|{source_base_url}/_0253_MeetingRoomsII.java[Java]
//|{doc_base_url}/0253-meeting-rooms-ii.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/factor-combinations/[254. Factor Combinations^]
//|{source_base_url}/_0254_FactorCombinations.java[Java]
//|{doc_base_url}/0254-factor-combinations.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/verify-preorder-sequence-in-binary-search-tree/[255. Verify Preorder Sequence in Binary Search Tree^]
//|{source_base_url}/_0255_VerifyPreorderSequenceInBinarySearchTree.java[Java]
//|{doc_base_url}/0255-verify-preorder-sequence-in-binary-search-tree.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/paint-house/[256. Paint House^]
//|{source_base_url}/_0256_PaintHouse.java[Java]
//|{doc_base_url}/0256-paint-house.adoc[题解]
//|Easy
//|
|{counter:codes}
|{leetcode_base_url}/binary-tree-paths/[257. Binary Tree Paths^]
|{source_base_url}/_0257_BinaryTreePaths.java[Java]
|{doc_base_url}/0257-binary-tree-paths.adoc[题解]
|Easy
|
//|{counter:codes}
//|{leetcode_base_url}/add-digits/[258. Add Digits^]
//|{source_base_url}/_0258_AddDigits.java[Java]
//|{doc_base_url}/0258-add-digits.adoc[题解]
//|Easy
//|
//
//|{counter:codes}
//|{leetcode_base_url}/3sum-smaller/[259. 3Sum Smaller^]
//|{source_base_url}/_0259_3SumSmaller.java[Java]
//|{doc_base_url}/0259-3sum-smaller.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/single-number-iii/[260. Single Number III^]
//|{source_base_url}/_0260_SingleNumberIII.java[Java]
//|{doc_base_url}/0260-single-number-iii.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/graph-valid-tree/[261. Graph Valid Tree^]
//|{source_base_url}/_0261_GraphValidTree.java[Java]
//|{doc_base_url}/0261-graph-valid-tree.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/trips-and-users/[262. Trips and Users^]
//|{source_base_url}/_0262_TripsAndUsers.java[Java]
//|{doc_base_url}/0262-trips-and-users.adoc[题解]
//|Hard
//|
//
//|{counter:codes}
//|{leetcode_base_url}/ugly-number/[263. Ugly Number^]
//|{source_base_url}/_0263_UglyNumber.java[Java]
//|{doc_base_url}/0263-ugly-number.adoc[题解]
//|Easy
//|
//
//|{counter:codes}
//|{leetcode_base_url}/ugly-number-ii/[264. Ugly Number II^]
//|{source_base_url}/_0264_UglyNumberII.java[Java]
//|{doc_base_url}/0264-ugly-number-ii.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/paint-house-ii/[265. Paint House II^]
//|{source_base_url}/_0265_PaintHouseII.java[Java]
//|{doc_base_url}/0265-paint-house-ii.adoc[题解]
//|Hard
//|
//
//|{counter:codes}
//|{leetcode_base_url}/palindrome-permutation/[266. Palindrome Permutation^]
//|{source_base_url}/_0266_PalindromePermutation.java[Java]
//|{doc_base_url}/0266-palindrome-permutation.adoc[题解]
//|Easy
//|
//
//|{counter:codes}
//|{leetcode_base_url}/palindrome-permutation-ii/[267. Palindrome Permutation II^]
//|{source_base_url}/_0267_PalindromePermutationII.java[Java]
//|{doc_base_url}/0267-palindrome-permutation-ii.adoc[题解]
//|Medium
//|
|{counter:codes}
|{leetcode_base_url}/missing-number/[268. Missing Number^]
|{source_base_url}/_0268_MissingNumber.java[Java]
|{doc_base_url}/0268-missing-number.adoc[题解]
|Easy
|
//|{counter:codes}
//|{leetcode_base_url}/alien-dictionary/[269. Alien Dictionary^]
//|{source_base_url}/_0269_AlienDictionary.java[Java]
//|{doc_base_url}/0269-alien-dictionary.adoc[题解]
//|Hard
//|
//
//|{counter:codes}
//|{leetcode_base_url}/closest-binary-search-tree-value/[270. Closest Binary Search Tree Value^]
//|{source_base_url}/_0270_ClosestBinarySearchTreeValue.java[Java]
//|{doc_base_url}/0270-closest-binary-search-tree-value.adoc[题解]
//|Easy
//|
//
//|{counter:codes}
//|{leetcode_base_url}/encode-and-decode-strings/[271. Encode and Decode Strings^]
//|{source_base_url}/_0271_EncodeAndDecodeStrings.java[Java]
//|{doc_base_url}/0271-encode-and-decode-strings.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/closest-binary-search-tree-value-ii/[272. Closest Binary Search Tree Value II^]
//|{source_base_url}/_0272_ClosestBinarySearchTreeValueII.java[Java]
//|{doc_base_url}/0272-closest-binary-search-tree-value-ii.adoc[题解]
//|Hard
//|
//
//|{counter:codes}
//|{leetcode_base_url}/integer-to-english-words/[273. Integer to English Words^]
//|{source_base_url}/_0273_IntegerToEnglishWords.java[Java]
//|{doc_base_url}/0273-integer-to-english-words.adoc[题解]
//|Hard
//|
//
//|{counter:codes}
//|{leetcode_base_url}/h-index/[274. H-Index^]
//|{source_base_url}/_0274_HIndex.java[Java]
//|{doc_base_url}/0274-h-index.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/h-index-ii/[275. H-Index II^]
//|{source_base_url}/_0275_HIndexII.java[Java]
//|{doc_base_url}/0275-h-index-ii.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/paint-fence/[276. Paint Fence^]
//|{source_base_url}/_0276_PaintFence.java[Java]
//|{doc_base_url}/0276-paint-fence.adoc[题解]
//|Easy
//|
//
//|{counter:codes}
//|{leetcode_base_url}/find-the-celebrity/[277. Find the Celebrity^]
//|{source_base_url}/_0277_FindTheCelebrity.java[Java]
//|{doc_base_url}/0277-find-the-celebrity.adoc[题解]
//|Medium
//|
|{counter:codes}
|{leetcode_base_url}/first-bad-version/[278. First Bad Version^]
|{source_base_url}/_0278_FirstBadVersion.java[Java]
|{doc_base_url}/0278-first-bad-version.adoc[题解]
|Easy
|
|{counter:codes}
|{leetcode_base_url}/perfect-squares/[279. Perfect Squares^]
|{source_base_url}/_0279_PerfectSquares.java[Java]
|{doc_base_url}/0279-perfect-squares.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/wiggle-sort/[280. Wiggle Sort^]
//|{source_base_url}/_0280_WiggleSort.java[Java]
//|{doc_base_url}/0280-wiggle-sort.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/zigzag-iterator/[281. Zigzag Iterator^]
//|{source_base_url}/_0281_ZigzagIterator.java[Java]
//|{doc_base_url}/0281-zigzag-iterator.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/expression-add-operators/[282. Expression Add Operators^]
//|{source_base_url}/_0282_ExpressionAddOperators.java[Java]
//|{doc_base_url}/0282-expression-add-operators.adoc[题解]
//|Hard
//|
|{counter:codes}
|{leetcode_base_url}/move-zeroes/[283. Move Zeroes^]
|{source_base_url}/_0283_MoveZeroes.java[Java]
|{doc_base_url}/0283-move-zeroes.adoc[题解]
|Easy
|
//|{counter:codes}
//|{leetcode_base_url}/peeking-iterator/[284. Peeking Iterator^]
//|{source_base_url}/_0284_PeekingIterator.java[Java]
//|{doc_base_url}/0284-peeking-iterator.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/inorder-successor-in-bst/[285. Inorder Successor in BST^]
//|{source_base_url}/_0285_InorderSuccessorInBST.java[Java]
//|{doc_base_url}/0285-inorder-successor-in-bst.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/walls-and-gates/[286. Walls and Gates^]
//|{source_base_url}/_0286_WallsAndGates.java[Java]
//|{doc_base_url}/0286-walls-and-gates.adoc[题解]
//|Medium
//|
|{counter:codes}
|{leetcode_base_url}/find-the-duplicate-number/[287. Find the Duplicate Number^]
|{source_base_url}/_0287_FindTheDuplicateNumber.java[Java]
|{doc_base_url}/0287-find-the-duplicate-number.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/unique-word-abbreviation/[288. Unique Word Abbreviation^]
//|{source_base_url}/_0288_UniqueWordAbbreviation.java[Java]
//|{doc_base_url}/0288-unique-word-abbreviation.adoc[题解]
//|Medium
//|
|{counter:codes}
|{leetcode_base_url}/game-of-life/[289. Game of Life^]
|{source_base_url}/_0289_GameOfLife.java[Java]
|{doc_base_url}/0289-game-of-life.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/word-pattern/[290. Word Pattern^]
//|{source_base_url}/_0290_WordPattern.java[Java]
//|{doc_base_url}/0290-word-pattern.adoc[题解]
//|Easy
//|
//
//|{counter:codes}
//|{leetcode_base_url}/word-pattern-ii/[291. Word Pattern II^]
//|{source_base_url}/_0291_WordPatternII.java[Java]
//|{doc_base_url}/0291-word-pattern-ii.adoc[题解]
//|Hard
//|
//
//|{counter:codes}
//|{leetcode_base_url}/nim-game/[292. Nim Game^]
//|{source_base_url}/_0292_NimGame.java[Java]
//|{doc_base_url}/0292-nim-game.adoc[题解]
//|Easy
//|
//
//|{counter:codes}
//|{leetcode_base_url}/flip-game/[293. Flip Game^]
//|{source_base_url}/_0293_FlipGame.java[Java]
//|{doc_base_url}/0293-flip-game.adoc[题解]
//|Easy
//|
//
//|{counter:codes}
//|{leetcode_base_url}/flip-game-ii/[294. Flip Game II^]
//|{source_base_url}/_0294_FlipGameII.java[Java]
//|{doc_base_url}/0294-flip-game-ii.adoc[题解]
//|Medium
//|
|{counter:codes}
|{leetcode_base_url}/find-median-from-data-stream/[295. Find Median from Data Stream^]
|{source_base_url}/_0295_FindMedianFromDataStream.java[Java]
|{doc_base_url}/0295-find-median-from-data-stream.adoc[题解]
|Hard
|
//|{counter:codes}
//|{leetcode_base_url}/best-meeting-point/[296. Best Meeting Point^]
//|{source_base_url}/_0296_BestMeetingPoint.java[Java]
//|{doc_base_url}/0296-best-meeting-point.adoc[题解]
//|Hard
//|
|{counter:codes}
|{leetcode_base_url}/serialize-and-deserialize-binary-tree/[297. Serialize and Deserialize Binary Tree^]
|{source_base_url}/_0297_SerializeAndDeserializeBinaryTree.java[Java]
|{doc_base_url}/0297-serialize-and-deserialize-binary-tree.adoc[题解]
|Hard
|注意思维误区！
//|{counter:codes}
//|{leetcode_base_url}/binary-tree-longest-consecutive-sequence/[298. Binary Tree Longest Consecutive Sequence^]
//|{source_base_url}/_0298_BinaryTreeLongestConsecutiveSequence.java[Java]
//|{doc_base_url}/0298-binary-tree-longest-consecutive-sequence.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/bulls-and-cows/[299. Bulls and Cows^]
//|{source_base_url}/_0299_BullsAndCows.java[Java]
//|{doc_base_url}/0299-bulls-and-cows.adoc[题解]
//|Easy
//|
|{counter:codes}
|{leetcode_base_url}/longest-increasing-subsequence/[300. Longest Increasing Subsequence^]
|{source_base_url}/_0300_LongestIncreasingSubsequence.java[Java]
|{doc_base_url}/0300-longest-increasing-subsequence.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/remove-invalid-parentheses/[301. Remove Invalid Parentheses^]
//|{source_base_url}/_0301_RemoveInvalidParentheses.java[Java]
//|{doc_base_url}/0301-remove-invalid-parentheses.adoc[题解]
//|Hard
//|
//
//|{counter:codes}
//|{leetcode_base_url}/smallest-rectangle-enclosing-black-pixels/[302. Smallest Rectangle Enclosing Black Pixels^]
//|{source_base_url}/_0302_SmallestRectangleEnclosingBlackPixels.java[Java]
//|{doc_base_url}/0302-smallest-rectangle-enclosing-black-pixels.adoc[题解]
//|Hard
//|
|{counter:codes}
|{leetcode_base_url}/range-sum-query-immutable/[303. Range Sum Query - Immutable^]
|{source_base_url}/_0303_RangeSumQueryImmutable.java[Java]
|{doc_base_url}/0303-range-sum-query-immutable.adoc[题解]
|Easy
|
|{counter:codes}
|{leetcode_base_url}/range-sum-query-2d-immutable/[304. Range Sum Query 2D - Immutable^]
|{source_base_url}/_0304_RangeSumQuery2DImmutable.java[Java]
|{doc_base_url}/0304-range-sum-query-2d-immutable.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/number-of-islands-ii/[305. Number of Islands II^]
//|{source_base_url}/_0305_NumberOfIslandsII.java[Java]
//|{doc_base_url}/0305-number-of-islands-ii.adoc[题解]
//|Hard
//|
//
//|{counter:codes}
//|{leetcode_base_url}/additive-number/[306. Additive Number^]
//|{source_base_url}/_0306_AdditiveNumber.java[Java]
//|{doc_base_url}/0306-additive-number.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/range-sum-query-mutable/[307. Range Sum Query - Mutable^]
//|{source_base_url}/_0307_RangeSumQueryMutable.java[Java]
//|{doc_base_url}/0307-range-sum-query-mutable.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/range-sum-query-2d-mutable/[308. Range Sum Query 2D - Mutable^]
//|{source_base_url}/_0308_RangeSumQuery2DMutable.java[Java]
//|{doc_base_url}/0308-range-sum-query-2d-mutable.adoc[题解]
//|Hard
//|
|{counter:codes}
|{leetcode_base_url}/best-time-to-buy-and-sell-stock-with-cooldown/[309. Best Time to Buy and Sell Stock with Cooldown^]
|{source_base_url}/_0309_BestTimeToBuyAndSellStockWithCooldown.java[Java]
|{doc_base_url}/0309-best-time-to-buy-and-sell-stock-with-cooldown.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/minimum-height-trees/[310. Minimum Height Trees^]
//|{source_base_url}/_0310_MinimumHeightTrees.java[Java]
//|{doc_base_url}/0310-minimum-height-trees.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/sparse-matrix-multiplication/[311. Sparse Matrix Multiplication^]
//|{source_base_url}/_0311_SparseMatrixMultiplication.java[Java]
//|{doc_base_url}/0311-sparse-matrix-multiplication.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/burst-balloons/[312. Burst Balloons^]
//|{source_base_url}/_0312_BurstBalloons.java[Java]
//|{doc_base_url}/0312-burst-balloons.adoc[题解]
//|Hard
//|
//
//|{counter:codes}
//|{leetcode_base_url}/super-ugly-number/[313. Super Ugly Number^]
//|{source_base_url}/_0313_SuperUglyNumber.java[Java]
//|{doc_base_url}/0313-super-ugly-number.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/binary-tree-vertical-order-traversal/[314. Binary Tree Vertical Order Traversal^]
//|{source_base_url}/_0314_BinaryTreeVerticalOrderTraversal.java[Java]
//|{doc_base_url}/0314-binary-tree-vertical-order-traversal.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/count-of-smaller-numbers-after-self/[315. Count of Smaller Numbers After Self^]
//|{source_base_url}/_0315_CountOfSmallerNumbersAfterSelf.java[Java]
//|{doc_base_url}/0315-count-of-smaller-numbers-after-self.adoc[题解]
//|Hard
//|
|{counter:codes}
|{leetcode_base_url}/remove-duplicate-letters/[316. Remove Duplicate Letters^]
|{source_base_url}/_0316_RemoveDuplicateLetters.java[Java]
|{doc_base_url}/0316-remove-duplicate-letters.adoc[题解]
|Hard
|
//|{counter:codes}
//|{leetcode_base_url}/shortest-distance-from-all-buildings/[317. Shortest Distance from All Buildings^]
//|{source_base_url}/_0317_ShortestDistanceFromAllBuildings.java[Java]
//|{doc_base_url}/0317-shortest-distance-from-all-buildings.adoc[题解]
//|Hard
//|
//
//|{counter:codes}
//|{leetcode_base_url}/maximum-product-of-word-lengths/[318. Maximum Product of Word Lengths^]
//|{source_base_url}/_0318_MaximumProductOfWordLengths.java[Java]
//|{doc_base_url}/0318-maximum-product-of-word-lengths.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/bulb-switcher/[319. Bulb Switcher^]
//|{source_base_url}/_0319_BulbSwitcher.java[Java]
//|{doc_base_url}/0319-bulb-switcher.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/generalized-abbreviation/[320. Generalized Abbreviation^]
//|{source_base_url}/_0320_GeneralizedAbbreviation.java[Java]
//|{doc_base_url}/0320-generalized-abbreviation.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/create-maximum-number/[321. Create Maximum Number^]
//|{source_base_url}/_0321_CreateMaximumNumber.java[Java]
//|{doc_base_url}/0321-create-maximum-number.adoc[题解]
//|Hard
//|
|{counter:codes}
|{leetcode_base_url}/coin-change/[322. Coin Change^]
|{source_base_url}/_0322_CoinChange.java[Java]
|{doc_base_url}/0322-coin-change.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/number-of-connected-components-in-an-undirected-graph/[323. Number of Connected Components in an Undirected Graph^]
//|{source_base_url}/_0323_NumberOfConnectedComponentsInAnUndirectedGraph.java[Java]
//|{doc_base_url}/0323-number-of-connected-components-in-an-undirected-graph.adoc[题解]
//|Medium
//|
|{counter:codes}
|{leetcode_base_url}/wiggle-sort-ii/[324. Wiggle Sort II^]
|{source_base_url}/_0324_WiggleSortII.java[Java]
|{doc_base_url}/0324-wiggle-sort-ii.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/maximum-size-subarray-sum-equals-k/[325. Maximum Size Subarray Sum Equals k^]
//|{source_base_url}/_0325_MaximumSizeSubarraySumEqualsK.java[Java]
//|{doc_base_url}/0325-maximum-size-subarray-sum-equals-k.adoc[题解]
//|Medium
//|
|{counter:codes}
|{leetcode_base_url}/power-of-three/[326. Power of Three^]
|{source_base_url}/_0326_PowerOfThree.java[Java]
|{doc_base_url}/0326-power-of-three.adoc[题解]
|Easy
|
//|{counter:codes}
//|{leetcode_base_url}/count-of-range-sum/[327. Count of Range Sum^]
//|{source_base_url}/_0327_CountOfRangeSum.java[Java]
//|{doc_base_url}/0327-count-of-range-sum.adoc[题解]
//|Hard
//|
|{counter:codes}
|{leetcode_base_url}/odd-even-linked-list/[328. Odd Even Linked List^]
|{source_base_url}/_0328_OddEvenLinkedList.java[Java]
|{doc_base_url}/0328-odd-even-linked-list.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/longest-increasing-path-in-a-matrix/[329. Longest Increasing Path in a Matrix^]
//|{source_base_url}/_0329_LongestIncreasingPathInAMatrix.java[Java]
//|{doc_base_url}/0329-longest-increasing-path-in-a-matrix.adoc[题解]
//|Hard
//|
//
//|{counter:codes}
//|{leetcode_base_url}/patching-array/[330. Patching Array^]
//|{source_base_url}/_0330_PatchingArray.java[Java]
//|{doc_base_url}/0330-patching-array.adoc[题解]
//|Hard
//|
//
//|{counter:codes}
//|{leetcode_base_url}/verify-preorder-serialization-of-a-binary-tree/[331. Verify Preorder Serialization of a Binary Tree^]
//|{source_base_url}/_0331_VerifyPreorderSerializationOfABinaryTree.java[Java]
//|{doc_base_url}/0331-verify-preorder-serialization-of-a-binary-tree.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/reconstruct-itinerary/[332. Reconstruct Itinerary^]
//|{source_base_url}/_0332_ReconstructItinerary.java[Java]
//|{doc_base_url}/0332-reconstruct-itinerary.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/largest-bst-subtree/[333. Largest BST Subtree^]
//|{source_base_url}/_0333_LargestBSTSubtree.java[Java]
//|{doc_base_url}/0333-largest-bst-subtree.adoc[题解]
//|Medium
//|
|{counter:codes}
|{leetcode_base_url}/increasing-triplet-subsequence/[334. Increasing Triplet Subsequence^]
|{source_base_url}/_0334_IncreasingTripletSubsequence.java[Java]
|{doc_base_url}/0334-increasing-triplet-subsequence.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/self-crossing/[335. Self Crossing^]
//|{source_base_url}/_0335_SelfCrossing.java[Java]
//|{doc_base_url}/0335-self-crossing.adoc[题解]
//|Hard
//|
//
//|{counter:codes}
//|{leetcode_base_url}/palindrome-pairs/[336. Palindrome Pairs^]
//|{source_base_url}/_0336_PalindromePairs.java[Java]
//|{doc_base_url}/0336-palindrome-pairs.adoc[题解]
//|Hard
//|
|{counter:codes}
|{leetcode_base_url}/house-robber-iii/[337. House Robber III^]
|{source_base_url}/_0337_HouseRobberIII.java[Java]
|{doc_base_url}/0337-house-robber-iii.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/counting-bits/[338. Counting Bits^]
|{source_base_url}/_0338_CountingBits.java[Java]
|{doc_base_url}/0338-counting-bits.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/nested-list-weight-sum/[339. Nested List Weight Sum^]
//|{source_base_url}/_0339_NestedListWeightSum.java[Java]
//|{doc_base_url}/0339-nested-list-weight-sum.adoc[题解]
//|Easy
//|
//
//|{counter:codes}
//|{leetcode_base_url}/longest-substring-with-at-most-k-distinct-characters/[340. Longest Substring with At Most K Distinct Characters^]
//|{source_base_url}/_0340_LongestSubstringWithAtMostKDistinctCharacters.java[Java]
//|{doc_base_url}/0340-longest-substring-with-at-most-k-distinct-characters.adoc[题解]
//|Hard
//|
|{counter:codes}
|{leetcode_base_url}/flatten-nested-list-iterator/[341. Flatten Nested List Iterator^]
|{source_base_url}/_0341_FlattenNestedListIterator.java[Java]
|{doc_base_url}/0341-flatten-nested-list-iterator.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/power-of-four/[342. Power of Four^]
//|{source_base_url}/_0342_PowerOfFour.java[Java]
//|{doc_base_url}/0342-power-of-four.adoc[题解]
//|Easy
//|
|{counter:codes}
|{leetcode_base_url}/integer-break/[343. Integer Break^]
|{source_base_url}/_0343_IntegerBreak.java[Java]
|{doc_base_url}/0343-integer-break.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/reverse-string/[344. Reverse String^]
|{source_base_url}/_0344_ReverseString.java[Java]
|{doc_base_url}/0344-reverse-string.adoc[题解]
|Easy
|
//|{counter:codes}
//|{leetcode_base_url}/reverse-vowels-of-a-string/[345. Reverse Vowels of a String^]
//|{source_base_url}/_0345_ReverseVowelsOfAString.java[Java]
//|{doc_base_url}/0345-reverse-vowels-of-a-string.adoc[题解]
//|Easy
//|
//
//|{counter:codes}
//|{leetcode_base_url}/moving-average-from-data-stream/[346. Moving Average from Data Stream^]
//|{source_base_url}/_0346_MovingAverageFromDataStream.java[Java]
//|{doc_base_url}/0346-moving-average-from-data-stream.adoc[题解]
//|Easy
//|
|{counter:codes}
|{leetcode_base_url}/top-k-frequent-elements/[347. Top K Frequent Elements^]
|{source_base_url}/_0347_TopKFrequentElements.java[Java]
|{doc_base_url}/0347-top-k-frequent-elements.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/design-tic-tac-toe/[348. Design Tic-Tac-Toe^]
//|{source_base_url}/_0348_DesignTicTacToe.java[Java]
//|{doc_base_url}/0348-design-tic-tac-toe.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/intersection-of-two-arrays/[349. Intersection of Two Arrays^]
//|{source_base_url}/_0349_IntersectionOfTwoArrays.java[Java]
//|{doc_base_url}/0349-intersection-of-two-arrays.adoc[题解]
//|Easy
//|
|{counter:codes}
|{leetcode_base_url}/intersection-of-two-arrays-ii/[350. Intersection of Two Arrays II^]
|{source_base_url}/_0350_IntersectionOfTwoArraysIi.java[Java]
|{doc_base_url}/0350-intersection-of-two-arrays-ii.adoc[题解]
|Easy
|
//|{counter:codes}
//|{leetcode_base_url}/android-unlock-patterns/[351. Android Unlock Patterns^]
//|{source_base_url}/_0351_AndroidUnlockPatterns.java[Java]
//|{doc_base_url}/0351-android-unlock-patterns.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/data-stream-as-disjoint-intervals/[352. Data Stream as Disjoint Intervals^]
//|{source_base_url}/_0352_DataStreamAsDisjointIntervals.java[Java]
//|{doc_base_url}/0352-data-stream-as-disjoint-intervals.adoc[题解]
//|Hard
//|
//
//|{counter:codes}
//|{leetcode_base_url}/design-snake-game/[353. Design Snake Game^]
//|{source_base_url}/_0353_DesignSnakeGame.java[Java]
//|{doc_base_url}/0353-design-snake-game.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/russian-doll-envelopes/[354. Russian Doll Envelopes^]
//|{source_base_url}/_0354_RussianDollEnvelopes.java[Java]
//|{doc_base_url}/0354-russian-doll-envelopes.adoc[题解]
//|Hard
//|
//
//|{counter:codes}
//|{leetcode_base_url}/design-twitter/[355. Design Twitter^]
//|{source_base_url}/_0355_DesignTwitter.java[Java]
//|{doc_base_url}/0355-design-twitter.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/line-reflection/[356. Line Reflection^]
//|{source_base_url}/_0356_LineReflection.java[Java]
//|{doc_base_url}/0356-line-reflection.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/count-numbers-with-unique-digits/[357. Count Numbers with Unique Digits^]
//|{source_base_url}/_0357_CountNumbersWithUniqueDigits.java[Java]
//|{doc_base_url}/0357-count-numbers-with-unique-digits.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/rearrange-string-k-distance-apart/[358. Rearrange String k Distance Apart^]
//|{source_base_url}/_0358_RearrangeStringKDistanceApart.java[Java]
//|{doc_base_url}/0358-rearrange-string-k-distance-apart.adoc[题解]
//|Hard
//|
//
//|{counter:codes}
//|{leetcode_base_url}/logger-rate-limiter/[359. Logger Rate Limiter^]
//|{source_base_url}/_0359_LoggerRateLimiter.java[Java]
//|{doc_base_url}/0359-logger-rate-limiter.adoc[题解]
//|Easy
//|
//
//|{counter:codes}
//|{leetcode_base_url}/sort-transformed-array/[360. Sort Transformed Array^]
//|{source_base_url}/_0360_SortTransformedArray.java[Java]
//|{doc_base_url}/0360-sort-transformed-array.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/bomb-enemy/[361. Bomb Enemy^]
//|{source_base_url}/_0361_BombEnemy.java[Java]
//|{doc_base_url}/0361-bomb-enemy.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/design-hit-counter/[362. Design Hit Counter^]
//|{source_base_url}/_0362_DesignHitCounter.java[Java]
//|{doc_base_url}/0362-design-hit-counter.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/max-sum-of-rectangle-no-larger-than-k/[363. Max Sum of Rectangle No Larger Than K^]
//|{source_base_url}/_0363_MaxSumOfRectangleNoLargerThanK.java[Java]
//|{doc_base_url}/0363-max-sum-of-rectangle-no-larger-than-k.adoc[题解]
//|Hard
//|
//
//|{counter:codes}
//|{leetcode_base_url}/nested-list-weight-sum-ii/[364. Nested List Weight Sum II^]
//|{source_base_url}/_0364_NestedListWeightSumII.java[Java]
//|{doc_base_url}/0364-nested-list-weight-sum-ii.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/water-and-jug-problem/[365. Water and Jug Problem^]
//|{source_base_url}/_0365_WaterAndJugProblem.java[Java]
//|{doc_base_url}/0365-water-and-jug-problem.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/find-leaves-of-binary-tree/[366. Find Leaves of Binary Tree^]
//|{source_base_url}/_0366_FindLeavesOfBinaryTree.java[Java]
//|{doc_base_url}/0366-find-leaves-of-binary-tree.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/valid-perfect-square/[367. Valid Perfect Square^]
//|{source_base_url}/_0367_ValidPerfectSquare.java[Java]
//|{doc_base_url}/0367-valid-perfect-square.adoc[题解]
//|Easy
//|
//
//|{counter:codes}
//|{leetcode_base_url}/largest-divisible-subset/[368. Largest Divisible Subset^]
//|{source_base_url}/_0368_LargestDivisibleSubset.java[Java]
//|{doc_base_url}/0368-largest-divisible-subset.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/plus-one-linked-list/[369. Plus One Linked List^]
//|{source_base_url}/_0369_PlusOneLinkedList.java[Java]
//|{doc_base_url}/0369-plus-one-linked-list.adoc[题解]
//|Medium
//|
|{counter:codes}
|{leetcode_base_url}/range-addition/[370. Range Addition^]
|{source_base_url}/_0370_RangeAddition.java[Java]
|{doc_base_url}/0370-range-addition.adoc[题解]
|Medium
|Plus专题
|{counter:codes}
|{leetcode_base_url}/sum-of-two-integers/[371. Sum of Two Integers^]
|{source_base_url}/_0371_SumOfTwoIntegers.java[Java]
|{doc_base_url}/0371-sum-of-two-integers.adoc[题解]
|Easy
|
//|{counter:codes}
//|{leetcode_base_url}/super-pow/[372. Super Pow^]
//|{source_base_url}/_0372_SuperPow.java[Java]
//|{doc_base_url}/0372-super-pow.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/find-k-pairs-with-smallest-sums/[373. Find K Pairs with Smallest Sums^]
//|{source_base_url}/_0373_FindKPairsWithSmallestSums.java[Java]
//|{doc_base_url}/0373-find-k-pairs-with-smallest-sums.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/guess-number-higher-or-lower/[374. Guess Number Higher or Lower^]
//|{source_base_url}/_0374_GuessNumberHigherOrLower.java[Java]
//|{doc_base_url}/0374-guess-number-higher-or-lower.adoc[题解]
//|Easy
//|
//
//|{counter:codes}
//|{leetcode_base_url}/guess-number-higher-or-lower-ii/[375. Guess Number Higher or Lower II^]
//|{source_base_url}/_0375_GuessNumberHigherOrLowerII.java[Java]
//|{doc_base_url}/0375-guess-number-higher-or-lower-ii.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/wiggle-subsequence/[376. Wiggle Subsequence^]
//|{source_base_url}/_0376_WiggleSubsequence.java[Java]
//|{doc_base_url}/0376-wiggle-subsequence.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/combination-sum-iv/[377. Combination Sum IV^]
//|{source_base_url}/_0377_CombinationSumIV.java[Java]
//|{doc_base_url}/0377-combination-sum-iv.adoc[题解]
//|Medium
//|
|{counter:codes}
|{leetcode_base_url}/kth-smallest-element-in-a-sorted-matrix/[378. Kth Smallest Element in a Sorted Matrix^]
|{source_base_url}/_0378_KthSmallestElementInASortedMatrix.java[Java]
|{doc_base_url}/0378-kth-smallest-element-in-a-sorted-matrix.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/design-phone-directory/[379. Design Phone Directory^]
//|{source_base_url}/_0379_DesignPhoneDirectory.java[Java]
//|{doc_base_url}/0379-design-phone-directory.adoc[题解]
//|Medium
//|
|{counter:codes}
|{leetcode_base_url}/insert-delete-getrandom-o1/[380. Insert Delete GetRandom O(1)^]
|{source_base_url}/_0380_InsertDeleteGetRandomO1.java[Java]
|{doc_base_url}/0380-insert-delete-getrandom-o1.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/insert-delete-getrandom-o1-duplicates-allowed/[381. Insert Delete GetRandom O(1) - Duplicates allowed^]
//|{source_base_url}/_0381_InsertDeleteGetRandomO1DuplicatesAllowed.java[Java]
//|{doc_base_url}/0381-insert-delete-getrandom-o1-duplicates-allowed.adoc[题解]
//|Hard
//|
//
//|{counter:codes}
//|{leetcode_base_url}/linked-list-random-node/[382. Linked List Random Node^]
//|{source_base_url}/_0382_LinkedListRandomNode.java[Java]
//|{doc_base_url}/0382-linked-list-random-node.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/ransom-note/[383. Ransom Note^]
//|{source_base_url}/_0383_RansomNote.java[Java]
//|{doc_base_url}/0383-ransom-note.adoc[题解]
//|Easy
//|
|{counter:codes}
|{leetcode_base_url}/shuffle-an-array/[384. Shuffle an Array^]
|{source_base_url}/_0384_ShuffleAnArray.java[Java]
|{doc_base_url}/0384-shuffle-an-array.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/mini-parser/[385. Mini Parser^]
//|{source_base_url}/_0385_MiniParser.java[Java]
//|{doc_base_url}/0385-mini-parser.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/lexicographical-numbers/[386. Lexicographical Numbers^]
//|{source_base_url}/_0386_LexicographicalNumbers.java[Java]
//|{doc_base_url}/0386-lexicographical-numbers.adoc[题解]
//|Medium
//|
|{counter:codes}
|{leetcode_base_url}/first-unique-character-in-a-string/[387. First Unique Character in a String^]
|{source_base_url}/_0387_FirstUniqueCharacterInAString.java[Java]
|{doc_base_url}/0387-first-unique-character-in-a-string.adoc[题解]
|Easy
|
//|{counter:codes}
//|{leetcode_base_url}/longest-absolute-file-path/[388. Longest Absolute File Path^]
//|{source_base_url}/_0388_LongestAbsoluteFilePath.java[Java]
//|{doc_base_url}/0388-longest-absolute-file-path.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/find-the-difference/[389. Find the Difference^]
//|{source_base_url}/_0389_FindTheDifference.java[Java]
//|{doc_base_url}/0389-find-the-difference.adoc[题解]
//|Easy
//|
//
//|{counter:codes}
//|{leetcode_base_url}/elimination-game/[390. Elimination Game^]
//|{source_base_url}/_0390_EliminationGame.java[Java]
//|{doc_base_url}/0390-elimination-game.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/perfect-rectangle/[391. Perfect Rectangle^]
//|{source_base_url}/_0391_PerfectRectangle.java[Java]
//|{doc_base_url}/0391-perfect-rectangle.adoc[题解]
//|Hard
//|
|{counter:codes}
|{leetcode_base_url}/is-subsequence/[392. Is Subsequence^]
|{source_base_url}/_0392_IsSubsequence.java[Java]
|{doc_base_url}/0392-is-subsequence.adoc[题解]
|Easy
|
//|{counter:codes}
//|{leetcode_base_url}/utf-8-validation/[393. UTF-8 Validation^]
//|{source_base_url}/_0393_UTF8Validation.java[Java]
//|{doc_base_url}/0393-utf-8-validation.adoc[题解]
//|Medium
//|
|{counter:codes}
|{leetcode_base_url}/decode-string/[394. Decode String^]
|{source_base_url}/_0394_DecodeString.java[Java]
|{doc_base_url}/0394-decode-string.adoc[题解]
|Medium
|
|{counter:codes}
|{leetcode_base_url}/longest-substring-with-at-least-k-repeating-characters/[395. Longest Substring with At Least K Repeating Characters^]
|{source_base_url}/_0395_LongestSubstringWithAtLeastKRepeatingCharacters.java[Java]
|{doc_base_url}/0395-longest-substring-with-at-least-k-repeating-characters.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/rotate-function/[396. Rotate Function^]
//|{source_base_url}/_0396_RotateFunction.java[Java]
//|{doc_base_url}/0396-rotate-function.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/integer-replacement/[397. Integer Replacement^]
//|{source_base_url}/_0397_IntegerReplacement.java[Java]
//|{doc_base_url}/0397-integer-replacement.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/random-pick-index/[398. Random Pick Index^]
//|{source_base_url}/_0398_RandomPickIndex.java[Java]
//|{doc_base_url}/0398-random-pick-index.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/evaluate-division/[399. Evaluate Division^]
//|{source_base_url}/_0399_EvaluateDivision.java[Java]
//|{doc_base_url}/0399-evaluate-division.adoc[题解]
//|Medium
//|
|{counter:codes}
|{leetcode_base_url}/nth-digit/[400. Nth Digit^]
|{source_base_url}/_0400_NthDigit.java[Java]
|{doc_base_url}/0400-nth-digit.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/binary-watch/[401. Binary Watch^]
//|{source_base_url}/_0401_BinaryWatch.java[Java]
//|{doc_base_url}/0401-binary-watch.adoc[题解]
//|Easy
//|
|{counter:codes}
|{leetcode_base_url}/remove-k-digits/[402. Remove K Digits^]
|{source_base_url}/_0402_RemoveKDigits.java[Java]
|{doc_base_url}/0402-remove-k-digits.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/frog-jump/[403. Frog Jump^]
//|{source_base_url}/_0403_FrogJump.java[Java]
//|{doc_base_url}/0403-frog-jump.adoc[题解]
//|Hard
//|
|{counter:codes}
|{leetcode_base_url}/sum-of-left-leaves/[404. Sum of Left Leaves^]
|{source_base_url}/_0404_SumOfLeftLeaves.java[Java]
|{doc_base_url}/0404-sum-of-left-leaves.adoc[题解]
|Easy
|
//|{counter:codes}
//|{leetcode_base_url}/convert-a-number-to-hexadecimal/[405. Convert a Number to Hexadecimal^]
//|{source_base_url}/_0405_ConvertANumberToHexadecimal.java[Java]
//|{doc_base_url}/0405-convert-a-number-to-hexadecimal.adoc[题解]
//|Easy
//|
|{counter:codes}
|{leetcode_base_url}/queue-reconstruction-by-height/[406. Queue Reconstruction by Height^]
|{source_base_url}/_0406_QueueReconstructionByHeight.java[Java]
|{doc_base_url}/0406-queue-reconstruction-by-height.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/trapping-rain-water-ii/[407. Trapping Rain Water II^]
//|{source_base_url}/_0407_TrappingRainWaterII.java[Java]
//|{doc_base_url}/0407-trapping-rain-water-ii.adoc[题解]
//|Hard
//|
//
//|{counter:codes}
//|{leetcode_base_url}/valid-word-abbreviation/[408. Valid Word Abbreviation^]
//|{source_base_url}/_0408_ValidWordAbbreviation.java[Java]
//|{doc_base_url}/0408-valid-word-abbreviation.adoc[题解]
//|Easy
//|
|{counter:codes}
|{leetcode_base_url}/longest-palindrome/[409. Longest Palindrome^]
|{source_base_url}/_0409_LongestPalindrome.java[Java]
|{doc_base_url}/0409-longest-palindrome.adoc[题解]
|Easy
|
//|{counter:codes}
//|{leetcode_base_url}/split-array-largest-sum/[410. Split Array Largest Sum^]
//|{source_base_url}/_0410_SplitArrayLargestSum.java[Java]
//|{doc_base_url}/0410-split-array-largest-sum.adoc[题解]
//|Hard
//|
//
//|{counter:codes}
//|{leetcode_base_url}/minimum-unique-word-abbreviation/[411. Minimum Unique Word Abbreviation^]
//|{source_base_url}/_0411_MinimumUniqueWordAbbreviation.java[Java]
//|{doc_base_url}/0411-minimum-unique-word-abbreviation.adoc[题解]
//|Hard
//|
|{counter:codes}
|{leetcode_base_url}/fizz-buzz/[412. Fizz Buzz^]
|{source_base_url}/_0412_FizzBuzz.java[Java]
|{doc_base_url}/0412-fizz-buzz.adoc[题解]
|Easy
|
//|{counter:codes}
//|{leetcode_base_url}/arithmetic-slices/[413. Arithmetic Slices^]
//|{source_base_url}/_0413_ArithmeticSlices.java[Java]
//|{doc_base_url}/0413-arithmetic-slices.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/third-maximum-number/[414. Third Maximum Number^]
//|{source_base_url}/_0414_ThirdMaximumNumber.java[Java]
//|{doc_base_url}/0414-third-maximum-number.adoc[题解]
//|Easy
//|
|{counter:codes}
|{leetcode_base_url}/add-strings/[415. Add Strings^]
|{source_base_url}/_0415_AddStrings.java[Java]
|{doc_base_url}/0415-add-strings.adoc[题解]
|Easy
|
|{counter:codes}
|{leetcode_base_url}/partition-equal-subset-sum/[416. Partition Equal Subset Sum^]
|{source_base_url}/_0416_PartitionEqualSubsetSum.java[Java]
|{doc_base_url}/0416-partition-equal-subset-sum.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/pacific-atlantic-water-flow/[417. Pacific Atlantic Water Flow^]
//|{source_base_url}/_0417_PacificAtlanticWaterFlow.java[Java]
//|{doc_base_url}/0417-pacific-atlantic-water-flow.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/sentence-screen-fitting/[418. Sentence Screen Fitting^]
//|{source_base_url}/_0418_SentenceScreenFitting.java[Java]
//|{doc_base_url}/0418-sentence-screen-fitting.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/battleships-in-a-board/[419. Battleships in a Board^]
//|{source_base_url}/_0419_BattleshipsInABoard.java[Java]
//|{doc_base_url}/0419-battleships-in-a-board.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/strong-password-checker/[420. Strong Password Checker^]
//|{source_base_url}/_0420_StrongPasswordChecker.java[Java]
//|{doc_base_url}/0420-strong-password-checker.adoc[题解]
//|Hard
//|
//
//|{counter:codes}
//|{leetcode_base_url}/maximum-xor-of-two-numbers-in-an-array/[421. Maximum XOR of Two Numbers in an Array^]
//|{source_base_url}/_0421_MaximumXOROfTwoNumbersInAnArray.java[Java]
//|{doc_base_url}/0421-maximum-xor-of-two-numbers-in-an-array.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/valid-word-square/[422. Valid Word Square^]
//|{source_base_url}/_0422_ValidWordSquare.java[Java]
//|{doc_base_url}/0422-valid-word-square.adoc[题解]
//|Easy
//|
//
//|{counter:codes}
//|{leetcode_base_url}/reconstruct-original-digits-from-english/[423. Reconstruct Original Digits from English^]
//|{source_base_url}/_0423_ReconstructOriginalDigitsFromEnglish.java[Java]
//|{doc_base_url}/0423-reconstruct-original-digits-from-english.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/longest-repeating-character-replacement/[424. Longest Repeating Character Replacement^]
//|{source_base_url}/_0424_LongestRepeatingCharacterReplacement.java[Java]
//|{doc_base_url}/0424-longest-repeating-character-replacement.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/word-squares/[425. Word Squares^]
//|{source_base_url}/_0425_WordSquares.java[Java]
//|{doc_base_url}/0425-word-squares.adoc[题解]
//|Hard
//|
//
//|{counter:codes}
//|{leetcode_base_url}/convert-binary-search-tree-to-sorted-doubly-linked-list/[426. Convert Binary Search Tree to Sorted Doubly Linked List^]
//|{source_base_url}/_0426_ConvertBinarySearchTreeToSortedDoublyLinkedList.java[Java]
//|{doc_base_url}/0426-convert-binary-search-tree-to-sorted-doubly-linked-list.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/construct-quad-tree/[427. Construct Quad Tree^]
//|{source_base_url}/_0427_ConstructQuadTree.java[Java]
//|{doc_base_url}/0427-construct-quad-tree.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/serialize-and-deserialize-n-ary-tree/[428. Serialize and Deserialize N-ary Tree^]
//|{source_base_url}/_0428_SerializeAndDeserializeNAryTree.java[Java]
//|{doc_base_url}/0428-serialize-and-deserialize-n-ary-tree.adoc[题解]
//|Hard
//|
|{counter:codes}
|{leetcode_base_url}/n-ary-tree-level-order-traversal/[429. N-ary Tree Level Order Traversal^]
|{source_base_url}/_0429_NAryTreeLevelOrderTraversal.java[Java]
|{doc_base_url}/0429-n-ary-tree-level-order-traversal.adoc[题解]
|Medium
|广度优先
//|{counter:codes}
//|{leetcode_base_url}/flatten-a-multilevel-doubly-linked-list/[430. Flatten a Multilevel Doubly Linked List^]
//|{source_base_url}/_0430_FlattenAMultilevelDoublyLinkedList.java[Java]
//|{doc_base_url}/0430-flatten-a-multilevel-doubly-linked-list.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/encode-n-ary-tree-to-binary-tree/[431. Encode N-ary Tree to Binary Tree^]
//|{source_base_url}/_0431_EncodeNAryTreeToBinaryTree.java[Java]
//|{doc_base_url}/0431-encode-n-ary-tree-to-binary-tree.adoc[题解]
//|Hard
//|
//
//|{counter:codes}
//|{leetcode_base_url}/all-oone-data-structure/[432. All O`one Data Structure^]
//|{source_base_url}/_0432_AllOOneDataStructure.java[Java]
//|{doc_base_url}/0432-all-oone-data-structure.adoc[题解]
//|Hard
//|
//
//|{counter:codes}
//|{leetcode_base_url}/minimum-genetic-mutation/[433. Minimum Genetic Mutation^]
//|{source_base_url}/_0433_MinimumGeneticMutation.java[Java]
//|{doc_base_url}/0433-minimum-genetic-mutation.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/number-of-segments-in-a-string/[434. Number of Segments in a String^]
//|{source_base_url}/_0434_NumberOfSegmentsInAString.java[Java]
//|{doc_base_url}/0434-number-of-segments-in-a-string.adoc[题解]
//|Easy
//|
//
//|{counter:codes}
//|{leetcode_base_url}/non-overlapping-intervals/[435. Non-overlapping Intervals^]
//|{source_base_url}/_0435_NonOverlappingIntervals.java[Java]
//|{doc_base_url}/0435-non-overlapping-intervals.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/find-right-interval/[436. Find Right Interval^]
//|{source_base_url}/_0436_FindRightInterval.java[Java]
//|{doc_base_url}/0436-find-right-interval.adoc[题解]
//|Medium
//|
|{counter:codes}
|{leetcode_base_url}/path-sum-iii/[437. Path Sum III^]
|{source_base_url}/_0437_PathSumIII.java[Java]
|{doc_base_url}/0437-path-sum-iii.adoc[题解]
|Medium
|前缀和解法还需要多思考！
|{counter:codes}
|{leetcode_base_url}/find-all-anagrams-in-a-string/[438. Find All Anagrams in a String^]
|{source_base_url}/_0438_FindAllAnagramsInAString.java[Java]
|{doc_base_url}/0438-find-all-anagrams-in-a-string.adoc[题解]
|Medium
|
//|{counter:codes}
//|{leetcode_base_url}/ternary-expression-parser/[439. Ternary Expression Parser^]
//|{source_base_url}/_0439_TernaryExpressionParser.java[Java]
//|{doc_base_url}/0439-ternary-expression-parser.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/k-th-smallest-in-lexicographical-order/[440. K-th Smallest in Lexicographical Order^]
//|{source_base_url}/_0440_KThSmallestInLexicographicalOrder.java[Java]
//|{doc_base_url}/0440-k-th-smallest-in-lexicographical-order.adoc[题解]
//|Hard
//|
//
//|{counter:codes}
//|{leetcode_base_url}/arranging-coins/[441. Arranging Coins^]
//|{source_base_url}/_0441_ArrangingCoins.java[Java]
//|{doc_base_url}/0441-arranging-coins.adoc[题解]
//|Easy
//|
//
//|{counter:codes}
//|{leetcode_base_url}/find-all-duplicates-in-an-array/[442. Find All Duplicates in an Array^]
//|{source_base_url}/_0442_FindAllDuplicatesInAnArray.java[Java]
//|{doc_base_url}/0442-find-all-duplicates-in-an-array.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/string-compression/[443. String Compression^]
//|{source_base_url}/_0443_StringCompression.java[Java]
//|{doc_base_url}/0443-string-compression.adoc[题解]
//|Easy
//|
// |{counter:codes}
// |{leetcode_base_url}/sequence-reconstruction/[444. Sequence Reconstruction^]
// |{source_base_url}/_0444_SequenceReconstruction.java[Java]
// |{doc_base_url}/0444-sequence-reconstruction.adoc[题解]
// |Medium
// |
//|{counter:codes}
//|{leetcode_base_url}/add-two-numbers-ii/[445. Add Two Numbers II^]
//|{source_base_url}/_0445_AddTwoNumbersII.java[Java]
//|{doc_base_url}/0445-add-two-numbers-ii.adoc[题解]
//|Medium
//|
//
//|{counter:codes}
//|{leetcode_base_url}/arithmetic-slices-ii-subsequence/[446. Arithmetic Slices II - Subsequen