From 0e99959a973590429c77aaa25bfbaa3b1be3d422 Mon Sep 17 00:00:00 2001 From: songyzh Date: Wed, 19 Feb 2020 22:36:33 +0800 Subject: [PATCH 1/3] rename --- src/solution/mod.rs | 416 +++++++++--------- ...substring_without_repeating_characters.rs} | 0 2 files changed, 208 insertions(+), 208 deletions(-) rename src/solution/{s0003_longest_substring.rs => s0003_longest_substring_without_repeating_characters.rs} (100%) diff --git a/src/solution/mod.rs b/src/solution/mod.rs index 3b079b74..bc982de9 100644 --- a/src/solution/mod.rs +++ b/src/solution/mod.rs @@ -1,237 +1,237 @@ +mod s0001_two_sum; +mod s0002_add_two_numbers; +mod s0003_longest_substring_without_repeating_characters; +mod s0004_median_of_two_sorted_arrays; +mod s0005_longest_palindromic_substring; mod s0006_zigzag_conversion; -mod s0238_product_of_array_except_self; -mod s0115_distinct_subsequences; -mod s0099_recover_binary_search_tree; -mod s0310_minimum_height_trees; -mod s0128_longest_consecutive_sequence; -mod s0274_h_index; -mod s0241_different_ways_to_add_parentheses; +mod s0007_reverse_integer; +mod s0008_string_to_integer_atoi; +mod s0009_palindrome_number; +mod s0010_regular_expression_matching; +mod s0011_container_with_most_water; +mod s0012_integer_to_roman; +mod s0013_roman_to_integer; +mod s0014_longest_common_prefix; +mod s0015_3sum; +mod s0016_3sum_closest; +mod s0017_letter_combinations_of_a_phone_number; +mod s0018_4sum; +mod s0019_remove_nth_node_from_end_of_list; +mod s0020_valid_parentheses; +mod s0021_merge_two_sorted_lists; +mod s0022_generate_parentheses; +mod s0023_merge_k_sorted_lists; mod s0024_swap_nodes_in_pairs; -mod s0110_balanced_binary_tree; -mod s0093_restore_ip_addresses; -mod s0076_minimum_window_substring; -mod s0124_binary_tree_maximum_path_sum; -mod s0122_best_time_to_buy_and_sell_stock_ii; -mod s0169_majority_element; -mod s0162_find_peak_element; -mod s0095_unique_binary_search_trees_ii; -mod s0155_min_stack; -mod s0040_combination_sum_ii; -mod s0217_contains_duplicate; -mod s0055_jump_game; -mod s0106_construct_binary_tree_from_inorder_and_postorder_traversal; -mod s0145_binary_tree_postorder_traversal; -mod s0079_word_search; -mod s0969_pancake_sorting; -mod s0042_trapping_rain_water; -mod s0108_convert_sorted_array_to_binary_search_tree; -mod s0083_remove_duplicates_from_sorted_list; -mod s0130_surrounded_regions; -mod s0226_invert_binary_tree; +mod s0025_reverse_nodes_in_k_group; +mod s0026_remove_duplicates_from_sorted_array; mod s0027_remove_element; -mod s0188_best_time_to_buy_and_sell_stock_iv; -mod s0204_count_primes; -mod s0268_missing_number; -mod s0214_shortest_palindrome; -mod s0231_power_of_two; -mod s0202_happy_number; -mod s0075_sort_colors; -mod s0066_plus_one; mod s0028_implement_strstr; -mod s0290_word_pattern; -mod s0048_rotate_image; -mod s0089_gray_code; -mod s0147_insertion_sort_list; -mod s0084_largest_rectangle_in_histogram; -mod s0011_container_with_most_water; -mod s0009_palindrome_number; -mod s0058_length_of_last_word; -mod s0080_remove_duplicates_from_sorted_array_ii; +mod s0029_divide_two_integers; mod s0030_substring_with_concatenation_of_all_words; -mod s0060_permutation_sequence; -mod s0071_simplify_path; -mod s0038_count_and_say; -mod s0144_binary_tree_preorder_traversal; -mod s0279_perfect_squares; -mod s0304_range_sum_query_2d_immutable; -mod s0292_nim_game; -mod s0264_ugly_number_ii; -mod s0132_palindrome_partitioning_ii; -mod s0019_remove_nth_node_from_end_of_list; -mod s0136_single_number; -mod s0018_4sum; -mod s0220_contains_duplicate_iii; -mod s0299_bulls_and_cows; -mod s0232_implement_queue_using_stacks; -mod s0100_same_tree; -mod s0171_excel_sheet_column_number; -mod s0087_scramble_string; -mod s0704_binary_search; -mod s0219_contains_duplicate_ii; -mod s0086_partition_list; -mod s0082_remove_duplicates_from_sorted_list_ii; -mod s0228_summary_ranges; -mod s0020_valid_parentheses; -mod s0017_letter_combinations_of_a_phone_number; -mod s0312_burst_balloons; -mod s0306_additive_number; -mod s0283_move_zeroes; -mod s1018_binary_prefix_divisible_by_5; -mod s0201_bitwise_and_of_numbers_range; -mod s0109_convert_sorted_list_to_binary_search_tree; -mod s0101_symmetric_tree; -mod s0098_validate_binary_search_tree; +mod s0031_next_permutation; +mod s0032_longest_valid_parentheses; +mod s0033_search_in_rotated_sorted_array; +mod s0034_find_first_and_last_position_of_element_in_sorted_array; mod s0035_search_insert_position; -mod s0050_powx_n; -mod s0198_house_robber; -mod s0004_median_of_two_sorted_arrays; -mod s0221_maximal_square; +mod s0036_valid_sudoku; +mod s0037_sudoku_solver; +mod s0038_count_and_say; +mod s0039_combination_sum; +mod s0040_combination_sum_ii; +mod s0041_first_missing_positive; +mod s0042_trapping_rain_water; +mod s0043_multiply_strings; +mod s0044_wildcard_matching; +mod s0045_jump_game_ii; +mod s0046_permutations; mod s0047_permutations_ii; -mod s0172_factorial_trailing_zeroes; -mod s0054_spiral_matrix; +mod s0048_rotate_image; +mod s0049_group_anagrams; +mod s0050_powx_n; +mod s0051_n_queens; +mod s0052_n_queens_ii; mod s0053_maximum_subarray; -mod s1046_last_stone_weight; -mod s0146_lru_cache; -mod s0126_word_ladder_ii; -mod s0242_valid_anagram; -mod s0112_path_sum; -mod s0023_merge_k_sorted_lists; -mod s0230_kth_smallest_element_in_a_bst; -mod s0104_maximum_depth_of_binary_tree; -mod s0258_add_digits; -mod s0187_repeated_dna_sequences; -mod s0025_reverse_nodes_in_k_group; -mod s0039_combination_sum; -mod s0107_binary_tree_level_order_traversal_ii; -mod s0091_decode_ways; +mod s0054_spiral_matrix; +mod s0055_jump_game; mod s0056_merge_intervals; +mod s0057_insert_interval; +mod s0058_length_of_last_word; +mod s0059_spiral_matrix_ii; +mod s0060_permutation_sequence; +mod s0061_rotate_list; +mod s0062_unique_paths; +mod s0063_unique_paths_ii; +mod s0064_minimum_path_sum; mod s0065_valid_number; -mod s0016_3sum_closest; -mod s0096_unique_binary_search_trees; +mod s0066_plus_one; +mod s0067_add_binary; +mod s0068_text_justification; +mod s0069_sqrtx; +mod s0070_climbing_stairs; +mod s0071_simplify_path; mod s0072_edit_distance; -mod s0044_wildcard_matching; -mod s0239_sliding_window_maximum; -mod s0174_dungeon_game; mod s0073_set_matrix_zeroes; +mod s0074_search_a_2d_matrix; +mod s0075_sort_colors; +mod s0076_minimum_window_substring; +mod s0077_combinations; mod s0078_subsets; -mod s0037_sudoku_solver; -mod s0033_search_in_rotated_sorted_array; -mod s0002_add_two_numbers; -mod s0313_super_ugly_number; -mod s0068_text_justification; -mod s0064_minimum_path_sum; -mod s0218_the_skyline_problem; -mod s0125_valid_palindrome; -mod s0210_course_schedule_ii; -mod s0143_reorder_list; -mod s0164_maximum_gap; +mod s0079_word_search; +mod s0080_remove_duplicates_from_sorted_array_ii; +mod s0081_search_in_rotated_sorted_array_ii; +mod s0082_remove_duplicates_from_sorted_list_ii; +mod s0083_remove_duplicates_from_sorted_list; +mod s0084_largest_rectangle_in_histogram; +mod s0085_maximal_rectangle; +mod s0086_partition_list; +mod s0087_scramble_string; +mod s0088_merge_sorted_array; +mod s0089_gray_code; +mod s0090_subsets_ii; +mod s0091_decode_ways; +mod s0092_reverse_linked_list_ii; +mod s0093_restore_ip_addresses; +mod s0094_binary_tree_inorder_traversal; +mod s0095_unique_binary_search_trees_ii; +mod s0096_unique_binary_search_trees; mod s0097_interleaving_string; +mod s0098_validate_binary_search_tree; +mod s0099_recover_binary_search_tree; +mod s0100_same_tree; +mod s0101_symmetric_tree; +mod s0102_binary_tree_level_order_traversal; +mod s0103_binary_tree_zigzag_level_order_traversal; +mod s0104_maximum_depth_of_binary_tree; mod s0105_construct_binary_tree_from_preorder_and_inorder_traversal; -mod s0167_two_sum_ii_input_array_is_sorted; -mod s0034_find_first_and_last_position_of_element_in_sorted_array; -mod s0094_binary_tree_inorder_traversal; -mod s0052_n_queens_ii; +mod s0106_construct_binary_tree_from_inorder_and_postorder_traversal; +mod s0107_binary_tree_level_order_traversal_ii; +mod s0108_convert_sorted_array_to_binary_search_tree; +mod s0109_convert_sorted_list_to_binary_search_tree; +mod s0110_balanced_binary_tree; +mod s0111_minimum_depth_of_binary_tree; +mod s0112_path_sum; +mod s0113_path_sum_ii; +mod s0114_flatten_binary_tree_to_linked_list; +mod s0115_distinct_subsequences; +mod s0118_pascals_triangle; +mod s0119_pascals_triangle_ii; +mod s0120_triangle; mod s0121_best_time_to_buy_and_sell_stock; -mod s0273_integer_to_english_words; -mod s0225_implement_stack_using_queues; -mod s0046_permutations; -mod s0085_maximal_rectangle; +mod s0122_best_time_to_buy_and_sell_stock_ii; +mod s0123_best_time_to_buy_and_sell_stock_iii; +mod s0124_binary_tree_maximum_path_sum; +mod s0125_valid_palindrome; +mod s0126_word_ladder_ii; +mod s0127_word_ladder; +mod s0128_longest_consecutive_sequence; +mod s0129_sum_root_to_leaf_numbers; +mod s0130_surrounded_regions; +mod s0131_palindrome_partitioning; +mod s0132_palindrome_partitioning_ii; +mod s0134_gas_station; mod s0135_candy; -mod s0113_path_sum_ii; -mod s0029_divide_two_integers; -mod s0260_single_number_iii; +mod s0136_single_number; +mod s0137_single_number_ii; +mod s0139_word_break; mod s0140_word_break_ii; +mod s0143_reorder_list; +mod s0144_binary_tree_preorder_traversal; +mod s0145_binary_tree_postorder_traversal; +mod s0146_lru_cache; +mod s0147_insertion_sort_list; +mod s0148_sort_list; mod s0149_max_points_on_a_line; -mod s0213_house_robber_ii; -mod s0222_count_complete_tree_nodes; -mod s0134_gas_station; -mod s0057_insert_interval; -mod s0173_binary_search_tree_iterator; -mod s0077_combinations; -mod s0005_longest_palindromic_substring; -mod s0041_first_missing_positive; -mod s0026_remove_duplicates_from_sorted_array; +mod s0150_evaluate_reverse_polish_notation; +mod s0151_reverse_words_in_a_string; +mod s0152_maximum_product_subarray; +mod s0153_find_minimum_in_rotated_sorted_array; +mod s0154_find_minimum_in_rotated_sorted_array_ii; +mod s0155_min_stack; +mod s0162_find_peak_element; +mod s0164_maximum_gap; +mod s0165_compare_version_numbers; mod s0166_fraction_to_recurring_decimal; -mod s0119_pascals_triangle_ii; -mod s0012_integer_to_roman; -mod s0223_rectangle_area; -mod s0229_majority_element_ii; -mod s0061_rotate_list; -mod s0123_best_time_to_buy_and_sell_stock_iii; -mod s0301_remove_invalid_parentheses; -mod s0067_add_binary; -mod s0049_group_anagrams; +mod s0167_two_sum_ii_input_array_is_sorted; +mod s0168_excel_sheet_column_title; +mod s0169_majority_element; +mod s0171_excel_sheet_column_number; +mod s0172_factorial_trailing_zeroes; +mod s0173_binary_search_tree_iterator; +mod s0174_dungeon_game; +mod s0179_largest_number; +mod s0187_repeated_dna_sequences; +mod s0188_best_time_to_buy_and_sell_stock_iv; mod s0189_rotate_array; -mod s0001_two_sum; -mod s0275_h_index_ii; -mod s0103_binary_tree_zigzag_level_order_traversal; -mod s0137_single_number_ii; +mod s0198_house_robber; +mod s0199_binary_tree_right_side_view; +mod s0200_number_of_islands; +mod s0201_bitwise_and_of_numbers_range; +mod s0202_happy_number; +mod s0203_remove_linked_list_elements; +mod s0204_count_primes; +mod s0205_isomorphic_strings; +mod s0206_reverse_linked_list; +mod s0207_course_schedule; mod s0208_implement_trie_prefix_tree; -mod s0300_longest_increasing_subsequence; -mod s0118_pascals_triangle; -mod s0010_regular_expression_matching; -mod s0013_roman_to_integer; mod s0209_minimum_size_subarray_sum; +mod s0210_course_schedule_ii; +mod s0211_add_and_search_word_data_structure_design; +mod s0212_word_search_ii; +mod s0213_house_robber_ii; +mod s0214_shortest_palindrome; +mod s0215_kth_largest_element_in_an_array; +mod s0216_combination_sum_iii; +mod s0217_contains_duplicate; +mod s0218_the_skyline_problem; +mod s0219_contains_duplicate_ii; +mod s0220_contains_duplicate_iii; +mod s0221_maximal_square; +mod s0222_count_complete_tree_nodes; +mod s0223_rectangle_area; +mod s0224_basic_calculator; +mod s0225_implement_stack_using_queues; +mod s0226_invert_binary_tree; mod s0227_basic_calculator_ii; -mod s0022_generate_parentheses; -mod s0008_string_to_integer_atoi; -mod s0152_maximum_product_subarray; -mod s0014_longest_common_prefix; -mod s0070_climbing_stairs; +mod s0228_summary_ranges; +mod s0229_majority_element_ii; +mod s0230_kth_smallest_element_in_a_bst; +mod s0231_power_of_two; +mod s0232_implement_queue_using_stacks; mod s0233_number_of_digit_one; -mod s0154_find_minimum_in_rotated_sorted_array_ii; -mod s0127_word_ladder; -mod s0207_course_schedule; -mod s0263_ugly_number; -mod s0295_find_median_from_data_stream; -mod s0148_sort_list; +mod s0238_product_of_array_except_self; +mod s0239_sliding_window_maximum; +mod s0241_different_ways_to_add_parentheses; +mod s0242_valid_anagram; mod s0257_binary_tree_paths; -mod s0120_triangle; -mod s0309_best_time_to_buy_and_sell_stock_with_cooldown; -mod s0074_search_a_2d_matrix; -mod s0215_kth_largest_element_in_an_array; -mod s0203_remove_linked_list_elements; -mod s0081_search_in_rotated_sorted_array_ii; -mod s0059_spiral_matrix_ii; -mod s0151_reverse_words_in_a_string; -mod s0205_isomorphic_strings; -mod s0179_largest_number; -mod s0168_excel_sheet_column_title; -mod s0007_reverse_integer; -mod s0032_longest_valid_parentheses; -mod s0165_compare_version_numbers; -mod s0031_next_permutation; -mod s0088_merge_sorted_array; -mod s0509_fibonacci_number; -mod s0036_valid_sudoku; -mod s0069_sqrtx; -mod s0211_add_and_search_word_data_structure_design; -mod s0114_flatten_binary_tree_to_linked_list; -mod s0224_basic_calculator; -mod s0045_jump_game_ii; -mod s0051_n_queens; -mod s0212_word_search_ii; +mod s0258_add_digits; +mod s0260_single_number_iii; +mod s0263_ugly_number; +mod s0264_ugly_number_ii; +mod s0268_missing_number; +mod s0273_integer_to_english_words; +mod s0274_h_index; +mod s0275_h_index_ii; +mod s0279_perfect_squares; +mod s0282_expression_add_operators; +mod s0283_move_zeroes; mod s0287_find_the_duplicate_number; -mod s0153_find_minimum_in_rotated_sorted_array; mod s0289_game_of_life; -mod s0200_number_of_islands; -mod s0015_3sum; -mod s0216_combination_sum_iii; -mod s0043_multiply_strings; -mod s0090_subsets_ii; -mod s0003_longest_substring; -mod s0139_word_break; -mod s0150_evaluate_reverse_polish_notation; -mod s0063_unique_paths_ii; -mod s0062_unique_paths; -mod s0199_binary_tree_right_side_view; -mod s0282_expression_add_operators; -mod s0021_merge_two_sorted_lists; -mod s0129_sum_root_to_leaf_numbers; -mod s0206_reverse_linked_list; -mod s0131_palindrome_partitioning; -mod s0307_range_sum_query_mutable; -mod s0111_minimum_depth_of_binary_tree; -mod s0092_reverse_linked_list_ii; +mod s0290_word_pattern; +mod s0292_nim_game; +mod s0295_find_median_from_data_stream; +mod s0299_bulls_and_cows; +mod s0300_longest_increasing_subsequence; +mod s0301_remove_invalid_parentheses; mod s0303_range_sum_query_immutable; -mod s0102_binary_tree_level_order_traversal; +mod s0304_range_sum_query_2d_immutable; +mod s0306_additive_number; +mod s0307_range_sum_query_mutable; +mod s0309_best_time_to_buy_and_sell_stock_with_cooldown; +mod s0310_minimum_height_trees; +mod s0312_burst_balloons; +mod s0313_super_ugly_number; +mod s0509_fibonacci_number; +mod s0704_binary_search; +mod s0969_pancake_sorting; +mod s1018_binary_prefix_divisible_by_5; +mod s1046_last_stone_weight; diff --git a/src/solution/s0003_longest_substring.rs b/src/solution/s0003_longest_substring_without_repeating_characters.rs similarity index 100% rename from src/solution/s0003_longest_substring.rs rename to src/solution/s0003_longest_substring_without_repeating_characters.rs From 5baae866fab47cc0fcef837ac965d64f12fde080 Mon Sep 17 00:00:00 2001 From: songyzh Date: Wed, 19 Feb 2020 22:38:06 +0800 Subject: [PATCH 2/3] add start line --- src/solution/s0074_search_a_2d_matrix.rs | 2 ++ src/solution/s0086_partition_list.rs | 2 ++ src/solution/s0149_max_points_on_a_line.rs | 2 ++ 3 files changed, 6 insertions(+) diff --git a/src/solution/s0074_search_a_2d_matrix.rs b/src/solution/s0074_search_a_2d_matrix.rs index e95f02a3..d535f16e 100644 --- a/src/solution/s0074_search_a_2d_matrix.rs +++ b/src/solution/s0074_search_a_2d_matrix.rs @@ -36,6 +36,8 @@ */ pub struct Solution {} +// submission codes start here + impl Solution { pub fn search_matrix(matrix: Vec>, target: i32) -> bool { if matrix.is_empty() { diff --git a/src/solution/s0086_partition_list.rs b/src/solution/s0086_partition_list.rs index 4238586f..d30a9053 100644 --- a/src/solution/s0086_partition_list.rs +++ b/src/solution/s0086_partition_list.rs @@ -16,6 +16,8 @@ pub struct Solution {} use crate::util::linked_list::{to_list, ListNode}; +// submission codes start here + impl Solution { pub fn partition(head: Option>, x: i32) -> Option> { let mut lower = Some(Box::new(ListNode::new(0))); diff --git a/src/solution/s0149_max_points_on_a_line.rs b/src/solution/s0149_max_points_on_a_line.rs index c2faf93b..1b0bf16c 100644 --- a/src/solution/s0149_max_points_on_a_line.rs +++ b/src/solution/s0149_max_points_on_a_line.rs @@ -38,6 +38,8 @@ pub struct Solution {} use crate::util::point::Point; +// submission codes start here + /* 要回顾下高中数学：已知两点, 求解一般式: From 5552d15974f5b03ed14991568e30a4fbda53ecd3 Mon Sep 17 00:00:00 2001 From: songyzh Date: Wed, 19 Feb 2020 22:41:34 +0800 Subject: [PATCH 3/3] add problem and discuss link to existing solutions --- src/solution/s0001_two_sum.rs | 3 +++ src/solution/s0002_add_two_numbers.rs | 3 +++ .../s0003_longest_substring_without_repeating_characters.rs | 3 +++ src/solution/s0004_median_of_two_sorted_arrays.rs | 3 +++ src/solution/s0005_longest_palindromic_substring.rs | 3 +++ src/solution/s0006_zigzag_conversion.rs | 3 +++ src/solution/s0007_reverse_integer.rs | 3 +++ src/solution/s0008_string_to_integer_atoi.rs | 3 +++ src/solution/s0009_palindrome_number.rs | 3 +++ src/solution/s0010_regular_expression_matching.rs | 3 +++ src/solution/s0011_container_with_most_water.rs | 3 +++ src/solution/s0012_integer_to_roman.rs | 3 +++ src/solution/s0013_roman_to_integer.rs | 3 +++ src/solution/s0014_longest_common_prefix.rs | 3 +++ src/solution/s0015_3sum.rs | 3 +++ src/solution/s0016_3sum_closest.rs | 3 +++ src/solution/s0017_letter_combinations_of_a_phone_number.rs | 3 +++ src/solution/s0018_4sum.rs | 3 +++ src/solution/s0019_remove_nth_node_from_end_of_list.rs | 3 +++ src/solution/s0020_valid_parentheses.rs | 3 +++ src/solution/s0021_merge_two_sorted_lists.rs | 3 +++ src/solution/s0022_generate_parentheses.rs | 3 +++ src/solution/s0023_merge_k_sorted_lists.rs | 3 +++ src/solution/s0024_swap_nodes_in_pairs.rs | 3 +++ src/solution/s0025_reverse_nodes_in_k_group.rs | 3 +++ src/solution/s0026_remove_duplicates_from_sorted_array.rs | 3 +++ src/solution/s0027_remove_element.rs | 3 +++ src/solution/s0028_implement_strstr.rs | 3 +++ src/solution/s0029_divide_two_integers.rs | 3 +++ .../s0030_substring_with_concatenation_of_all_words.rs | 3 +++ src/solution/s0031_next_permutation.rs | 3 +++ src/solution/s0032_longest_valid_parentheses.rs | 3 +++ src/solution/s0033_search_in_rotated_sorted_array.rs | 3 +++ ..._find_first_and_last_position_of_element_in_sorted_array.rs | 3 +++ src/solution/s0035_search_insert_position.rs | 3 +++ src/solution/s0036_valid_sudoku.rs | 3 +++ src/solution/s0037_sudoku_solver.rs | 3 +++ src/solution/s0038_count_and_say.rs | 3 +++ src/solution/s0039_combination_sum.rs | 3 +++ src/solution/s0040_combination_sum_ii.rs | 3 +++ src/solution/s0041_first_missing_positive.rs | 3 +++ src/solution/s0042_trapping_rain_water.rs | 3 +++ src/solution/s0043_multiply_strings.rs | 3 +++ src/solution/s0044_wildcard_matching.rs | 3 +++ src/solution/s0045_jump_game_ii.rs | 3 +++ src/solution/s0046_permutations.rs | 3 +++ src/solution/s0047_permutations_ii.rs | 3 +++ src/solution/s0048_rotate_image.rs | 3 +++ src/solution/s0049_group_anagrams.rs | 3 +++ src/solution/s0050_powx_n.rs | 3 +++ src/solution/s0051_n_queens.rs | 3 +++ src/solution/s0052_n_queens_ii.rs | 3 +++ src/solution/s0053_maximum_subarray.rs | 3 +++ src/solution/s0054_spiral_matrix.rs | 3 +++ src/solution/s0055_jump_game.rs | 3 +++ src/solution/s0056_merge_intervals.rs | 3 +++ src/solution/s0057_insert_interval.rs | 3 +++ src/solution/s0058_length_of_last_word.rs | 3 +++ src/solution/s0059_spiral_matrix_ii.rs | 3 +++ src/solution/s0060_permutation_sequence.rs | 3 +++ src/solution/s0061_rotate_list.rs | 3 +++ src/solution/s0062_unique_paths.rs | 3 +++ src/solution/s0063_unique_paths_ii.rs | 3 +++ src/solution/s0064_minimum_path_sum.rs | 3 +++ src/solution/s0065_valid_number.rs | 3 +++ src/solution/s0066_plus_one.rs | 3 +++ src/solution/s0067_add_binary.rs | 3 +++ src/solution/s0068_text_justification.rs | 3 +++ src/solution/s0069_sqrtx.rs | 3 +++ src/solution/s0070_climbing_stairs.rs | 3 +++ src/solution/s0071_simplify_path.rs | 3 +++ src/solution/s0072_edit_distance.rs | 3 +++ src/solution/s0073_set_matrix_zeroes.rs | 3 +++ src/solution/s0074_search_a_2d_matrix.rs | 3 +++ src/solution/s0075_sort_colors.rs | 3 +++ src/solution/s0076_minimum_window_substring.rs | 3 +++ src/solution/s0077_combinations.rs | 3 +++ src/solution/s0078_subsets.rs | 3 +++ src/solution/s0079_word_search.rs | 3 +++ src/solution/s0080_remove_duplicates_from_sorted_array_ii.rs | 3 +++ src/solution/s0081_search_in_rotated_sorted_array_ii.rs | 3 +++ src/solution/s0082_remove_duplicates_from_sorted_list_ii.rs | 3 +++ src/solution/s0083_remove_duplicates_from_sorted_list.rs | 3 +++ src/solution/s0084_largest_rectangle_in_histogram.rs | 3 +++ src/solution/s0085_maximal_rectangle.rs | 3 +++ src/solution/s0086_partition_list.rs | 3 +++ src/solution/s0087_scramble_string.rs | 3 +++ src/solution/s0088_merge_sorted_array.rs | 3 +++ src/solution/s0089_gray_code.rs | 3 +++ src/solution/s0090_subsets_ii.rs | 3 +++ src/solution/s0091_decode_ways.rs | 3 +++ src/solution/s0092_reverse_linked_list_ii.rs | 3 +++ src/solution/s0093_restore_ip_addresses.rs | 3 +++ src/solution/s0094_binary_tree_inorder_traversal.rs | 3 +++ src/solution/s0095_unique_binary_search_trees_ii.rs | 3 +++ src/solution/s0096_unique_binary_search_trees.rs | 3 +++ src/solution/s0097_interleaving_string.rs | 3 +++ src/solution/s0098_validate_binary_search_tree.rs | 3 +++ src/solution/s0099_recover_binary_search_tree.rs | 3 +++ src/solution/s0100_same_tree.rs | 3 +++ src/solution/s0101_symmetric_tree.rs | 3 +++ src/solution/s0102_binary_tree_level_order_traversal.rs | 3 +++ src/solution/s0103_binary_tree_zigzag_level_order_traversal.rs | 3 +++ src/solution/s0104_maximum_depth_of_binary_tree.rs | 3 +++ ...onstruct_binary_tree_from_preorder_and_inorder_traversal.rs | 3 +++ ...nstruct_binary_tree_from_inorder_and_postorder_traversal.rs | 3 +++ src/solution/s0107_binary_tree_level_order_traversal_ii.rs | 3 +++ .../s0108_convert_sorted_array_to_binary_search_tree.rs | 3 +++ .../s0109_convert_sorted_list_to_binary_search_tree.rs | 3 +++ src/solution/s0110_balanced_binary_tree.rs | 3 +++ src/solution/s0111_minimum_depth_of_binary_tree.rs | 3 +++ src/solution/s0112_path_sum.rs | 3 +++ src/solution/s0113_path_sum_ii.rs | 3 +++ src/solution/s0114_flatten_binary_tree_to_linked_list.rs | 3 +++ src/solution/s0115_distinct_subsequences.rs | 3 +++ src/solution/s0118_pascals_triangle.rs | 3 +++ src/solution/s0119_pascals_triangle_ii.rs | 3 +++ src/solution/s0120_triangle.rs | 3 +++ src/solution/s0121_best_time_to_buy_and_sell_stock.rs | 3 +++ src/solution/s0122_best_time_to_buy_and_sell_stock_ii.rs | 3 +++ src/solution/s0123_best_time_to_buy_and_sell_stock_iii.rs | 3 +++ src/solution/s0124_binary_tree_maximum_path_sum.rs | 3 +++ src/solution/s0125_valid_palindrome.rs | 3 +++ src/solution/s0126_word_ladder_ii.rs | 3 +++ src/solution/s0127_word_ladder.rs | 3 +++ src/solution/s0128_longest_consecutive_sequence.rs | 3 +++ src/solution/s0129_sum_root_to_leaf_numbers.rs | 3 +++ src/solution/s0130_surrounded_regions.rs | 3 +++ src/solution/s0131_palindrome_partitioning.rs | 3 +++ src/solution/s0132_palindrome_partitioning_ii.rs | 3 +++ src/solution/s0134_gas_station.rs | 3 +++ src/solution/s0135_candy.rs | 3 +++ src/solution/s0136_single_number.rs | 3 +++ src/solution/s0137_single_number_ii.rs | 3 +++ src/solution/s0139_word_break.rs | 3 +++ src/solution/s0140_word_break_ii.rs | 3 +++ src/solution/s0143_reorder_list.rs | 3 +++ src/solution/s0144_binary_tree_preorder_traversal.rs | 3 +++ src/solution/s0145_binary_tree_postorder_traversal.rs | 3 +++ src/solution/s0146_lru_cache.rs | 3 +++ src/solution/s0147_insertion_sort_list.rs | 3 +++ src/solution/s0148_sort_list.rs | 3 +++ src/solution/s0149_max_points_on_a_line.rs | 3 +++ src/solution/s0150_evaluate_reverse_polish_notation.rs | 3 +++ src/solution/s0151_reverse_words_in_a_string.rs | 3 +++ src/solution/s0152_maximum_product_subarray.rs | 3 +++ src/solution/s0153_find_minimum_in_rotated_sorted_array.rs | 3 +++ src/solution/s0154_find_minimum_in_rotated_sorted_array_ii.rs | 3 +++ src/solution/s0155_min_stack.rs | 3 +++ src/solution/s0162_find_peak_element.rs | 3 +++ src/solution/s0164_maximum_gap.rs | 3 +++ src/solution/s0165_compare_version_numbers.rs | 3 +++ src/solution/s0166_fraction_to_recurring_decimal.rs | 3 +++ src/solution/s0167_two_sum_ii_input_array_is_sorted.rs | 3 +++ src/solution/s0168_excel_sheet_column_title.rs | 3 +++ src/solution/s0169_majority_element.rs | 3 +++ src/solution/s0171_excel_sheet_column_number.rs | 3 +++ src/solution/s0172_factorial_trailing_zeroes.rs | 3 +++ src/solution/s0173_binary_search_tree_iterator.rs | 3 +++ src/solution/s0174_dungeon_game.rs | 3 +++ src/solution/s0179_largest_number.rs | 3 +++ src/solution/s0187_repeated_dna_sequences.rs | 3 +++ src/solution/s0188_best_time_to_buy_and_sell_stock_iv.rs | 3 +++ src/solution/s0189_rotate_array.rs | 3 +++ src/solution/s0198_house_robber.rs | 3 +++ src/solution/s0199_binary_tree_right_side_view.rs | 3 +++ src/solution/s0200_number_of_islands.rs | 3 +++ src/solution/s0201_bitwise_and_of_numbers_range.rs | 3 +++ src/solution/s0202_happy_number.rs | 3 +++ src/solution/s0203_remove_linked_list_elements.rs | 3 +++ src/solution/s0204_count_primes.rs | 3 +++ src/solution/s0205_isomorphic_strings.rs | 3 +++ src/solution/s0206_reverse_linked_list.rs | 3 +++ src/solution/s0207_course_schedule.rs | 3 +++ src/solution/s0208_implement_trie_prefix_tree.rs | 3 +++ src/solution/s0209_minimum_size_subarray_sum.rs | 3 +++ src/solution/s0210_course_schedule_ii.rs | 3 +++ .../s0211_add_and_search_word_data_structure_design.rs | 3 +++ src/solution/s0212_word_search_ii.rs | 3 +++ src/solution/s0213_house_robber_ii.rs | 3 +++ src/solution/s0214_shortest_palindrome.rs | 3 +++ src/solution/s0215_kth_largest_element_in_an_array.rs | 3 +++ src/solution/s0216_combination_sum_iii.rs | 3 +++ src/solution/s0217_contains_duplicate.rs | 3 +++ src/solution/s0218_the_skyline_problem.rs | 3 +++ src/solution/s0219_contains_duplicate_ii.rs | 3 +++ src/solution/s0220_contains_duplicate_iii.rs | 3 +++ src/solution/s0221_maximal_square.rs | 3 +++ src/solution/s0222_count_complete_tree_nodes.rs | 3 +++ src/solution/s0223_rectangle_area.rs | 3 +++ src/solution/s0224_basic_calculator.rs | 3 +++ src/solution/s0225_implement_stack_using_queues.rs | 3 +++ src/solution/s0226_invert_binary_tree.rs | 3 +++ src/solution/s0227_basic_calculator_ii.rs | 3 +++ src/solution/s0228_summary_ranges.rs | 3 +++ src/solution/s0229_majority_element_ii.rs | 3 +++ src/solution/s0230_kth_smallest_element_in_a_bst.rs | 3 +++ src/solution/s0231_power_of_two.rs | 3 +++ src/solution/s0232_implement_queue_using_stacks.rs | 3 +++ src/solution/s0233_number_of_digit_one.rs | 3 +++ src/solution/s0238_product_of_array_except_self.rs | 3 +++ src/solution/s0239_sliding_window_maximum.rs | 3 +++ src/solution/s0241_different_ways_to_add_parentheses.rs | 3 +++ src/solution/s0242_valid_anagram.rs | 3 +++ src/solution/s0257_binary_tree_paths.rs | 3 +++ src/solution/s0258_add_digits.rs | 3 +++ src/solution/s0260_single_number_iii.rs | 3 +++ src/solution/s0263_ugly_number.rs | 3 +++ src/solution/s0264_ugly_number_ii.rs | 3 +++ src/solution/s0268_missing_number.rs | 3 +++ src/solution/s0273_integer_to_english_words.rs | 3 +++ src/solution/s0274_h_index.rs | 3 +++ src/solution/s0275_h_index_ii.rs | 3 +++ src/solution/s0279_perfect_squares.rs | 3 +++ src/solution/s0282_expression_add_operators.rs | 3 +++ src/solution/s0283_move_zeroes.rs | 3 +++ src/solution/s0287_find_the_duplicate_number.rs | 3 +++ src/solution/s0289_game_of_life.rs | 3 +++ src/solution/s0290_word_pattern.rs | 3 +++ src/solution/s0292_nim_game.rs | 3 +++ src/solution/s0295_find_median_from_data_stream.rs | 3 +++ src/solution/s0299_bulls_and_cows.rs | 3 +++ src/solution/s0300_longest_increasing_subsequence.rs | 3 +++ src/solution/s0301_remove_invalid_parentheses.rs | 3 +++ src/solution/s0303_range_sum_query_immutable.rs | 3 +++ src/solution/s0304_range_sum_query_2d_immutable.rs | 3 +++ src/solution/s0306_additive_number.rs | 3 +++ src/solution/s0307_range_sum_query_mutable.rs | 3 +++ .../s0309_best_time_to_buy_and_sell_stock_with_cooldown.rs | 3 +++ src/solution/s0310_minimum_height_trees.rs | 3 +++ src/solution/s0312_burst_balloons.rs | 3 +++ src/solution/s0313_super_ugly_number.rs | 3 +++ src/solution/s0509_fibonacci_number.rs | 3 +++ src/solution/s0704_binary_search.rs | 3 +++ src/solution/s0969_pancake_sorting.rs | 3 +++ src/solution/s1018_binary_prefix_divisible_by_5.rs | 3 +++ src/solution/s1046_last_stone_weight.rs | 3 +++ 237 files changed, 711 insertions(+) diff --git a/src/solution/s0001_two_sum.rs b/src/solution/s0001_two_sum.rs index 1d04a13e..4a44a732 100644 --- a/src/solution/s0001_two_sum.rs +++ b/src/solution/s0001_two_sum.rs @@ -18,6 +18,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/two-sum/ +// discuss: https://leetcode.com/problems/two-sum/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::collections::HashMap; diff --git a/src/solution/s0002_add_two_numbers.rs b/src/solution/s0002_add_two_numbers.rs index 5612c3d4..d8bfc2d8 100644 --- a/src/solution/s0002_add_two_numbers.rs +++ b/src/solution/s0002_add_two_numbers.rs @@ -19,6 +19,9 @@ pub struct Solution {} use crate::util::linked_list::{to_list, ListNode}; +// problem: https://leetcode.com/problems/add-two-numbers/ +// discuss: https://leetcode.com/problems/add-two-numbers/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0003_longest_substring_without_repeating_characters.rs b/src/solution/s0003_longest_substring_without_repeating_characters.rs index dca33069..0ad6903d 100644 --- a/src/solution/s0003_longest_substring_without_repeating_characters.rs +++ b/src/solution/s0003_longest_substring_without_repeating_characters.rs @@ -12,6 +12,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/longest-substring-without-repeating-characters/ +// discuss: https://leetcode.com/problems/longest-substring-without-repeating-characters/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0004_median_of_two_sorted_arrays.rs b/src/solution/s0004_median_of_two_sorted_arrays.rs index b0775e14..e3c2d014 100644 --- a/src/solution/s0004_median_of_two_sorted_arrays.rs +++ b/src/solution/s0004_median_of_two_sorted_arrays.rs @@ -28,6 +28,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/median-of-two-sorted-arrays/ +// discuss: https://leetcode.com/problems/median-of-two-sorted-arrays/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // TODO: nth slice diff --git a/src/solution/s0005_longest_palindromic_substring.rs b/src/solution/s0005_longest_palindromic_substring.rs index 26a622ca..675e1951 100644 --- a/src/solution/s0005_longest_palindromic_substring.rs +++ b/src/solution/s0005_longest_palindromic_substring.rs @@ -21,6 +21,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/longest-palindromic-substring/ +// discuss: https://leetcode.com/problems/longest-palindromic-substring/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0006_zigzag_conversion.rs b/src/solution/s0006_zigzag_conversion.rs index 43bf5fdc..51ed13a7 100644 --- a/src/solution/s0006_zigzag_conversion.rs +++ b/src/solution/s0006_zigzag_conversion.rs @@ -38,6 +38,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/zigzag-conversion/ +// discuss: https://leetcode.com/problems/zigzag-conversion/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0007_reverse_integer.rs b/src/solution/s0007_reverse_integer.rs index d258809f..ad89eebd 100644 --- a/src/solution/s0007_reverse_integer.rs +++ b/src/solution/s0007_reverse_integer.rs @@ -30,6 +30,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/reverse-integer/ +// discuss: https://leetcode.com/problems/reverse-integer/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { pub fn reverse(x: i32) -> i32 { diff --git a/src/solution/s0008_string_to_integer_atoi.rs b/src/solution/s0008_string_to_integer_atoi.rs index 15a1eae1..9c86e17b 100644 --- a/src/solution/s0008_string_to_integer_atoi.rs +++ b/src/solution/s0008_string_to_integer_atoi.rs @@ -61,6 +61,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/string-to-integer-atoi/ +// discuss: https://leetcode.com/problems/string-to-integer-atoi/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0009_palindrome_number.rs b/src/solution/s0009_palindrome_number.rs index 070077a3..255eeed1 100644 --- a/src/solution/s0009_palindrome_number.rs +++ b/src/solution/s0009_palindrome_number.rs @@ -33,6 +33,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/palindrome-number/ +// discuss: https://leetcode.com/problems/palindrome-number/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // TODO: not optimal, we only have to revert half of the string diff --git a/src/solution/s0010_regular_expression_matching.rs b/src/solution/s0010_regular_expression_matching.rs index d600e619..13e15cb7 100644 --- a/src/solution/s0010_regular_expression_matching.rs +++ b/src/solution/s0010_regular_expression_matching.rs @@ -69,6 +69,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/regular-expression-matching/ +// discuss: https://leetcode.com/problems/regular-expression-matching/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // TODO: NFA diff --git a/src/solution/s0011_container_with_most_water.rs b/src/solution/s0011_container_with_most_water.rs index a26dcfb7..ae818bac 100644 --- a/src/solution/s0011_container_with_most_water.rs +++ b/src/solution/s0011_container_with_most_water.rs @@ -22,6 +22,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/container-with-most-water/ +// discuss: https://leetcode.com/problems/container-with-most-water/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // Brute force: O(N^2) diff --git a/src/solution/s0012_integer_to_roman.rs b/src/solution/s0012_integer_to_roman.rs index 2698956e..b32592c7 100644 --- a/src/solution/s0012_integer_to_roman.rs +++ b/src/solution/s0012_integer_to_roman.rs @@ -61,6 +61,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/integer-to-roman/ +// discuss: https://leetcode.com/problems/integer-to-roman/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0013_roman_to_integer.rs b/src/solution/s0013_roman_to_integer.rs index fcc2c1ad..4f3f0ae4 100644 --- a/src/solution/s0013_roman_to_integer.rs +++ b/src/solution/s0013_roman_to_integer.rs @@ -61,6 +61,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/roman-to-integer/ +// discuss: https://leetcode.com/problems/roman-to-integer/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0014_longest_common_prefix.rs b/src/solution/s0014_longest_common_prefix.rs index 3d3affec..1c5fd985 100644 --- a/src/solution/s0014_longest_common_prefix.rs +++ b/src/solution/s0014_longest_common_prefix.rs @@ -27,6 +27,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/longest-common-prefix/ +// discuss: https://leetcode.com/problems/longest-common-prefix/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::str::Chars; diff --git a/src/solution/s0015_3sum.rs b/src/solution/s0015_3sum.rs index 2d4c9cca..9feb3cd0 100644 --- a/src/solution/s0015_3sum.rs +++ b/src/solution/s0015_3sum.rs @@ -22,6 +22,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/3sum/ +// discuss: https://leetcode.com/problems/3sum/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0016_3sum_closest.rs b/src/solution/s0016_3sum_closest.rs index eee265b5..01cf442d 100644 --- a/src/solution/s0016_3sum_closest.rs +++ b/src/solution/s0016_3sum_closest.rs @@ -14,6 +14,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/3sum-closest/ +// discuss: https://leetcode.com/problems/3sum-closest/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0017_letter_combinations_of_a_phone_number.rs b/src/solution/s0017_letter_combinations_of_a_phone_number.rs index ccd30a82..7d3245f4 100644 --- a/src/solution/s0017_letter_combinations_of_a_phone_number.rs +++ b/src/solution/s0017_letter_combinations_of_a_phone_number.rs @@ -21,6 +21,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/letter-combinations-of-a-phone-number/ +// discuss: https://leetcode.com/problems/letter-combinations-of-a-phone-number/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0018_4sum.rs b/src/solution/s0018_4sum.rs index f74fa5ed..d832aef1 100644 --- a/src/solution/s0018_4sum.rs +++ b/src/solution/s0018_4sum.rs @@ -23,6 +23,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/4sum/ +// discuss: https://leetcode.com/problems/4sum/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // TODO: change to faster N^3 solution... maybe diff --git a/src/solution/s0019_remove_nth_node_from_end_of_list.rs b/src/solution/s0019_remove_nth_node_from_end_of_list.rs index b3dac826..c3f53a32 100644 --- a/src/solution/s0019_remove_nth_node_from_end_of_list.rs +++ b/src/solution/s0019_remove_nth_node_from_end_of_list.rs @@ -23,6 +23,9 @@ pub struct Solution {} use crate::util::linked_list::{to_list, ListNode}; +// problem: https://leetcode.com/problems/remove-nth-node-from-end-of-list/ +// discuss: https://leetcode.com/problems/remove-nth-node-from-end-of-list/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // one pass (two pointer runner pattern) cannot make borrow checker happy diff --git a/src/solution/s0020_valid_parentheses.rs b/src/solution/s0020_valid_parentheses.rs index 2af69c67..3c0940b9 100644 --- a/src/solution/s0020_valid_parentheses.rs +++ b/src/solution/s0020_valid_parentheses.rs @@ -50,6 +50,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/valid-parentheses/ +// discuss: https://leetcode.com/problems/valid-parentheses/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0021_merge_two_sorted_lists.rs b/src/solution/s0021_merge_two_sorted_lists.rs index c496d8e0..54d7f256 100644 --- a/src/solution/s0021_merge_two_sorted_lists.rs +++ b/src/solution/s0021_merge_two_sorted_lists.rs @@ -13,6 +13,9 @@ pub struct Solution {} use crate::util::linked_list::{to_list, ListNode}; +// problem: https://leetcode.com/problems/merge-two-sorted-lists/ +// discuss: https://leetcode.com/problems/merge-two-sorted-lists/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // recursive will be much easier to understand diff --git a/src/solution/s0022_generate_parentheses.rs b/src/solution/s0022_generate_parentheses.rs index 887aa213..9e0e33df 100644 --- a/src/solution/s0022_generate_parentheses.rs +++ b/src/solution/s0022_generate_parentheses.rs @@ -20,6 +20,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/generate-parentheses/ +// discuss: https://leetcode.com/problems/generate-parentheses/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // DFS diff --git a/src/solution/s0023_merge_k_sorted_lists.rs b/src/solution/s0023_merge_k_sorted_lists.rs index c213eb7d..eeaf3695 100644 --- a/src/solution/s0023_merge_k_sorted_lists.rs +++ b/src/solution/s0023_merge_k_sorted_lists.rs @@ -19,6 +19,9 @@ pub struct Solution {} use crate::util::linked_list::{to_list, ListNode}; +// problem: https://leetcode.com/problems/merge-k-sorted-lists/ +// discuss: https://leetcode.com/problems/merge-k-sorted-lists/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::cmp::Ordering; use std::collections::BinaryHeap; diff --git a/src/solution/s0024_swap_nodes_in_pairs.rs b/src/solution/s0024_swap_nodes_in_pairs.rs index 104d6b9e..4a6deb3e 100644 --- a/src/solution/s0024_swap_nodes_in_pairs.rs +++ b/src/solution/s0024_swap_nodes_in_pairs.rs @@ -19,6 +19,9 @@ pub struct Solution {} use crate::util::linked_list::{to_list, ListNode}; +// problem: https://leetcode.com/problems/swap-nodes-in-pairs/ +// discuss: https://leetcode.com/problems/swap-nodes-in-pairs/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0025_reverse_nodes_in_k_group.rs b/src/solution/s0025_reverse_nodes_in_k_group.rs index 3beb5528..5d39cd1e 100644 --- a/src/solution/s0025_reverse_nodes_in_k_group.rs +++ b/src/solution/s0025_reverse_nodes_in_k_group.rs @@ -27,6 +27,9 @@ pub struct Solution {} use crate::util::linked_list::{to_list, ListNode}; +// problem: https://leetcode.com/problems/reverse-nodes-in-k-group/ +// discuss: https://leetcode.com/problems/reverse-nodes-in-k-group/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0026_remove_duplicates_from_sorted_array.rs b/src/solution/s0026_remove_duplicates_from_sorted_array.rs index c4b07180..29ae1485 100644 --- a/src/solution/s0026_remove_duplicates_from_sorted_array.rs +++ b/src/solution/s0026_remove_duplicates_from_sorted_array.rs @@ -45,6 +45,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/remove-duplicates-from-sorted-array/ +// discuss: https://leetcode.com/problems/remove-duplicates-from-sorted-array/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0027_remove_element.rs b/src/solution/s0027_remove_element.rs index 5c11843b..7144d3e9 100644 --- a/src/solution/s0027_remove_element.rs +++ b/src/solution/s0027_remove_element.rs @@ -49,6 +49,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/remove-element/ +// discuss: https://leetcode.com/problems/remove-element/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0028_implement_strstr.rs b/src/solution/s0028_implement_strstr.rs index b4bbee26..e0d944ee 100644 --- a/src/solution/s0028_implement_strstr.rs +++ b/src/solution/s0028_implement_strstr.rs @@ -28,6 +28,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/implement-strstr/ +// discuss: https://leetcode.com/problems/implement-strstr/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0029_divide_two_integers.rs b/src/solution/s0029_divide_two_integers.rs index edff4f40..e8f13435 100644 --- a/src/solution/s0029_divide_two_integers.rs +++ b/src/solution/s0029_divide_two_integers.rs @@ -30,6 +30,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/divide-two-integers/ +// discuss: https://leetcode.com/problems/divide-two-integers/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0030_substring_with_concatenation_of_all_words.rs b/src/solution/s0030_substring_with_concatenation_of_all_words.rs index 1c797090..002ae9a3 100644 --- a/src/solution/s0030_substring_with_concatenation_of_all_words.rs +++ b/src/solution/s0030_substring_with_concatenation_of_all_words.rs @@ -26,6 +26,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/substring-with-concatenation-of-all-words/ +// discuss: https://leetcode.com/problems/substring-with-concatenation-of-all-words/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here struct Term { expect: i32, diff --git a/src/solution/s0031_next_permutation.rs b/src/solution/s0031_next_permutation.rs index 459693ec..b448dfa1 100644 --- a/src/solution/s0031_next_permutation.rs +++ b/src/solution/s0031_next_permutation.rs @@ -16,6 +16,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/next-permutation/ +// discuss: https://leetcode.com/problems/next-permutation/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0032_longest_valid_parentheses.rs b/src/solution/s0032_longest_valid_parentheses.rs index c6949519..d970de2b 100644 --- a/src/solution/s0032_longest_valid_parentheses.rs +++ b/src/solution/s0032_longest_valid_parentheses.rs @@ -22,6 +22,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/longest-valid-parentheses/ +// discuss: https://leetcode.com/problems/longest-valid-parentheses/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // time: O(N) space: O(1) diff --git a/src/solution/s0033_search_in_rotated_sorted_array.rs b/src/solution/s0033_search_in_rotated_sorted_array.rs index 968199f5..ab5c13d3 100644 --- a/src/solution/s0033_search_in_rotated_sorted_array.rs +++ b/src/solution/s0033_search_in_rotated_sorted_array.rs @@ -37,6 +37,9 @@ pub struct Solution {} Consider the given array as ring, each time we split the ring and judge which part is the target belong to, then it's ordinary binary search. */ +// problem: https://leetcode.com/problems/search-in-rotated-sorted-array/ +// discuss: https://leetcode.com/problems/search-in-rotated-sorted-array/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0034_find_first_and_last_position_of_element_in_sorted_array.rs b/src/solution/s0034_find_first_and_last_position_of_element_in_sorted_array.rs index d13bfb86..eba1c01c 100644 --- a/src/solution/s0034_find_first_and_last_position_of_element_in_sorted_array.rs +++ b/src/solution/s0034_find_first_and_last_position_of_element_in_sorted_array.rs @@ -22,6 +22,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/ +// discuss: https://leetcode.com/problems/find-first-and-last-position-of-element-in-sorted-array/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // TODO diff --git a/src/solution/s0035_search_insert_position.rs b/src/solution/s0035_search_insert_position.rs index 30921761..31c1c38b 100644 --- a/src/solution/s0035_search_insert_position.rs +++ b/src/solution/s0035_search_insert_position.rs @@ -36,6 +36,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/search-insert-position/ +// discuss: https://leetcode.com/problems/search-insert-position/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // TODO diff --git a/src/solution/s0036_valid_sudoku.rs b/src/solution/s0036_valid_sudoku.rs index 255bab22..5a595774 100644 --- a/src/solution/s0036_valid_sudoku.rs +++ b/src/solution/s0036_valid_sudoku.rs @@ -64,6 +64,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/valid-sudoku/ +// discuss: https://leetcode.com/problems/valid-sudoku/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // just brute force diff --git a/src/solution/s0037_sudoku_solver.rs b/src/solution/s0037_sudoku_solver.rs index a848d26c..d0187582 100644 --- a/src/solution/s0037_sudoku_solver.rs +++ b/src/solution/s0037_sudoku_solver.rs @@ -30,6 +30,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/sudoku-solver/ +// discuss: https://leetcode.com/problems/sudoku-solver/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // TODO diff --git a/src/solution/s0038_count_and_say.rs b/src/solution/s0038_count_and_say.rs index 53d1c269..6305b2a5 100644 --- a/src/solution/s0038_count_and_say.rs +++ b/src/solution/s0038_count_and_say.rs @@ -37,6 +37,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/count-and-say/ +// discuss: https://leetcode.com/problems/count-and-say/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::char::from_digit; diff --git a/src/solution/s0039_combination_sum.rs b/src/solution/s0039_combination_sum.rs index e589e9a7..b31e397e 100644 --- a/src/solution/s0039_combination_sum.rs +++ b/src/solution/s0039_combination_sum.rs @@ -38,6 +38,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/combination-sum/ +// discuss: https://leetcode.com/problems/combination-sum/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0040_combination_sum_ii.rs b/src/solution/s0040_combination_sum_ii.rs index a4a63011..0445bfb9 100644 --- a/src/solution/s0040_combination_sum_ii.rs +++ b/src/solution/s0040_combination_sum_ii.rs @@ -39,6 +39,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/combination-sum-ii/ +// discuss: https://leetcode.com/problems/combination-sum-ii/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0041_first_missing_positive.rs b/src/solution/s0041_first_missing_positive.rs index 72642eb2..80cd8d8e 100644 --- a/src/solution/s0041_first_missing_positive.rs +++ b/src/solution/s0041_first_missing_positive.rs @@ -31,6 +31,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/first-missing-positive/ +// discuss: https://leetcode.com/problems/first-missing-positive/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0042_trapping_rain_water.rs b/src/solution/s0042_trapping_rain_water.rs index d60647dd..9d961994 100644 --- a/src/solution/s0042_trapping_rain_water.rs +++ b/src/solution/s0042_trapping_rain_water.rs @@ -15,6 +15,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/trapping-rain-water/ +// discuss: https://leetcode.com/problems/trapping-rain-water/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // TODO diff --git a/src/solution/s0043_multiply_strings.rs b/src/solution/s0043_multiply_strings.rs index a2400d6c..8c487b8e 100644 --- a/src/solution/s0043_multiply_strings.rs +++ b/src/solution/s0043_multiply_strings.rs @@ -28,6 +28,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/multiply-strings/ +// discuss: https://leetcode.com/problems/multiply-strings/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // TODO diff --git a/src/solution/s0044_wildcard_matching.rs b/src/solution/s0044_wildcard_matching.rs index c4156c36..e875131a 100644 --- a/src/solution/s0044_wildcard_matching.rs +++ b/src/solution/s0044_wildcard_matching.rs @@ -69,6 +69,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/wildcard-matching/ +// discuss: https://leetcode.com/problems/wildcard-matching/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0045_jump_game_ii.rs b/src/solution/s0045_jump_game_ii.rs index 1f2de2aa..3922e20b 100644 --- a/src/solution/s0045_jump_game_ii.rs +++ b/src/solution/s0045_jump_game_ii.rs @@ -22,6 +22,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/jump-game-ii/ +// discuss: https://leetcode.com/problems/jump-game-ii/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // TODO: shortest path from backward diff --git a/src/solution/s0046_permutations.rs b/src/solution/s0046_permutations.rs index a6cdb8dd..ef9354c8 100644 --- a/src/solution/s0046_permutations.rs +++ b/src/solution/s0046_permutations.rs @@ -21,6 +21,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/permutations/ +// discuss: https://leetcode.com/problems/permutations/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0047_permutations_ii.rs b/src/solution/s0047_permutations_ii.rs index 22aef579..7dceb55b 100644 --- a/src/solution/s0047_permutations_ii.rs +++ b/src/solution/s0047_permutations_ii.rs @@ -18,6 +18,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/permutations-ii/ +// discuss: https://leetcode.com/problems/permutations-ii/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0048_rotate_image.rs b/src/solution/s0048_rotate_image.rs index 01145b47..6f6fdffa 100644 --- a/src/solution/s0048_rotate_image.rs +++ b/src/solution/s0048_rotate_image.rs @@ -50,6 +50,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/rotate-image/ +// discuss: https://leetcode.com/problems/rotate-image/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // x,y -> y,n-x 2-dimension vector rotate -90 degree: diff --git a/src/solution/s0049_group_anagrams.rs b/src/solution/s0049_group_anagrams.rs index 737dc03b..64200ea3 100644 --- a/src/solution/s0049_group_anagrams.rs +++ b/src/solution/s0049_group_anagrams.rs @@ -24,6 +24,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/group-anagrams/ +// discuss: https://leetcode.com/problems/group-anagrams/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::collections::HashMap; diff --git a/src/solution/s0050_powx_n.rs b/src/solution/s0050_powx_n.rs index 6e89f90c..3e2e9b3e 100644 --- a/src/solution/s0050_powx_n.rs +++ b/src/solution/s0050_powx_n.rs @@ -35,6 +35,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/powx-n/ +// discuss: https://leetcode.com/problems/powx-n/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0051_n_queens.rs b/src/solution/s0051_n_queens.rs index 98fd9480..d78435a9 100644 --- a/src/solution/s0051_n_queens.rs +++ b/src/solution/s0051_n_queens.rs @@ -30,6 +30,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/n-queens/ +// discuss: https://leetcode.com/problems/n-queens/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0052_n_queens_ii.rs b/src/solution/s0052_n_queens_ii.rs index 873cdda5..7c9b1987 100644 --- a/src/solution/s0052_n_queens_ii.rs +++ b/src/solution/s0052_n_queens_ii.rs @@ -29,6 +29,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/n-queens-ii/ +// discuss: https://leetcode.com/problems/n-queens-ii/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0053_maximum_subarray.rs b/src/solution/s0053_maximum_subarray.rs index 72b8b234..7967fb00 100644 --- a/src/solution/s0053_maximum_subarray.rs +++ b/src/solution/s0053_maximum_subarray.rs @@ -18,6 +18,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/maximum-subarray/ +// discuss: https://leetcode.com/problems/maximum-subarray/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0054_spiral_matrix.rs b/src/solution/s0054_spiral_matrix.rs index a2a8f009..ac90b769 100644 --- a/src/solution/s0054_spiral_matrix.rs +++ b/src/solution/s0054_spiral_matrix.rs @@ -28,6 +28,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/spiral-matrix/ +// discuss: https://leetcode.com/problems/spiral-matrix/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0055_jump_game.rs b/src/solution/s0055_jump_game.rs index a3634424..8dc35842 100644 --- a/src/solution/s0055_jump_game.rs +++ b/src/solution/s0055_jump_game.rs @@ -27,6 +27,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/jump-game/ +// discuss: https://leetcode.com/problems/jump-game/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0056_merge_intervals.rs b/src/solution/s0056_merge_intervals.rs index 37b7ade4..108c043b 100644 --- a/src/solution/s0056_merge_intervals.rs +++ b/src/solution/s0056_merge_intervals.rs @@ -21,6 +21,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/merge-intervals/ +// discuss: https://leetcode.com/problems/merge-intervals/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // Definition for an interval. diff --git a/src/solution/s0057_insert_interval.rs b/src/solution/s0057_insert_interval.rs index 90294a03..0afe62b4 100644 --- a/src/solution/s0057_insert_interval.rs +++ b/src/solution/s0057_insert_interval.rs @@ -22,6 +22,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/insert-interval/ +// discuss: https://leetcode.com/problems/insert-interval/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // Definition for an interval. diff --git a/src/solution/s0058_length_of_last_word.rs b/src/solution/s0058_length_of_last_word.rs index acd47197..4889c739 100644 --- a/src/solution/s0058_length_of_last_word.rs +++ b/src/solution/s0058_length_of_last_word.rs @@ -16,6 +16,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/length-of-last-word/ +// discuss: https://leetcode.com/problems/length-of-last-word/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0059_spiral_matrix_ii.rs b/src/solution/s0059_spiral_matrix_ii.rs index a9259672..d54f57b4 100644 --- a/src/solution/s0059_spiral_matrix_ii.rs +++ b/src/solution/s0059_spiral_matrix_ii.rs @@ -18,6 +18,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/spiral-matrix-ii/ +// discuss: https://leetcode.com/problems/spiral-matrix-ii/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0060_permutation_sequence.rs b/src/solution/s0060_permutation_sequence.rs index db0e84d5..0136a0b4 100644 --- a/src/solution/s0060_permutation_sequence.rs +++ b/src/solution/s0060_permutation_sequence.rs @@ -40,6 +40,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/permutation-sequence/ +// discuss: https://leetcode.com/problems/permutation-sequence/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // target: split k = i! + j! + ... diff --git a/src/solution/s0061_rotate_list.rs b/src/solution/s0061_rotate_list.rs index b7723576..bbfb059f 100644 --- a/src/solution/s0061_rotate_list.rs +++ b/src/solution/s0061_rotate_list.rs @@ -28,6 +28,9 @@ pub struct Solution {} use crate::util::linked_list::{to_list, ListNode}; +// problem: https://leetcode.com/problems/rotate-list/ +// discuss: https://leetcode.com/problems/rotate-list/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0062_unique_paths.rs b/src/solution/s0062_unique_paths.rs index fd3586fe..3a158326 100644 --- a/src/solution/s0062_unique_paths.rs +++ b/src/solution/s0062_unique_paths.rs @@ -33,6 +33,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/unique-paths/ +// discuss: https://leetcode.com/problems/unique-paths/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // its high school math: C(r,n) = n! / r!(n-r)! ...are you fxxking kidding me? diff --git a/src/solution/s0063_unique_paths_ii.rs b/src/solution/s0063_unique_paths_ii.rs index 84839e23..04d84911 100644 --- a/src/solution/s0063_unique_paths_ii.rs +++ b/src/solution/s0063_unique_paths_ii.rs @@ -33,6 +33,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/unique-paths-ii/ +// discuss: https://leetcode.com/problems/unique-paths-ii/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // Bottom-Up DP diff --git a/src/solution/s0064_minimum_path_sum.rs b/src/solution/s0064_minimum_path_sum.rs index 6500e2a3..d6340d50 100644 --- a/src/solution/s0064_minimum_path_sum.rs +++ b/src/solution/s0064_minimum_path_sum.rs @@ -21,6 +21,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/minimum-path-sum/ +// discuss: https://leetcode.com/problems/minimum-path-sum/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0065_valid_number.rs b/src/solution/s0065_valid_number.rs index 0370784c..11c5753d 100644 --- a/src/solution/s0065_valid_number.rs +++ b/src/solution/s0065_valid_number.rs @@ -36,6 +36,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/valid-number/ +// discuss: https://leetcode.com/problems/valid-number/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // hope that regex was included in std library... diff --git a/src/solution/s0066_plus_one.rs b/src/solution/s0066_plus_one.rs index ab0bda1a..fb1ea045 100644 --- a/src/solution/s0066_plus_one.rs +++ b/src/solution/s0066_plus_one.rs @@ -26,6 +26,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/plus-one/ +// discuss: https://leetcode.com/problems/plus-one/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0067_add_binary.rs b/src/solution/s0067_add_binary.rs index 715824f5..8c9951cc 100644 --- a/src/solution/s0067_add_binary.rs +++ b/src/solution/s0067_add_binary.rs @@ -20,6 +20,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/add-binary/ +// discuss: https://leetcode.com/problems/add-binary/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::char::from_digit; diff --git a/src/solution/s0068_text_justification.rs b/src/solution/s0068_text_justification.rs index 2d8a4fd2..827fa4f8 100644 --- a/src/solution/s0068_text_justification.rs +++ b/src/solution/s0068_text_justification.rs @@ -69,6 +69,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/text-justification/ +// discuss: https://leetcode.com/problems/text-justification/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0069_sqrtx.rs b/src/solution/s0069_sqrtx.rs index 5c15c63b..256f88be 100644 --- a/src/solution/s0069_sqrtx.rs +++ b/src/solution/s0069_sqrtx.rs @@ -26,6 +26,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/sqrtx/ +// discuss: https://leetcode.com/problems/sqrtx/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // Newton-Raphson for: root^2 - n = 0 diff --git a/src/solution/s0070_climbing_stairs.rs b/src/solution/s0070_climbing_stairs.rs index 4a9b44f0..2ef4153b 100644 --- a/src/solution/s0070_climbing_stairs.rs +++ b/src/solution/s0070_climbing_stairs.rs @@ -31,6 +31,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/climbing-stairs/ +// discuss: https://leetcode.com/problems/climbing-stairs/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // Bottom-up DP diff --git a/src/solution/s0071_simplify_path.rs b/src/solution/s0071_simplify_path.rs index 6b6b909c..4b61f7be 100644 --- a/src/solution/s0071_simplify_path.rs +++ b/src/solution/s0071_simplify_path.rs @@ -57,6 +57,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/simplify-path/ +// discuss: https://leetcode.com/problems/simplify-path/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0072_edit_distance.rs b/src/solution/s0072_edit_distance.rs index 280518c6..d50d9fa3 100644 --- a/src/solution/s0072_edit_distance.rs +++ b/src/solution/s0072_edit_distance.rs @@ -38,6 +38,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/edit-distance/ +// discuss: https://leetcode.com/problems/edit-distance/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0073_set_matrix_zeroes.rs b/src/solution/s0073_set_matrix_zeroes.rs index cdc73324..8d8cdab8 100644 --- a/src/solution/s0073_set_matrix_zeroes.rs +++ b/src/solution/s0073_set_matrix_zeroes.rs @@ -48,6 +48,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/set-matrix-zeroes/ +// discuss: https://leetcode.com/problems/set-matrix-zeroes/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0074_search_a_2d_matrix.rs b/src/solution/s0074_search_a_2d_matrix.rs index d535f16e..90975918 100644 --- a/src/solution/s0074_search_a_2d_matrix.rs +++ b/src/solution/s0074_search_a_2d_matrix.rs @@ -36,6 +36,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/search-a-2d-matrix/ +// discuss: https://leetcode.com/problems/search-a-2d-matrix/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0075_sort_colors.rs b/src/solution/s0075_sort_colors.rs index 8276ea52..6b72ac88 100644 --- a/src/solution/s0075_sort_colors.rs +++ b/src/solution/s0075_sort_colors.rs @@ -24,6 +24,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/sort-colors/ +// discuss: https://leetcode.com/problems/sort-colors/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // three-way partition diff --git a/src/solution/s0076_minimum_window_substring.rs b/src/solution/s0076_minimum_window_substring.rs index 1eaa1ab9..9d190533 100644 --- a/src/solution/s0076_minimum_window_substring.rs +++ b/src/solution/s0076_minimum_window_substring.rs @@ -20,6 +20,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/minimum-window-substring/ +// discuss: https://leetcode.com/problems/minimum-window-substring/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::collections::HashMap; impl Solution { diff --git a/src/solution/s0077_combinations.rs b/src/solution/s0077_combinations.rs index c5e56f80..6bb10d6b 100644 --- a/src/solution/s0077_combinations.rs +++ b/src/solution/s0077_combinations.rs @@ -21,6 +21,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/combinations/ +// discuss: https://leetcode.com/problems/combinations/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0078_subsets.rs b/src/solution/s0078_subsets.rs index 95757486..2db34925 100644 --- a/src/solution/s0078_subsets.rs +++ b/src/solution/s0078_subsets.rs @@ -24,6 +24,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/subsets/ +// discuss: https://leetcode.com/problems/subsets/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0079_word_search.rs b/src/solution/s0079_word_search.rs index fa02e3ad..07c4a705 100644 --- a/src/solution/s0079_word_search.rs +++ b/src/solution/s0079_word_search.rs @@ -23,6 +23,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/word-search/ +// discuss: https://leetcode.com/problems/word-search/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // TODO: use HashSet to record visited pos diff --git a/src/solution/s0080_remove_duplicates_from_sorted_array_ii.rs b/src/solution/s0080_remove_duplicates_from_sorted_array_ii.rs index 1ba2e2e9..70b3cf82 100644 --- a/src/solution/s0080_remove_duplicates_from_sorted_array_ii.rs +++ b/src/solution/s0080_remove_duplicates_from_sorted_array_ii.rs @@ -46,6 +46,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/ +// discuss: https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0081_search_in_rotated_sorted_array_ii.rs b/src/solution/s0081_search_in_rotated_sorted_array_ii.rs index d7f841d7..7972a16f 100644 --- a/src/solution/s0081_search_in_rotated_sorted_array_ii.rs +++ b/src/solution/s0081_search_in_rotated_sorted_array_ii.rs @@ -30,6 +30,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/search-in-rotated-sorted-array-ii/ +// discuss: https://leetcode.com/problems/search-in-rotated-sorted-array-ii/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0082_remove_duplicates_from_sorted_list_ii.rs b/src/solution/s0082_remove_duplicates_from_sorted_list_ii.rs index d04b15f8..067d0c79 100644 --- a/src/solution/s0082_remove_duplicates_from_sorted_list_ii.rs +++ b/src/solution/s0082_remove_duplicates_from_sorted_list_ii.rs @@ -21,6 +21,9 @@ pub struct Solution {} use crate::util::linked_list::{to_list, ListNode}; +// problem: https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/ +// discuss: https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // Definition for singly-linked list. diff --git a/src/solution/s0083_remove_duplicates_from_sorted_list.rs b/src/solution/s0083_remove_duplicates_from_sorted_list.rs index 785cc03f..5c9552cc 100644 --- a/src/solution/s0083_remove_duplicates_from_sorted_list.rs +++ b/src/solution/s0083_remove_duplicates_from_sorted_list.rs @@ -21,6 +21,9 @@ pub struct Solution {} use crate::util::linked_list::{to_list, ListNode}; +// problem: https://leetcode.com/problems/remove-duplicates-from-sorted-list/ +// discuss: https://leetcode.com/problems/remove-duplicates-from-sorted-list/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // Definition for singly-linked list. diff --git a/src/solution/s0084_largest_rectangle_in_histogram.rs b/src/solution/s0084_largest_rectangle_in_histogram.rs index 19b845a0..d33b9bda 100644 --- a/src/solution/s0084_largest_rectangle_in_histogram.rs +++ b/src/solution/s0084_largest_rectangle_in_histogram.rs @@ -25,6 +25,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/largest-rectangle-in-histogram/ +// discuss: https://leetcode.com/problems/largest-rectangle-in-histogram/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // record the height and start position using 2 stack, thus we reuse the previously scanned information diff --git a/src/solution/s0085_maximal_rectangle.rs b/src/solution/s0085_maximal_rectangle.rs index 878236ef..6dbf2951 100644 --- a/src/solution/s0085_maximal_rectangle.rs +++ b/src/solution/s0085_maximal_rectangle.rs @@ -19,6 +19,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/maximal-rectangle/ +// discuss: https://leetcode.com/problems/maximal-rectangle/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0086_partition_list.rs b/src/solution/s0086_partition_list.rs index d30a9053..1f4952dd 100644 --- a/src/solution/s0086_partition_list.rs +++ b/src/solution/s0086_partition_list.rs @@ -16,6 +16,9 @@ pub struct Solution {} use crate::util::linked_list::{to_list, ListNode}; +// problem: https://leetcode.com/problems/partition-list/ +// discuss: https://leetcode.com/problems/partition-list/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0087_scramble_string.rs b/src/solution/s0087_scramble_string.rs index 5b70a69a..19b47dc0 100644 --- a/src/solution/s0087_scramble_string.rs +++ b/src/solution/s0087_scramble_string.rs @@ -63,6 +63,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/scramble-string/ +// discuss: https://leetcode.com/problems/scramble-string/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0088_merge_sorted_array.rs b/src/solution/s0088_merge_sorted_array.rs index 955d5ad9..bdcc2a1a 100644 --- a/src/solution/s0088_merge_sorted_array.rs +++ b/src/solution/s0088_merge_sorted_array.rs @@ -23,6 +23,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/merge-sorted-array/ +// discuss: https://leetcode.com/problems/merge-sorted-array/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0089_gray_code.rs b/src/solution/s0089_gray_code.rs index 0bc4ffc0..039283eb 100644 --- a/src/solution/s0089_gray_code.rs +++ b/src/solution/s0089_gray_code.rs @@ -38,6 +38,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/gray-code/ +// discuss: https://leetcode.com/problems/gray-code/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here /* diff --git a/src/solution/s0090_subsets_ii.rs b/src/solution/s0090_subsets_ii.rs index 80d17be6..e859e2d1 100644 --- a/src/solution/s0090_subsets_ii.rs +++ b/src/solution/s0090_subsets_ii.rs @@ -23,6 +23,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/subsets-ii/ +// discuss: https://leetcode.com/problems/subsets-ii/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here /* diff --git a/src/solution/s0091_decode_ways.rs b/src/solution/s0091_decode_ways.rs index a181c137..bbecc932 100644 --- a/src/solution/s0091_decode_ways.rs +++ b/src/solution/s0091_decode_ways.rs @@ -30,6 +30,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/decode-ways/ +// discuss: https://leetcode.com/problems/decode-ways/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0092_reverse_linked_list_ii.rs b/src/solution/s0092_reverse_linked_list_ii.rs index e84035da..318c0d15 100644 --- a/src/solution/s0092_reverse_linked_list_ii.rs +++ b/src/solution/s0092_reverse_linked_list_ii.rs @@ -16,6 +16,9 @@ pub struct Solution {} use crate::util::linked_list::{to_list, ListNode}; +// problem: https://leetcode.com/problems/reverse-linked-list-ii/ +// discuss: https://leetcode.com/problems/reverse-linked-list-ii/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // Definition for singly-linked list. diff --git a/src/solution/s0093_restore_ip_addresses.rs b/src/solution/s0093_restore_ip_addresses.rs index 08d0a8ec..5c2706b4 100644 --- a/src/solution/s0093_restore_ip_addresses.rs +++ b/src/solution/s0093_restore_ip_addresses.rs @@ -13,6 +13,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/restore-ip-addresses/ +// discuss: https://leetcode.com/problems/restore-ip-addresses/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0094_binary_tree_inorder_traversal.rs b/src/solution/s0094_binary_tree_inorder_traversal.rs index d4d2ea2a..01afb57a 100644 --- a/src/solution/s0094_binary_tree_inorder_traversal.rs +++ b/src/solution/s0094_binary_tree_inorder_traversal.rs @@ -20,6 +20,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/binary-tree-inorder-traversal/ +// discuss: https://leetcode.com/problems/binary-tree-inorder-traversal/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use crate::util::tree::{to_tree, TreeNode}; diff --git a/src/solution/s0095_unique_binary_search_trees_ii.rs b/src/solution/s0095_unique_binary_search_trees_ii.rs index ffdc763b..1f75639d 100644 --- a/src/solution/s0095_unique_binary_search_trees_ii.rs +++ b/src/solution/s0095_unique_binary_search_trees_ii.rs @@ -27,6 +27,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/unique-binary-search-trees-ii/ +// discuss: https://leetcode.com/problems/unique-binary-search-trees-ii/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here /* diff --git a/src/solution/s0096_unique_binary_search_trees.rs b/src/solution/s0096_unique_binary_search_trees.rs index 7124a2bf..4f64c26c 100644 --- a/src/solution/s0096_unique_binary_search_trees.rs +++ b/src/solution/s0096_unique_binary_search_trees.rs @@ -21,6 +21,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/unique-binary-search-trees/ +// discuss: https://leetcode.com/problems/unique-binary-search-trees/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0097_interleaving_string.rs b/src/solution/s0097_interleaving_string.rs index 5741bb7c..8d69d851 100644 --- a/src/solution/s0097_interleaving_string.rs +++ b/src/solution/s0097_interleaving_string.rs @@ -20,6 +20,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/interleaving-string/ +// discuss: https://leetcode.com/problems/interleaving-string/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // DFS with memorization diff --git a/src/solution/s0098_validate_binary_search_tree.rs b/src/solution/s0098_validate_binary_search_tree.rs index 7f55a47e..09098c18 100644 --- a/src/solution/s0098_validate_binary_search_tree.rs +++ b/src/solution/s0098_validate_binary_search_tree.rs @@ -37,6 +37,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/validate-binary-search-tree/ +// discuss: https://leetcode.com/problems/validate-binary-search-tree/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // Definition for a binary tree node. diff --git a/src/solution/s0099_recover_binary_search_tree.rs b/src/solution/s0099_recover_binary_search_tree.rs index 3b92da04..2401231a 100644 --- a/src/solution/s0099_recover_binary_search_tree.rs +++ b/src/solution/s0099_recover_binary_search_tree.rs @@ -57,6 +57,9 @@ pub struct Solution {} use crate::util::tree::{to_tree, TreeNode}; +// problem: https://leetcode.com/problems/recover-binary-search-tree/ +// discuss: https://leetcode.com/problems/recover-binary-search-tree/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here /* diff --git a/src/solution/s0100_same_tree.rs b/src/solution/s0100_same_tree.rs index f1ca1972..c7dc1372 100644 --- a/src/solution/s0100_same_tree.rs +++ b/src/solution/s0100_same_tree.rs @@ -45,6 +45,9 @@ pub struct Solution {} use crate::util::tree::{to_tree, TreeNode}; +// problem: https://leetcode.com/problems/same-tree/ +// discuss: https://leetcode.com/problems/same-tree/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::cell::RefCell; use std::rc::Rc; diff --git a/src/solution/s0101_symmetric_tree.rs b/src/solution/s0101_symmetric_tree.rs index c62962d2..41f44bc8 100644 --- a/src/solution/s0101_symmetric_tree.rs +++ b/src/solution/s0101_symmetric_tree.rs @@ -32,6 +32,9 @@ pub struct Solution {} use crate::util::tree::{to_tree, TreeNode}; +// problem: https://leetcode.com/problems/symmetric-tree/ +// discuss: https://leetcode.com/problems/symmetric-tree/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::cell::RefCell; diff --git a/src/solution/s0102_binary_tree_level_order_traversal.rs b/src/solution/s0102_binary_tree_level_order_traversal.rs index 42f782a5..a5a3fd13 100644 --- a/src/solution/s0102_binary_tree_level_order_traversal.rs +++ b/src/solution/s0102_binary_tree_level_order_traversal.rs @@ -28,6 +28,9 @@ pub struct Solution {} use crate::util::tree::{to_tree, TreeNode}; +// problem: https://leetcode.com/problems/binary-tree-level-order-traversal/ +// discuss: https://leetcode.com/problems/binary-tree-level-order-traversal/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::cell::RefCell; diff --git a/src/solution/s0103_binary_tree_zigzag_level_order_traversal.rs b/src/solution/s0103_binary_tree_zigzag_level_order_traversal.rs index 96476fda..78aa7b5e 100644 --- a/src/solution/s0103_binary_tree_zigzag_level_order_traversal.rs +++ b/src/solution/s0103_binary_tree_zigzag_level_order_traversal.rs @@ -28,6 +28,9 @@ pub struct Solution {} use crate::util::tree::{to_tree, TreeNode}; +// problem: https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/ +// discuss: https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::cell::RefCell; diff --git a/src/solution/s0104_maximum_depth_of_binary_tree.rs b/src/solution/s0104_maximum_depth_of_binary_tree.rs index 6d2f18e6..2b2a51d4 100644 --- a/src/solution/s0104_maximum_depth_of_binary_tree.rs +++ b/src/solution/s0104_maximum_depth_of_binary_tree.rs @@ -24,6 +24,9 @@ pub struct Solution {} use crate::util::tree::{to_tree, TreeNode}; +// problem: https://leetcode.com/problems/maximum-depth-of-binary-tree/ +// discuss: https://leetcode.com/problems/maximum-depth-of-binary-tree/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::cell::RefCell; diff --git a/src/solution/s0105_construct_binary_tree_from_preorder_and_inorder_traversal.rs b/src/solution/s0105_construct_binary_tree_from_preorder_and_inorder_traversal.rs index e271faa5..809ae654 100644 --- a/src/solution/s0105_construct_binary_tree_from_preorder_and_inorder_traversal.rs +++ b/src/solution/s0105_construct_binary_tree_from_preorder_and_inorder_traversal.rs @@ -25,6 +25,9 @@ pub struct Solution {} use crate::util::tree::{to_tree, TreeNode}; +// problem: https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/ +// discuss: https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::cell::RefCell; diff --git a/src/solution/s0106_construct_binary_tree_from_inorder_and_postorder_traversal.rs b/src/solution/s0106_construct_binary_tree_from_inorder_and_postorder_traversal.rs index 63c469be..df215bbc 100644 --- a/src/solution/s0106_construct_binary_tree_from_inorder_and_postorder_traversal.rs +++ b/src/solution/s0106_construct_binary_tree_from_inorder_and_postorder_traversal.rs @@ -26,6 +26,9 @@ pub struct Solution {} use crate::util::tree::{to_tree, TreeNode}; +// problem: https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/ +// discuss: https://leetcode.com/problems/construct-binary-tree-from-inorder-and-postorder-traversal/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::cell::RefCell; diff --git a/src/solution/s0107_binary_tree_level_order_traversal_ii.rs b/src/solution/s0107_binary_tree_level_order_traversal_ii.rs index f77229a6..4b74e0d7 100644 --- a/src/solution/s0107_binary_tree_level_order_traversal_ii.rs +++ b/src/solution/s0107_binary_tree_level_order_traversal_ii.rs @@ -28,6 +28,9 @@ pub struct Solution {} use crate::util::tree::{to_tree, TreeNode}; +// problem: https://leetcode.com/problems/binary-tree-level-order-traversal-ii/ +// discuss: https://leetcode.com/problems/binary-tree-level-order-traversal-ii/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::cell::RefCell; diff --git a/src/solution/s0108_convert_sorted_array_to_binary_search_tree.rs b/src/solution/s0108_convert_sorted_array_to_binary_search_tree.rs index 67e4b2ac..2cefab5c 100644 --- a/src/solution/s0108_convert_sorted_array_to_binary_search_tree.rs +++ b/src/solution/s0108_convert_sorted_array_to_binary_search_tree.rs @@ -23,6 +23,9 @@ pub struct Solution {} use crate::util::tree::{to_tree, TreeNode}; +// problem: https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/ +// discuss: https://leetcode.com/problems/convert-sorted-array-to-binary-search-tree/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::cell::RefCell; diff --git a/src/solution/s0109_convert_sorted_list_to_binary_search_tree.rs b/src/solution/s0109_convert_sorted_list_to_binary_search_tree.rs index 6bb37b0e..e2070965 100644 --- a/src/solution/s0109_convert_sorted_list_to_binary_search_tree.rs +++ b/src/solution/s0109_convert_sorted_list_to_binary_search_tree.rs @@ -24,6 +24,9 @@ pub struct Solution {} use crate::util::linked_list::{to_list, ListNode}; use crate::util::tree::{to_tree, TreeNode}; +// problem: https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/ +// discuss: https://leetcode.com/problems/convert-sorted-list-to-binary-search-tree/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::cell::RefCell; diff --git a/src/solution/s0110_balanced_binary_tree.rs b/src/solution/s0110_balanced_binary_tree.rs index bb067d02..c3171126 100644 --- a/src/solution/s0110_balanced_binary_tree.rs +++ b/src/solution/s0110_balanced_binary_tree.rs @@ -42,6 +42,9 @@ pub struct Solution {} use crate::util::tree::{to_tree, TreeNode}; +// problem: https://leetcode.com/problems/balanced-binary-tree/ +// discuss: https://leetcode.com/problems/balanced-binary-tree/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::cell::RefCell; diff --git a/src/solution/s0111_minimum_depth_of_binary_tree.rs b/src/solution/s0111_minimum_depth_of_binary_tree.rs index 1efb759d..a73e49f0 100644 --- a/src/solution/s0111_minimum_depth_of_binary_tree.rs +++ b/src/solution/s0111_minimum_depth_of_binary_tree.rs @@ -24,6 +24,9 @@ pub struct Solution {} use crate::util::tree::{to_tree, TreeNode}; +// problem: https://leetcode.com/problems/minimum-depth-of-binary-tree/ +// discuss: https://leetcode.com/problems/minimum-depth-of-binary-tree/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::cell::RefCell; diff --git a/src/solution/s0112_path_sum.rs b/src/solution/s0112_path_sum.rs index 2f036b21..e2e0a235 100644 --- a/src/solution/s0112_path_sum.rs +++ b/src/solution/s0112_path_sum.rs @@ -25,6 +25,9 @@ pub struct Solution {} use crate::util::tree::{to_tree, TreeNode}; +// problem: https://leetcode.com/problems/path-sum/ +// discuss: https://leetcode.com/problems/path-sum/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::cell::RefCell; diff --git a/src/solution/s0113_path_sum_ii.rs b/src/solution/s0113_path_sum_ii.rs index d567e693..106d1921 100644 --- a/src/solution/s0113_path_sum_ii.rs +++ b/src/solution/s0113_path_sum_ii.rs @@ -32,6 +32,9 @@ pub struct Solution {} use crate::util::tree::{to_tree, TreeNode}; +// problem: https://leetcode.com/problems/path-sum-ii/ +// discuss: https://leetcode.com/problems/path-sum-ii/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::cell::RefCell; diff --git a/src/solution/s0114_flatten_binary_tree_to_linked_list.rs b/src/solution/s0114_flatten_binary_tree_to_linked_list.rs index 9661e9e7..63668c47 100644 --- a/src/solution/s0114_flatten_binary_tree_to_linked_list.rs +++ b/src/solution/s0114_flatten_binary_tree_to_linked_list.rs @@ -33,6 +33,9 @@ pub struct Solution {} use crate::util::tree::{to_tree, TreeNode}; +// problem: https://leetcode.com/problems/flatten-binary-tree-to-linked-list/ +// discuss: https://leetcode.com/problems/flatten-binary-tree-to-linked-list/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::cell::RefCell; diff --git a/src/solution/s0115_distinct_subsequences.rs b/src/solution/s0115_distinct_subsequences.rs index f67304f6..7af3d08b 100644 --- a/src/solution/s0115_distinct_subsequences.rs +++ b/src/solution/s0115_distinct_subsequences.rs @@ -48,6 +48,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/distinct-subsequences/ +// discuss: https://leetcode.com/problems/distinct-subsequences/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here /* diff --git a/src/solution/s0118_pascals_triangle.rs b/src/solution/s0118_pascals_triangle.rs index a69d64e4..d593242d 100644 --- a/src/solution/s0118_pascals_triangle.rs +++ b/src/solution/s0118_pascals_triangle.rs @@ -23,6 +23,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/pascals-triangle/ +// discuss: https://leetcode.com/problems/pascals-triangle/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0119_pascals_triangle_ii.rs b/src/solution/s0119_pascals_triangle_ii.rs index 5129ed5a..588a9835 100644 --- a/src/solution/s0119_pascals_triangle_ii.rs +++ b/src/solution/s0119_pascals_triangle_ii.rs @@ -22,6 +22,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/pascals-triangle-ii/ +// discuss: https://leetcode.com/problems/pascals-triangle-ii/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here /* diff --git a/src/solution/s0120_triangle.rs b/src/solution/s0120_triangle.rs index 4a96591a..93c38d33 100644 --- a/src/solution/s0120_triangle.rs +++ b/src/solution/s0120_triangle.rs @@ -23,6 +23,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/triangle/ +// discuss: https://leetcode.com/problems/triangle/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0121_best_time_to_buy_and_sell_stock.rs b/src/solution/s0121_best_time_to_buy_and_sell_stock.rs index fa27fc10..d5d3746d 100644 --- a/src/solution/s0121_best_time_to_buy_and_sell_stock.rs +++ b/src/solution/s0121_best_time_to_buy_and_sell_stock.rs @@ -27,6 +27,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/best-time-to-buy-and-sell-stock/ +// discuss: https://leetcode.com/problems/best-time-to-buy-and-sell-stock/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0122_best_time_to_buy_and_sell_stock_ii.rs b/src/solution/s0122_best_time_to_buy_and_sell_stock_ii.rs index 7b376e6b..803c71b6 100644 --- a/src/solution/s0122_best_time_to_buy_and_sell_stock_ii.rs +++ b/src/solution/s0122_best_time_to_buy_and_sell_stock_ii.rs @@ -36,6 +36,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/ +// discuss: https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0123_best_time_to_buy_and_sell_stock_iii.rs b/src/solution/s0123_best_time_to_buy_and_sell_stock_iii.rs index 3907c044..bb068273 100644 --- a/src/solution/s0123_best_time_to_buy_and_sell_stock_iii.rs +++ b/src/solution/s0123_best_time_to_buy_and_sell_stock_iii.rs @@ -35,6 +35,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/ +// discuss: https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iii/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here /* diff --git a/src/solution/s0124_binary_tree_maximum_path_sum.rs b/src/solution/s0124_binary_tree_maximum_path_sum.rs index f76f3178..e7c57b49 100644 --- a/src/solution/s0124_binary_tree_maximum_path_sum.rs +++ b/src/solution/s0124_binary_tree_maximum_path_sum.rs @@ -35,6 +35,9 @@ pub struct Solution {} use crate::util::tree::{to_tree, TreeNode}; +// problem: https://leetcode.com/problems/binary-tree-maximum-path-sum/ +// discuss: https://leetcode.com/problems/binary-tree-maximum-path-sum/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here /* diff --git a/src/solution/s0125_valid_palindrome.rs b/src/solution/s0125_valid_palindrome.rs index b325ac0c..2f090b72 100644 --- a/src/solution/s0125_valid_palindrome.rs +++ b/src/solution/s0125_valid_palindrome.rs @@ -22,6 +22,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/valid-palindrome/ +// discuss: https://leetcode.com/problems/valid-palindrome/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0126_word_ladder_ii.rs b/src/solution/s0126_word_ladder_ii.rs index b9de6f4c..32169865 100644 --- a/src/solution/s0126_word_ladder_ii.rs +++ b/src/solution/s0126_word_ladder_ii.rs @@ -52,6 +52,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/word-ladder-ii/ +// discuss: https://leetcode.com/problems/word-ladder-ii/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here /* diff --git a/src/solution/s0127_word_ladder.rs b/src/solution/s0127_word_ladder.rs index 6c8fbfa6..a67465fa 100644 --- a/src/solution/s0127_word_ladder.rs +++ b/src/solution/s0127_word_ladder.rs @@ -47,6 +47,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/word-ladder/ +// discuss: https://leetcode.com/problems/word-ladder/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::collections::HashSet; diff --git a/src/solution/s0128_longest_consecutive_sequence.rs b/src/solution/s0128_longest_consecutive_sequence.rs index ef77362b..f0e0806f 100644 --- a/src/solution/s0128_longest_consecutive_sequence.rs +++ b/src/solution/s0128_longest_consecutive_sequence.rs @@ -16,6 +16,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/longest-consecutive-sequence/ +// discuss: https://leetcode.com/problems/longest-consecutive-sequence/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here /* diff --git a/src/solution/s0129_sum_root_to_leaf_numbers.rs b/src/solution/s0129_sum_root_to_leaf_numbers.rs index c52dc94c..1e44fb68 100644 --- a/src/solution/s0129_sum_root_to_leaf_numbers.rs +++ b/src/solution/s0129_sum_root_to_leaf_numbers.rs @@ -42,6 +42,9 @@ pub struct Solution {} use crate::util::tree::{to_tree, TreeNode}; +// problem: https://leetcode.com/problems/sum-root-to-leaf-numbers/ +// discuss: https://leetcode.com/problems/sum-root-to-leaf-numbers/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::cell::RefCell; diff --git a/src/solution/s0130_surrounded_regions.rs b/src/solution/s0130_surrounded_regions.rs index 90135ae8..411286b4 100644 --- a/src/solution/s0130_surrounded_regions.rs +++ b/src/solution/s0130_surrounded_regions.rs @@ -30,6 +30,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/surrounded-regions/ +// discuss: https://leetcode.com/problems/surrounded-regions/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here /* diff --git a/src/solution/s0131_palindrome_partitioning.rs b/src/solution/s0131_palindrome_partitioning.rs index a9f52608..22a92dfd 100644 --- a/src/solution/s0131_palindrome_partitioning.rs +++ b/src/solution/s0131_palindrome_partitioning.rs @@ -19,6 +19,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/palindrome-partitioning/ +// discuss: https://leetcode.com/problems/palindrome-partitioning/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here /* diff --git a/src/solution/s0132_palindrome_partitioning_ii.rs b/src/solution/s0132_palindrome_partitioning_ii.rs index 99dc13f0..81b75cf6 100644 --- a/src/solution/s0132_palindrome_partitioning_ii.rs +++ b/src/solution/s0132_palindrome_partitioning_ii.rs @@ -16,6 +16,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/palindrome-partitioning-ii/ +// discuss: https://leetcode.com/problems/palindrome-partitioning-ii/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here /* diff --git a/src/solution/s0134_gas_station.rs b/src/solution/s0134_gas_station.rs index 69462797..352990f9 100644 --- a/src/solution/s0134_gas_station.rs +++ b/src/solution/s0134_gas_station.rs @@ -55,6 +55,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/gas-station/ +// discuss: https://leetcode.com/problems/gas-station/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0135_candy.rs b/src/solution/s0135_candy.rs index 39e3de36..debb29d0 100644 --- a/src/solution/s0135_candy.rs +++ b/src/solution/s0135_candy.rs @@ -32,6 +32,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/candy/ +// discuss: https://leetcode.com/problems/candy/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0136_single_number.rs b/src/solution/s0136_single_number.rs index 5d14631b..580d1213 100644 --- a/src/solution/s0136_single_number.rs +++ b/src/solution/s0136_single_number.rs @@ -24,6 +24,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/single-number/ +// discuss: https://leetcode.com/problems/single-number/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { pub fn single_number(nums: Vec) -> i32 { diff --git a/src/solution/s0137_single_number_ii.rs b/src/solution/s0137_single_number_ii.rs index e4a928a2..5e99cd84 100644 --- a/src/solution/s0137_single_number_ii.rs +++ b/src/solution/s0137_single_number_ii.rs @@ -23,6 +23,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/single-number-ii/ +// discuss: https://leetcode.com/problems/single-number-ii/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here /* diff --git a/src/solution/s0139_word_break.rs b/src/solution/s0139_word_break.rs index ed4af30c..ce9e2684 100644 --- a/src/solution/s0139_word_break.rs +++ b/src/solution/s0139_word_break.rs @@ -48,6 +48,9 @@ DP 向上递推即可 BFS 也是可以的 */ +// problem: https://leetcode.com/problems/word-break/ +// discuss: https://leetcode.com/problems/word-break/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::collections::HashSet; diff --git a/src/solution/s0140_word_break_ii.rs b/src/solution/s0140_word_break_ii.rs index 9953e574..68c1319e 100644 --- a/src/solution/s0140_word_break_ii.rs +++ b/src/solution/s0140_word_break_ii.rs @@ -50,6 +50,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/word-break-ii/ +// discuss: https://leetcode.com/problems/word-break-ii/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0143_reorder_list.rs b/src/solution/s0143_reorder_list.rs index 06ec32af..1a7854cc 100644 --- a/src/solution/s0143_reorder_list.rs +++ b/src/solution/s0143_reorder_list.rs @@ -21,6 +21,9 @@ pub struct Solution {} use crate::util::linked_list::{to_list, ListNode}; +// problem: https://leetcode.com/problems/reorder-list/ +// discuss: https://leetcode.com/problems/reorder-list/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here /* diff --git a/src/solution/s0144_binary_tree_preorder_traversal.rs b/src/solution/s0144_binary_tree_preorder_traversal.rs index 02ed1f7a..3d823976 100644 --- a/src/solution/s0144_binary_tree_preorder_traversal.rs +++ b/src/solution/s0144_binary_tree_preorder_traversal.rs @@ -22,6 +22,9 @@ pub struct Solution {} use crate::util::tree::{to_tree, TreeNode}; +// problem: https://leetcode.com/problems/binary-tree-preorder-traversal/ +// discuss: https://leetcode.com/problems/binary-tree-preorder-traversal/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::cell::RefCell; diff --git a/src/solution/s0145_binary_tree_postorder_traversal.rs b/src/solution/s0145_binary_tree_postorder_traversal.rs index 2670b5bd..63197e88 100644 --- a/src/solution/s0145_binary_tree_postorder_traversal.rs +++ b/src/solution/s0145_binary_tree_postorder_traversal.rs @@ -22,6 +22,9 @@ pub struct Solution {} use crate::util::tree::{to_tree, TreeNode}; +// problem: https://leetcode.com/problems/binary-tree-postorder-traversal/ +// discuss: https://leetcode.com/problems/binary-tree-postorder-traversal/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::cell::RefCell; diff --git a/src/solution/s0146_lru_cache.rs b/src/solution/s0146_lru_cache.rs index 5ee256c8..226cbf77 100644 --- a/src/solution/s0146_lru_cache.rs +++ b/src/solution/s0146_lru_cache.rs @@ -29,6 +29,9 @@ * * */ +// problem: https://leetcode.com/problems/lru-cache/ +// discuss: https://leetcode.com/problems/lru-cache/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here /* diff --git a/src/solution/s0147_insertion_sort_list.rs b/src/solution/s0147_insertion_sort_list.rs index cdcd2d69..09aff82b 100644 --- a/src/solution/s0147_insertion_sort_list.rs +++ b/src/solution/s0147_insertion_sort_list.rs @@ -41,6 +41,9 @@ pub struct Solution {} use crate::util::linked_list::{to_list, ListNode}; +// problem: https://leetcode.com/problems/insertion-sort-list/ +// discuss: https://leetcode.com/problems/insertion-sort-list/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // TODO; boring diff --git a/src/solution/s0148_sort_list.rs b/src/solution/s0148_sort_list.rs index 4bc8ac17..78b7f08c 100644 --- a/src/solution/s0148_sort_list.rs +++ b/src/solution/s0148_sort_list.rs @@ -20,6 +20,9 @@ pub struct Solution {} use crate::util::linked_list::{to_list, ListNode}; +// problem: https://leetcode.com/problems/sort-list/ +// discuss: https://leetcode.com/problems/sort-list/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here /* diff --git a/src/solution/s0149_max_points_on_a_line.rs b/src/solution/s0149_max_points_on_a_line.rs index 1b0bf16c..31ea4c62 100644 --- a/src/solution/s0149_max_points_on_a_line.rs +++ b/src/solution/s0149_max_points_on_a_line.rs @@ -38,6 +38,9 @@ pub struct Solution {} use crate::util::point::Point; +// problem: https://leetcode.com/problems/max-points-on-a-line/ +// discuss: https://leetcode.com/problems/max-points-on-a-line/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here /* diff --git a/src/solution/s0150_evaluate_reverse_polish_notation.rs b/src/solution/s0150_evaluate_reverse_polish_notation.rs index 4626d5aa..048824dd 100644 --- a/src/solution/s0150_evaluate_reverse_polish_notation.rs +++ b/src/solution/s0150_evaluate_reverse_polish_notation.rs @@ -46,6 +46,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/evaluate-reverse-polish-notation/ +// discuss: https://leetcode.com/problems/evaluate-reverse-polish-notation/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0151_reverse_words_in_a_string.rs b/src/solution/s0151_reverse_words_in_a_string.rs index e26bd573..627f0dd6 100644 --- a/src/solution/s0151_reverse_words_in_a_string.rs +++ b/src/solution/s0151_reverse_words_in_a_string.rs @@ -46,6 +46,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/reverse-words-in-a-string/ +// discuss: https://leetcode.com/problems/reverse-words-in-a-string/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0152_maximum_product_subarray.rs b/src/solution/s0152_maximum_product_subarray.rs index 34bba87e..b85b5ecb 100644 --- a/src/solution/s0152_maximum_product_subarray.rs +++ b/src/solution/s0152_maximum_product_subarray.rs @@ -21,6 +21,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/maximum-product-subarray/ +// discuss: https://leetcode.com/problems/maximum-product-subarray/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here /* diff --git a/src/solution/s0153_find_minimum_in_rotated_sorted_array.rs b/src/solution/s0153_find_minimum_in_rotated_sorted_array.rs index 9c609f42..03b7e7f1 100644 --- a/src/solution/s0153_find_minimum_in_rotated_sorted_array.rs +++ b/src/solution/s0153_find_minimum_in_rotated_sorted_array.rs @@ -26,6 +26,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/ +// discuss: https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0154_find_minimum_in_rotated_sorted_array_ii.rs b/src/solution/s0154_find_minimum_in_rotated_sorted_array_ii.rs index 8868ff82..cdb23ac3 100644 --- a/src/solution/s0154_find_minimum_in_rotated_sorted_array_ii.rs +++ b/src/solution/s0154_find_minimum_in_rotated_sorted_array_ii.rs @@ -31,6 +31,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/ +// discuss: https://leetcode.com/problems/find-minimum-in-rotated-sorted-array-ii/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here /* diff --git a/src/solution/s0155_min_stack.rs b/src/solution/s0155_min_stack.rs index 1c544d87..99a96698 100644 --- a/src/solution/s0155_min_stack.rs +++ b/src/solution/s0155_min_stack.rs @@ -34,6 +34,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/min-stack/ +// discuss: https://leetcode.com/problems/min-stack/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here /* diff --git a/src/solution/s0162_find_peak_element.rs b/src/solution/s0162_find_peak_element.rs index 8e5a3f76..3888b998 100644 --- a/src/solution/s0162_find_peak_element.rs +++ b/src/solution/s0162_find_peak_element.rs @@ -32,6 +32,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/find-peak-element/ +// discuss: https://leetcode.com/problems/find-peak-element/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0164_maximum_gap.rs b/src/solution/s0164_maximum_gap.rs index ded5006d..bd961db7 100644 --- a/src/solution/s0164_maximum_gap.rs +++ b/src/solution/s0164_maximum_gap.rs @@ -30,6 +30,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/maximum-gap/ +// discuss: https://leetcode.com/problems/maximum-gap/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here /* 想不出来, 一看解析居然是 Radix Sort 或 Bucket Sort, 我就 ??? 了... diff --git a/src/solution/s0165_compare_version_numbers.rs b/src/solution/s0165_compare_version_numbers.rs index 522224df..b53f1bbb 100644 --- a/src/solution/s0165_compare_version_numbers.rs +++ b/src/solution/s0165_compare_version_numbers.rs @@ -48,6 +48,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/compare-version-numbers/ +// discuss: https://leetcode.com/problems/compare-version-numbers/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0166_fraction_to_recurring_decimal.rs b/src/solution/s0166_fraction_to_recurring_decimal.rs index 29900b38..4585738f 100644 --- a/src/solution/s0166_fraction_to_recurring_decimal.rs +++ b/src/solution/s0166_fraction_to_recurring_decimal.rs @@ -28,6 +28,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/fraction-to-recurring-decimal/ +// discuss: https://leetcode.com/problems/fraction-to-recurring-decimal/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // TODO diff --git a/src/solution/s0167_two_sum_ii_input_array_is_sorted.rs b/src/solution/s0167_two_sum_ii_input_array_is_sorted.rs index 9fd7a483..58de2e86 100644 --- a/src/solution/s0167_two_sum_ii_input_array_is_sorted.rs +++ b/src/solution/s0167_two_sum_ii_input_array_is_sorted.rs @@ -22,6 +22,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/ +// discuss: https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0168_excel_sheet_column_title.rs b/src/solution/s0168_excel_sheet_column_title.rs index c61f9875..5a9dc585 100644 --- a/src/solution/s0168_excel_sheet_column_title.rs +++ b/src/solution/s0168_excel_sheet_column_title.rs @@ -39,6 +39,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/excel-sheet-column-title/ +// discuss: https://leetcode.com/problems/excel-sheet-column-title/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0169_majority_element.rs b/src/solution/s0169_majority_element.rs index ccde478f..be59bea6 100644 --- a/src/solution/s0169_majority_element.rs +++ b/src/solution/s0169_majority_element.rs @@ -21,6 +21,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/majority-element/ +// discuss: https://leetcode.com/problems/majority-element/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here /* diff --git a/src/solution/s0171_excel_sheet_column_number.rs b/src/solution/s0171_excel_sheet_column_number.rs index a6e6838c..1b2f611f 100644 --- a/src/solution/s0171_excel_sheet_column_number.rs +++ b/src/solution/s0171_excel_sheet_column_number.rs @@ -39,6 +39,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/excel-sheet-column-number/ +// discuss: https://leetcode.com/problems/excel-sheet-column-number/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // TODO: boring diff --git a/src/solution/s0172_factorial_trailing_zeroes.rs b/src/solution/s0172_factorial_trailing_zeroes.rs index 0c9f9691..9a54916d 100644 --- a/src/solution/s0172_factorial_trailing_zeroes.rs +++ b/src/solution/s0172_factorial_trailing_zeroes.rs @@ -22,6 +22,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/factorial-trailing-zeroes/ +// discuss: https://leetcode.com/problems/factorial-trailing-zeroes/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0173_binary_search_tree_iterator.rs b/src/solution/s0173_binary_search_tree_iterator.rs index caef4724..b350600d 100644 --- a/src/solution/s0173_binary_search_tree_iterator.rs +++ b/src/solution/s0173_binary_search_tree_iterator.rs @@ -42,6 +42,9 @@ use crate::util::tree::{to_tree, TreeNode}; use std::cell::RefCell; use std::rc::Rc; +// problem: https://leetcode.com/problems/binary-search-tree-iterator/ +// discuss: https://leetcode.com/problems/binary-search-tree-iterator/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here /* diff --git a/src/solution/s0174_dungeon_game.rs b/src/solution/s0174_dungeon_game.rs index c1551250..23be4d97 100644 --- a/src/solution/s0174_dungeon_game.rs +++ b/src/solution/s0174_dungeon_game.rs @@ -57,6 +57,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/dungeon-game/ +// discuss: https://leetcode.com/problems/dungeon-game/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here /* diff --git a/src/solution/s0179_largest_number.rs b/src/solution/s0179_largest_number.rs index 349ffc8b..65348165 100644 --- a/src/solution/s0179_largest_number.rs +++ b/src/solution/s0179_largest_number.rs @@ -21,6 +21,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/largest-number/ +// discuss: https://leetcode.com/problems/largest-number/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0187_repeated_dna_sequences.rs b/src/solution/s0187_repeated_dna_sequences.rs index d16cf948..9ceb86cb 100644 --- a/src/solution/s0187_repeated_dna_sequences.rs +++ b/src/solution/s0187_repeated_dna_sequences.rs @@ -16,6 +16,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/repeated-dna-sequences/ +// discuss: https://leetcode.com/problems/repeated-dna-sequences/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here /* diff --git a/src/solution/s0188_best_time_to_buy_and_sell_stock_iv.rs b/src/solution/s0188_best_time_to_buy_and_sell_stock_iv.rs index af1d9c09..e9c23319 100644 --- a/src/solution/s0188_best_time_to_buy_and_sell_stock_iv.rs +++ b/src/solution/s0188_best_time_to_buy_and_sell_stock_iv.rs @@ -27,6 +27,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/ +// discuss: https://leetcode.com/problems/best-time-to-buy-and-sell-stock-iv/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here /* diff --git a/src/solution/s0189_rotate_array.rs b/src/solution/s0189_rotate_array.rs index 644ce374..1a4d2ab8 100644 --- a/src/solution/s0189_rotate_array.rs +++ b/src/solution/s0189_rotate_array.rs @@ -33,6 +33,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/rotate-array/ +// discuss: https://leetcode.com/problems/rotate-array/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0198_house_robber.rs b/src/solution/s0198_house_robber.rs index e1257f0c..446e63f1 100644 --- a/src/solution/s0198_house_robber.rs +++ b/src/solution/s0198_house_robber.rs @@ -25,6 +25,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/house-robber/ +// discuss: https://leetcode.com/problems/house-robber/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here /* diff --git a/src/solution/s0199_binary_tree_right_side_view.rs b/src/solution/s0199_binary_tree_right_side_view.rs index c580970c..e07dc998 100644 --- a/src/solution/s0199_binary_tree_right_side_view.rs +++ b/src/solution/s0199_binary_tree_right_side_view.rs @@ -20,6 +20,9 @@ pub struct Solution {} use crate::util::tree::{to_tree, TreeNode}; +// problem: https://leetcode.com/problems/binary-tree-right-side-view/ +// discuss: https://leetcode.com/problems/binary-tree-right-side-view/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::cell::RefCell; diff --git a/src/solution/s0200_number_of_islands.rs b/src/solution/s0200_number_of_islands.rs index b9bcadd2..262f0315 100644 --- a/src/solution/s0200_number_of_islands.rs +++ b/src/solution/s0200_number_of_islands.rs @@ -29,6 +29,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/number-of-islands/ +// discuss: https://leetcode.com/problems/number-of-islands/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // Union-Find Set diff --git a/src/solution/s0201_bitwise_and_of_numbers_range.rs b/src/solution/s0201_bitwise_and_of_numbers_range.rs index 6fc338b7..6c46e74f 100644 --- a/src/solution/s0201_bitwise_and_of_numbers_range.rs +++ b/src/solution/s0201_bitwise_and_of_numbers_range.rs @@ -18,6 +18,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/bitwise-and-of-numbers-range/ +// discuss: https://leetcode.com/problems/bitwise-and-of-numbers-range/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // just find the highest bit 1 of m and n diff --git a/src/solution/s0202_happy_number.rs b/src/solution/s0202_happy_number.rs index 3443f1db..076f2736 100644 --- a/src/solution/s0202_happy_number.rs +++ b/src/solution/s0202_happy_number.rs @@ -19,6 +19,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/happy-number/ +// discuss: https://leetcode.com/problems/happy-number/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::collections::HashSet; diff --git a/src/solution/s0203_remove_linked_list_elements.rs b/src/solution/s0203_remove_linked_list_elements.rs index f8d9bc43..3e48d811 100644 --- a/src/solution/s0203_remove_linked_list_elements.rs +++ b/src/solution/s0203_remove_linked_list_elements.rs @@ -14,6 +14,9 @@ pub struct Solution {} use crate::util::linked_list::{to_list, ListNode}; +// problem: https://leetcode.com/problems/remove-linked-list-elements/ +// discuss: https://leetcode.com/problems/remove-linked-list-elements/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0204_count_primes.rs b/src/solution/s0204_count_primes.rs index 4ec5d5c3..d6f0f134 100644 --- a/src/solution/s0204_count_primes.rs +++ b/src/solution/s0204_count_primes.rs @@ -14,6 +14,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/count-primes/ +// discuss: https://leetcode.com/problems/count-primes/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0205_isomorphic_strings.rs b/src/solution/s0205_isomorphic_strings.rs index 6bb77373..df697ebb 100644 --- a/src/solution/s0205_isomorphic_strings.rs +++ b/src/solution/s0205_isomorphic_strings.rs @@ -32,6 +32,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/isomorphic-strings/ +// discuss: https://leetcode.com/problems/isomorphic-strings/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::char; diff --git a/src/solution/s0206_reverse_linked_list.rs b/src/solution/s0206_reverse_linked_list.rs index 4689f415..b62aced8 100644 --- a/src/solution/s0206_reverse_linked_list.rs +++ b/src/solution/s0206_reverse_linked_list.rs @@ -18,6 +18,9 @@ pub struct Solution {} use crate::util::linked_list::{to_list, ListNode}; +// problem: https://leetcode.com/problems/reverse-linked-list/ +// discuss: https://leetcode.com/problems/reverse-linked-list/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0207_course_schedule.rs b/src/solution/s0207_course_schedule.rs index 2222adad..2a793683 100644 --- a/src/solution/s0207_course_schedule.rs +++ b/src/solution/s0207_course_schedule.rs @@ -35,6 +35,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/course-schedule/ +// discuss: https://leetcode.com/problems/course-schedule/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // topology sort, BFS diff --git a/src/solution/s0208_implement_trie_prefix_tree.rs b/src/solution/s0208_implement_trie_prefix_tree.rs index be29d61b..9ac8e470 100644 --- a/src/solution/s0208_implement_trie_prefix_tree.rs +++ b/src/solution/s0208_implement_trie_prefix_tree.rs @@ -26,6 +26,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/implement-trie-prefix-tree/ +// discuss: https://leetcode.com/problems/implement-trie-prefix-tree/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here #[derive(Default)] diff --git a/src/solution/s0209_minimum_size_subarray_sum.rs b/src/solution/s0209_minimum_size_subarray_sum.rs index 13b02448..b6a692d7 100644 --- a/src/solution/s0209_minimum_size_subarray_sum.rs +++ b/src/solution/s0209_minimum_size_subarray_sum.rs @@ -17,6 +17,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/minimum-size-subarray-sum/ +// discuss: https://leetcode.com/problems/minimum-size-subarray-sum/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0210_course_schedule_ii.rs b/src/solution/s0210_course_schedule_ii.rs index 336fe345..dd3a1b03 100644 --- a/src/solution/s0210_course_schedule_ii.rs +++ b/src/solution/s0210_course_schedule_ii.rs @@ -36,6 +36,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/course-schedule-ii/ +// discuss: https://leetcode.com/problems/course-schedule-ii/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::collections::VecDeque; diff --git a/src/solution/s0211_add_and_search_word_data_structure_design.rs b/src/solution/s0211_add_and_search_word_data_structure_design.rs index fbab7949..0652f951 100644 --- a/src/solution/s0211_add_and_search_word_data_structure_design.rs +++ b/src/solution/s0211_add_and_search_word_data_structure_design.rs @@ -28,6 +28,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/add-and-search-word-data-structure-design/ +// discuss: https://leetcode.com/problems/add-and-search-word-data-structure-design/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here struct WordDictionary { diff --git a/src/solution/s0212_word_search_ii.rs b/src/solution/s0212_word_search_ii.rs index 77914f04..ada034c8 100644 --- a/src/solution/s0212_word_search_ii.rs +++ b/src/solution/s0212_word_search_ii.rs @@ -34,6 +34,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/word-search-ii/ +// discuss: https://leetcode.com/problems/word-search-ii/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // TODO diff --git a/src/solution/s0213_house_robber_ii.rs b/src/solution/s0213_house_robber_ii.rs index 6dac950c..fbe55040 100644 --- a/src/solution/s0213_house_robber_ii.rs +++ b/src/solution/s0213_house_robber_ii.rs @@ -25,6 +25,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/house-robber-ii/ +// discuss: https://leetcode.com/problems/house-robber-ii/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // DP twice: rob first one || not rob first one diff --git a/src/solution/s0214_shortest_palindrome.rs b/src/solution/s0214_shortest_palindrome.rs index a8a23c60..425eec95 100644 --- a/src/solution/s0214_shortest_palindrome.rs +++ b/src/solution/s0214_shortest_palindrome.rs @@ -18,6 +18,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/shortest-palindrome/ +// discuss: https://leetcode.com/problems/shortest-palindrome/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0215_kth_largest_element_in_an_array.rs b/src/solution/s0215_kth_largest_element_in_an_array.rs index 3c114990..159e7af6 100644 --- a/src/solution/s0215_kth_largest_element_in_an_array.rs +++ b/src/solution/s0215_kth_largest_element_in_an_array.rs @@ -22,6 +22,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/kth-largest-element-in-an-array/ +// discuss: https://leetcode.com/problems/kth-largest-element-in-an-array/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::cmp::Reverse; diff --git a/src/solution/s0216_combination_sum_iii.rs b/src/solution/s0216_combination_sum_iii.rs index d6f797fa..0f714e01 100644 --- a/src/solution/s0216_combination_sum_iii.rs +++ b/src/solution/s0216_combination_sum_iii.rs @@ -28,6 +28,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/combination-sum-iii/ +// discuss: https://leetcode.com/problems/combination-sum-iii/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0217_contains_duplicate.rs b/src/solution/s0217_contains_duplicate.rs index 6e2c906d..0d2e5e12 100644 --- a/src/solution/s0217_contains_duplicate.rs +++ b/src/solution/s0217_contains_duplicate.rs @@ -26,6 +26,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/contains-duplicate/ +// discuss: https://leetcode.com/problems/contains-duplicate/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0218_the_skyline_problem.rs b/src/solution/s0218_the_skyline_problem.rs index 9e774db0..7f0ba3c1 100644 --- a/src/solution/s0218_the_skyline_problem.rs +++ b/src/solution/s0218_the_skyline_problem.rs @@ -24,6 +24,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/the-skyline-problem/ +// discuss: https://leetcode.com/problems/the-skyline-problem/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0219_contains_duplicate_ii.rs b/src/solution/s0219_contains_duplicate_ii.rs index c5713adb..da446dae 100644 --- a/src/solution/s0219_contains_duplicate_ii.rs +++ b/src/solution/s0219_contains_duplicate_ii.rs @@ -33,6 +33,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/contains-duplicate-ii/ +// discuss: https://leetcode.com/problems/contains-duplicate-ii/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::collections::HashMap; diff --git a/src/solution/s0220_contains_duplicate_iii.rs b/src/solution/s0220_contains_duplicate_iii.rs index a29cb2e5..0677b1d3 100644 --- a/src/solution/s0220_contains_duplicate_iii.rs +++ b/src/solution/s0220_contains_duplicate_iii.rs @@ -33,6 +33,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/contains-duplicate-iii/ +// discuss: https://leetcode.com/problems/contains-duplicate-iii/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::collections::HashMap; impl Solution { diff --git a/src/solution/s0221_maximal_square.rs b/src/solution/s0221_maximal_square.rs index 2fbe5b02..34f793ac 100644 --- a/src/solution/s0221_maximal_square.rs +++ b/src/solution/s0221_maximal_square.rs @@ -18,6 +18,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/maximal-square/ +// discuss: https://leetcode.com/problems/maximal-square/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here /* diff --git a/src/solution/s0222_count_complete_tree_nodes.rs b/src/solution/s0222_count_complete_tree_nodes.rs index 189fb3dd..ae0d410b 100644 --- a/src/solution/s0222_count_complete_tree_nodes.rs +++ b/src/solution/s0222_count_complete_tree_nodes.rs @@ -24,6 +24,9 @@ pub struct Solution {} use crate::util::tree::{to_tree, TreeNode}; +// problem: https://leetcode.com/problems/count-complete-tree-nodes/ +// discuss: https://leetcode.com/problems/count-complete-tree-nodes/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::cell::RefCell; diff --git a/src/solution/s0223_rectangle_area.rs b/src/solution/s0223_rectangle_area.rs index b90235dd..647b6b2a 100644 --- a/src/solution/s0223_rectangle_area.rs +++ b/src/solution/s0223_rectangle_area.rs @@ -20,6 +20,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/rectangle-area/ +// discuss: https://leetcode.com/problems/rectangle-area/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // mention the integer divition diff --git a/src/solution/s0224_basic_calculator.rs b/src/solution/s0224_basic_calculator.rs index 33ed3112..5d917661 100644 --- a/src/solution/s0224_basic_calculator.rs +++ b/src/solution/s0224_basic_calculator.rs @@ -33,6 +33,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/basic-calculator/ +// discuss: https://leetcode.com/problems/basic-calculator/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here #[derive(PartialEq, Copy, Clone, Debug)] diff --git a/src/solution/s0225_implement_stack_using_queues.rs b/src/solution/s0225_implement_stack_using_queues.rs index a4ff6a3b..f162e9a6 100644 --- a/src/solution/s0225_implement_stack_using_queues.rs +++ b/src/solution/s0225_implement_stack_using_queues.rs @@ -32,6 +32,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/implement-stack-using-queues/ +// discuss: https://leetcode.com/problems/implement-stack-using-queues/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here struct MyStack { diff --git a/src/solution/s0226_invert_binary_tree.rs b/src/solution/s0226_invert_binary_tree.rs index 30bd001a..1a1b6115 100644 --- a/src/solution/s0226_invert_binary_tree.rs +++ b/src/solution/s0226_invert_binary_tree.rs @@ -32,6 +32,9 @@ pub struct Solution {} use crate::util::tree::{to_tree, TreeNode}; +// problem: https://leetcode.com/problems/invert-binary-tree/ +// discuss: https://leetcode.com/problems/invert-binary-tree/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::cell::RefCell; diff --git a/src/solution/s0227_basic_calculator_ii.rs b/src/solution/s0227_basic_calculator_ii.rs index cd52accb..07e349dd 100644 --- a/src/solution/s0227_basic_calculator_ii.rs +++ b/src/solution/s0227_basic_calculator_ii.rs @@ -35,6 +35,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/basic-calculator-ii/ +// discuss: https://leetcode.com/problems/basic-calculator-ii/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0228_summary_ranges.rs b/src/solution/s0228_summary_ranges.rs index bb36db17..63e8fe77 100644 --- a/src/solution/s0228_summary_ranges.rs +++ b/src/solution/s0228_summary_ranges.rs @@ -22,6 +22,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/summary-ranges/ +// discuss: https://leetcode.com/problems/summary-ranges/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0229_majority_element_ii.rs b/src/solution/s0229_majority_element_ii.rs index 26baf79e..fab987ba 100644 --- a/src/solution/s0229_majority_element_ii.rs +++ b/src/solution/s0229_majority_element_ii.rs @@ -20,6 +20,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/majority-element-ii/ +// discuss: https://leetcode.com/problems/majority-element-ii/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0230_kth_smallest_element_in_a_bst.rs b/src/solution/s0230_kth_smallest_element_in_a_bst.rs index fe14721f..0533f705 100644 --- a/src/solution/s0230_kth_smallest_element_in_a_bst.rs +++ b/src/solution/s0230_kth_smallest_element_in_a_bst.rs @@ -38,6 +38,9 @@ pub struct Solution {} use crate::util::tree::{to_tree, TreeNode}; +// problem: https://leetcode.com/problems/kth-smallest-element-in-a-bst/ +// discuss: https://leetcode.com/problems/kth-smallest-element-in-a-bst/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::cell::RefCell; diff --git a/src/solution/s0231_power_of_two.rs b/src/solution/s0231_power_of_two.rs index 683dfc91..334fc314 100644 --- a/src/solution/s0231_power_of_two.rs +++ b/src/solution/s0231_power_of_two.rs @@ -27,6 +27,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/power-of-two/ +// discuss: https://leetcode.com/problems/power-of-two/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0232_implement_queue_using_stacks.rs b/src/solution/s0232_implement_queue_using_stacks.rs index d7ff9543..70bf3735 100644 --- a/src/solution/s0232_implement_queue_using_stacks.rs +++ b/src/solution/s0232_implement_queue_using_stacks.rs @@ -32,6 +32,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/implement-queue-using-stacks/ +// discuss: https://leetcode.com/problems/implement-queue-using-stacks/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here struct MyQueue { diff --git a/src/solution/s0233_number_of_digit_one.rs b/src/solution/s0233_number_of_digit_one.rs index 74c0091c..60097ed0 100644 --- a/src/solution/s0233_number_of_digit_one.rs +++ b/src/solution/s0233_number_of_digit_one.rs @@ -14,6 +14,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/number-of-digit-one/ +// discuss: https://leetcode.com/problems/number-of-digit-one/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0238_product_of_array_except_self.rs b/src/solution/s0238_product_of_array_except_self.rs index 7134f2ba..ef5683c4 100644 --- a/src/solution/s0238_product_of_array_except_self.rs +++ b/src/solution/s0238_product_of_array_except_self.rs @@ -18,6 +18,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/product-of-array-except-self/ +// discuss: https://leetcode.com/problems/product-of-array-except-self/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here /* diff --git a/src/solution/s0239_sliding_window_maximum.rs b/src/solution/s0239_sliding_window_maximum.rs index 116218f6..f7509cb9 100644 --- a/src/solution/s0239_sliding_window_maximum.rs +++ b/src/solution/s0239_sliding_window_maximum.rs @@ -28,6 +28,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/sliding-window-maximum/ +// discuss: https://leetcode.com/problems/sliding-window-maximum/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::collections::VecDeque; diff --git a/src/solution/s0241_different_ways_to_add_parentheses.rs b/src/solution/s0241_different_ways_to_add_parentheses.rs index cdb5ceaa..a76bfa6a 100644 --- a/src/solution/s0241_different_ways_to_add_parentheses.rs +++ b/src/solution/s0241_different_ways_to_add_parentheses.rs @@ -27,6 +27,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/different-ways-to-add-parentheses/ +// discuss: https://leetcode.com/problems/different-ways-to-add-parentheses/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0242_valid_anagram.rs b/src/solution/s0242_valid_anagram.rs index 8c809549..ba7a58ae 100644 --- a/src/solution/s0242_valid_anagram.rs +++ b/src/solution/s0242_valid_anagram.rs @@ -26,6 +26,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/valid-anagram/ +// discuss: https://leetcode.com/problems/valid-anagram/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0257_binary_tree_paths.rs b/src/solution/s0257_binary_tree_paths.rs index c5d6d336..6c7833e2 100644 --- a/src/solution/s0257_binary_tree_paths.rs +++ b/src/solution/s0257_binary_tree_paths.rs @@ -24,6 +24,9 @@ pub struct Solution {} use crate::util::tree::{to_tree, TreeNode}; +// problem: https://leetcode.com/problems/binary-tree-paths/ +// discuss: https://leetcode.com/problems/binary-tree-paths/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // Definition for a binary tree node. diff --git a/src/solution/s0258_add_digits.rs b/src/solution/s0258_add_digits.rs index 1ebeda42..2248be1d 100644 --- a/src/solution/s0258_add_digits.rs +++ b/src/solution/s0258_add_digits.rs @@ -17,6 +17,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/add-digits/ +// discuss: https://leetcode.com/problems/add-digits/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0260_single_number_iii.rs b/src/solution/s0260_single_number_iii.rs index 2735cb7d..09d7a920 100644 --- a/src/solution/s0260_single_number_iii.rs +++ b/src/solution/s0260_single_number_iii.rs @@ -18,6 +18,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/single-number-iii/ +// discuss: https://leetcode.com/problems/single-number-iii/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0263_ugly_number.rs b/src/solution/s0263_ugly_number.rs index 1ad0a3cc..9ef3bf57 100644 --- a/src/solution/s0263_ugly_number.rs +++ b/src/solution/s0263_ugly_number.rs @@ -37,6 +37,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/ugly-number/ +// discuss: https://leetcode.com/problems/ugly-number/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0264_ugly_number_ii.rs b/src/solution/s0264_ugly_number_ii.rs index 48be94d1..8dda4f01 100644 --- a/src/solution/s0264_ugly_number_ii.rs +++ b/src/solution/s0264_ugly_number_ii.rs @@ -21,6 +21,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/ugly-number-ii/ +// discuss: https://leetcode.com/problems/ugly-number-ii/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0268_missing_number.rs b/src/solution/s0268_missing_number.rs index c8636b99..63291ee0 100644 --- a/src/solution/s0268_missing_number.rs +++ b/src/solution/s0268_missing_number.rs @@ -22,6 +22,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/missing-number/ +// discuss: https://leetcode.com/problems/missing-number/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0273_integer_to_english_words.rs b/src/solution/s0273_integer_to_english_words.rs index 7119014d..123a1f9d 100644 --- a/src/solution/s0273_integer_to_english_words.rs +++ b/src/solution/s0273_integer_to_english_words.rs @@ -33,6 +33,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/integer-to-english-words/ +// discuss: https://leetcode.com/problems/integer-to-english-words/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // static digits: Vec<&str> = vec!["One", "Two", "Three", "Four", "Five", "Six", "Seven", "Eight", "Nine"]; diff --git a/src/solution/s0274_h_index.rs b/src/solution/s0274_h_index.rs index 936ba1e7..b36f65a3 100644 --- a/src/solution/s0274_h_index.rs +++ b/src/solution/s0274_h_index.rs @@ -20,6 +20,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/h-index/ +// discuss: https://leetcode.com/problems/h-index/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0275_h_index_ii.rs b/src/solution/s0275_h_index_ii.rs index 63e21671..027ad02a 100644 --- a/src/solution/s0275_h_index_ii.rs +++ b/src/solution/s0275_h_index_ii.rs @@ -29,6 +29,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/h-index-ii/ +// discuss: https://leetcode.com/problems/h-index-ii/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0279_perfect_squares.rs b/src/solution/s0279_perfect_squares.rs index 349d9584..fe5f0a01 100644 --- a/src/solution/s0279_perfect_squares.rs +++ b/src/solution/s0279_perfect_squares.rs @@ -19,6 +19,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/perfect-squares/ +// discuss: https://leetcode.com/problems/perfect-squares/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // BFS diff --git a/src/solution/s0282_expression_add_operators.rs b/src/solution/s0282_expression_add_operators.rs index a1c9d776..1c41367b 100644 --- a/src/solution/s0282_expression_add_operators.rs +++ b/src/solution/s0282_expression_add_operators.rs @@ -39,6 +39,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/expression-add-operators/ +// discuss: https://leetcode.com/problems/expression-add-operators/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0283_move_zeroes.rs b/src/solution/s0283_move_zeroes.rs index 1087acab..6581bcaf 100644 --- a/src/solution/s0283_move_zeroes.rs +++ b/src/solution/s0283_move_zeroes.rs @@ -18,6 +18,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/move-zeroes/ +// discuss: https://leetcode.com/problems/move-zeroes/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0287_find_the_duplicate_number.rs b/src/solution/s0287_find_the_duplicate_number.rs index d0111840..cea65001 100644 --- a/src/solution/s0287_find_the_duplicate_number.rs +++ b/src/solution/s0287_find_the_duplicate_number.rs @@ -28,6 +28,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/find-the-duplicate-number/ +// discuss: https://leetcode.com/problems/find-the-duplicate-number/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // 假如把值看做 next node 的下标, 那么: diff --git a/src/solution/s0289_game_of_life.rs b/src/solution/s0289_game_of_life.rs index 37e81fc3..53d34623 100644 --- a/src/solution/s0289_game_of_life.rs +++ b/src/solution/s0289_game_of_life.rs @@ -43,6 +43,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/game-of-life/ +// discuss: https://leetcode.com/problems/game-of-life/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // in-place: 1: live->live, 0: die->die, 2: die->live, 3: live->die diff --git a/src/solution/s0290_word_pattern.rs b/src/solution/s0290_word_pattern.rs index adb5cb0e..c758f352 100644 --- a/src/solution/s0290_word_pattern.rs +++ b/src/solution/s0290_word_pattern.rs @@ -35,6 +35,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/word-pattern/ +// discuss: https://leetcode.com/problems/word-pattern/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::collections::HashMap; diff --git a/src/solution/s0292_nim_game.rs b/src/solution/s0292_nim_game.rs index ff0e1444..4c46505c 100644 --- a/src/solution/s0292_nim_game.rs +++ b/src/solution/s0292_nim_game.rs @@ -16,6 +16,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/nim-game/ +// discuss: https://leetcode.com/problems/nim-game/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0295_find_median_from_data_stream.rs b/src/solution/s0295_find_median_from_data_stream.rs index f400c5b0..02dc5331 100644 --- a/src/solution/s0295_find_median_from_data_stream.rs +++ b/src/solution/s0295_find_median_from_data_stream.rs @@ -39,6 +39,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/find-median-from-data-stream/ +// discuss: https://leetcode.com/problems/find-median-from-data-stream/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::cmp::Ordering; diff --git a/src/solution/s0299_bulls_and_cows.rs b/src/solution/s0299_bulls_and_cows.rs index 3ef77009..08525c71 100644 --- a/src/solution/s0299_bulls_and_cows.rs +++ b/src/solution/s0299_bulls_and_cows.rs @@ -29,6 +29,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/bulls-and-cows/ +// discuss: https://leetcode.com/problems/bulls-and-cows/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0300_longest_increasing_subsequence.rs b/src/solution/s0300_longest_increasing_subsequence.rs index cf5eee05..c0b7eb27 100644 --- a/src/solution/s0300_longest_increasing_subsequence.rs +++ b/src/solution/s0300_longest_increasing_subsequence.rs @@ -22,6 +22,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/longest-increasing-subsequence/ +// discuss: https://leetcode.com/problems/longest-increasing-subsequence/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // N^2, DP: L[i] = max(1 + L[j]) for j in [0, i) and nums[j] < nums[i] // N * logN, kick out strategy, maintain an increasing array, new elements kick out a formal one larger than it, if the new element is largest, expand the array diff --git a/src/solution/s0301_remove_invalid_parentheses.rs b/src/solution/s0301_remove_invalid_parentheses.rs index 6d6f2f51..2cec757c 100644 --- a/src/solution/s0301_remove_invalid_parentheses.rs +++ b/src/solution/s0301_remove_invalid_parentheses.rs @@ -28,6 +28,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/remove-invalid-parentheses/ +// discuss: https://leetcode.com/problems/remove-invalid-parentheses/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // 1. Calculate the number of misplaced left parenthese and right parenthese diff --git a/src/solution/s0303_range_sum_query_immutable.rs b/src/solution/s0303_range_sum_query_immutable.rs index 0143a4ab..c56f8ae9 100644 --- a/src/solution/s0303_range_sum_query_immutable.rs +++ b/src/solution/s0303_range_sum_query_immutable.rs @@ -22,6 +22,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/range-sum-query-immutable/ +// discuss: https://leetcode.com/problems/range-sum-query-immutable/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here struct NumArray { diff --git a/src/solution/s0304_range_sum_query_2d_immutable.rs b/src/solution/s0304_range_sum_query_2d_immutable.rs index d9775add..42a0f41f 100644 --- a/src/solution/s0304_range_sum_query_2d_immutable.rs +++ b/src/solution/s0304_range_sum_query_2d_immutable.rs @@ -34,6 +34,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/range-sum-query-2d-immutable/ +// discuss: https://leetcode.com/problems/range-sum-query-2d-immutable/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here struct NumMatrix { diff --git a/src/solution/s0306_additive_number.rs b/src/solution/s0306_additive_number.rs index 08b926f4..38f6c0b2 100644 --- a/src/solution/s0306_additive_number.rs +++ b/src/solution/s0306_additive_number.rs @@ -31,6 +31,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/additive-number/ +// discuss: https://leetcode.com/problems/additive-number/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here // first_cut second_cut third_cut diff --git a/src/solution/s0307_range_sum_query_mutable.rs b/src/solution/s0307_range_sum_query_mutable.rs index 74ec6139..bbaac119 100644 --- a/src/solution/s0307_range_sum_query_mutable.rs +++ b/src/solution/s0307_range_sum_query_mutable.rs @@ -36,6 +36,9 @@ pub struct Solution {} // / \ / \ / \ // N[0] N[1] N[2] N[3] N[4] N[5] // +// problem: https://leetcode.com/problems/range-sum-query-mutable/ +// discuss: https://leetcode.com/problems/range-sum-query-mutable/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here struct NumArray { diff --git a/src/solution/s0309_best_time_to_buy_and_sell_stock_with_cooldown.rs b/src/solution/s0309_best_time_to_buy_and_sell_stock_with_cooldown.rs index 0f3f2765..6f3e911d 100644 --- a/src/solution/s0309_best_time_to_buy_and_sell_stock_with_cooldown.rs +++ b/src/solution/s0309_best_time_to_buy_and_sell_stock_with_cooldown.rs @@ -20,6 +20,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/ +// discuss: https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here /* diff --git a/src/solution/s0310_minimum_height_trees.rs b/src/solution/s0310_minimum_height_trees.rs index ab1337e2..4141273c 100644 --- a/src/solution/s0310_minimum_height_trees.rs +++ b/src/solution/s0310_minimum_height_trees.rs @@ -47,6 +47,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/minimum-height-trees/ +// discuss: https://leetcode.com/problems/minimum-height-trees/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::mem; diff --git a/src/solution/s0312_burst_balloons.rs b/src/solution/s0312_burst_balloons.rs index 689db341..f8833b5e 100644 --- a/src/solution/s0312_burst_balloons.rs +++ b/src/solution/s0312_burst_balloons.rs @@ -23,6 +23,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/burst-balloons/ +// discuss: https://leetcode.com/problems/burst-balloons/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here /* diff --git a/src/solution/s0313_super_ugly_number.rs b/src/solution/s0313_super_ugly_number.rs index 78c54fa8..bf99bcc8 100644 --- a/src/solution/s0313_super_ugly_number.rs +++ b/src/solution/s0313_super_ugly_number.rs @@ -25,6 +25,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/super-ugly-number/ +// discuss: https://leetcode.com/problems/super-ugly-number/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::cmp::Ordering; diff --git a/src/solution/s0509_fibonacci_number.rs b/src/solution/s0509_fibonacci_number.rs index b4a5d918..47a9b420 100644 --- a/src/solution/s0509_fibonacci_number.rs +++ b/src/solution/s0509_fibonacci_number.rs @@ -45,6 +45,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/fibonacci-number/ +// discuss: https://leetcode.com/problems/fibonacci-number/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s0704_binary_search.rs b/src/solution/s0704_binary_search.rs index c75364ed..26ed0c8d 100644 --- a/src/solution/s0704_binary_search.rs +++ b/src/solution/s0704_binary_search.rs @@ -34,6 +34,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/binary-search/ +// discuss: https://leetcode.com/problems/binary-search/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::cmp::Ordering; diff --git a/src/solution/s0969_pancake_sorting.rs b/src/solution/s0969_pancake_sorting.rs index 6a32ea04..541ae423 100644 --- a/src/solution/s0969_pancake_sorting.rs +++ b/src/solution/s0969_pancake_sorting.rs @@ -44,6 +44,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/pancake-sorting/ +// discuss: https://leetcode.com/problems/pancake-sorting/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s1018_binary_prefix_divisible_by_5.rs b/src/solution/s1018_binary_prefix_divisible_by_5.rs index ff05f8c6..b2bb1839 100644 --- a/src/solution/s1018_binary_prefix_divisible_by_5.rs +++ b/src/solution/s1018_binary_prefix_divisible_by_5.rs @@ -47,6 +47,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/binary-prefix-divisible-by-5/ +// discuss: https://leetcode.com/problems/binary-prefix-divisible-by-5/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here impl Solution { diff --git a/src/solution/s1046_last_stone_weight.rs b/src/solution/s1046_last_stone_weight.rs index cf0c81ac..871b4eb4 100644 --- a/src/solution/s1046_last_stone_weight.rs +++ b/src/solution/s1046_last_stone_weight.rs @@ -36,6 +36,9 @@ */ pub struct Solution {} +// problem: https://leetcode.com/problems/last-stone-weight/ +// discuss: https://leetcode.com/problems/last-stone-weight/discuss/?currentPage=1&orderBy=most_votes&query= + // submission codes start here use std::collections::BinaryHeap;