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

↓ 147 callersMethodpush

(&mut self, x: i32)

src/solution/s0155_min_stack.rs:67

↓ 25 callersMethodpop

(&mut self)

src/solution/s0155_min_stack.rs:75

↓ 16 callersMethodcontains

(&self, p: &Point)

src/solution/s0149_max_points_on_a_line.rs:75

↓ 14 callersMethodinsert

(intervals: Vec<Interval>, new_interval: Interval)

src/solution/s0057_insert_interval.rs:44

↓ 14 callersMethodreverse

(x: i32)

src/solution/s0007_reverse_integer.rs:38

↓ 10 callersMethodnext

@return the next smallest number */

src/solution/s0173_binary_search_tree_iterator.rs:73

↓ 9 callersMethodpeek

Get the front element. */

src/solution/s0232_implement_queue_using_stacks.rs:75

↓ 8 callersMethodget

(&mut self, key: i32)

src/solution/s0146_lru_cache.rs:94

↓ 5 callersMethodcmp

(&self, other: &Invert)

src/solution/s0313_super_ugly_number.rs:43

↓ 5 callersMethodfind

(&self, word: String)

src/solution/s0208_implement_trie_prefix_tree.rs:70

↓ 4 callersMethodpush

push() pushs an entry to the tail of linked-list

src/solution/s0146_lru_cache.rs:155

↓ 4 callersMethodput

(&mut self, key: i32, value: i32)

src/solution/s0146_lru_cache.rs:110

↓ 3 callersMethodadd_num

(&mut self, num: i32)

src/solution/s0295_find_median_from_data_stream.rs:86

↓ 3 callersMethoddetach

detach() remove an entry from the linked-list

src/solution/s0146_lru_cache.rs:167

↓ 3 callersMethodis_match

(s: String, p: String)

src/solution/s0044_wildcard_matching.rs:78

↓ 3 callersFunctionpancake_oper

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

src/solution/s0969_pancake_sorting.rs:139

↓ 3 callersMethodupdate

(&mut self, i: i32, val: i32)

src/solution/s0307_range_sum_query_mutable.rs:63

↓ 2 callersFunctiondeal_problem

(problem: &Problem, code: &CodeDefinition, write_mod_file: bool)

src/main.rs:320

↓ 2 callersMethoddec

(&mut self)

src/solution/s0030_substring_with_concatenation_of_all_words.rs:47

↓ 2 callersFunctionget_problem

(frontend_question_id: u32)

src/fetcher.rs:21

↓ 2 callersFunctionget_problems

()

src/fetcher.rs:99

↓ 2 callersMethodinsert

insert a word into the trie. */

src/solution/s0208_implement_trie_prefix_tree.rs:51

↓ 2 callersMethodpop

Removes the element from in front of queue and returns that element. */

src/solution/s0232_implement_queue_using_stacks.rs:70

↓ 2 callersMethodpush

Push element x onto stack. */

src/solution/s0225_implement_stack_using_queues.rs:60

↓ 2 callersMethodpush

Push element x to the back of queue. */

src/solution/s0232_implement_queue_using_stacks.rs:59

↓ 2 callersMethodreset

(&mut self)

src/solution/s0030_substring_with_concatenation_of_all_words.rs:53

↓ 1 callersFunctionapply_pancake_sort_res

(shuffled_vecter: &mut Vec<i32>, oper: Vec<i32>)

src/solution/s0969_pancake_sorting.rs:133

↓ 1 callersFunctionbuild_desc

(content: &str)

src/main.rs:244

↓ 1 callersMethodcmp

(&self, other: &Self)

src/solution/s0023_merge_k_sorted_lists.rs:34

↓ 1 callersMethodcmp

(&self, other: &Invert)

src/solution/s0295_find_median_from_data_stream.rs:55

↓ 1 callersFunctiondeal_solving

(id: &u32)

src/main.rs:279

↓ 1 callersMethodexhausted

(&self)

src/solution/s0030_substring_with_concatenation_of_all_words.rs:50

↓ 1 callersFunctiongenerate_random_id

(except_ids: &[u32])

src/main.rs:150

↓ 1 callersFunctionget_initialized_ids

()

src/main.rs:167

↓ 1 callersFunctionget_problem_async

