Open Source Address: Click on this link
Foreword
October total of 60 questions, all belong to the Easy difficulty, so the number of public share out of not much, just pick some sense can only share out of which 60 were the subject I sorted according to different categories, All source and corresponding to the open GitHub uniform solving ideas, respond to a public number "LeetCode" Get specific topics are as follows.Subject classification
Array
- 0001_two_sum
- 0026_remove_duplicates_from_sorted_array
- 0027_remove_element
- 0035_search_insert_position
- 0045_jump_game_II
- 0053_maximum_subarray
- 0055_jump_game
- 0066_plus_one
- 0088_merge_sorted_array
- 0106_binary_tree_postorder_traversal
- 0118_pascals_triangle
- 0119_pascals_triangle_ii
- 0121_best_time_to_buy_and_sell_stock
- 0122_best_time_to_buy_and_sell_stock_ii
- 0167_two_sum_ii
- 0169_majority_element
- 0189_rotate_array
- 0217_contains_duplicate
- 0219_contains_duplicate_ii
BFS
- 0101_symmetric_tree
- 0107_binary_tree_level_order_traversal_ii
- 0111_minimum_depth_of_binary_tree
Bit computing
- 0136_single_number
- 0169_majority_element
- 0190_reverse_bits
- 0191_number_of_1_bits
- 0231_power_of_two
Binary search
- 0035_search_insert_position
- 0069_sqrtx
- 0167_two_sum_ii
- 0222_count_complete_tree_nodes
- 0300_longest_increasing_subsequence
分治法
- 0053_maximum_subarray
- 0169_majority_element
设计
- 0155_min_stack
- 0225_implement_stack_using_queues
- 0232_implement_queue_using_stacks
深度优先搜索
- 0100_same_tree
- 0101_symmetric_tree
- 0104_maximum_depth_of_binary_tree
- 0106_binary_tree_postorder_traversal
- 0108_convert_sorted_array_to_binary_search_tree
- 0110_balanced_binary_tree
- 0111_minimum_depth_of_binary_tree
- 0112_path_sum
动态规划
- 0053_maximum_subarray
- 0070_climbing_stairs
- 0121_best_time_to_buy_and_sell_stock
- 0198_house_robber
- 0300_longest_increasing_subsequence
贪心法
- 0045_jump_game_II
- 0055_jump_game
- 0122_best_time_to_buy_and_sell_stock_ii
哈希表
- 0001_two_sum
- 0136_single_number
- 0149_max_points_on_a_line
- 0202_happy_numbers
- 0204_count_primes
- 0205_isomorphic_strings
- 0217_contains_duplicate
- 0219_contains_duplicate_ii
链表
- 0021_merge_two_sorted_lists
- 0083_remove_duplicates_from_sorted_list
- 0141_linked_list_cycle
- 0147_insertion_sort_list
- 0160_intersection_of_two_linked_lists
- 0203_remove_linked_list_elements
- 0206_reverse_linked_list
- 0234_palindrome_linked_list
- 0237_delete_node_in_a_linked_list
数学
- 0007_reverse_integer
- 0009_palindrome_number
- 0013_roman_to_integer
- 0067_add_binary
- 0069_sqrtx
- 0149_max_points_on_a_line
- 0168_excel_sheet_column_title
- 0172_factorial_trailling_zeros
- 0202_happy_numbers
- 0204_count_primes
- 0231_power_of_two
栈
- 0020_valid_parentheses
- 0144_binary_tree_preorder_traversal
- 0150_evaluate_reverse_polish_notation
- 0155_min_stack
- 0225_implement_stack_using_queues
- 0232_implement_queue_using_stacks
字符串
- 0013_roman_to_integer
- 0014_longest_common_prefix
- 0020_valid_parentheses
- 0028_implement_strstr
- 0038_count_and_say
- 0058_length_of_last_word
- 0067_add_binary
- 0125_valid_palindrome
双指针
- 0026_remove_duplicates_from_sorted_array
- 0027_remove_element
- 0028_implement_strstr
- 0088_merge_sorted_array
- 0125_valid_palindrome
- 0141_linked_list_cycle
- 0167_two_sum_ii
- 0234_palindrome_linked_list
树
- 0100_same_tree
- 0101_symmetric_tree
- 0104_maximum_depth_of_binary_tree
- 0106_binary_tree_postorder_traversal
- 0107_binary_tree_level_order_traversal_ii
- 0108_convert_sorted_array_to_binary_search_tree
- 0110_balanced_binary_tree
- 0111_minimum_depth_of_binary_tree
- 0112_path_sum
- 0144_binary_tree_preorder_traversal
- 0222_count_complete_tree_nodes
- 0226_invert_binary_tree
- 0235_lowest_common_ancestor_of_a_binary_search_tree
- 0617_merge_two_binary_trees