GitHub - plmsmile/aim2offer: aim2offer programming algorithms

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 50 Commits
00_0_cpp_api		00_0_cpp_api
00_1_dfs		00_1_dfs
00_2_tree		00_2_tree
03_find_duplicate_nums		03_find_duplicate_nums
04_findnum_order_matrix		04_findnum_order_matrix
05_replacespace_reverse		05_replacespace_reverse
06_listnode		06_listnode
07_construct_binary_tree		07_construct_binary_tree
08_tree_next_node		08_tree_next_node
09_stack2queue		09_stack2queue
10_fibonacci		10_fibonacci
11_sort		11_sort
12_matrix_path		12_matrix_path
13_robot_run_range		13_robot_run_range
14_cutting_rope		14_cutting_rope
15_binary_1_count		15_binary_1_count
16_power		16_power
17_print_1_to_maxn		17_print_1_to_maxn
18_del_node_in_list		18_del_node_in_list
19_regular_expression_matching		19_regular_expression_matching
20_is_numeric		20_is_numeric
21_reorder_array		21_reorder_array
22_kth_node_from_end		22_kth_node_from_end
23_circle_entry		23_circle_entry
24_reverse_list		24_reverse_list
25_merge_lists		25_merge_lists
26_sub_tree		26_sub_tree
27_btree_mirror		27_btree_mirror
28_btree_symmetric		28_btree_symmetric
29_print_matrix		29_print_matrix
30_min_stack		30_min_stack
31_is_stack_poporder		31_is_stack_poporder
32_zigzag_levelorder		32_zigzag_levelorder
33_bst_postorder		33_bst_postorder
34_btree_path_sum		34_btree_path_sum
35_complex_list_copy		35_complex_list_copy
36_bst2list.cpp		36_bst2list.cpp
37_serialize_btree		37_serialize_btree
38_num_permutations		38_num_permutations
39_majority_element		39_majority_element
40_min_kth_nums		40_min_kth_nums
41_stream_medium		41_stream_medium
42_subarray_maxsum		42_subarray_maxsum
43_count_1		43_count_1
44_digit_in_sequence		44_digit_in_sequence
45_array_to_minnum		45_array_to_minnum
46_num2letter		46_num2letter
47_max_gift_value		47_max_gift_value
.gitignore		.gitignore