(problem_stat: StatWithStatus)

src/fetcher.rs:57

↓ 1 callersMethodinc

(&mut self)

src/solution/s0030_substring_with_concatenation_of_all_words.rs:44

↓ 1 callersMethodinc_expect

(&mut self)

src/solution/s0030_substring_with_concatenation_of_all_words.rs:41

↓ 1 callersFunctioninsert_return_in_code

(return_type: &str, code: &str)

src/main.rs:202

↓ 1 callersFunctionmake_shuffled_vector

(a: &Vec<i32>)

src/solution/s0969_pancake_sorting.rs:126

↓ 1 callersFunctionmake_sorted_vector

(i: i32)

src/solution/s0969_pancake_sorting.rs:122

↓ 1 callersFunctionparse_discuss_link

(problem: &Problem)

src/main.rs:195

↓ 1 callersFunctionparse_extra_use

(code: &str)

src/main.rs:176

↓ 1 callersFunctionparse_problem_link

(problem: &Problem)

src/main.rs:191

↓ 1 callersMethodpop

pop() remove the entry from map, detach the entry from head of linked-list, and return it

src/solution/s0146_lru_cache.rs:141

Methodadd_binary

(a: String, b: String)

src/solution/s0067_add_binary.rs:30

Methodadd_digits

(num: i32)

src/solution/s0258_add_digits.rs:26

Methodadd_operators

(num: String, target: i32)

src/solution/s0282_expression_add_operators.rs:48

Methodadd_two_numbers

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

src/solution/s0002_add_two_numbers.rs:28

Methodbacktrack

( seq: &Vec<i32>, target: i32, mut curr: Vec<i32>, result: &mut Vec<Vec<i3

src/solution/s0040_combination_sum_ii.rs:57

Methodbacktrack

(start: i32, end: i32, k: i32, curr: Vec<i32>, result: &mut Vec<Vec<i32>>)

src/solution/s0077_combinations.rs:36

Methodbacktrack

(start: usize, mut curr: Vec<i32>, nums: &Vec<i32>, result: &mut Vec<Vec<i32>>)

src/solution/s0078_subsets.rs:39

Methodbacktrack

( seq: &Vec<i32>, target: i32, mut curr: Vec<i32>, result: &mut Vec<Vec<i3

src/solution/s0039_combination_sum.rs:56

Methodbacktrack

( start: usize, mut curr: Vec<i32>, nums: &Vec<(i32, i32)>, result: &mut Vec<V

src/solution/s0090_subsets_ii.rs:53

Methodbalanced_helper

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

src/solution/s0110_balanced_binary_tree.rs:57

Methodbinary_tree_paths

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

src/solution/s0257_binary_tree_paths.rs:53

Methodbst_helper

(nums: &[i32])

src/solution/s0108_convert_sorted_array_to_binary_search_tree.rs:38

Methodbst_helper

(nums: &[i32])

src/solution/s0109_convert_sorted_list_to_binary_search_tree.rs:45

Methodbuild

(node: usize, start: usize, end: usize, tree: &mut Vec<i32>, nums: &Vec<i32>)

src/solution/s0307_range_sum_query_mutable.rs:71

Methodbuild_tree

(inorder: Vec<i32>, postorder: Vec<i32>)

src/solution/s0106_construct_binary_tree_from_inorder_and_postorder_traversal.rs:37

Methodbuild_tree

(preorder: Vec<i32>, inorder: Vec<i32>)

src/solution/s0105_construct_binary_tree_from_preorder_and_inorder_traversal.rs:36

Methodbuild_tree_helper

(postorder: &[i32], inorder: &[i32])

src/solution/s0106_construct_binary_tree_from_inorder_and_postorder_traversal.rs:41

Methodbuild_tree_helper

(preorder: &[i32], inorder: &[i32])

src/solution/s0105_construct_binary_tree_from_preorder_and_inorder_traversal.rs:40

Methodcalculate

(s: String)

src/solution/s0224_basic_calculator.rs:51

Methodcalculate

(s: String)

src/solution/s0227_basic_calculator_ii.rs:44

Methodcalculate_minimum_hp

(dungeon: Vec<Vec<i32>>)

src/solution/s0174_dungeon_game.rs:79

Methodcan_complete_circuit

(gas: Vec<i32>, cost: Vec<i32>)

src/solution/s0134_gas_station.rs:64

Methodcan_finish

(num_courses: i32, prerequisites: Vec<Vec<i32>>)

src/solution/s0207_course_schedule.rs:46

Methodcan_jump

(nums: Vec<i32>)

src/solution/s0055_jump_game.rs:36

Methodcan_win_nim

(n: i32)

src/solution/s0292_nim_game.rs:25

Methodcandy

(ratings: Vec<i32>)

src/solution/s0135_candy.rs:41

Methodclimb_stairs

(n: i32)

src/solution/s0070_climbing_stairs.rs:41

Methodcode

(s: String)

src/solution/s0205_isomorphic_strings.rs:48

Methodcollision

(board: &Vec<Vec<char>>, len: usize, x: usize, y: usize)

src/solution/s0051_n_queens.rs:66

Methodcollision

(board: &Vec<Vec<char>>, len: usize, x: usize, y: usize)

src/solution/s0052_n_queens_ii.rs:60

Methodcombination_sum

(candidates: Vec<i32>, target: i32)

src/solution/s0039_combination_sum.rs:47

Methodcombination_sum2

(candidates: Vec<i32>, target: i32)

src/solution/s0040_combination_sum_ii.rs:48

Methodcombination_sum3

(k: i32, n: i32)

src/solution/s0216_combination_sum_iii.rs:37

Methodcombine

(n: i32, k: i32)

src/solution/s0077_combinations.rs:30

Methodcompact

(words: Vec<String>, max_width: usize, row_len: usize)

src/solution/s0068_text_justification.rs:103

Methodcompact_last

(words: Vec<String>, max_width: usize)

src/solution/s0068_text_justification.rs:121

Methodcompare_version

(version1: String, version2: String)

src/solution/s0165_compare_version_numbers.rs:57

Methodcompute_area

(a: i32, b: i32, c: i32, d: i32, e: i32, f: i32, g: i32, h: i32)

src/solution/s0223_rectangle_area.rs:30

Methodconnect

(s1: &str, s2: &str)

src/solution/s0127_word_ladder.rs:88

Methodconnect

(s1: &str, s2: &str)

src/solution/s0126_word_ladder_ii.rs:145

Methodcontains_duplicate

(nums: Vec<i32>)

src/solution/s0217_contains_duplicate.rs:35

Methodcontains_nearby_almost_duplicate

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

src/solution/s0220_contains_duplicate_iii.rs:42

Methodcontains_nearby_duplicate

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

src/solution/s0219_contains_duplicate_ii.rs:43

Methodconvert

(s: String, num_rows: i32)

src/solution/s0006_zigzag_conversion.rs:47

Methodconvert_to_title

(n: i32)

src/solution/s0168_excel_sheet_column_title.rs:48

Methodcount_and_say

(n: i32)

src/solution/s0038_count_and_say.rs:47

Methodcount_char

(s: String)

src/solution/s0076_minimum_window_substring.rs:39

Methodcount_digit_one

(n: i32)

src/solution/s0233_number_of_digit_one.rs:23

Methodcount_nodes

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

src/solution/s0222_count_complete_tree_nodes.rs:35

Methodcount_primes

(n: i32)

src/solution/s0204_count_primes.rs:23

Methoddelete_duplicates

(head: Option<Box<ListNode>>)

src/solution/s0082_remove_duplicates_from_sorted_list_ii.rs:46

Methoddelete_duplicates

(head: Option<Box<ListNode>>)

src/solution/s0083_remove_duplicates_from_sorted_list.rs:46

Methoddepth_helper

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

src/solution/s0104_maximum_depth_of_binary_tree.rs:41

Methoddfs

( x: usize, y: usize, seq: &[char], board: &Vec<Vec<char>>, mut visite

src/solution/s0079_word_search.rs:59

Methoddfs

( s1: &Vec<char>, s2: &Vec<char>, s3: &Vec<char>, i: usize, j: usize,

src/solution/s0097_interleaving_string.rs:56

Methoddfs

(n: i32, left: i32, right: i32, result: &mut Vec<String>, mut path: String)

src/solution/s0022_generate_parentheses.rs:39

next →1–100 of 608, ranked by callers