文件名称：leetcode同行同列-leetcode:leetcode问题的Python解决方案
文件大小：77KB
文件格式：ZIP
更新时间：2024-07-21 02:40:34
系统开源
leetcode 越过同列这是由 Richard Cocoules 创建的 Leetcode 解决方案存储库。 解决方案是用 python 编码的，并与随附的问题陈述文件一起放在单独的文件夹中。 目录组织如下： $(问题编号)-$(问题名称) $(问题编号)-$(问题名称).py desc-$(问题编号)-$(问题名称).md
【文件预览】：
leetcode-master
----002-add-two-numbers()
--------002-add-two-numbers.py(732B)
--------desc-002-add-two-numbers.md(410B)
----0005-valid-sequence-from-root-to-leaves()
--------desc-0005-valid-sequence-from-root-to-leaves.md(1KB)
--------0005-valid-sequence-from-root-to-leaves.py(669B)
----.gitignore(2KB)
----146-lru-cache()
--------146-lru-cache.py(859B)
--------desc-146-lru-cache.md(959B)
----221-maximal-square()
--------221-maximal-square.py(2KB)
--------desc-221-maximal-square.md(206B)
----1008-construct-binary-search()
--------desc-1008-construct-binary-search.md(553B)
--------1008-construct-binary-search.py(1KB)
----007-reverse-integer()
--------007-reverse-integer.py(739B)
--------desc-007-reverse-integer.md(465B)
----README.md(344B)
----678-valid-parenthesis-string()
--------desc-678-valid-parenthesis-string.md(769B)
--------678-valid-parenthesis-string.py(258B)
----0002-perform-string-shifts()
--------desc-0002-perform-string-shifts.md(1KB)
--------0002-perform-string-shifts.py(549B)
----238-product-of-array()
--------238-product-of-array.py(345B)
--------desc-238-product-of-array.md(580B)
----876-middle-of-the-linked-list()
--------desc-876-middle-of-the-linked-list.md(749B)
--------876-middle-of-the-linked-list.py(613B)
----0004-first-unique-number()
--------0004-first-unique-number.py(733B)
--------desc-0004-first-unique-number.md(2KB)
----560-subarray-sum-equals-k()
--------560-subarray-sum-equals-k.py(700B)
--------desc-560-subarray-sum-equals-k.md(348B)
----809-expressive-words()
--------desc-809-expressive-words.md(1KB)
--------809-expressive-words.py(2KB)
----003-longest-substring()
--------desc-003-longest-substring.md(526B)
--------003-longest-substring.py(877B)
----001-two-sum()
--------desc-001-two-sum.md(335B)
--------001-two-sum.py(1KB)
----008-string-to-integer-atoi()
--------desc-008-string-to-integer-atoi.md(2KB)
--------008-string-to-integer-atoi.py(2KB)
----525-contiguous-array()
--------525-contiguous-array.py(1KB)
--------desc-525-contiguous-array.md(447B)
----1046-last-stone-weight()
--------1046-last-stone-weight.py(710B)
--------desc-1046-last-stone-weight.md(928B)
----844-backspace-string-compare()
--------844-backspace-string-compare.py(611B)
--------desc-844-backspace-string-compare.md(744B)
----013-roman-to-integer()
--------013-roman-to-integer.py(1KB)
--------desc-013-roman-to-integer.md(1KB)
----055-jump-game()
--------desc-055-jump-game.md(588B)
--------055-jump-game.py(502B)
----014-longest-common-prefix()
--------014-longest-common-prefix.py(1KB)
--------desc-014-longest-common-prefix.md(398B)
----049-group-anagrams()
--------desc-049-group-anagrams.md(320B)
--------049-group-anagrams.py(819B)
----015-3sum()
--------015-3sum.py(1KB)
--------desc-015-3sum.md(346B)
----201-bitwise-and()
--------desc-201-bitwise-and.md(205B)
--------201-bitwise-and.py(333B)
----283-move-zeroes()
--------desc-283-move-zeroes.md(310B)
--------283-move-zeroes.py(444B)
----155-min-stack()
--------desc-155-min-stack.md(557B)
--------155-min-stack.py(1KB)
----064-minimum-path-sum()
--------desc-064-minimum-path-sum.md(388B)
--------064-minimum-path-sum.py(2KB)
----122-best-time-to-buy-and-sell-stock-2()
--------desc-122-best-time-to-buy-and-sell-stock-2.md(1KB)
--------122-best-time-to-buy-and-sell-stock-2.py(1KB)
----124-binary-tree-max-path()
--------124-binary-tree-max-path.py(640B)
--------desc-124-binary-tree-max-path.md(488B)
----121-best-time-to-buy-and-sell-stock()
--------desc-121-best-time-to-buy-and-sell-stock.md(652B)
--------121-best-time-to-buy-and-sell-stock.py(649B)
----005-longest-palindromic-substring()
--------desc-005-longest-palindromic-substring.md(286B)
--------005-longest-palindromic-substring.py(2KB)
----136-single-number()
--------desc-136-single-number.md(319B)
--------136-single-number.py(370B)
----200-number-of-islands()
--------desc-200-number-of-islands.md(415B)
--------200-number-of-islands.py(824B)
----226-invert-binary-tree()
--------desc-226-invert-binary-tree.md(402B)
--------226-invert-binary-tree.py(360B)
----0003-leftmost-column()
--------desc-0003-leftmost-column.md(1KB)
--------0003-leftmost-column.py(687B)
----033-search-in-rotated-array()
--------desc-033-search-in-rotated-array.md(521B)
--------033-search-in-rotated-array.py(2KB)
----543-diameter-of-binary-tree()
--------543-diameter-of-binary-tree.py(549B)
--------desc-543-diameter-of-binary-tree.md(492B)
----053-maximum-subarray()
--------053-maximum-subarray.py(2KB)
--------desc-053-maximum-subarray.md(392B)
----273-integer-to-english-words()
--------273-integer-to-english-words.py(2KB)
--------desc-273-integer-to-english-words.md(539B)
----0001-counting-elements()
--------0001-counting-elements.py(572B)
--------desc-0001-counting-elements.md(630B)
----011-container-with-most-water()
--------test(43KB)
--------desc-011-container-with-most-water.md(698B)
--------011-container-with-most-water.py(2KB)
----202-happy-number()
--------202-happy-number.py(502B)
--------desc-202-happy-number.md(546B)