Functions — github.com/aylei/leetcode-rust

hub / github.com/aylei/leetcode-rust / functions

Functions608 in github.com/aylei/leetcode-rust

⨍ Functions 608◇ Types & classes 271

Methodmax_area

(height: Vec<i32>)

src/solution/s0011_container_with_most_water.rs:34

Methodmax_coins

(nums: Vec<i32>)

src/solution/s0312_burst_balloons.rs:48

Methodmax_depth

(root: Option<Rc<RefCell<TreeNode>>>)

src/solution/s0104_maximum_depth_of_binary_tree.rs:35

Methodmax_path_sum

(root: Option<Rc<RefCell<TreeNode>>>)

src/solution/s0124_binary_tree_maximum_path_sum.rs:60

Methodmax_points

(points: Vec<Point>)

src/solution/s0149_max_points_on_a_line.rs:83

Methodmax_product

(nums: Vec<i32>)

src/solution/s0152_maximum_product_subarray.rs:44

Methodmax_profit

(prices: Vec<i32>)

src/solution/s0122_best_time_to_buy_and_sell_stock_ii.rs:45

Methodmax_profit

(prices: Vec<i32>)

src/solution/s0309_best_time_to_buy_and_sell_stock_with_cooldown.rs:35

Methodmax_profit

(k: i32, prices: Vec<i32>)

src/solution/s0188_best_time_to_buy_and_sell_stock_iv.rs:72

Methodmax_profit

(prices: Vec<i32>)

src/solution/s0123_best_time_to_buy_and_sell_stock_iii.rs:75

Methodmax_profit

(prices: Vec<i32>)

src/solution/s0121_best_time_to_buy_and_sell_stock.rs:36

Methodmax_sliding_window

(nums: Vec<i32>, k: i32)

src/solution/s0239_sliding_window_maximum.rs:38

Methodmax_sub_array

(nums: Vec<i32>)

src/solution/s0053_maximum_subarray.rs:27

Methodmax_subrange

(coins: &Vec<i32>, start: usize, end: usize, memo: &mut Vec<Vec<i32>>)

src/solution/s0312_burst_balloons.rs:68

Methodmaximal_rectangle

(matrix: Vec<Vec<char>>)

src/solution/s0085_maximal_rectangle.rs:28

Methodmaximal_square

(matrix: Vec<Vec<char>>)

src/solution/s0221_maximal_square.rs:40

Methodmaximum_gap

(nums: Vec<i32>)

src/solution/s0164_maximum_gap.rs:45

Methodmerge

(intervals: Vec<Interval>)

src/solution/s0056_merge_intervals.rs:43

Methodmerge

( mut l1: Option<Box<ListNode>>, mut l2: Option<Box<ListNode>>, )

src/solution/s0148_sort_list.rs:70

Methodmerge

(nums1: &mut Vec<i32>, m: i32, nums2: &mut Vec<i32>, n: i32)

src/solution/s0088_merge_sorted_array.rs:32

Methodmerge_k_lists

(lists: Vec<Option<Box<ListNode>>>)

src/solution/s0023_merge_k_sorted_lists.rs:51

Methodmerge_sort

(mut head: Option<Box<ListNode>>, len: i32)

src/solution/s0148_sort_list.rs:54

Methodmerge_two_lists

( l1: Option<Box<ListNode>>, l2: Option<Box<ListNode>>, )

src/solution/s0021_merge_two_sorted_lists.rs:23

Methodmin

(i: i32, j: i32)

src/solution/s0011_container_with_most_water.rs:60

Methodmin_cut

(s: String)

src/solution/s0132_palindrome_partitioning_ii.rs:38

Methodmin_depth

(root: Option<Rc<RefCell<TreeNode>>>)

src/solution/s0111_minimum_depth_of_binary_tree.rs:36

Methodmin_distance

(word1: String, word2: String)

src/solution/s0072_edit_distance.rs:47

Methodmin_path_sum

(grid: Vec<Vec<i32>>)

src/solution/s0064_minimum_path_sum.rs:30

Methodmin_sub_array_len

(s: i32, nums: Vec<i32>)

src/solution/s0209_minimum_size_subarray_sum.rs:26

Methodmin_window

(s: String, t: String)

src/solution/s0076_minimum_window_substring.rs:29

Methodminimum_total

(triangle: Vec<Vec<i32>>)

src/solution/s0120_triangle.rs:32

Methodmissing_number

(nums: Vec<i32>)

src/solution/s0268_missing_number.rs:31

Methodmove_zeroes

(nums: &mut Vec<i32>)

src/solution/s0283_move_zeroes.rs:27

Methodmultiply

(num1: String, num2: String)

src/solution/s0043_multiply_strings.rs:40

Methodmy_atoi

(input: String)

src/solution/s0008_string_to_integer_atoi.rs:70

Methodmy_pow

(x: f64, n: i32)

src/solution/s0050_powx_n.rs:44

Methodmy_sqrt

(x: i32)

src/solution/s0069_sqrtx.rs:38

Methodnew

(nums: Vec<i32>)

src/solution/s0307_range_sum_query_mutable.rs:54

Methodnew

initialize your data structure here. */

src/solution/s0295_find_median_from_data_stream.rs:78

Methodnew

(key: i32, val: i32)

src/solution/s0146_lru_cache.rs:57

Methodnew

(nums: Vec<i32>)

src/solution/s0303_range_sum_query_immutable.rs:39

Methodnew

Initialize your data structure here. */

src/solution/s0208_implement_trie_prefix_tree.rs:46

Methodnew

(start: i32, end: i32)

src/solution/s0056_merge_intervals.rs:38

Methodnew

(start: i32, end: i32)

src/solution/s0057_insert_interval.rs:39

Methodnew

Initialize your data structure here. */

src/solution/s0225_implement_stack_using_queues.rs:52

Methodnew

Assumes that there is no same point

src/solution/s0149_max_points_on_a_line.rs:68

Methodnew

(matrix: Vec<Vec<i32>>)

src/solution/s0304_range_sum_query_2d_immutable.rs:55

Methodnew

()

src/solution/s0211_add_and_search_word_data_structure_design.rs:48

Methodnew

initialize your data structure here. */

src/solution/s0155_min_stack.rs:60

Methodnew

(expect: i32, count: i32)

src/solution/s0030_substring_with_concatenation_of_all_words.rs:38

Methodnew

Initialize your data structure here. */

src/solution/s0232_implement_queue_using_stacks.rs:51

Methodnew

(root: Option<Rc<RefCell<TreeNode>>>)

src/solution/s0173_binary_search_tree_iterator.rs:62

src/util/linked_list.rs:9

Methodnext

( mut lists: Vec<Option<Box<ListNode>>>, heap: &mut BinaryHeap<Node>, )

src/solution/s0023_merge_k_sorted_lists.rs:60

Methodnext

(n: i32)

src/solution/s0202_happy_number.rs:46

Methodnext_permutation

(nums: &mut Vec<i32>)

src/solution/s0031_next_permutation.rs:25

Methodnext_unique

(nums: &[i32], idx: usize, forward: bool)

src/solution/s0015_3sum.rs:78

Methodnth_super_ugly_number

(n: i32, primes: Vec<i32>)

src/solution/s0313_super_ugly_number.rs:55

Methodnth_ugly_number

(n: i32)

src/solution/s0264_ugly_number_ii.rs:30

Methodnum_decodings

(s: String)

src/solution/s0091_decode_ways.rs:39

Methodnum_islands

(grid: Vec<Vec<char>>)

src/solution/s0200_number_of_islands.rs:39

Methodnum_squares

(n: i32)

src/solution/s0279_perfect_squares.rs:30

Methodnum_trees

(n: i32)

src/solution/s0096_unique_binary_search_trees.rs:30

Methodnumber_to_words

(num: i32)

src/solution/s0273_integer_to_english_words.rs:48

Methodpair

(open: char, close: char)

src/solution/s0020_valid_parentheses.rs:77

Methodpancake_oper

(a: &mut Vec<i32>, index: usize, res: &mut Vec<i32>)

src/solution/s0969_pancake_sorting.rs:87

Methodpancake_sort

(a: Vec<i32>)

src/solution/s0969_pancake_sorting.rs:53

Methodpartial_cmp

(&self, other: &Self)

src/solution/s0023_merge_k_sorted_lists.rs:45

Methodpartial_cmp

(&self, other: &Invert)

src/solution/s0295_find_median_from_data_stream.rs:61

Methodpartial_cmp

(&self, other: &Invert)

src/solution/s0313_super_ugly_number.rs:49

Methodpartial_factorial

(start: u64, mut end: u64)

src/solution/s0062_unique_paths.rs:52

Methodpartition

(s: String)

src/solution/s0131_palindrome_partitioning.rs:43

Methodpartition

(head: Option<Box<ListNode>>, x: i32)

src/solution/s0086_partition_list.rs:25

Methodpath_sum

(root: Option<Rc<RefCell<TreeNode>>>, sum: i32)

src/solution/s0113_path_sum_ii.rs:44

Methodpermute

(mut nums: Vec<i32>)

src/solution/s0047_permutations_ii.rs:33

Methodpermute

(nums: Vec<i32>)

src/solution/s0046_permutations.rs:30

Methodpermute_unique

(nums: Vec<i32>)

src/solution/s0047_permutations_ii.rs:27

Methodplus_one

(digits: Vec<i32>)

src/solution/s0066_plus_one.rs:35

Methodpop

Removes the element on top of the stack and returns that element. */

src/solution/s0225_implement_stack_using_queues.rs:75

Methodpostorder

(root: Option<&Rc<RefCell<TreeNode>>>, max: &mut i32)

src/solution/s0124_binary_tree_maximum_path_sum.rs:66

Methodpostorder_traversal

(root: Option<Rc<RefCell<TreeNode>>>)

src/solution/s0145_binary_tree_postorder_traversal.rs:33

Methodprefixes_div_by5

(a: Vec<i32>)

src/solution/s1018_binary_prefix_divisible_by_5.rs:56

Methodpreorder_traversal

(root: Option<Rc<RefCell<TreeNode>>>)

src/solution/s0144_binary_tree_preorder_traversal.rs:33

Methodpreorder_traverse

( root: Option<&Rc<RefCell<TreeNode>>>, formers: &mut Vec<(i32, i32)>, )

src/solution/s0098_validate_binary_search_tree.rs:56

Methodproduct_except_self

(nums: Vec<i32>)

src/solution/s0238_product_of_array_except_self.rs:33

Methodquestion_query

(title_slug: &str)

src/fetcher.rs:134

Methodrange_bitwise_and

(m: i32, n: i32)

src/solution/s0201_bitwise_and_of_numbers_range.rs:28

Methodrecord

(vec: &mut Vec<String>, start: i32, end: i32)

src/solution/s0228_summary_ranges.rs:52

Methodrecover_helper

( root: Option<&Rc<RefCell<TreeNode>>>, )

src/solution/s0099_recover_binary_search_tree.rs:94

Methodrecover_tree

(root: &mut Option<Rc<RefCell<TreeNode>>>)

src/solution/s0099_recover_binary_search_tree.rs:90

Methodremove_duplicates

(nums: &mut Vec<i32>)

src/solution/s0026_remove_duplicates_from_sorted_array.rs:54

Methodremove_duplicates

(nums: &mut Vec<i32>)

src/solution/s0080_remove_duplicates_from_sorted_array_ii.rs:55

Methodremove_element

(nums: &mut Vec<i32>, val: i32)

src/solution/s0027_remove_element.rs:58

Methodremove_elements

(mut head: Option<Box<ListNode>>, val: i32)

src/solution/s0203_remove_linked_list_elements.rs:23

Methodremove_invalid_parentheses

(s: String)

src/solution/s0301_remove_invalid_parentheses.rs:40

Methodremove_nth_from_end

(head: Option<Box<ListNode>>, n: i32)

src/solution/s0019_remove_nth_node_from_end_of_list.rs:34

Methodreorder_list

(head: &mut Option<Box<ListNode>>)

src/solution/s0143_reorder_list.rs:37

Methodrestore_ip_addresses

(s: String)

src/solution/s0093_restore_ip_addresses.rs:22

← previous next →201–300 of 608, ranked by callers