Skip to content

Mountain-AI/python-to-the-offer

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

8 Commits
.idea
.idea
 
 
10_1_fibonacci.py
10_1_fibonacci.py
 
 
10_2_frog_jump.py
10_2_frog_jump.py
 
 
10_3_frog_jump_hard.py
10_3_frog_jump_hard.py
 
 
11_min_num_in_a_rotated_list.py
11_min_num_in_a_rotated_list.py
 
 
12_find_str_path_in_matrix.py
12_find_str_path_in_matrix.py
 
 
12_max_location_robot_can_access.py
12_max_location_robot_can_access.py
 
 
14_cut_rope.py
14_cut_rope.py
 
 
16_exponent.py
16_exponent.py
 
 
17_print_the_largest_n_digits.py
17_print_the_largest_n_digits.py
 
 
19_re_pattern.py
19_re_pattern.py
 
 
20_is_num.py
20_is_num.py
 
 
21_odd_before_even.py
21_odd_before_even.py
 
 
22_print_kth_node_from_tail.py
22_print_kth_node_from_tail.py
 
 
23_find_entrance_of_a_loop_in_linkedlist.py
23_find_entrance_of_a_loop_in_linkedlist.py
 
 
24_reverse_linklist.py
24_reverse_linklist.py
 
 
25_merge_two_sorted_linkedlist.py
25_merge_two_sorted_linkedlist.py
 
 
27_mirror_tree.py
27_mirror_tree.py
 
 
28_is_symmetry_tree.py
28_is_symmetry_tree.py
 
 
29_print_matrix_clocked.py
29_print_matrix_clocked.py
 
 
30_stack_with_min.py
30_stack_with_min.py
 
 
31_is_poped_seq_of_a_stack.py
31_is_poped_seq_of_a_stack.py
 
 
32_3_zigzag_traverse_of_binary_tree.py
32_3_zigzag_traverse_of_binary_tree.py
 
 
32_level_traverse_of_binary_tree.py
32_level_traverse_of_binary_tree.py
 
 
33_is_post_traverse_sequence_of_bst.py
33_is_post_traverse_sequence_of_bst.py
 
 
34_find_path.py
34_find_path.py
 
 
35_clone_complex_linklist.py
35_clone_complex_linklist.py
 
 
36_convert_bst_to_linkedlist.py
36_convert_bst_to_linkedlist.py
 
 
37_serialize_and_deserialize_bt.py
37_serialize_and_deserialize_bt.py
 
 
38_all_str_sequence.py
38_all_str_sequence.py
 
 
39_2_get_nums_occur_more_than_n_divide_k_times_in_list.py
39_2_get_nums_occur_more_than_n_divide_k_times_in_list.py
 
 
39_get_num_occur_more_than_half_times.py
39_get_num_occur_more_than_half_times.py
 
 
3_1_find_dup_num_in_a_list.py
3_1_find_dup_num_in_a_list.py
 
 
40_get_kth_small_num.py
40_get_kth_small_num.py
 
 
41_get_median_from_a_stram.py
41_get_median_from_a_stram.py
 
 
42_get_max_sum_of_sublist.py
42_get_max_sum_of_sublist.py
 
 
43_accur_times_of_1.py
43_accur_times_of_1.py
 
 
44_nth_num_of_sequence.py
44_nth_num_of_sequence.py
 
 
45_min_value_of_the_combined_nums_in_a_list.py
45_min_value_of_the_combined_nums_in_a_list.py
 
 
46_get_total_methods_to_decode_int_to_str.py
46_get_total_methods_to_decode_int_to_str.py
 
 
47_max_value.py
47_max_value.py
 
 
48_max_length_of_nodup_str.py
48_max_length_of_nodup_str.py
 
 
49_get_nth_ugly_number.py
49_get_nth_ugly_number.py
 
 
4_search_in_a_two_demension_list.py
4_search_in_a_two_demension_list.py
 
 
50_get_the_first_occured_only_one_time_char_in_a_string.py
50_get_the_first_occured_only_one_time_char_in_a_string.py
 
 
51_get_invered_pairs_nums_in_a_list.py
51_get_invered_pairs_nums_in_a_list.py
 
 
52_get_common_node_of_linkedlist.py
52_get_common_node_of_linkedlist.py
 
 
53_get_the_occur_number_of_K_in_a_list.py
53_get_the_occur_number_of_K_in_a_list.py
 
 
54_get_kth_node.py
54_get_kth_node.py
 
 
55_1_find_nums_appear_once.py
55_1_find_nums_appear_once.py
 
 
55_2_find_ocuur_1_time_Item.py
55_2_find_ocuur_1_time_Item.py
 
 
57_1_two_sum.py
57_1_two_sum.py
 
 
57_2_sum_of_sequence.py
57_2_sum_of_sequence.py
 
 
58_1_reversedSentence.py
58_1_reversedSentence.py
 
 
59_1_get_max_of_cur_window.py
59_1_get_max_of_cur_window.py
 
 
59_2_queue_with_max_method.py
59_2_queue_with_max_method.py
 
 
5_replace_the_blank_in_str.py
5_replace_the_blank_in_str.py
 
 
60_get_sum_of_n_dices.py
60_get_sum_of_n_dices.py
 
 
61_is_continious.py
61_is_continious.py
 
 
62_last_remaining.py
62_last_remaining.py
 
 
63_max_profit_of_stack.py
63_max_profit_of_stack.py
 
 
65_add_without_operator.py
65_add_without_operator.py
 
 
66_multiList.py
66_multiList.py
 
 
6_print_linklist_from_tail_to_head.py
6_print_linklist_from_tail_to_head.py
 
 
7_recreate_bt.py
7_recreate_bt.py
 
 
8_next_node_in_bt.py
8_next_node_in_bt.py
 
 
9_use_two_stack_to_create_queue.py
9_use_two_stack_to_create_queue.py
 
 
README.md
README.md
 
 

Repository files navigation

剑指offer Python题解

代码均已通过牛客刷题系统。

About

剑指offer Python题解

Resources

Readme
Activity

Stars

0 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages