文件名称：网格最短leetcodePython-leetcode:leetcode
文件大小：85KB
文件格式：ZIP
更新时间：2024-07-20 01:39:49
系统开源
数字老鼠leetcode Python 力码 力扣算法 :heart_suit: 细绳 # 标题 困难 时间 空间 标签 传奇 笔记 最后提交日期 3 中等的 上） 上） 字符串，滑动窗口 * 一关：对于范围内的右边（len（s）），相应地改变左边的位置。 2020-09-02 5 中等的 O(n^2) O(1) 细绳 * expandAroundCenter(s,i,i) 和 expandAroundCenter(s,i,i+1) 2020-09-01 13 简单的 上） O(1) 字符串，数学 是 如果 mapping[s[i]] < mapping[s[i+1]]: res -= mapping[s[i]] 2020-09-02 20 简单的 上） 上） 字符串、堆栈 是 不适用 2020-09-01 49 中等的 O(nK), n: # of strs, K: maxlen of str in strs O(nK) 细绳 * 1. collections.defaultdict(list) - 值类型是列表（默认类型是 int） 2. 使用 dict[tuple(cnt)].append(s) 或
【文件预览】：
leetcode-master
----README.md(18KB)
----python()
--------lintcode-0178-graph-valid-tree.py(2KB)
--------lintcode-0017-subsets.py(2KB)
--------lintcode-0462-total-occurrence-of-target.py(2KB)
--------lintcode-0228-middle-of-linked-list.py(1009B)
--------0416-partition-equal-subset-sum.py(4KB)
--------lintcode-0902-kth-smallest-element-in-a-bst.py(2KB)
--------lintcode-0014-first-position-of-target.py(728B)
--------lintcode-0544-top-k-largest-numbers.py(540B)
--------0956-tallest-billboard.py(4KB)
--------lintcode-0521-remove-duplicate-numbers-in-array.py(1KB)
--------lintcode-0892-alien-dictionary.py(4KB)
--------1510-stone-game-iv.py(902B)
--------0076-minimum-window-substring.py(3KB)
--------lintcode-0480-binary-tree-paths.py(2KB)
--------lintcode-0143-sort-colors-ii.py(2KB)
--------lintcode-0005-kth-largest-element.py(2KB)
--------1406-stone-game-iii.py(2KB)
--------lintcode-0144-interleaving-positive-and-negative-numbers.py(1KB)
--------lintcode-0049-sort-letters-by-case.py(960B)
--------lintcode-0900-closest-binary-search-tree-value.py(2KB)
--------lintcode-0615-course-schedule.py(1KB)
--------lintcode-0018-subsets-ii.py(2KB)
--------lintcode-0070-binary-tree-level-order-traversal-ii.py(949B)
--------0142-linked-list-cycle-ii.py(2KB)
--------lintcode-0153-combination-sum-ii.py(1KB)
--------lintcode-0127-topological-sorting.py(1KB)
--------0125-valid-palindrome.py(499B)
--------lintcode-0458-last-position-of-target.py(703B)
--------0464-can-i-win.py(2KB)
--------lintcode-0135-combination-sum.py(2KB)
--------lintcode-0031-partition-array.py(685B)
--------0680-valid-palindrome-ii.py(1KB)
--------lintcode-0596-minimum-subtree.py(1KB)
--------lintcode-0578-lowest-common-ancestor-iii.py(2KB)
--------0005-longest-palindromic-substring.py(2KB)
--------lintcode-0175-invert-binary-tree.py(1KB)
--------lintcode-0901-closest-binary-search-tree-value-ii.py(3KB)
--------lintcode-0605-sequence-reconstruction.py(2KB)
--------0494-target-sum.py(920B)
--------lintcode-0433-number-of-islands.py(2KB)
--------lintcode-0067-binary-tree-inorder-traversal.py(2KB)
--------lintcode-0464-sort-integers-ii.py(862B)
--------lintcode-0015-permutations.py(1KB)
--------0805-split-array-with-same-average.py(1KB)
--------lintcode-0120-word-ladder.py(2KB)
--------0242-valid-anagram.py(1KB)
--------0020-valid-parentheses.py(977B)
--------0424-longest-repeating-character-replacement.py(1KB)
--------lintcode-0152-combinations.py(1KB)
--------0647-palindromic-substrings.py(549B)
--------lintcode-0618-search-graph-nodes.py(1KB)
--------lintcode-0611-knight-shortest-path.py(2KB)
--------lintcode-0087-remove-node-in-binary-search-tree.py(2KB)
--------lintcode-0573-build-post-office-ii.py(3KB)
--------0198-house-robber.py(415B)
--------lintcode-0431-connected-component-in-undirected-graph.py(2KB)
--------0013-roman-to-integer.py(530B)
--------lintcode-0894-pancake-sorting.py(2KB)
--------lintcode-0461-kth-smallest-numbers-in-unsorted-array.py(2KB)
--------lintcode-0539-move-zeroes.py(2KB)
--------lintcode-0137-clone-graph.py(1KB)
--------lintcode-0071-binary-tree-zigzag-level-order-traversal.py(1KB)
--------lintcode-0373-partition-array-by-odd-and-even.py(644B)
--------lintcode-0598-zombie-in-matrix.py(2KB)
--------0518-coin-change-2.py(979B)
--------lintcode-0007-serialize-and-deserialize-binary-tree.py(2KB)
--------lintcode-0148-sort-colors.py(4KB)
--------lintcode-0448-inorder-successor-in-bst.py(3KB)
--------0049-group-anagrams.py(2KB)
--------lintcode-0088-lowest-common-ancestor-of-a-binary-tree.py(3KB)
--------0877-stone-game.py(1KB)
--------0375-guess-number-higher-or-lower-ii.py(3KB)
--------0486-predict-the-winner.py(1KB)
--------lintcode-0086-binary-search-tree-iterator.py(1KB)
--------1049-last-stone-weight-ii.py(1KB)
--------0473-matchsticks-to-square.py(2KB)
--------0969-pancake-sorting.py(2KB)
--------0322-coin-change.py(867B)
--------lintcode-0085-insert-node-in-a-binary-search-tree.py(2KB)
--------1140-stone-game-ii.py(2KB)
--------lintcode-0616-course-schedule-ii.py(1KB)
--------lintcode-0011-search-range-in-binary-search-tree.py(2KB)
--------lintcode-0093-balanced-binary-tree.py(913B)
--------lintcode-0016-permutations-ii.py(1KB)
--------lintcode-0597-subtree-with-maximum-average.py(2KB)
--------lintcode-0069-binary-tree-level-order-traversal.py(873B)
--------lintcode-0095-validate-binary-search-tree.py(2KB)
--------lintcode-0242-convert-binary-tree-to-linked-lists-by-depth.py(1KB)
--------0003-longest-substring-without-repeating-characters.py(2KB)
--------lintcode-0608-two-sum-ii-input-array-is-sorted.py(574B)
--------lintcode-0453-flatten-binary-tree-to-linked-list.py(1KB)
--------0160-intersection-of-two-linked-lists.py(1KB)
--------lintcode-0057-3sum.py(1KB)