文件名称：gasstationleetcode-LeetCode:Leet和其他OJ问题
文件大小：75KB
文件格式：ZIP
更新时间：2024-07-19 21:27:36
系统开源
加油站 leetcode 力码 该文件夹不仅包含算法和数据库的leetcode问题，还包含其他公开评委的其他经典算法。 DP LINT_longest_com_subseq.cpp： Given two strings, find the longest common subsequence. LCS is defined as https://en.wikipedia.org/wiki/Longest_common_subsequence_problem. OTHER_Min_Imbalance.cpp： Given an input of array a and a partition k, we split a[n] into k+1 subarray. Also, let an Imbalance of Array defined as the largest distance from the sum of any subarray to the average of subarray (sum(a[n])/(k+1)). Output: a number of the Im
【文件预览】：
LeetCode-master
----other_decode_morse.py(3KB)
----lint_backpack.cpp(1KB)
----other_valid_ip_checker.py(1KB)
----lint_fast_power.py(559B)
----lint_minPathSum.py(714B)
----dynamic_max_subarray.cpp(732B)
----lint_max_prod_subarray.py(940B)
----sc_MixColors.py(2KB)
----lint_2_sum.cpp(1KB)
----lint_cont_sub_sum.py(1019B)
----other_omni_calculator.py(2KB)
----lint_word_search.py(1KB)
----algorithms()
--------dijkstra.py(1KB)
--------max_priority_queue.py(1KB)
--------stack.py(991B)
--------chapter6()
--------expected_linear_selection.py(1018B)
--------binary_heap.py(1KB)
--------max_heap.py(2KB)
--------bellman_ford.py(1KB)
--------chapter4()
--------find_max_subarray.py(2KB)
----other_min_imbalance.cpp(1KB)
----other_palindrome_int.py(704B)
----lint_letter_combinations_phone.py(838B)
----lint_pow_x_n.py(600B)
----lint_jump_game.py(777B)
----lint_backpackII.py(778B)
----lint_create_max_num.py(807B)
----lint_longest_common_substring.py(823B)
----sc_maze.py(3KB)
----lint_find_peak.py(668B)
----lint_coins_in_line.cpp(2KB)
----lint_combinations.py(699B)
----lint_aplusb.cpp(1KB)
----leet_alien_dic.py(2KB)
----lint_median.py(567B)
----lint_add_search_word.py(1KB)
----lint_sort_colors.py(586B)
----lint_unique_path.py(530B)
----lint_word_ladder_ii.py(4KB)
----leet_word_count.sh(107B)
----lint_largest_number.py(611B)
----other_find_missing.py(407B)
----sc_lowestCommonAncester.py(2KB)
----lint_balanced_binary_tree.py(904B)
----lint_longest_com_subseq.cpp(1KB)
----lint_3sum.py(952B)
----lint_partitionArray.py(690B)
----lint_kth_largest_element.py(959B)
----lint_sort_colors_ii.py(1KB)
----lint_permutations_ii.py(824B)
----lint_reverse_polish_notation.py(1KB)
----.Rhistory(0B)
----lint_binary_tree_max_path_sum.py(966B)
----imc_pawn_length.py(611B)
----lint_gas_station.py(749B)
----other_bigint.py(777B)
----lint_edit_distance.cpp(2KB)
----lint_numTree.py(439B)
----lint_palindrome_partition.py(896B)
----other_maze_dfs.py(2KB)
----sc_binary_search_sorted_array.py(984B)
----README.md(8KB)
----lint_palindrome_linked_list.py(1KB)
----other_matched_and_unmatched.py(783B)
----leet_stock_sell_buy_II.cpp(1KB)
----other_get_target_operator.py(2KB)
----lint_implement_trie.py(1KB)
----lint_distinct_subsequence.py(841B)
----input_word_ladder_ii.py(36KB)
----akuna_find_cheapest_transformation.py(134B)
----lint_update_bits.py(667B)
----lint_generate_parentheses.py(1019B)
----lint_binary_representation.py(1KB)
----other_auto_complete_num.py(1KB)
----lint_majority_number_ii.py(935B)
----lint_subsets.py(793B)
----lint_longest_incre_subseq.cpp(1KB)
----other_task_schedule.py(1KB)
----lint_ugly_num_ii.py(852B)
----lint_graph_valid_tree.py(2KB)
----.gitignore(66B)
----lint_house_robber.py(521B)
----lint_sort_subarray_sum_cloest.py(902B)
----lint_word_break.cpp(1KB)
----other_simple_bloomfilter.py(86B)
----lint_max_gap.py(812B)
----lint_sort_by_case.py(444B)
----lint_anagrams.py(710B)
----leet_single_number.cpp(935B)
----lint_MergeKSortedLists.py(1KB)