GitHub - dengxiayehu/coding_interviews: 《剑指offer》刷题

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
01_assignment_operation.cc		01_assignment_operation.cc
01_assignment_operation.md		01_assignment_operation.md
02_singleton.cc		02_singleton.cc
02_singleton.md		02_singleton.md
03_duplication_in_array.cc		03_duplication_in_array.cc
03_duplication_in_array.md		03_duplication_in_array.md
03_duplication_in_array_no_edit.cc		03_duplication_in_array_no_edit.cc
03_duplication_in_array_no_edit.md		03_duplication_in_array_no_edit.md
04_find_in_partially_sorted_matrix.cc		04_find_in_partially_sorted_matrix.cc
04_find_in_partially_sorted_matrix.md		04_find_in_partially_sorted_matrix.md
04_find_in_partially_sorted_matrix_lb.cc		04_find_in_partially_sorted_matrix_lb.cc
05_replace_spaces.cc		05_replace_spaces.cc
05_replace_spaces.md		05_replace_spaces.md
06_print_list_in_reversed_order.cc		06_print_list_in_reversed_order.cc
06_print_list_in_reversed_order.md		06_print_list_in_reversed_order.md
07_construct_binary_tree.cc		07_construct_binary_tree.cc
07_construct_binary_tree.md		07_construct_binary_tree.md
08_next_node_in_binary_tree.cc		08_next_node_in_binary_tree.cc
08_next_node_in_binary_tree.md		08_next_node_in_binary_tree.md
09_queue_with_two_stacks.cc		09_queue_with_two_stacks.cc
09_queue_with_two_stacks.md		09_queue_with_two_stacks.md
10_crasy_jump_floor.cc		10_crasy_jump_floor.cc
10_crasy_jump_floor.md		10_crasy_jump_floor.md
10_fibonacci.cc		10_fibonacci.cc
10_fibonacci.md		10_fibonacci.md
10_jump_floor.cc		10_jump_floor.cc
10_jump_floor.md		10_jump_floor.md
10_rect_cover.cc		10_rect_cover.cc
10_rect_cover.md		10_rect_cover.md
11_min_number_in_rotated_array.cc		11_min_number_in_rotated_array.cc
11_min_number_in_rotated_array.md		11_min_number_in_rotated_array.md
12_path_in_matrix.cc		12_path_in_matrix.cc
12_path_in_matrix.md		12_path_in_matrix.md
13_robot_moving_count.cc		13_robot_moving_count.cc
13_robot_moving_count.md		13_robot_moving_count.md
14_cut_the_rope.cc		14_cut_the_rope.cc
14_cut_the_rope.md		14_cut_the_rope.md
14_cut_the_rope_greedy.cc		14_cut_the_rope_greedy.cc
15_number_of_1.cc		15_number_of_1.cc
15_number_of_1.md		15_number_of_1.md
16_pow.cc		16_pow.cc
16_pow.md		16_pow.md
17_print_1_to_max_of_n_digits.cc		17_print_1_to_max_of_n_digits.cc
17_print_1_to_max_of_n_digits.md		17_print_1_to_max_of_n_digits.md
17_print_1_to_max_of_n_digits_1.cc		17_print_1_to_max_of_n_digits_1.cc
18_delete_node_in_list.cc		18_delete_node_in_list.cc
18_delete_node_in_list.md		18_delete_node_in_list.md
19_delete_duplicated_node.cc		19_delete_duplicated_node.cc
19_delete_duplicated_node.md		19_delete_duplicated_node.md
20_number_string.cc		20_number_string.cc
20_number_string.md		20_number_string.md
21_reorder_array.cc		21_reorder_array.cc
21_reorder_array.md		21_reorder_array.md
21_reorder_array_order.cc		21_reorder_array_order.cc
22_kth_to_tail.cc		22_kth_to_tail.cc
22_kth_to_tail.md		22_kth_to_tail.md
23_entry_node_of_loop.cc		23_entry_node_of_loop.cc
23_entry_node_of_loop.md		23_entry_node_of_loop.md
24_reverse_list.cc		24_reverse_list.cc
24_reverse_list.md		24_reverse_list.md
25_merge_sorted_lists.cc		25_merge_sorted_lists.cc
25_merge_sorted_lists.md		25_merge_sorted_lists.md
26_has_subtree.cc		26_has_subtree.cc
27_mirror.cc		27_mirror.cc
28_is_symmetrical.cc		28_is_symmetrical.cc
28_is_symmetrical.md		28_is_symmetrical.md
29_print_matrix.cc		29_print_matrix.cc
29_print_matrix.md		29_print_matrix.md
30_min_in_stack.cc		30_min_in_stack.cc
30_min_in_stack.md		30_min_in_stack.md
31_is_pop_order.cc		31_is_pop_order.cc
31_is_pop_order.md		31_is_pop_order.md
32_print_tree_from_top_to_bottom.cc		32_print_tree_from_top_to_bottom.cc
32_print_tree_from_top_to_bottom.md		32_print_tree_from_top_to_bottom.md
32_print_tree_in_lines.cc		32_print_tree_in_lines.cc
32_print_tree_in_lines.md		32_print_tree_in_lines.md
32_print_trees_in_zigzag.cc		32_print_trees_in_zigzag.cc
32_print_trees_in_zigzag.md		32_print_trees_in_zigzag.md
33_sequence_of_bst.cc		33_sequence_of_bst.cc
33_sequence_of_bst.md		33_sequence_of_bst.md
34_path_in_tree.cc		34_path_in_tree.cc
34_path_in_tree.md		34_path_in_tree.md
35_copy_complex_list.cc		35_copy_complex_list.cc
35_copy_complex_list.md		35_copy_complex_list.md
35_copy_complex_list1.cc		35_copy_complex_list1.cc
36_convert_binary_search_tree.cc		36_convert_binary_search_tree.cc
36_convert_binary_search_tree.md		36_convert_binary_search_tree.md
37_serialize_binary_trees.cc		37_serialize_binary_trees.cc
37_serialize_binary_trees.md		37_serialize_binary_trees.md
38_string_permutation.cc		38_string_permutation.cc
38_string_permutation.md		38_string_permutation.md
38_string_permutation1.cc		38_string_permutation1.cc
39_more_than_half_num.cc		39_more_than_half_num.cc
39_more_than_half_num.md		39_more_than_half_num.md
40_get_least_numbers.cc		40_get_least_numbers.cc
40_get_least_numbers.md		40_get_least_numbers.md
41_median.cc		41_median.cc
41_median.md		41_median.md
42_greatest_sum_of_subarrays.cc		42_greatest_sum_of_subarrays.cc
42_greatest_sum_of_subarrays.md		42_greatest_sum_of_subarrays.md