leetcode-go

module

v0.0.0-...-161f347 Latest Latest Go to latest Published: Mar 24, 2023 License: GPL-3.0

Details

Valid go.mod file
Redistributable license
Tagged version
Stable version
Learn more about best practices

Repository

github.com/CNife/leetcode-go

Links

Open Source Insights

README ¶

LeetCode 题解 - Golang 版本

我的 LeetCode 主页。

Directories ¶

Path	Synopsis
code
accounts_merge
add_binary
add_one_row_to_tree
add_to_array_form_of_integer
array_partition_1
assign_cookies
asteroid_collision
average_of_sliding_window
basic_calculator
basic_calculator_2
beautiful_arrangement_ii
best_sightseeing_pair
best_time_to_buy_and_sell_stock_2
best_time_to_buy_and_sell_stock_3
best_time_to_buy_and_sell_stock_4
best_time_to_buy_and_sell_stock_with_transaction_fee
binary_prefix_divisible_by_5
binary_search_tree_iterator
binary_tree_maximum_path_sum
binary_tree_preorder_traversal
binary_tree_pruning
binary_tree_zigzag_level_order_traversal
bricks_falling_when_hit
can_place_flowers
can_you_eat_your_favorite_candy_on_your_favorite_day
candy
capacity_to_ship_packages_within_d_days
cells_with_odd_values_in_a_matrix
check_if_a_word_occurs_as_a_prefix_of_any_word_in_a_sentence
check_if_it_is_a_straight_line
coin_change_2
combination_sum_4
complete_binary_tree_inserter
contains_duplicate
contains_duplicate_3
contiguous_array
count_complete_tree_nodes
count_of_range_sum
count_primes
counting_bits
couples_holding_hands
crawler_log_folder
create_maximum_number
decode_ways
deepest_leaves_sum
degree_of_an_array
design_an_ordered_stream
design_circular_deque
design_hashmap
design_hashset
design_parking_system
design_skiplist
different_ways_to_add_parentheses
distance_between_bus_stops
distinct_subsequences
dota2_senate
dungeon_game
evaluate_division
evaluate_reverse_polish_notation
fair_candy_swap
fibonacci_number
final_prices_with_a_special_discount_in_a_shop
find_all_continuous_sequences
find_all_numbers_disappeared_in_an_array
find_common_characters
find_critical_and_pseudo_critical_edges_in_minimum_spanning_tree
find_duplicate_subtrees
find_first_and_last_position_of_element_in_sorted_array
find_k_closest_elements
find_minimum_in_rotated_sorted_array
find_minimum_in_rotated_sorted_array_2
find_pivot_index
find_the_difference
first_missing_positive
first_unique_character_in_a_string
flatten_binary_tree_to_linked_list
flatten_nested_list_iterator
flipping_an_image
four_sum_2
freedom_trail
frog_jump
gas_station
get_equal_substrings_within_budget
group_anagrams
grumpy_bookstore_owner
hamming_distance
house_robber_2
how_many_numbers_are_smaller_than_the_current_number
implement_magic_dictionary
implement_queue_using_stacks
implement_strstr
implement_trie_prefix_tree
increasing_decreasing_string
increasing_order_search_tree
insert_delete_getrandom_o1_duplicates_allowed
insert_interval
insertion_sort_list
interleaving_string
intersection_of_two_arrays
intersection_of_two_arrays_2
intersection_of_two_linked_lists
is_graph_bipartite
island_perimeter
isomorphic_strings
jump_game_2
k_closest_points_to_origin
kth_largest_element_in_a_stream
largest_divisible_subset
largest_number
largest_perimeter_triangle
last_stone_weight
lemonade_change
length_of_longest_fibonacci_subsequence
logical_or_of_two_binary_grids_represented_as_quad_trees
long_pressed_name
longest_common_prefix
longest_continuous_increasing_subsequence
longest_continuous_subarray_with_absolute_diff_less_than_or_equal_to_limit
longest_increasing_path_in_a_matrix
longest_mountain_in_array
longest_repeating_character_replacement
longest_substring_with_at_least_k_repeating_characters
longest_turbulent_subarray
longest_univalue_path
majority_element_2
matrix_cells_in_distance_order
max_consecutive_ones
max_consecutive_ones_3
max_sum_of_rectangle_no_larger_than_k
maximal_rectangle
maximal_square
maximum_average_subarray_1
maximum_binary_tree
maximum_binary_tree_ii
maximum_depth_of_binary_tree
maximum_equal_frequency
maximum_gap
maximum_length_of_pair_chain
maximum_points_you_can_obtain_from_cards
maximum_product_of_three_numbers
min_cost_climbing_stairs
min_cost_to_connect_all_points
min_in_spiral_array
minimum_cost_to_move_chips_to_the_same_position
minimum_distance_between_bst_nodes
minimum_number_of_arrows_to_burst_balloons
minimum_number_of_k_consecutive_bit_flips
minimum_path_sum
minimum_window_substring
monotonic_array
most_common_word
most_stones_removed_with_same_row_or_column
my_calendar_1
my_calendar_ii
n_queens_2
next_greater_element_2
next_permutation
non_decreasing_array
non_overlapping_intervals
number_of_1_bits
number_of_equivalent_domino_pairs
number_of_operations_to_make_network_connected
number_of_provinces
number_of_students_doing_homework_at_a_given_time
number_of_valid_words_for_each_puzzle
odd_even_linked_list
offer_rebuild_sequence
palindrome_linked_list
palindrome_partitioning
palindrome_partitioning_2
parse_lisp_expression
partition_labels
partition_list
pascals_triangle
pascals_triangle_2
patching_array
path_with_minimum_effort
pattern_132
permutation_in_string
populating_next_right_pointers_in_each_node
positions_of_large_groups
power_of_four
power_of_two
prefix_and_suffix_search
print_binary_tree
queue_reconstruction_by_height
rabbits_in_forest
range_sum_of_bst
range_sum_query_2d_immutable
range_sum_query_immutable
rearrange_spaces_between_words
recover_a_tree_from_preorder_traversal
rectangle_area
redundant_connection
regions_cut_by_slashes
regular_expression_matching
relative_sort_array
remove_all_adjacent_duplicates_in_string
remove_duplicate_letters
remove_duplicates_from_sorted_array
remove_duplicates_from_sorted_array_2
remove_duplicates_from_sorted_list
remove_duplicates_from_sorted_list_2
remove_element
remove_k_digits
remove_linked_list_elements
remove_max_number_of_edges_to_keep_graph_fully_traversable
remove_nth_node_from_end_of_list
reorder_list
reorganize_string
repeated_dna_sequences
replace_words
reshape_the_matrix
reverse_bits
reverse_linked_list_2
reverse_pairs
rotate_array
rotate_image
rotate_list
rotting_oranges
russian_doll_envelopes
score_after_flipping_matrix
scramble_string
search_a_2d_matrix
search_a_2d_matrix_2
search_in_rotated_sorted_array_2
search_insert_position
serialize_and_deserialize_binary_tree
set_matrix_zeroes
short_encoding_of_words
similar_string_groups
single_number_2
single_number_3
sliding_window_maximum
sliding_window_median
smallest_string_with_swaps
sort_array_by_parity_2
sort_integers_by_the_number_of_1_bits
sort_items_by_groups_respecting_dependencies
sort_list
special_positions_in_a_binary_matrix
spiral_matrix
spiral_matrix_2
split_array_into_consecutive_subsequences
split_array_into_fibonacci_sequence
stitch_videos
stream_of_characters
string_matching_in_an_array
subarrays_with_k_different_integers
subsets_2
substring_with_concatenation_of_all_words
sum_of_square_numbers
sum_root_to_leaf_numbers
summary_ranges
surface_area_of_3d_shapes
swap_nodes_in_pairs
swim_in_rising_water
target_sum
task_scheduler
text_justification
toeplitz_matrix
top_k_frequent_words
transform_to_chessboard
transpose_matrix
triangle
ugly_number_2
unique_binary_search_trees
unique_binary_search_trees_2
unique_number_of_occurrences
unique_paths
valid_anagram
valid_mountain_array
valid_number
valid_palindrome
validate_stack_sequences
verify_preorder_serialization_of_a_binary_tree
volume_of_histogram_lcci
wiggle_subsequence
word_break_2
word_ladder
word_pattern
types
util
clone
sort

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL