文件名称：LeetCode:我的LeetCode解决历史记录
文件大小：67KB
文件格式：ZIP
更新时间：2024-05-12 16:15:31
Python
LeetCode 这是LeetCode代码存储库。 我使用VSCode插件Leetcode与Leetcode进行交互。 现在我主要使用Python和Typescript 。 借此机会改善编码意识和算法思维。 我通常每月进行一次锻炼，因此每天我都会在此仓库中添加一个新问题。
【文件预览】：
LeetCode-master
----971.flip-binary-tree-to-match-preorder-traversal.py(2KB)
----206.reverse-linked-list.py(919B)
----1658.minimum-operations-to-reduce-x-to-zero.py(1KB)
----.gitignore(2KB)
----38.count-and-say.py(1KB)
----417.pacific-atlantic-water-flow.py(1KB)
----31.next-permutation.py(1KB)
----714.best-time-to-buy-and-sell-stock-with-transaction-fee.py(1KB)
----98.validate-binary-search-tree.py(1KB)
----1663.smallest-string-with-a-given-numeric-value.py(698B)
----387.first-unique-character-in-a-string.py(560B)
----215.kth-largest-element-in-an-array.py(444B)
----594.longest-harmonious-subsequence.py(800B)
----1302.deepest-leaves-sum.py(792B)
----234.palindrome-linked-list.py(1KB)
----1631.path-with-minimum-effort.py(2KB)
----242.valid-anagram.py(418B)
----1675.minimize-deviation-in-array.py(1KB)
----966.vowel-spellchecker.py(1KB)
----1673.find-the-most-competitive-subsequence.ts(1KB)
----12.integer-to-roman.py(821B)
----71.simplify-path.py(549B)
----240.search-a-2-d-matrix-ii.py(604B)
----2.add-two-numbers.py(1KB)
----1332.remove-palindromic-subsequences.py(395B)
----1641.count-sorted-vowel-strings.py(806B)
----870.advantage-shuffle.py(920B)
----1679.max-number-of-k-sum-pairs.ts(997B)
----977.squares-of-a-sorted-array.py(716B)
----199.binary-tree-right-side-view.py(1000B)
----86.partition-list.py(1KB)
----895.maximum-frequency-stack.py(1KB)
----856.score-of-parentheses.py(627B)
----354.russian-doll-envelopes.py(1KB)
----869.reordered-power-of-2.py(687B)
----524.longest-word-in-dictionary-through-deleting.py(918B)
----1437.check-if-all-1-s-are-at-least-length-k-places-away.py(652B)
----Pipfile.lock(9KB)
----535.encode-and-decode-tiny-url.py(1KB)
----268.missing-number.py(421B)
----191.number-of-1-bits.py(453B)
----21.merge-two-sorted-lists.py(767B)
----284.peeking-iterator.py(2KB)
----23.merge-k-sorted-lists.ts(1KB)
----82.remove-duplicates-from-sorted-list-ii.py(1022B)
----237.delete-node-in-a-linked-list.py(658B)
----376.wiggle-subsequence.py(757B)
----48.rotate-image.py(879B)
----125.valid-palindrome.py(492B)
----8.string-to-integer-atoi.py(839B)
----19.remove-nth-node-from-end-of-list.py(939B)
----160.intersection-of-two-linked-lists.py(780B)
----881.boats-to-save-people.py(794B)
----README.md(306B)
----575.distribute-candies.py(424B)
----706.design-hash-map.py(2KB)
----785.is-graph-bipartite.py(896B)
----13.roman-to-integer.py(747B)
----987.vertical-order-traversal-of-a-binary-tree.py(1KB)
----1640.check-array-formation-through-concatenation.py(636B)
----189.rotate-array.py(517B)
----14.longest-common-prefix.py(621B)
----Pipfile(185B)
----7.reverse-integer.py(466B)
----1657.determine-if-two-strings-are-close.ts(1KB)
----28.implement-str-str.py(561B)
----423.reconstruct-original-digits-from-english.py(1KB)
----509.fibonacci-number.py(553B)
----344.reverse-string.py(528B)
----936.stamping-the-sequence.py(2KB)
----1646.get-maximum-in-generated-array.py(673B)
----581.shortest-unsorted-continuous-subarray.py(535B)
----623.add-one-row-to-tree.py(1KB)
----1342.number-of-steps-to-reduce-a-number-to-zero.py(654B)
----645.set-mismatch.py(474B)
----821.shortest-distance-to-a-character.py(771B)
----1649.create-sorted-array-through-instructions.py(844B)
----.vscode()
--------.ropeproject()
--------settings.json(0B)
----377.combination-sum-iv.py(987B)
----104.maximum-depth-of-binary-tree.py(764B)
----775.global-and-local-inversions.py(748B)
----5.longest-palindromic-substring.ts(1015B)
----1680.concatenation-of-consecutive-binary-numbers.py(500B)
----138.copy-list-with-random-pointer.py(819B)
----3.longest-substring-without-repeating-characters.py(1KB)
----538.convert-bst-to-greater-tree.py(855B)
----122.best-time-to-buy-and-sell-stock-ii.py(567B)
----669.trim-a-binary-search-tree.py(1KB)
----136.single-number.py(532B)
----141.linked-list-cycle.py(811B)
----20.valid-parentheses.ts(646B)
----1329.sort-the-matrix-diagonally.ts(997B)
----991.broken-calculator.py(521B)
----217.contains-duplicate.py(406B)
----36.valid-sudoku.py(641B)
----1721.swapping-nodes-in-a-linked-list.py(964B)
----350.intersection-of-two-arrays-ii.py(493B)