GitHub - jiayouxujin/Algorithm: 定个小目标，每天一道算法题

jiayouxujin / Algorithm Public

Notifications You must be signed in to change notification settings
Fork 0
Star 1

定个小目标，每天一道算法题

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 431 Commits
algorithm		algorithm
binary		binary
diffarray		diffarray
doublepointer		doublepointer
doublepointer2		doublepointer2
interview		interview
lookup		lookup
loop		loop
niuke		niuke
prepare		prepare
presum		presum
singlestack		singlestack
towpointerarray		towpointerarray
window		window
.gitignore		.gitignore
1-two-sum.go		1-two-sum.go
101-symmetric-tree.go		101-symmetric-tree.go
102-binary-tree-level-order-traversal.go		102-binary-tree-level-order-traversal.go
103-binary-tree-zigzag-level-order-traversal.go		103-binary-tree-zigzag-level-order-traversal.go
104-maximum-depth-of-binary-tree.go		104-maximum-depth-of-binary-tree.go
105-construct-binary-tree-from-preorder-and-inorder-traversal.go		105-construct-binary-tree-from-preorder-and-inorder-traversal.go
110-balanced-binary-tree.go		110-balanced-binary-tree.go
112-path-sum.go		112-path-sum.go
113-path-sum-ii.go		113-path-sum-ii.go
1143-longest-common-subsequence.go		1143-longest-common-subsequence.go
121-best-time-to-buy-and-sell-stock.go		121-best-time-to-buy-and-sell-stock.go
124-binary-tree-maximum-path-sum.go		124-binary-tree-maximum-path-sum.go
128-longest-consecutive-sequence.go		128-longest-consecutive-sequence.go
129-sum-root-to-leaf-numbers.go		129-sum-root-to-leaf-numbers.go
136-single-number.go		136-single-number.go
14-longest-common-prefix.go		14-longest-common-prefix.go
142-linked-list-cycle-ii.go		142-linked-list-cycle-ii.go
143-reorder-list.go		143-reorder-list.go
144-binary-tree-preorder-traversal.go		144-binary-tree-preorder-traversal.go
146-lru-cache.go		146-lru-cache.go
148-sort-list.go		148-sort-list.go
15-3sum.go		15-3sum.go
151-reverse-words-in-a-string.go		151-reverse-words-in-a-string.go
152-maximum-product-subarray.go		152-maximum-product-subarray.go
155-min-stack.go		155-min-stack.go
160-intersection-of-two-linked-lists.go		160-intersection-of-two-linked-lists.go
162-find-peak-element.go		162-find-peak-element.go
169-majority-element.go		169-majority-element.go
179-largest-number.go		179-largest-number.go
198-house-robber.go		198-house-robber.go
199-binary-tree-right-side-view.go		199-binary-tree-right-side-view.go
2-add-two-numbers.go		2-add-two-numbers.go
20-valid-parentheses.go		20-valid-parentheses.go
200-number-of-islands.go		200-number-of-islands.go
206-reverse-linked-list.go		206-reverse-linked-list.go
21-diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof.go		21-diao-zheng-shu-zu-shun-xu-shi-qi-shu-wei-yu-ou-shu-qian-mian-lcof.go
21-merge-two-sorted-lists.go		21-merge-two-sorted-lists.go
215-kth-largest-element-in-an-array.go		215-kth-largest-element-in-an-array.go
22-generate-parentheses.go		22-generate-parentheses.go
221-maximal-square.go		221-maximal-square.go
226-invert-binary-tree.go		226-invert-binary-tree.go
23-merge-k-sorted-lists.go		23-merge-k-sorted-lists.go
232-implement-queue-using-stacks.go		232-implement-queue-using-stacks.go
236-lowest-common-ancestor-of-a-binary-tree.go		236-lowest-common-ancestor-of-a-binary-tree.go
25-reverse-nodes-in-k-group.go		25-reverse-nodes-in-k-group.go
3-longest-substring-without-repeating-characters.go		3-longest-substring-without-repeating-characters.go
300-longest-increasing-subsequence.go		300-longest-increasing-subsequence.go
32-longest-valid-parentheses.go		32-longest-valid-parentheses.go
322-coin-change.go		322-coin-change.go
39-combination-sum.go		39-combination-sum.go
41-first-missing-positive.go		41-first-missing-positive.go
415-add-strings.go		415-add-strings.go
42-trapping-rain-water.go		42-trapping-rain-water.go
43-multiply-strings.go		43-multiply-strings.go
46-permutations.go		46-permutations.go
48-rotate-image.go		48-rotate-image.go
5-longest-palindromic-substring.go		5-longest-palindromic-substring.go
53-maximum-subarray.go		53-maximum-subarray.go
54-spiral-matrix.go		54-spiral-matrix.go
543-diameter-of-binary-tree.go		543-diameter-of-binary-tree.go
56-merge-intervals.go		56-merge-intervals.go
62-unique-paths.go		62-unique-paths.go
64-minimum-path-sum.go		64-minimum-path-sum.go
69-sqrt.go		69-sqrt.go
70-climbing-stairs.go		70-climbing-stairs.go
704-binary-search.go		704-binary-search.go
718-maximum-length-of-repeated-subarray.go		718-maximum-length-of-repeated-subarray.go
72-edit-distance-2.go		72-edit-distance-2.go
72-edit-distance.go		72-edit-distance.go
78-subsets.go		78-subsets.go
82-remove-duplicates-from-sorted-list-ii.go		82-remove-duplicates-from-sorted-list-ii.go
912-sort-an-arra-mergesort.go		912-sort-an-arra-mergesort.go
912-sort-an-array-heapsort.go		912-sort-an-array-heapsort.go
912-sort-an-array.go		912-sort-an-array.go
92-reverse-linked-list-ii.go		92-reverse-linked-list-ii.go
94-binary-tree-inorder-traversal-no.go		94-binary-tree-inorder-traversal-no.go
94-binary-tree-inorder-traversal.go		94-binary-tree-inorder-traversal.go
98-validate-binary-search-tree.go		98-validate-binary-search-tree.go
go.mod		go.mod