MCPcopy Create free account

hub / github.com/corpsepiges/leetcode / functions

Functions1,433 in github.com/corpsepiges/leetcode

⨍ Functions 1,433◇ Types & classes 940
↓ 492 callersMethodget
:rtype: int
Algorithms/146. LRU Cache/Solution.py:16
↓ 453 callersMethodget
(int key)
java/146. LRU Cache.java:11
↓ 383 callersMethodadd
(ListNode l1, ListNode l2,boolean flag)
Algorithms/002. Add Two Numbers/Solution.java:13
↓ 383 callersMethodadd
(ListNode l1, ListNode l2,boolean flag)
java/002. Add Two Numbers.java:13
↓ 63 callersMethodremove
Removes a value from the set. Returns true if the set contained the specified element.
Algorithms/380. Insert Delete GetRandom O(1)/Solution.java:22
↓ 63 callersMethodremove
Removes a value from the set. Returns true if the set contained the specified element.
java/380. Insert Delete GetRandom O(1).java:22
↓ 58 callersMethodtoString
(self)
util/spider.py:29
↓ 43 callersMethodget
:rtype: int
python/146. LRU Cache.py:16
↓ 26 callersMethodmax
(List<Integer> list)
Algorithms/152. Maximum Product Subarray/Solution.java:36
↓ 26 callersMethodmax
(List<Integer> list)
java/152. Maximum Product Subarray.java:36
↓ 24 callersMethodleft
(int[][] matrix,int mb,int nb,int me,int ne,List<Integer> list)
Algorithms/054. Spiral Matrix/Solution.java:41
↓ 24 callersMethodleft
(int[][] matrix,int mb,int nb,int me,int ne,List<Integer> list)
java/054. Spiral Matrix.java:41
↓ 23 callersMethodright
(int[][] matrix,int mb,int nb,int me,int ne,List<Integer> list)
Algorithms/054. Spiral Matrix/Solution.java:35
↓ 23 callersMethodright
(int[][] matrix,int mb,int nb,int me,int ne,List<Integer> list)
java/054. Spiral Matrix.java:35
↓ 12 callersMethodnext
()
Algorithms/284. Peeking Iterator/Solution.java:20
↓ 12 callersMethodnext
()
java/284. Peeking Iterator.java:20
↓ 11 callersMethodempty
()
Algorithms/232. Implement Queue using Stacks/Solution.java:49
↓ 11 callersMethodempty
()
java/232. Implement Queue using Stacks.java:49
↓ 8 callersMethodg
(int[][] board,int x,int y)
Algorithms/289. Game of Life/Solution.java:24
↓ 8 callersMethodg
(int[][] board,int x,int y)
java/289. Game of Life.java:24
↓ 8 callersMethodreverse
:type x: int :rtype: int
Algorithms/007. Reverse Integer/Solution.py:4
↓ 6 callersMethodpush
(int x)
Algorithms/232. Implement Queue using Stacks/Solution.java:4
↓ 6 callersMethodpush
(int x)
java/232. Implement Queue using Stacks.java:4
↓ 6 callersMethodreverse
:type x: int :rtype: int
python/007. Reverse Integer.py:4
↓ 4 callersMethodpop
()
Algorithms/232. Implement Queue using Stacks/Solution.java:13
↓ 4 callersMethodpop
()
java/232. Implement Queue using Stacks.java:13
↓ 3 callersMethodget
(int key)
Algorithms/146. LRU Cache/Solution.java:11
↓ 3 callersMethodopenurl
打开网页
util/csdn.py:28
↓ 3 callersMethodrobSon
(self,root)
python/337. House Robber III.py:23
↓ 3 callersMethodrobSon
(self,root)
Algorithms/337. House Robber III/Solution.py:23
↓ 2 callersMethodCount
(ListNode head,int i)
Algorithms/160. Intersection of Two Linked Lists/Solution.java:31
↓ 2 callersMethodCount
(ListNode head,int i)
java/160. Intersection of Two Linked Lists.java:31
↓ 2 callersFunctiondeep
(root)
Algorithms/110. Balanced Binary Tree/Solution.rb:16
↓ 2 callersFunctiondeep
(root)
ruby/110. Balanced Binary Tree.rb:16
↓ 2 callersMethodf
()
Algorithms/232. Implement Queue using Stacks/Solution.java:53
↓ 2 callersMethodf
(TreeNode root)
Algorithms/110. Balanced Binary Tree/Solution.java:20
↓ 2 callersMethodf
(TreeNode root, TreeNode p)
Algorithms/236. Lowest Common Ancestor of a Binary Tree/Solution.java:31
↓ 2 callersMethodf
(char[][] board,int x,int y,char val)
Algorithms/037. Sudoku Solver/Solution.java:43
↓ 2 callersMethodf
(TreeNode root)
java/110. Balanced Binary Tree.java:20
↓ 2 callersMethodf
(char[][] board,int x,int y,char val)
java/037. Sudoku Solver.java:43
↓ 2 callersMethodf
()
java/232. Implement Queue using Stacks.java:53
↓ 2 callersMethodf
(TreeNode root, TreeNode p)
java/236. Lowest Common Ancestor of a Binary Tree.java:31
↓ 2 callersMethodgetMainArticle
get the main article of CSDN blog
util/csdn.py:61
↓ 2 callersMethodgetOneSide
(self,root,direction)
python/222. Count Complete Tree Nodes.py:23
↓ 2 callersMethodgetOneSide
(self,root,direction)
Algorithms/222. Count Complete Tree Nodes/Solution.py:23
↓ 2 callersFunctionisBadVersion
(version)
python/278. First Bad Version.py:6
↓ 2 callersFunctionisBadVersion
(version)
Algorithms/278. First Bad Version/Solution.py:6
↓ 2 callersMethodisPartition
(String s)
Algorithms/131. Palindrome Partitioning/Solution.java:29
↓ 2 callersMethodisPartition
(String s)
java/131. Palindrome Partitioning.java:29
↓ 2 callersMethodmaxDeep
(self,root)
python/110. Balanced Binary Tree.py:18
↓ 2 callersMethodmaxDeep
(self,root)
Algorithms/110. Balanced Binary Tree/Solution.py:18
↓ 2 callersMethodmergeTwoLists
(ListNode l1, ListNode l2)
Algorithms/023. Merge k Sorted Lists/Solution.java:30
↓ 2 callersMethodmergeTwoLists
(ListNode l1, ListNode l2)
java/023. Merge k Sorted Lists.java:30
↓ 2 callersFunctionmerge_two_lists
@param {ListNode} l1 @param {ListNode} l2 @return {ListNode}
Algorithms/023. Merge k Sorted Lists/Solution.rb:23
↓ 2 callersFunctionmerge_two_lists
@param {ListNode} l1 @param {ListNode} l2 @return {ListNode}
ruby/023. Merge k Sorted Lists.rb:23
↓ 2 callersMethodpeek
()
Algorithms/284. Peeking Iterator/Solution.java:14
↓ 2 callersMethodpeek
()
java/284. Peeking Iterator.java:14
↓ 2 callersMethodpush
(int x)
Algorithms/155. Min Stack/Solution.java:3
↓ 2 callersMethodpush
(int x)
java/155. Min Stack.java:3
↓ 2 callersMethodreverse
(int x)
java/007. Reverse Integer.java:2
↓ 2 callersMethodrob
:type root: TreeNode :rtype: int
python/337. House Robber III.py:12
↓ 2 callersMethodrob
:type root: TreeNode :rtype: int
Algorithms/337. House Robber III/Solution.py:12
↓ 2 callersMethodrob
(TreeNode root)
Algorithms/337. House Robber III/Solution.java:11
↓ 2 callersMethodrob
(TreeNode root)
java/337. House Robber III.java:11
↓ 2 callersMethodrobSimple
(self,nums)
python/213. House Robber II.py:17
↓ 2 callersMethodrobSimple
(self,nums)
Algorithms/213. House Robber II/Solution.py:17
↓ 2 callersMethodrobSon
(TreeNode root)
Algorithms/337. House Robber III/Solution.java:14
↓ 2 callersMethodrobSon
(TreeNode root)
java/337. House Robber III.java:14
↓ 2 callersMethodset
:type key: int :type value: int :rtype: nothing
Algorithms/146. LRU Cache/Solution.py:27
↓ 2 callersMethodset
(int key, int value)
java/146. LRU Cache.java:19
↓ 2 callersMethodstructureTreeFile
(String input)
Algorithms/388. Longest Absolute File Path/Solution.java:35
↓ 2 callersMethodstructureTreeFile
(String input)
java/388. Longest Absolute File Path.java:35
↓ 2 callersMethodsum
(TreeNode root,boolean flag)
Algorithms/404. Sum of Left Leaves/Solution.java:17
↓ 2 callersMethodsum
(TreeNode root,boolean flag)
java/404. Sum of Left Leaves.java:17
↓ 2 callersMethodswapTwoNumber
(self,nums,i,j)
python/324. Wiggle Sort II.py:49
↓ 2 callersMethodswapTwoNumber
(self,nums,i,j)
Algorithms/324. Wiggle Sort II/Solution.py:49
↓ 2 callersMethodvisitForAtlanticOcean
(int x, int y, int lastHeight)
Algorithms/417. Pacific Atlantic Water Flow/Solution.java:52
↓ 2 callersMethodvisitForAtlanticOcean
(int x, int y, int lastHeight)
java/417. Pacific Atlantic Water Flow.java:52
↓ 2 callersMethodvisitForPacificOcean
(int x, int y, int lastHeight)
Algorithms/417. Pacific Atlantic Water Flow/Solution.java:41
↓ 2 callersMethodvisitForPacificOcean
(int x, int y, int lastHeight)
java/417. Pacific Atlantic Water Flow.java:41
↓ 1 callersMethoda
(List<Integer> list)
Algorithms/264. Ugly Number II/Solution.java:15
↓ 1 callersMethoda
(List<Integer> list)
java/264. Ugly Number II.java:15
↓ 1 callersFunctionadd
(l1,l2,flag)
Algorithms/002. Add Two Numbers/Solution.js:16
↓ 1 callersFunctionadd
(l1,l2,f)
Algorithms/002. Add Two Numbers/Solution.rb:17
↓ 1 callersFunctionadd
(l1,l2,f)
ruby/002. Add Two Numbers.rb:17
↓ 1 callersFunctionadd
(l1,l2,flag)
js/002. Add Two Numbers.js:16
↓ 1 callersMethodaddString
(String sa,String sb)
Algorithms/306. Additive Number/Solution.java:42
↓ 1 callersMethodaddString
(String sa,String sb)
java/306. Additive Number.java:42
↓ 1 callersMethodaddTwo
(self,l1,l2,flag)
python/002. Add Two Numbers.py:12
↓ 1 callersMethodaddTwo
(self,l1,l2,flag)
Algorithms/002. Add Two Numbers/Solution.py:12
↓ 1 callersMethodaddTwoNumbers
(self, l1, l2)
python/002. Add Two Numbers.py:10
↓ 1 callersMethodaddTwoNumbers
(self, l1, l2)
Algorithms/002. Add Two Numbers/Solution.py:10
↓ 1 callersMethodaddlist
(ListNode head, List<ListNode> list)
Algorithms/019. Remove Nth Node From End of List/Solution.java:19
↓ 1 callersMethodaddlist
(ListNode head, List<ListNode> list)
java/019. Remove Nth Node From End of List.java:19
↓ 1 callersMethodbuild
(int[] preorder, int[] inorder,int ps,int pe,int is,int ie)
Algorithms/105. Construct Binary Tree from Preorder and Inorder Traversal/Solution.java:14
↓ 1 callersMethodbuild
(int[] nums,int s,int e)
Algorithms/108. Convert Sorted Array to Binary Search Tree/Solution.java:14
↓ 1 callersMethodbuild
(int[] inorder, int[] postorder,int is,int ie,int ps,int pe)
Algorithms/106. Construct Binary Tree from Inorder and Postorder Traversal/Solution.java:14
↓ 1 callersMethodbuild
(int[] preorder, int[] inorder,int ps,int pe,int is,int ie)
java/105. Construct Binary Tree from Preorder and Inorder Traversal.java:14
↓ 1 callersMethodbuild
(int[] nums,int s,int e)
java/108. Convert Sorted Array to Binary Search Tree.java:14
↓ 1 callersMethodbuild
(int[] inorder, int[] postorder,int is,int ie,int ps,int pe)
java/106. Construct Binary Tree from Inorder and Postorder Traversal.java:14
next →1–100 of 1,433, ranked by callers