algorithm-lab

整个repo是用来存储自己平时写的算法（主要是为了练习算法）。大部分都是用golang写的，以后也许会用rust重写一遍。

主要实现以下算法：

《剑指offer》的所有算法。
经典排序算法。
经典的动态规划算法。《暂未实现》
一些leetcode题目。
基本数据结构（队列，双端队列，链表，双向链表，二叉树，bst，栈，堆等）
其他

所有的算法都配套UniTest，UnitTest真好。。

Name		Name	Last commit message	Last commit date
Latest commit History 73 Commits
code-interviews		code-interviews
common		common
leetcode		leetcode
sort		sort
.gitignore		.gitignore
README.md		README.md
binary-search-tree.go		binary-search-tree.go
binary-search-tree_test.go		binary-search-tree_test.go
binary-tree-mirror.go		binary-tree-mirror.go
binary-tree-mirror_test.go		binary-tree-mirror_test.go
clone-complex-list.go		clone-complex-list.go
clone-complex-list_test.go		clone-complex-list_test.go
convert-bst-node-to-list.go		convert-bst-node-to-list.go
convert-bst-node-to-list_test.go		convert-bst-node-to-list_test.go
delete-duplication.go		delete-duplication.go
delete-duplication_test.go		delete-duplication_test.go
entry-node-of-loop.go		entry-node-of-loop.go
entry-node-of-loop_test.go		entry-node-of-loop_test.go
fibonacci.go		fibonacci.go
fibonacci_test.go		fibonacci_test.go
find-all-path-equal-target.go		find-all-path-equal-target.go
find-all-path-equal-target_test.go		find-all-path-equal-target_test.go
find-continuous-sequence.go		find-continuous-sequence.go
find-continuous-sequence_test.go		find-continuous-sequence_test.go
find-duplicate-number-array.go		find-duplicate-number-array.go
find-duplicate-number-array_test.go		find-duplicate-number-array_test.go
find-first-common-node.go		find-first-common-node.go
find-first-common-node_test.go		find-first-common-node_test.go
find-greatest-sum-of-subarray.go		find-greatest-sum-of-subarray.go
find-greatest-sum-of-subarray_test.go		find-greatest-sum-of-subarray_test.go
find-in-matrix.go		find-in-matrix.go
find-in-matrix_test.go		find-in-matrix_test.go
find-kth-to-tail.go		find-kth-to-tail.go
find-kth-to-tail_test.go		find-kth-to-tail_test.go
find-numbers-with-sum.go		find-numbers-with-sum.go
find-numbers-with-sum_test.go		find-numbers-with-sum_test.go
first-appearing-once.go		first-appearing-once.go
first-appearing-once_test.go		first-appearing-once_test.go
first-not-repeating-char.go		first-not-repeating-char.go
first-not-repeating-char_test.go		first-not-repeating-char_test.go
get-k-least-numbers.go		get-k-least-numbers.go
get-k-least-numbers_test.go		get-k-least-numbers_test.go
get-median-from-stream.go		get-median-from-stream.go
get-median-from-stream_test.go		get-median-from-stream_test.go
get-next-node-in-binary-tree.go		get-next-node-in-binary-tree.go
get-next-node-in-binary-tree_test.go		get-next-node-in-binary-tree_test.go
get-number-of-k.go		get-number-of-k.go
get-number-of-k_test.go		get-number-of-k_test.go
get-ugly-number.go		get-ugly-number.go
go.mod		go.mod
go.sum		go.sum
has-subtree.go		has-subtree.go
has-subtree_test.go		has-subtree_test.go
heap-sort.go		heap-sort.go
heap-sort_test.go		heap-sort_test.go
inverse-pairs.go		inverse-pairs.go
inverse-pairs_test.go		inverse-pairs_test.go
is-balance-binary-tree.go		is-balance-binary-tree.go
is-balance-binary-tree_test.go		is-balance-binary-tree_test.go
is-stack-poporder.go		is-stack-poporder.go
is-stack-poporder_test.go		is-stack-poporder_test.go
is-symmetrical-binary-tree.go		is-symmetrical-binary-tree.go
is-symmetrical-binary-tree_test.go		is-symmetrical-binary-tree_test.go
is-valid.go		is-valid.go
is-valid_test.go		is-valid_test.go
jump-floor-2.go		jump-floor-2.go
jump-floor.go		jump-floor.go
left-rotate-string.go		left-rotate-string.go
left-rotate-string_test.go		left-rotate-string_test.go
lru.go		lru.go
lru_test.go		lru_test.go
max-sliding-window.go		max-sliding-window.go
max-sliding-window_test.go		max-sliding-window_test.go
merge-sorted-list.go		merge-sorted-list.go
merge-sorted-list_test.go		merge-sorted-list_test.go
min-number-in-rotate-array.go		min-number-in-rotate-array.go
min-number-in-rotate-array_test.go		min-number-in-rotate-array_test.go
min-stack.go		min-stack.go
min-stack_test.go		min-stack_test.go
more-than-half-number.go		more-than-half-number.go
more-than-half-number_test.go		more-than-half-number_test.go
myqueue.go		myqueue.go
myqueue_test.go		myqueue_test.go
mystack.go		mystack.go
mystack_test.go		mystack_test.go
number-of-1-between-1-and-N.go		number-of-1-between-1-and-N.go
number-of-1-between-1-and-N_test.go		number-of-1-between-1-and-N_test.go
number-of-one.go		number-of-one.go
print-binary-tree-as-z-word-style.go		print-binary-tree-as-z-word-style.go
print-binary-tree-as-z-word-style_test.go		print-binary-tree-as-z-word-style_test.go
print-list-from-tail-to-head.go		print-list-from-tail-to-head.go
print-list-from-tail-to-head_test.go		print-list-from-tail-to-head_test.go
print-matrix.go		print-matrix.go
print-matrix_test.go		print-matrix_test.go
print-min-number.go		print-min-number.go
print-min-number_test.go		print-min-number_test.go
reconstruct-binary-tree.go		reconstruct-binary-tree.go
reconstruct-binary-tree_test.go		reconstruct-binary-tree_test.go
rect-cover.go		rect-cover.go
regexp-match.go		regexp-match.go

elvin-du/algorithm-lab

Folders and files

Latest commit

History