geektime-algorithm-learn

module

v0.0.0-...-55fa3f2 Latest Latest Go to latest Published: May 10, 2022 License: MIT

Details

Valid go.mod file
Redistributable license
Tagged version
Stable version
Learn more about best practices

Repository

gitee.com/dllearn/geektime-algorithm-learn

Links

Open Source Insights

README ¶

geektime-algorithm-learn

介绍

geek time algorithm learn
用于学习极客时间的算法

Directories ¶

Path	Synopsis
leetcode
0001.two-sum
0003.longest-substring-without-repeating-characters
0012.integer-to-roman
0013.roman-to-integer
0019.remove-nth-node-from-end-of-list
0020.valid-parentheses
0021.merge-two-sorted-lists
0022.generate-parentheses
0023.merge-k-sorted-lists
0025.reverse-nodes-in-k-group
0026.Remove-Duplicates-from-Sorted-Array
0027.remove-element
0030.substring-with-concatenation-of-all-words
0035.search-insert-position
0046.permutations
0047.permutations-ii
0049.group-anagrams
0050.powx-n
0066.plus-one
0077.combinations
0078.subsets
0083.remove-duplicates-from-sorted-list
0088.Merge-Sorted-Array
0094.binary-tree-inorder-traversal
0098.validate-binary-search-tree
0100.same-tree
0101.symmetric-tree
0102.binary-tree-level-order-traversal
0103.binary-tree-zigzag-level-order-traversal
0104.maximum-depth-of-binary-tree
0105.construct-binary-tree-from-preorder-and-inorder-traversal
0106.construct-binary-tree-from-inorder-and-postorder-traversal
0107.binary-tree-level-order-traversal-ii
0108.convert-sorted-array-to-binary-search-tree
0109.convert-sorted-list-to-binary-search-tree
0110.balanced-binary-tree
0111.minimum-depth-of-binary-tree
0112.path-sum
0113.path-sum-ii
0114.flatten-binary-tree-to-linked-list
0141.linked-list-cycle
0142.linked-list-cycle-ii
0144.binary-tree-preorder-traversal
0145.binary-tree-postorder-traversal
0146.lru-cache
0146.lru-cache/test
0150.evaluate-reverse-polish-notation
0155.min-stack
0167.two-sum-ii-input-array-is-sorted
0189.rotate-array
0206.reverse-linked-list
0207.course-schedule
0210.course-schedule-ii
0217.contains-duplicate
0224.basic-calculator
0226.invert-binary-tree
0227.basic-calculator-ii
0236.lowest-common-ancestor-of-a-binary-tree
0237.delete-node-in-a-linked-list
0239.sliding-window-maximum
0278.first-bad-version
0283.Move-Zeroes
0297.serialize-and-deserialize-binary-tree
0344.reverse-string
0355.design-twitter
0429.n-ary-tree-level-order-traversa
0450.delete-node-in-a-bst
0538.convert-bst-to-greater-tree
0557.reverse-words-in-a-string-iii
0567.permutation-in-string
0589.n-ary-tree-preorder-traversal
0684.redundant-connection
0697.degree-of-an-array
0701.insert-into-a-binary-search-tree
0704.binary-search
0811.subdomain-visit-count
0874.walking-robot-simulation
0876.middle-of-the-linked-list
0977.squares-of-a-sorted-array
0997.find-the-town-judge
1038.binary-search-tree-to-greater-sum-tree
1245.tree-diameter
structures

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL