MCPcopy Create free account

hub / github.com/Ainevsia/Leetcode-Rust / functions

Functions1,163 in github.com/Ainevsia/Leetcode-Rust

MethodgetNext
28. Implement strStr()/Solution.cpp:53
Methodget_all_elements
(root1: Option<Rc<RefCell<TreeNode>>>, root2: Option<Rc<RefCell<TreeNode>>>)
cn/1305. 两棵二叉搜索树中的所有元素/src/main.rs:39
Methodget_char
(c: char)
17. Letter Combinations of a Phone Number/src/main.rs:57
Methodget_min
(&self)
155. Min Stack/src/main.rs:43
Methodget_number_of_backlog_orders
(orders: Vec<Vec<i32>>)
1801. Average Time of Process per Machine/src/lib.rs:4
Methodget_number_of_backlog_orders_2
(orders: Vec<Vec<i32>>)
1801. Average Time of Process per Machine/src/lib.rs:57
Methodget_permutation
(n: i32, k: i32)
60. Permutation Sequence/src/main.rs:8
Methodgetchildn
get the number of childs of the node id */
Weekly Contest 179/p4/Solution.cpp:20
Methodgo
Weekly Contest 181/1391. Check if There is a Valid Path in a Grid/Solution.cpp:19
Methodgood_reverse
(x: i32)
7. Reverse Integer/src/main.rs:32
Methodgroup_anagrams
an ugly O(n^2) algo
49. Group Anagrams/src/main.rs:25
Methodgroup_anagrams_old
(strs: Vec<String>)
49. Group Anagrams/src/main.rs:8
Functionhard
()
855. Count Unique Characters of All Substrings of a Given String/src/lib.rs:166
MethodhasValidPath
dfs
Weekly Contest 181/1391. Check if There is a Valid Path in a Grid/Solution.cpp:54
Methodhas_valid_path
(grid: Vec<Vec<i32>>)
Weekly Contest 181/1391. Check if There is a Valid Path in a Grid/src/main.rs:8
Methodhelp
98. Validate Binary Search Tree/Solution.cpp:21
Functionhund
()
2. Add Two Numbers/src/main.rs:166
Methodincrement
Weekly Contest 180/1381. Design a Stack With Increment Operation/Solution.cpp:34
Functioninit
()
2. Add Two Numbers/src/main.rs:161
MethodinorderTraversal
Morris Traversal, do not need extra space https://stackoverflow.com/questions/5502916/explain-morris-inorder-tree-traversal-without-using-stacks-or-re
94. Binary Tree Inorder Traversal/Solution.cpp:25
Functioninorder_traversal
(root: Option<Rc<RefCell<TreeNode>>>)
1669. Minimum Cost to Cut a Stick/src/main.rs:504
Methodinsert_inplace
(mut intervals: Vec<Vec<i32>>, mut new_interval: Vec<i32>)
Merge Intervals/57. Insert Interval/src/main.rs:8
Methodint_to_roman
(num: i32)
12. Integer to Roman/src/main.rs:9
MethodintegerBreak
2 <= n <= 58
343. Integer Break/Solution.cpp:17
Methodinterval_intersection
(a: Vec<Vec<i32>>, b: Vec<Vec<i32>>)
Merge Intervals/986. Interval List Intersections/src/main.rs:14
Methodinto1
(grid: &mut Vec<Vec<i32>>, i: usize, j: usize)
1254. Number of Closed Islands/src/main.rs:32
Functioninto_iter
()
1669. Minimum Cost to Cut a Stick/src/list.rs:162
Methodinto_vec
Weekly Contest 180/1382. Balance a Binary Search Tree/Solution.cpp:23
Methodinto_water
(grid: &mut Vec<Vec<char>>, i: usize, j: usize)
200. Number of Islands/src/main.rs:24
MethodisHappy
two pointer
Two Pointers/202. Happy Number/Solution.cpp:28
MethodisInterleave
97. Interleaving String/Solution.cpp:14
MethodisSubPath
Weekly Contest 178/1367. Linked List in Binary Tree/Solution.cpp:23
MethodisSymmetric
101. Symmetric Tree/Solution.cpp:26
Methodis_anagram
(s: String, t: String)
704. 二分查找/src/main.rs:514
Methodis_happy
(mut n: i32)
704. 二分查找/src/main.rs:457
Methodis_happy
(n: i32)
Two Pointers/202. Happy Number/src/main.rs:11
Methodis_match
(s: String, p: String)
10. Regular Expression Matching/src/main.rs:9
Methodis_match_g
(s: String, p: String)
44. Wildcard Matching/src/main.rs:32
Methodis_match_n
(s: String, p: String)
44. Wildcard Matching/src/main.rs:8
Methodis_number
(s: String)
65. Valid Number/src/main.rs:95
Methodis_number_
(s: String)
65. Valid Number/src/main.rs:11
Methodis_number_dfa
(s: String)
65. Valid Number/src/main.rs:50
Methodis_number_re
(s: String)
65. Valid Number/src/main.rs:43
Methodis_palindrome
(s: String)
125. Valid Palindrome/src/main.rs:14
Methodis_palindrome
(mut head: Option<Box<ListNode>>)
Two Pointers/234. Palindrome Linked List/src/main.rs:57
Methodis_palindrome
(x: i32)
9. Palindrome Number/src/main.rs:14
Methodis_palindrome
(s: & Vec<char>, mut start: usize, mut end: usize)
131. Palindrome Partitioning/src/main.rs:33
Methodis_palindrome_
(head: Option<Box<ListNode>>)
Two Pointers/234. Palindrome Linked List/src/main.rs:29
Methodis_palindromic
(s:&[u8], start:usize, end:usize)
5. Longest Palindromic Substring/src/main.rs:37
Methodis_palindromic
(s: &[u8])
Weekly Contest 173/5319. Remove Palindromic Subsequences/src/main.rs:29
Methodis_valid
(s: String)
704. 二分查找/src/main.rs:44
Methodis_valid
(code: String)
cn/591. 标签验证器/src/main.rs:8
Methodis_valid
(s: String)
20. Valid Parentheses/src/main.rs:8
Methodis_valid_sudoku
(board: Vec<Vec<char>>)
36. Valid Sudoku/src/main.rs:14
Functionit_works
()
1813. Maximum Erasure Value/src/lib.rs:38
Functionit_works
()
2303. Unique Substrings With Equal Digit Frequency/src/lib.rs:24
Functionit_works
()
855. Count Unique Characters of All Substrings of a Given String/src/lib.rs:143
Functionit_works
()
855. Count Unique Characters of All Substrings of a Given String/src/lib_bkup_ac.rs:49
Functionit_works
()
855. Count Unique Characters of All Substrings of a Given String/src/lib_bkup.rs:91
Functionit_works
()
1632. Number of Good Ways to Split a String/src/lib.rs:78
Functionit_works
()
1815. Checking Existence of Edge Length Limited Paths/src/lib.rs:66
Functionit_works
()
2032. Largest Odd Number in String/src/lib.rs:23
Functionit_works
()
1807. Partitioning Into Minimum Number Of Deci-Binary Numbers/src/lib.rs:34
Functionit_works
()
2042. Maximum Product Difference Between Two Pairs/src/lib.rs:22
Functionit_works
()
2309. Maximize Number of Subsequences in a String/src/lib.rs:21
Functionit_works
()
1825. Find Minimum Time to Finish All Jobs/src/lib.rs:134
Functionit_works
()
1663. Detect Cycles in 2D Grid/src/lib.rs:16
Functionit_works
()
576. Out of Boundary Paths/src/lib.rs:30
Functionit_works
()
1658. Minimum Swaps to Arrange a Binary Grid/src/lib.rs:49
Functionit_works
()
1819. Construct the Lexicographically Largest Valid Sequence/src/lib.rs:94
Functionit_works
()
2287. Minimum Number of Lines to Cover Points/src/lib.rs:29
Functionit_works
()
931. Maximum Frequency Stack/src/lib.rs:20
Functionit_works
()
1575. Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts/src/lib.rs:35
Functionit_works
()
368. Largest Divisible Subset/src/lib.rs:51
Functionit_works
()
1664. Find Users With Valid E-Mails/src/lib.rs:31
Functionit_works
()
1801. Average Time of Process per Machine/src/lib.rs:149
Functionit_works
()
1289. Day of the Week/src/lib.rs:30
Functionit_works
()
1817. Calculate Money in Leetcode Bank/src/lib.rs:21
Functionit_works
()
1828. Count Ways to Distribute Candies/src/lib.rs:23
Functionit_works
()
1814. Jump Game VI/src/lib.rs:51
Functionit_works
()
753. Open the Lock/src/lib.rs:26
Functionit_works
()
2299. Merge Nodes in Between Zeros/src/lib.rs:26
Functionit_works
()
1803. Average Waiting Time/src/lib.rs:95
Functionit_works
()
1802. Number of Students Unable to Eat Lunch/src/lib.rs:34
Functionit_works
()
2351. Number of Ways to Buy Pens and Pencils/src/lib.rs:21
Functionit_works
()
1301. Reformat Department Table/src/lib.rs:48
Functionit_works
()
2180. Maximum Number of Tasks You Can Assign/src/lib.rs:25
Functionit_works
()
1824. Maximum Number of Eaten Apples/src/lib.rs:34
Functionit_works
()
2037. Count Square Sum Triples/src/lib.rs:18
Functionit_works
()
2315. The Change in Global Rankings/src/lib.rs:14
Functionit_works2
()
1801. Average Time of Process per Machine/src/lib.rs:159
Functioniter
()
1669. Minimum Cost to Cut a Stick/src/list.rs:174
Functioniter_mut
()
1669. Minimum Cost to Cut a Stick/src/list.rs:185
Methoditerr
(&self)
1444. Number of Steps to Reduce a Number to Zero/src/main.rs:15
Methodjump
(nums: Vec<i32>)
45. Jump Game II/src/main.rs:8
Methodk_weakest_rows
(mat: Vec<Vec<i32>>, k: i32)
Weekly Contest 174/5328. The K Weakest Rows in a Matrix/src/main.rs:15
Methodkth_smallest
(mut matrix: Vec<Vec<i32>>, k: i32)
378. Kth Smallest Element in a Sorted Matrix/src/main.rs:15
Methodlargest_divisible_subset
(mut nums: Vec<i32>)
368. Largest Divisible Subset/src/lib.rs:6
Methodlargest_multiple_of_three
(mut digits: Vec<i32>)
Weekly Contest 177/1363. Largest Multiple of Three/src/main.rs:11
Methodlargest_palindrome
回文数p可表示为p=(10^n-i)*(10^n-j) = (10^n-i-j)*10^n + i*j 令 upper = 10^n-i-j, lower = i*j, 两者形成回文的关系 只要使得i+j尽可能小,回文数p便可以尽可能大,枚举之
cn/479. 最大回文数乘积/src/main.rs:11
← previousnext →501–600 of 1,163, ranked by callers