MCPcopy Create free account

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

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

↓ 1 callersMethodmedian
(&self)
Two Heaps/480. Sliding Window Median/src/main.rs:115
↓ 1 callersMethodnext
(&mut self)
1669. Minimum Cost to Cut a Stick/src/main.rs:181
↓ 1 callersMethodnumDistinct
string dp
115. Distinct Subsequences/Solution.cpp:16
↓ 1 callersMethodnumTimesAllBlue
do not try to simulate in algorithm contest find the inner regulation and abstraction
Weekly Contest 179/1375. Bulb Switcher III/Solution.cpp:16
↓ 1 callersMethodnumTrees_cantalan
cantalan tree http://www-math.mit.edu/~rstan/ec/catalan.pdf
96. Unique Binary Search Trees/Solution.cpp:56
↓ 1 callersMethodo2i
(&mut self)
704. 二分查找/src/main.rs:136
↓ 1 callersMethodp
(&self)
32. Longest Valid Parentheses/src/main.rs:86
↓ 1 callersMethodpartial_cmp
(&self, other: &Self)
855. Count Unique Characters of All Substrings of a Given String/src/lib.rs:30
↓ 1 callersMethodpartition
86. Partition List/Solution.cpp:17
↓ 1 callersMethodpartition
(mut head: Option<Box<ListNode>>, x: i32)
86. Partition List/src/main.rs:41
↓ 1 callersMethodpop
(&mut self)
155. Min Stack/src/main.rs:31
↓ 1 callersMethodproductExceptSelf
238. Product of Array Except Self/Solution.cpp:16
↓ 1 callersMethodrecur
recur
77. Combinations/Solution.cpp:17
↓ 1 callersMethodrestoreIpAddresses
Input: "25525511135" Output: ["255.255.11.135", "255.255.111.35"]
93. Restore IP Addresses/Solution.cpp:38
↓ 1 callersMethodreversePairs
493. Reverse Pairs/Solution.cpp:45
↓ 1 callersFunctionreverse_k_group
(mut head: Option<Box<ListNode>>, k: i32)
1669. Minimum Cost to Cut a Stick/src/main.rs:354
↓ 1 callersMethodsimplifyPath
71. Simplify Path/Solution.cpp:9
↓ 1 callersFunctionsimulate_anneal
(w: &mut Vec<i32>, bs: i32)
1815. Checking Existence of Edge Length Limited Paths/src/lib.rs:8
↓ 1 callersMethodstrStr
28. Implement strStr()/Solution.cpp:69
↓ 1 callersMethodsumFourDivisors
Weekly Contest 181/1390. Four Divisors/Solution.cpp:15
↓ 1 callersMethodtail
(&self)
1825. Find Minimum Time to Finish All Jobs/src/lib.rs:22
↓ 1 callersFunctionte
(a: Rc<String>)
1669. Minimum Cost to Cut a Stick/src/main.rs:31
↓ 1 callersFunctiontest
()
1814. Jump Game VI/src/lib.rs:45
↓ 1 callersFunctiontestB
(a: &mut A)
1759. Find the Missing IDs/src/main.rs:56
↓ 1 callersMethodtop
(&mut self)
704. 二分查找/src/main.rs:95
↓ 1 callersMethodtraverse
(&mut self, root: Rc<RefCell<TreeNode>>)
Tree/113. Path Sum II/src/main.rs:51
↓ 1 callersMethodunite
(&mut self, a: usize, b: usize)
1632. Number of Good Ways to Split a String/src/lib.rs:19
MethodCustomStack
Weekly Contest 180/1381. Design a Stack With Increment Operation/Solution.cpp:16
MethodEngineer
Weekly Contest 180/1383. Maximum Performance of a Team/Solution.cpp:22
MethodListNode
82. Remove Duplicates from Sorted List II/Solution.cpp:7
MethodListNode
109. Convert Sorted List to Binary Search Tree/Solution.cpp:16
MethodListNode
83. Remove Duplicates from Sorted List/Solution.cpp:14
MethodListNode
86. Partition List/Solution.cpp:12
MethodListNode
160. Intersection of Two Linked Lists/Solution.cpp:7
MethodListNode
Weekly Contest 178/1367. Linked List in Binary Tree/Solution.cpp:11
MethodSolution
99. Recover Binary Search Tree/Solution.cpp:27
MethodSolution
493. Reverse Pairs/Solution.cpp:16
MethodSolution
543. Diameter of Binary Tree/Solution.cpp:25
FunctionTest1
(t *testing.T)
133. Clone Graph/solution_test.go:7
MethodTreeNode
95. Unique Binary Search Trees II/Solution.cpp:16
MethodTreeNode
105. Construct Binary Tree from Preorder and Inorder Traversal/Solution.cpp:17
MethodTreeNode
109. Convert Sorted List to Binary Search Tree/Solution.cpp:23
MethodTreeNode
102. Binary Tree Level Order Traversal/Solution.cpp:17
MethodTreeNode
Tree/236. Lowest Common Ancestor of a Binary Tree/Solution.cpp:10
MethodTreeNode
99. Recover Binary Search Tree/Solution.cpp:17
MethodTreeNode
98. Validate Binary Search Tree/Solution.cpp:16
MethodTreeNode
94. Binary Tree Inorder Traversal/Solution.cpp:17
MethodTreeNode
101. Symmetric Tree/Solution.cpp:18
MethodTreeNode
Weekly Contest 180/1382. Balance a Binary Search Tree/Solution.cpp:16
MethodTreeNode
Weekly Contest 178/1367. Linked List in Binary Tree/Solution.cpp:18
MethodTreeNode
543. Diameter of Binary Tree/Solution.cpp:18
MethodUndergroundSystem
Weekly Contest 182/1396. Design Underground System/Solution.cpp:23
Method_equal
both end inclusive
Weekly Contest 181/1392. Longest Happy Prefix/Solution.cpp:16
Functiona
()
1669. Minimum Cost to Cut a Stick/src/main.rs:636
Functiona
()
1444. Number of Steps to Reduce a Number to Zero/src/main.rs:114
Methoda
(&mut self)
1669. Minimum Cost to Cut a Stick/src/main.rs:123
Methoda
(b: &mut std::str::Chars)
1759. Find the Missing IDs/src/main.rs:91
Methodadd
(root: &mut Trie, num: i32)
1803. Average Waiting Time/src/lib.rs:62
Methodadd
n == 2, [1,0] n == 3, [1,1,0] n == 4, [1,2,1,0] n == 5, [1,2,2,1,0]
cn/821. 字符的最短距离/src/main.rs:27
Methodadd
(n: i32, res: &mut Vec<i32>, base: i32)
cn/386. 字典序排数/src/main.rs:20
Methodadd_at_head
(&mut self, val: i32)
704. 二分查找/src/main.rs:611
Methodadd_at_index
(&mut self, index: i32, val: i32)
704. 二分查找/src/main.rs:633
Methodadd_at_tail
(&mut self, val: i32)
704. 二分查找/src/main.rs:620
Methodadd_binary
(a: String, b: String)
67. Add Binary/src/main.rs:8
Methodadd_two_numbers
(l1: Option<Box<ListNode>>, l2: Option<Box<ListNode>>)
2. Add Two Numbers/src/main.rs:112
Methodadd_two_numbers_recursive
(l1: Option<&Box<ListNode>>, l2: Option<&Box<ListNode>>, carry: i32)
2. Add Two Numbers/src/main.rs:95
Functionadv
()
1802. Number of Students Unable to Eat Lunch/src/lib.rs:29
Methodare_numbers_ascending
(s: String)
2042. Maximum Product Difference Between Two Pairs/src/lib.rs:4
Functionare_sentences_similar
(sentence1: String, sentence2: String)
1813. Maximum Erasure Value/src/lib.rs:1
MethodbackspaceCompare
go from back to front
Two Pointers/844. Backspace String Compare/Solution.cpp:8
Methodbackspace_compare
two array walk through
Two Pointers/844. Backspace String Compare/src/main.rs:9
MethodbalanceBST
Weekly Contest 180/1382. Balance a Binary Search Tree/Solution.cpp:49
Functionbasic
()
51. N-Queens/src/main.rs:60
Functionbasic
()
213. House Robber II/src/main.rs:41
Functionbasic
()
82. Remove Duplicates from Sorted List II/src/main.rs:49
Functionbasic
()
49. Group Anagrams/src/main.rs:58
Functionbasic
()
6. ZigZag Conversion/src/main.rs:62
Functionbasic
()
Merge Intervals/57. Insert Interval/src/main.rs:43
Functionbasic
()
Merge Intervals/56. Merge Intervals/src/main.rs:36
Functionbasic
()
Merge Intervals/986. Interval List Intersections/src/main.rs:42
Functionbasic
()
217. Contains Duplicate/src/main.rs:27
Functionbasic
()
42. Trapping Rain Water/src/main.rs:44
Functionbasic
()
704. 二分查找/src/main.rs:1074
Functionbasic
()
29. Divide Two Integers/src/main.rs:38
Functionbasic
()
58. Length of Last Word/src/main.rs:21
Functionbasic
()
88. Merge Sorted Array/src/main.rs:31
Functionbasic
()
14. Longest Common Prefix/src/main.rs:40
Functionbasic
()
1046. Last Stone Weight/src/main.rs:32
Functionbasic
()
16. 3Sum Closest/src/main.rs:41
Functionbasic
()
62. Unique Paths/src/main.rs:24
Functionbasic
()
39. Combination Sum/src/main.rs:42
Functionbasic
()
Cyclic Sort/287. Find the Duplicate Number/src/main.rs:31
Functionbasic
()
Cyclic Sort/268. Missing Number/src/main.rs:27
Functionbasic
()
63. Unique Paths II/src/main.rs:33
Functionbasic
()
855. Count Unique Characters of All Substrings of a Given String/src/lib.rs:126
Functionbasic
()
855. Count Unique Characters of All Substrings of a Given String/src/lib_bkup_ac.rs:45
Functionbasic
()
855. Count Unique Characters of All Substrings of a Given String/src/lib_bkup.rs:80
Functionbasic
()
Weekly Contest 174/5328. The K Weakest Rows in a Matrix/src/main.rs:32
Functionbasic
()
782. Transform to Chessboard/src/main.rs:142
Functionbasic
()
23. Merge k Sorted Lists/src/main.rs:116
← previousnext →101–200 of 1,163, ranked by callers