GitHub - YcPancc/leetcode: The repo i store my leetcode codes

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 36 Commits
.vscode		.vscode
.clang-format		.clang-format
.gitignore		.gitignore
1.two-sum.cpp		1.two-sum.cpp
1005.maximize-sum-of-array-after-k-negations.cpp		1005.maximize-sum-of-array-after-k-negations.cpp
101.symmetric-tree.cpp		101.symmetric-tree.cpp
102.binary-tree-level-order-traversal.cpp		102.binary-tree-level-order-traversal.cpp
104.maximum-depth-of-binary-tree.cpp		104.maximum-depth-of-binary-tree.cpp
1047.remove-all-adjacent-duplicates-in-string.cpp		1047.remove-all-adjacent-duplicates-in-string.cpp
105.construct-binary-tree-from-preorder-and-inorder-traversal.cpp		105.construct-binary-tree-from-preorder-and-inorder-traversal.cpp
106.construct-binary-tree-from-inorder-and-postorder-traversal.cpp		106.construct-binary-tree-from-inorder-and-postorder-traversal.cpp
107.binary-tree-level-order-traversal-ii.cpp		107.binary-tree-level-order-traversal-ii.cpp
108.convert-sorted-array-to-binary-search-tree.cpp		108.convert-sorted-array-to-binary-search-tree.cpp
110.balanced-binary-tree.cpp		110.balanced-binary-tree.cpp
111.minimum-depth-of-binary-tree.cpp		111.minimum-depth-of-binary-tree.cpp
112.path-sum.cpp		112.path-sum.cpp
116.populating-next-right-pointers-in-each-node.cpp		116.populating-next-right-pointers-in-each-node.cpp
117.populating-next-right-pointers-in-each-node-ii.cpp		117.populating-next-right-pointers-in-each-node-ii.cpp
122.best-time-to-buy-and-sell-stock-ii.cpp		122.best-time-to-buy-and-sell-stock-ii.cpp
131.palindrome-partitioning.cpp		131.palindrome-partitioning.cpp
134.gas-station.cpp		134.gas-station.cpp
135.candy.cpp		135.candy.cpp
142.linked-list-cycle-ii.cpp		142.linked-list-cycle-ii.cpp
144.binary-tree-preorder-traversal.cpp		144.binary-tree-preorder-traversal.cpp
145.binary-tree-postorder-traversal.cpp		145.binary-tree-postorder-traversal.cpp
15.3-sum.cpp		15.3-sum.cpp
150.evaluate-reverse-polish-notation.cpp		150.evaluate-reverse-polish-notation.cpp
151.reverse-words-in-a-string.cpp		151.reverse-words-in-a-string.cpp
160.intersection-of-two-linked-lists.cpp		160.intersection-of-two-linked-lists.cpp
17.letter-combinations-of-a-phone-number.cpp		17.letter-combinations-of-a-phone-number.cpp
18.4-sum.cpp		18.4-sum.cpp
19.remove-nth-node-from-end-of-list.cpp		19.remove-nth-node-from-end-of-list.cpp
199.binary-tree-right-side-view.cpp		199.binary-tree-right-side-view.cpp
20.valid-parentheses.cpp		20.valid-parentheses.cpp
202.happy-number.cpp		202.happy-number.cpp
203.remove-linked-list-elements.cpp		203.remove-linked-list-elements.cpp
206.reverse-linked-list.cpp		206.reverse-linked-list.cpp
209.minimum-size-subarray-sum.cpp		209.minimum-size-subarray-sum.cpp
216.combination-sum-iii.cpp		216.combination-sum-iii.cpp
222.count-complete-tree-nodes.cpp		222.count-complete-tree-nodes.cpp
225.implement-stack-using-queues.cpp		225.implement-stack-using-queues.cpp
226.invert-binary-tree.cpp		226.invert-binary-tree.cpp
232.implement-queue-using-stacks.cpp		232.implement-queue-using-stacks.cpp
235.lowest-common-ancestor-of-a-binary-search-tree.cpp		235.lowest-common-ancestor-of-a-binary-search-tree.cpp
236.lowest-common-ancestor-of-a-binary-tree.cpp		236.lowest-common-ancestor-of-a-binary-tree.cpp
239.sliding-window-maximum.cpp		239.sliding-window-maximum.cpp
24.swap-nodes-in-pairs.cpp		24.swap-nodes-in-pairs.cpp
242.valid-anagram.cpp		242.valid-anagram.cpp
257.binary-tree-paths.cpp		257.binary-tree-paths.cpp
26.remove-duplicates-from-sorted-array.cpp		26.remove-duplicates-from-sorted-array.cpp
27.remove-element.cpp		27.remove-element.cpp
28.find-the-index-of-the-first-occurrence-in-a-string.cpp		28.find-the-index-of-the-first-occurrence-in-a-string.cpp
283.move-zeroes.cpp		283.move-zeroes.cpp
332.reconstruct-itinerary.cpp		332.reconstruct-itinerary.cpp
34.find-first-and-last-position-of-element-in-sorted-array.cpp		34.find-first-and-last-position-of-element-in-sorted-array.cpp
343.integer-break.cpp		343.integer-break.cpp
344.reverse-string.cpp		344.reverse-string.cpp
347.top-k-frequent-elements.cpp		347.top-k-frequent-elements.cpp
349.intersection-of-two-arrays.cpp		349.intersection-of-two-arrays.cpp
35.search-insert-position.cpp		35.search-insert-position.cpp
367.valid-perfect-square.cpp		367.valid-perfect-square.cpp
37.sudoku-solver.cpp		37.sudoku-solver.cpp
376.wiggle-subsequence.cpp		376.wiggle-subsequence.cpp
383.ransom-note.cpp		383.ransom-note.cpp
39.combination-sum.cpp		39.combination-sum.cpp
40.combination-sum-ii.cpp		40.combination-sum-ii.cpp
404.sum-of-left-leaves.cpp		404.sum-of-left-leaves.cpp
406.queue-reconstruction-by-height.cpp		406.queue-reconstruction-by-height.cpp
429.n-ary-tree-level-order-traversal.cpp		429.n-ary-tree-level-order-traversal.cpp
435.non-overlapping-intervals.cpp		435.non-overlapping-intervals.cpp
44.km-developer-purchases-land.cpp		44.km-developer-purchases-land.cpp
45.jump-game-ii.cpp		45.jump-game-ii.cpp
450.delete-node-in-a-bst.cpp		450.delete-node-in-a-bst.cpp
452.minimum-number-of-arrows-to-burst-balloons.cpp		452.minimum-number-of-arrows-to-burst-balloons.cpp
454.4-sum-ii.cpp		454.4-sum-ii.cpp
455.assign-cookies.cpp		455.assign-cookies.cpp
459.repeated-substring-pattern.cpp		459.repeated-substring-pattern.cpp
46.permutations.cpp		46.permutations.cpp
47.permutations-ii.cpp		47.permutations-ii.cpp
491.non-decreasing-subsequences.cpp		491.non-decreasing-subsequences.cpp
501.find-mode-in-binary-search-tree.cpp		501.find-mode-in-binary-search-tree.cpp
509.fibonacci-number.cpp		509.fibonacci-number.cpp
51.n-queens.cpp		51.n-queens.cpp
513.find-bottom-left-tree-value.cpp		513.find-bottom-left-tree-value.cpp
515.find-largest-value-in-each-tree-row.cpp		515.find-largest-value-in-each-tree-row.cpp
53.maximum-subarray.cpp		53.maximum-subarray.cpp
530.minimum-absolute-difference-in-bst.cpp		530.minimum-absolute-difference-in-bst.cpp
538.convert-bst-to-greater-tree.cpp		538.convert-bst-to-greater-tree.cpp
54.km-replace-number.cpp		54.km-replace-number.cpp
54.spiral-matrix.cpp		54.spiral-matrix.cpp
541.reverse-string-ii.cpp		541.reverse-string-ii.cpp
55.jump-game.cpp		55.jump-game.cpp
55.km-right-handed-string.cpp		55.km-right-handed-string.cpp
56.merge-intervals.cpp		56.merge-intervals.cpp
58.km-interval-sum.cpp		58.km-interval-sum.cpp
59.spiral-matrix-ii.cpp		59.spiral-matrix-ii.cpp
617.merge-two-binary-trees.cpp		617.merge-two-binary-trees.cpp
62.unique-paths.cpp		62.unique-paths.cpp
63.unique-paths-ii.cpp		63.unique-paths-ii.cpp
637.average-of-levels-in-binary-tree.cpp		637.average-of-levels-in-binary-tree.cpp