{"id":20994867,"url":"https://github.com/xiedacon/leetcode","last_synced_at":"2026-04-09T05:31:13.732Z","repository":{"id":84793278,"uuid":"78285928","full_name":"xiedacon/leetcode","owner":"xiedacon","description":"leetcode算法题集","archived":false,"fork":false,"pushed_at":"2017-03-24T09:37:02.000Z","size":169,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-12-31T23:56:21.470Z","etag":null,"topics":["algorithms","leetcode"],"latest_commit_sha":null,"homepage":"","language":null,"has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/xiedacon.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2017-01-07T15:13:38.000Z","updated_at":"2017-03-18T09:16:05.000Z","dependencies_parsed_at":null,"dependency_job_id":"126a5169-63d3-47b1-be4b-a77aab0dcb96","html_url":"https://github.com/xiedacon/leetcode","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/xiedacon/leetcode","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/xiedacon%2Fleetcode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/xiedacon%2Fleetcode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/xiedacon%2Fleetcode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/xiedacon%2Fleetcode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/xiedacon","download_url":"https://codeload.github.com/xiedacon/leetcode/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/xiedacon%2Fleetcode/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":31587757,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-08T14:31:17.711Z","status":"online","status_checked_at":"2026-04-09T02:00:06.848Z","response_time":112,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","leetcode"],"created_at":"2024-11-19T07:20:09.666Z","updated_at":"2026-04-09T05:31:13.710Z","avatar_url":"https://github.com/xiedacon.png","language":null,"funding_links":[],"categories":[],"sub_categories":[],"readme":"# leetcode算法题集\n\n1. [Two Sum](./algorithms/1.Two%20Sum.md)\n2. [Add Two Numbers](./algorithms/2.Add%20Two%20Numbers.md)\n3. [Longest Substring Without Repeating Characters](./algorithms/3.Longest%20Substring%20Without%20Repeating%20Characters.md)\n4. Median of Two Sorted Arrays\n5. [Longest Palindromic Substring](./algorithms/5.Longest%20Palindromic%20Substring.md)\n6. [ZigZag Conversion](./algorithms/6.ZigZag%20Conversion.md)\n7. [Reverse Integer](./algorithms/7.Reverse%20Integer.md)\n8. [String to Integer (atoi)](./algorithms/8.String%20to%20Integer.md)\n9. [Palindrome Number](./algorithms/9.Palindrome%20Number.md)\n10. Regular Expression Matching\n11. [Container With Most Water](./algorithms/11.Container%20With%20Most%20Water.md)\n12. [Integer to Roman](./algorithms/12.Integer%20to%20Roman.md)\n13. [Roman to Integer](./algorithms/13.Roman%20to%20Integer.md)\n14. [Longest Common Prefix](./algorithms/14.Longest%20Common%20Prefix.md)\n15. [3Sum](./algorithms/15.3Sum.md)\n16. [3Sum Closest](./algorithms/16.3Sum%20Closest.md)\n17. [Letter Combinations of a Phone Number](./algorithms/17.Letter%20Combinations%20of%20a%20Phone%20Number.md)\n18. [4Sum](./algorithms/18.4Sum.md)\n19. [Remove Nth Node From End of List](./algorithms/19.Remove%20Nth%20Node%20From%20End%20of%20List.md)\n20. [Valid Parentheses](./algorithms/20.Valid%20Parentheses.md)\n21. [Merge Two Sorted Lists](./algorithms/21.Merge%20Two%20Sorted%20Lists.md)\n22. [Generate Parentheses](./algorithms/22.Generate%20Parentheses.md)\n23. [Merge k Sorted Lists](./algorithms/23.Merge%20k%20Sorted%20Lists.md)\n24. [Swap Nodes in Pairs](./algorithms/24.Swap%20Nodes%20in%20Pairs.md)\n25. [Reverse Nodes in k-Group](./algorithms/25.Reverse%20Nodes%20in%20k-Group.md)\n26. [Remove Duplicates from Sorted Array](./algorithms/26.Remove%20Duplicates%20from%20Sorted%20Array.md)\n27. [Remove Element](./algorithms/27.Remove%20Element.md)\n28. [Implement strStr()](./algorithms/28.Implement%20strStr.md)\n29. [Divide Two Integers](./algorithms/29.Divide%20Two%20Integers.md)\n30. Substring with Concatenation of All Words\n31. [Next Permutation](./algorithms/31.Next%20Permutation.md)\n32. [Longest Valid Parentheses](./algorithms/32.Longest%20Valid%20Parentheses.md)\n33. [Search in Rotated Sorted Array](./algorithms/33.Search%20in%20Rotated%20Sorted%20Array.md)\n34. [Search for a Range](./algorithms/34.Search%20for%20a%20Range.md)\n35. [Search Insert Position](./algorithms/35.Search%20Insert%20Position.md)\n36. [Valid Sudoku](./algorithms/36.Valid%20Sudoku.md)\n37. [Sudoku Solver](./algorithms/37.Sudoku%20Solver.md)\n38. Count and Say\n39. [Combination Sum](./algorithms/39.Combination%20Sum.md)\n40. [Combination Sum II](./algorithms/40.Combination%20Sum%20II.md)\n41. [First Missing Positive](./algorithms/41.First%20Missing%20Positive.md)\n42. [Trapping Rain Water](./algorithms/42.Trapping%20Rain%20Water.md)\n43. [Multiply Strings](./algorithms/43.Multiply%20Strings.md)\n44. Wildcard Matching\n45. [Jump Game II](./algorithms/45.Jump%20Game%20II.md)\n46. [Permutations](./algorithms/46.Permutations.md)\n47. [Permutations II](./algorithms/47.Permutations%20II.md)\n48. [Rotate Image](./algorithms/48.Rotate%20Image.md)\n49. [Group Anagrams](./algorithms/49.Group%20Anagrams.md)\n50. [Pow(x, n)](./algorithms/50.Pow%20x, n .md)\n51. N-Queens\n52. N-Queens II\n53. [Maximum Subarray](./algorithms/53.Maximum%20Subarray.md)\n54. [Spiral Matrix](./algorithms/54.Spiral%20Matrix.md)\n55. [Jump Game](./algorithms/55.Jump%20Game.md)\n56. [Merge Intervals](./algorithms/56.Merge%20Intervals.md)\n57. [Insert Interval](./algorithms/57.Insert%20Interval.md)\n58. [Length of Last Word](./algorithms/58.Length%20of%20Last%20Word.md)\n59. [Spiral Matrix II](./algorithms/59.Spiral%20Matrix%20II.md)\n60. [Permutation Sequence](./algorithms/60.Permutation%20Sequence.md)\n61. [Rotate List](./algorithms/61.Rotate%20List.md)\n62. [Unique Paths](./algorithms/62.Unique%20Paths.md)\n63. [Unique Paths II](./algorithms/63.Unique%20Paths%20II.md)\n64. [Minimum Path Sum](./algorithms/64.Minimum%20Path%20Sum.md)\n65. Valid Number\n66. [Plus One](./algorithms/66.Plus%20One.md)\n67. [Add Binary](./algorithms/67.Add%20Binary.md)\n68. [Text Justification](./algorithms/68.Text%20Justification.md)\n69. [Sqrt(x)](./algorithms/69.Sqrt%20x .md)\n70. [Climbing Stairs](./algorithms/70.Climbing%20Stairs.md)\n71. [Simplify Path](./algorithms/71.Simplify%20Path.md)\n72. [Edit Distance](./algorithms/72.Edit%20Distance.md)\n73. [Set Matrix Zeroes](./algorithms/73.Set%20Matrix%20Zeroes.md)\n74. [Search a 2D Matrix](./algorithms/74.Search%20a%202D%20Matrix.md)\n75. [Sort Colors](./algorithms/75.Sort%20Colors.md)\n76. [Minimum Window Substring](./algorithms/76.Minimum%20Window%20Substring.md)\n77. [Combinations](./algorithms/77.Combinations.md)\n78. [Subsets](./algorithms/78.Subsets.md)\n79. [Word Search](./algorithms/79.Word%20Search.md)\n80. [Remove Duplicates from Sorted Array II](./algorithms/80.Remove%20Duplicates%20from%20Sorted%20Array%20II.md)\n81. [Search in Rotated Sorted Array II](./algorithms/81.Search%20in%20Rotated%20Sorted%20Array%20II.md)\n82. [Remove Duplicates from Sorted List II](./algorithms/82.Remove%20Duplicates%20from%20Sorted%20List%20II.md)\n83. [Remove Duplicates from Sorted List](./algorithms/83.Remove%20Duplicates%20from%20Sorted%20List.md)\n84. [Largest Rectangle in Histogram](./algorithms/84.Largest%20Rectangle%20in%20Histogram.md)\n85. [Maximal Rectangle](./algorithms/85.Maximal%20Rectangle.md)\n86. [Partition List](./algorithms/86.Partition%20List.md)\n87. [Scramble String](./algorithms/87.Scramble%20String.md)\n88. [Merge Sorted Array](./algorithms/88.Merge%20Sorted%20Array.md)\n89. [Gray Code](./algorithms/89.Gray%20Code.md)\n90. [Subsets II](./algorithms/90.Subsets%20II.md)\n91. [Decode Ways](./algorithms/91.Decode%20Ways.md)\n92. [Reverse Linked List II](./algorithms/92.Reverse%20Linked%20List%20II.md)\n93. [Restore IP Addresses](./algorithms/93.Restore%20IP%20Addresses.md)\n94. [Binary Tree Inorder Traversal](./algorithms/94.Binary%20Tree%20Inorder%20Traversal.md)\n95. [Unique Binary Search Trees II](./algorithms/95.Unique%20Binary%20Search%20Trees%20II.md)\n96. [Unique Binary Search Trees](./algorithms/96.Unique%20Binary%20Search%20Trees.md)\n97. [Interleaving String](./algorithms/97.Interleaving%20String.md)\n98. [Validate Binary Search Tree](./algorithms/98.Validate%20Binary%20Search%20Tree.md)\n99. [Recover Binary Search Tree](./algorithms/99.Recover%20Binary%20Search%20Tree.md)\n100. [Same Tree](./algorithms/100.Same%20Tree.md)\n101. [Symmetric Tree](./algorithms/101.Symmetric%20Tree.md)\n102. [Binary Tree Level Order Traversal](./algorithms/102.Binary%20Tree%20Level%20Order%20Traversal.md)\n103. [Binary Tree Zigzag Level Order Traversal](./algorithms/103.Binary%20Tree%20Zigzag%20Level%20Order%20Traversal.md)\n104. [Maximum Depth of Binary Tree](./algorithms/104.Maximum%20Depth%20of%20Binary%20Tree.md)\n105. [Construct Binary Tree from Preorder and Inorder Traversal](./algorithms/105.Construct%20Binary%20Tree%20from%20Preorder%20and%20Inorder%20Traversal.md)\n106. Construct Binary Tree from Inorder and Postorder Traversal\n107. [Binary Tree Level Order Traversal II](./algorithms/107.Binary%20Tree%20Level%20Order%20Traversal%20II.md)\n108. [Convert Sorted Array to Binary Search Tree](./algorithms/108.Convert%20Sorted%20Array%20to%20Binary%20Search%20Tree.md)\n109. [Convert Sorted List to Binary Search Tree](./algorithms/109.Convert%20Sorted%20List%20to%20Binary%20Search%20Tree.md)\n110. [Balanced Binary Tree](./algorithms/110.Balanced%20Binary%20Tree.md)\n111. [Minimum Depth of Binary Tree](./algorithms/111.Minimum%20Depth%20of%20Binary%20Tree.md)\n112. [Path Sum](./algorithms/112.Path%20Sum.md)\n113. [Path Sum II](./algorithms/113.Path%20Sum%20II.md)\n114. [Flatten Binary Tree to Linked List](./algorithms/114.Flatten%20Binary%20Tree%20to%20Linked%20List.md)\n115. [Distinct Subsequences](./algorithms/115.Distinct%20Subsequences.md)\n116. [Populating Next Right Pointers in Each Node](./algorithms/116.Populating%20Next%20Right%20Pointers%20in%20Each%20Node.md)\n117. [Populating Next Right Pointers in Each Node II](./algorithms/117.Populating%20Next%20Right%20Pointers%20in%20Each%20Node%20II.md)\n118. [Pascal's Triangle](./algorithms/118.Pascal's%20Triangle.md)\n119. [Pascal's Triangle II](./algorithms/119.Pascal's%20Triangle%20II.md)\n\n**目录生成脚本：**\n\n```javascript\n  (function a(begin,end){\n  \tvar tbody = document.querySelector(\"tbody\"),temp = \"\";\n  \tif(begin \u0026\u0026 end)\n  \twhile(begin\u003c=end){\n  \t\tvar name = tbody.children[begin-1].children[2].getAttribute(\"value\");\n  \t\ttemp += begin + \". [\" + name + \"](./algorithms/\" + begin + \".\" + name.replace(/\\s/g,\"%20\") + \".md)\\r\\n\";\n  \t\tbegin++;\n  \t}\n  \tconsole.log(temp);\n  })(1,200)\n```\n\n**页面转markdown脚本：**\n\n\u003e 不是100%正确，转换后需要修正\n\n```javascript\n  (function(){\n    var temp = \"# \" + document.querySelector(\"h3\").textContent.trim() + \"\\r\\n\";\n    function a(ele){\n      ((ele instanceof Text) \u0026\u0026 (temp+=(ele.data.trim().length==0)?\"\\r\\n\":ele.data))\n      || ((ele.matches(\"code\")) \u0026\u0026 (temp+=\"``\"+ele.textContent+\"``\"))\n      || ((ele.matches(\"pre\")) \u0026\u0026 (temp+=\"\\r\\n```\\r\\n\"+ele.textContent+\"```\\r\\n\"))\n      || ((ele.matches(\"b\")) \u0026\u0026 (temp+=\"**\"+ele.textContent+\"**\"))\n      || ((ele.matches(\"img\")) \u0026\u0026 (temp+=\"\\r\\n!(图片名)[\"+ele.src+\"]\\r\\n\"))\n      || ((ele.matches(\"li\")) \u0026\u0026 (temp+=\"* \"+ele.textContent))\n      || ele.matches(\"div\")\n      || Array.from(ele.childNodes).forEach((e) =\u003e {a(e);});\n    }\n    Array.from(document.querySelector(\"div.question-content\").childNodes).forEach((e)=\u003e{a(e);});\n    temp += \"**Solution:**\\r\\n\\r\\n```java\\r\\n\\r\\n```\"\n    console.log(temp);\n  })()\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fxiedacon%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fxiedacon%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fxiedacon%2Fleetcode/lists"}