{"id":15031615,"url":"https://github.com/hubertroy/leetcode","last_synced_at":"2025-04-08T08:16:41.025Z","repository":{"id":39706531,"uuid":"141866636","full_name":"HuberTRoy/leetCode","owner":"HuberTRoy","description":":pencil2: 算法相关知识储备 LeetCode with Python and JavaScript :books:","archived":false,"fork":false,"pushed_at":"2021-07-26T05:18:08.000Z","size":289,"stargazers_count":1809,"open_issues_count":2,"forks_count":419,"subscribers_count":58,"default_branch":"master","last_synced_at":"2025-04-08T08:16:03.256Z","etag":null,"topics":["algorithm","algorithms","alogrithms","data-structures","interview","leetcode","leetcode-javascript","leetcode-python","leetcode-solutions"],"latest_commit_sha":null,"homepage":"","language":"Python","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/HuberTRoy.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}},"created_at":"2018-07-22T04:47:47.000Z","updated_at":"2025-03-28T07:07:00.000Z","dependencies_parsed_at":"2022-07-13T12:10:18.389Z","dependency_job_id":null,"html_url":"https://github.com/HuberTRoy/leetCode","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HuberTRoy%2FleetCode","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HuberTRoy%2FleetCode/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HuberTRoy%2FleetCode/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HuberTRoy%2FleetCode/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/HuberTRoy","download_url":"https://codeload.github.com/HuberTRoy/leetCode/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247801175,"owners_count":20998339,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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":["algorithm","algorithms","alogrithms","data-structures","interview","leetcode","leetcode-javascript","leetcode-python","leetcode-solutions"],"created_at":"2024-09-24T20:16:11.556Z","updated_at":"2025-04-08T08:16:41.001Z","avatar_url":"https://github.com/HuberTRoy.png","language":"Python","readme":"\u003ch3 align=\"center\"\u003e算法知识储备 Leetcode with Python \u003csub\u003eand Js\u003csub\u003e\u003c/h3\u003e\n\u003cdiv align=\"center\"\u003e\n    \u003cimg src=\"0_icons/book.png\"\u003e\n\u003c/div\u003e\n\u003cdiv align=\"center\"\u003e\n    \u003cimg src=\"https://img.shields.io/badge/%3E-Leetcode-blue.svg\"\u003e\n    \u003cimg src=\"https://img.shields.io/badge/-Algorithm-blue.svg\"\u003e\n\u003c/div\u003e\n\n## [数组(及其相关结构)](Array/)\n- [可容纳最多水的一组容器.py](Array/ContainerWithMostWater.py)\n- [糖果公平交换.py](Array/FairCandySwap.py)\n- [已排序的数组中找到第一和最后一个元素.py](Array/FindFirstAndLastPositionOfElementInSortedArray.py)\n- [旋转过的排序数组中找到最小的元素.py](Array/FindMinimumInRotatedSortedArray.py)\n- [旋转过的排序数组中找到最小的元素II.py](Array/FindMinimumInRotatedSortedArrayII.py)\n- [足球粉儿~.py](Array/FootballFans.py)\n- [水果分到篮子里.py](Array/FruitIntoBaskets.py)\n- [三连递增的子序列.py](Array/IncreasingTripletSubsequence.py)\n- [插入间隔.py](Array/InsertInterval.py)\n- [能组合成的最大的数.py](Array/LargestNumber.py)\n- [最长的连续子序列.py](Array/LongestConsecutiveSequence.py)\n- [岛屿的最大区域.py](Array/MaxAreaOfIsland.py)\n- [相乘最大的子数组.py](Array/MaximumProductSubarray.py)\n- [最大的子数组.py](Array/MaximumSubarray.py)\n- [合并数组.py](Array/MergeArray.py)\n- [丢失的数字.py](Array/MissingNumber.py)\n- [岛屿的数量.py](Array/NumberOfIslands.py)\n- [数组中除自己外的相乘.py](Array/ProductOfArrayExceptSelf.py)\n- [从链表尾中删除第N个节点.py](Array/RemoveNthNodeFromEndOfList.py)\n- [从旋转过的排序数组中搜索某数.py](Array/SearchInRotatedSortedArray.py)\n- [从旋转过的排序数组中搜索某数II.py](Array/SearchInRotatedSortedArrayII.py)\n- [落单的数.py](Array/SingleNumber.py)\n- [以数对为基准排序.py](Array/SortArrayByParity.py)\n- [螺旋矩阵.py](Array/SpiralMatrix.py)\n- [子数组合中最小的一个.py](Array/SumOfSubarrayMinimums.py)\n- [3D图形的表面区域.py](Array/SurfaceAreaOf3DShapes.py)\n- [被包围的区域.py](Array/SurroundedRegions.py)\n- [两个链表相加II.py](Array/AddTowNumbersII.py)\n- [两个链表相加.py](Array/AddTwoNumbers.py)\n- [两个链表相交点.py](Array/IntersectionOfTwoLinkedLists.py)\n- [数组中第k大个元素.py](Array/KthLargestElementInAnArray.py)\n- [数组中第k大个元素.js](Array/KthLargestElementInAnArray.js)\n- [链表中的环.py](Array/LinkedListCycle.py)\n- [链表中的环.js](Array/LinkedListCycle.js)\n- [翻转链表.js](Array/ReverseLinkedList.js)\n- [K个一组翻转链表.js](Array/ReverseNodesInk-Group.js)\n- [保持当前城市天际线的最大可增加能容量.py](Array/max_increase_to_keep_city_skyline.py)\n- [两个排序后的列表的中位数.py](Array/MedianOfTwoSorted.py)\n- [合并两个排序过的列表.py](Array/MergerTwoSortedList.py)\n- [合并排序的数组.py](Array/MergeSortedArray.py)\n- [两个列表的(相同部分)最小索引和.py](Array/MinimumIndexSumOfTwoLists.py)\n- [翻转对.py](Array/ReversePairs.py)\n- [2D矩阵搜索.py](Array/Search2DMatrix.py)\n- [2D矩阵搜索II.py](Array/Search2DMatrixII.py)\n- [第三大的数.py](Array/ThirdMaximumNumbers.py)\n- [3数相加.py](Array/ThreeSum.py)\n- [最频繁的K个元素.py](Array/TopKFrequentElements.py)\n- [两数相加II数组已排序.py](Array/TwoSumIIAlreadySorted.py)\n- [两数相加.py](Array/two_sum.py)\n- [两数相加.js](Array/two_sum.js)\n- [多重三数相加.py](Array/3SumWithMultiplicity.py)\n- [最佳买卖时机I_II.py](Array/BestTimeToBuyAndSellStockI_II.py)\n- [二进制子数组和.py](Array/BinarySubarraysWithSum.py)\n- [统计小于自身且在自身之后的数.py](Array/CountOfSmallerNumbersAfterSelf.py)\n- [寻找极值.py](Array/FindPeakElement.py)\n- [FizzBuzz.py](Array/FizzBuzz.py)\n- [加油站.py](Array/GasStation.py)\n- [本地和全局的倒置.py](Array/GlobalAndLocalInversions.py)\n- [组团的变位词.py](Array/GroupAnagrams.py)\n- [两数组的重叠部分.py](Array/IntersectionOfTwoArrays.py)\n- [两数组重叠部分II.py](Array/IntersectionOfTwoArraysII.py)\n- [跳跃游戏.py](Array/JumpGame.py)\n- [跳跃游戏II.py](Array/JumpGameII.py)\n- [距离最近的人的可走过的最远距离.py](Array/MaximizeDistanceToClosestPerson.py)\n- [循环子数组的最大和.py](Array/MaximumSumCircularSubarray.py)\n- [最小下落路径和.py](Array/MinimumFallingPathSum.py)\n- [最小路径和.py](Array/MinimumPathSum.py)\n- [单双链表.py](Array/OddEvenLinkedList.py)\n- [解体大数组.py](Array/PartitionArrayIntoDisjointIntervals.py)\n- [解体列表.py](Array/PartitionList.py)\n- [Pascal 三角I_II.py](Array/Pascal'sTriangleI_II.py)\n- [+1.py](Array/PlusOne.py)\n- [从已排序的数组中删除重复数据.py](Array/RemoveDuplicatesFromSortedArray.py)\n- [从已排序的数组中删除重复数据II.py](Array/RemoveDuplicatesFromSortedArrayII.py)\n- [从已排序的列表中删除重复数据.py](Array/RemoveDuplicatesFromSortedList.py)\n- [从已排序的列表中删除重复数据II.py](Array/RemoveDuplicatesFromSortedListII.py)\n- [删除链表中的元素.py](Array/RemoveLinkedListElements.py)\n- [旋转列表.py](Array/RotateList.py)\n- [在矩阵中捣蛋.py](Array/SetMatrixZeroes.py)\n- [洗牌.py](Array/ShuffleAnArray.py)\n- [最大的滑动窗口.py](Array/SlidingWindowMaximum.py)\n- [根据\"对er\"排序数组II.py](Array/SortArrayByParityII.py)\n- [颜色颜色.py](Array/SortColors.py)\n- [螺旋矩阵II.py](Array/SpiralMatrixII.py)\n- [等于K的子数组.py](Array/SubarraySumEqualsK.py)\n- [三角.py](Array/Triangle.py)\n- [单词子集.py](Array/WordSubsets.py)\n\n## [回溯](Backtracking/)\n- [生成括号.py](Backtracking/GenerateParentheses.py)\n- [子集.py](Backtracking/subsets.py)\n\n## [广度优先搜索](BFS/)\n- [树中最靠近左下的节点的值.py](BFS/FindBottomLeftTreeValue.py)\n- [二叉树层级遍历.py](BFS/BinaryTreeLevelOrderTraversal.py)\n- [二叉树层级遍历II.py](BFS/BinaryTreeLevelOrderTraversalII.py)\n- [二叉树层级 Zigzag 遍历.py](BFS/BinaryTreeZigzagLevelOrderTraversal.py)\n- [二叉树的最大深度.py](BFS/MaximumDepthOfBinaryTree.py)\n- [单词阶梯.py](BFS/WordLadder.py)\n\n## [设计类](Design/)\n- [LRU 缓存设计.py](Design/LRUCache.py)\n- [RLE 迭代器.py](Design/RLEIterator.py)\n- [O(1)复杂度的插入删除和取随机容器.py](Design/InsertDeleteGetRandomO(1).py)\n\n## [深度优先搜索](DFS/)\n- [路径和.py](DFS/PathSum.py)\n- [词搜索.py](DFS/WordSearch.py)\n- [词搜索II.py](DFS/WordSearchII.py)\n\n## [动态规划](DP/)\n- [交错的字符串.py](DP/InterleavingString.py)\n- [最长的子序列.py](DP/longesSubsequence.py)\n- [子数组的或运算.py](DP/BitwiseORsOfSubarray.py)\n- [交换硬币.py](DP/CoinChange.py)\n- [江洋大盗.py](DP/HouseRobber.py)\n- [江洋大盗II.py](DP/HouseRobberII.py)\n- [最长的连续递增子序列.py](DP/LongestContinuousIncreasingSubsequence.py)\n- [A子数组中的最大比B子数组中最小要小的子数组.py](DP/MaxASubarrayLessThanMinBSubarray.py)\n- [最大长度的数对链.py](DP/MaximumLengthOfPairChain.py)\n- [最长增长子序列的个数.py](DP/NumberofLongestIncreasingSubsequence.py)\n- [挑卡片.py](DP/PickCards.py)\n- [唯一路径.py](DP/UniquePath.py)\n- [唯一路径II.py](DP/UniquePathII.py)\n- [爬楼.py](DP/ClimbingStairs.py)\n- [爬楼.js](DP/ClimbingStairs.js)\n- [最小花费爬楼.js](DP/MinCostClimbingStairs.js)\n- [组合总和.js](DP/CombinationSum.js)\n- [解码方式.py](DP/DecodeWays.py)\n- [在某字符串中找到所有的变位词.py](DP/FindAllAnagramsInAString.py)\n- [转换字符串到单调递增.py](DP/FlipStringToMonotoneIncreasing.py)\n- [小于K的子数组积.py](DP/SubarrayProductLessThanK.py)\n- [单词中断处.py](DP/WordBreak.py)\n\n## [堆](Heap/)\n- [排序矩阵中第k小个元素.py](Heap/KthSmallestElementInASortedMatrix.py)\n- [合并K个已排序过的链表.py](Heap/MergeKSortedLists.py)\n- [合并K个已排序过的链表.js](Heap/MergeKSortedLists.js)\n- [从数据流中找中位数.py](Heap/FindMedianFromDataStream.py)\n\n## [排序](Sorted/)\n- [选择,插入,快排,归并](Sorted/sotred.py)\n- [排序列表.py](Sorted/SortList.py)\n- [奇怪的排序II.py](Sorted/WiggleSortII.py)\n\n## [纯数字问题](Number/)\n- [两数相除.py](Number/DivideTwoIntegers.py)\n- [Sqrt(x).py](Number/Sqrt(x).py)\n\n## [栈](Stack/)\n- [可取最小值的栈.py](Stack/GetMinStack.py)\n- [使用栈模拟队列.py](Stack/ImplementQueueUsingStack.py)\n- [使用递归翻转栈.py](Stack/ReverseAStackByRecursive.py)\n- [直方图中最大的矩形.py](Stack/LargestRectangleInHistogram.py)\n- [收集雨水.py](Stack/TrappingRainWater.py)\n\n## [字符串](String/)\n- [找到可被模板替换的字符串.py](String/FindAndReplacePattern.py)\n- [电话号码排列组合.py](String/LetterCombinationsOfAPhoneNumber.py)\n- [最长的公共前缀.py](String/LongestCommonPrefix.py)\n- [最小窗口子字符串.py](String/MinimumWindowSubstring.py)\n- [翻转整数.py](String/ReverseInteger.py)\n- [字符串-\u003e整数.py](String/StringToInteger.py)\n- [有效的数字.py](String/ValidNumber.py)\n- [有效的括号.py](String/ValidParentheses.py)\n- [大写侦查.py](String/DetectCapital.py)\n- [汉明距离.py](String/HammingDistance.py)\n- [实现StrStr().py](String/ImplementStrStr().py)\n- [同结构字符串.py](String/IsomorphicStrings.py)\n- [Jewels和Stones.py](String/JewelsAndStones.py)\n- [最末单词的长度.py](String/LengthOfLastWord.py)\n- [最长的子字符串.py](String/LongesSubstrings.py)\n- [最长的回文子字符串.py](String/LongestPalindromicSubstrings.py)\n- [字符串中的分段数量.py](String/NumberOfSegmentsInString.py)\n- [替换词.py](String/ReplaceWords.py)\n- [翻转字符串.py](String/ReverseString.py)\n- [转换至小写.py](String/ToLowerCase.py)\n- [词模板.py](String/WordPattern.py)\n- [字符串中最先出现的唯一字符.py](String/FirstUniqueCharacterInAString.py)\n- [长印刷名字.py](String/LongPressedName.py)\n- [使括号有效的最小添加数.py](String/MinimumAddToMakeParenthesesValid.py)\n- [字符串中的全排列.py](String/PermutationInString.py)\n- [转换单词.py](String/ShiftingLetters.py)\n- [简化路径.py](String/SimplifyPath.py)\n- [根据频率排序字符.py](String/SortCharactersByFrequency.py)\n- [独一无二的邮箱地址.py](String/UniqueEmailAddresses.py)\n- [有效变位词.py](String/ValidAnagram.py)\n- [有效回文字符串.py](String/ValidPalindrome.py)\n\n## [树](Tree/)\n- [根据前序和后序的结果生成二叉树.py](Tree/ConstructBinaryTreeFromPreorderAndPostorderTraversal.py)\n- [转换已排序的数组到二叉搜索树.py](Tree/ConvertSortedArrayToBinarySearchTree.py)\n- [转换已排序的链表到二叉搜索树.py](Tree/ConvertSortedListToBinarySearchTree.py)\n- [镜像树.py](Tree/SymmetricTree.py)\n- [有效的二叉搜索树.py](Tree/ValidateBinarySearchTree.py)\n- [二叉搜索树.py](Tree/BinarySearchTree.py)\n- [二叉树的最大路径和.py](Tree/BinaryTreeMaximumPathSum.py)\n- [路径和II.py](Tree/PathSumII.py)\n- [“结”构与解构.py](Tree/serializeAndDeserialize.py)\n- [根到叶的和.py](Tree/SumRootToLeafNumbers.py)\n- [字典树.py](Tree/Trie.py)\n- [所有可能的满二叉树.py](Tree/AllPossibleFullBinaryTree.py)\n- [右边视角的二叉树.py](Tree/BinaryTreeRightSideView.py)\n- [完整二叉树插入.py](Tree/CompleteBinaryTreeInserter.py)\n- [根据中序和后序遍历结果中构建二叉树.py](Tree/ConstructBinaryTreeFromInorderAndPostorderTraversal.py)\n- [根据前序和中序遍历结果中构建二叉树.py](Tree/ConstructBinaryTreeFromPreorderAndInorderTraversal.py)\n- [一只二叉搜索树中第k小个数.py](Tree/KthSmallestElementInABST.py)\n- [二叉搜索树中最小公共祖先.py](Tree/LowestCommonAncestorOfABinarySearchTree.py)\n- [二叉树中最小公共祖先.py](Tree/LowestCommonAncestorOfABinaryTree.py)\n- [为每个节点指定下一个右边指向.py](Tree/PopulatingNextRightPointersInEachNode.py)\n- [为每个节点指定下一个右边指向II.py](Tree/PopulatingNextRightPointersInEachNodeII.py)\n- [“结”构与解构二叉树.py](Tree/SerializeAndDeserializeBinaryTree.py)\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhubertroy%2Fleetcode","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhubertroy%2Fleetcode","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhubertroy%2Fleetcode/lists"}