MCPcopy Create free account

hub / github.com/andavid/leetcode-java / functions

Functions374 in github.com/andavid/leetcode-java

⨍ Functions 374◇ Types & classes 256
↓ 56 callersMethodsize
()
en/146.lru-cache.java:94
↓ 43 callersMethodisEmpty
Checks whether the circular deque is empty or not.
en/641.design-circular-deque.java:137
↓ 40 callersMethodpush
(int x)
en/155.min-stack.java:56
↓ 39 callersMethodget
(int key)
en/146.lru-cache.java:110
↓ 32 callersMethodpop
()
en/155.min-stack.java:64
↓ 22 callersMethodput
(int key, int value)
en/146.lru-cache.java:119
↓ 19 callersMethodempty
Returns whether the stack is empty.
en/225.implement-stack-using-queues.java:76
↓ 16 callersMethodpeek
Get the front element.
en/232.implement-queue-using-stacks.java:73
↓ 15 callersMethodremove
(Node x)
en/146.lru-cache.java:79
↓ 4 callersMethodisEmpty
Checks whether the circular queue is empty or not.
en/622.design-circular-queue.java:127
↓ 4 callersMethodreverse
(int[] nums, int from, int to)
en/189.rotate-array.java:56
↓ 3 callersMethodreverse
(String str)
en/151.reverse-words-in-a-string.java:88
↓ 2 callersMethodbuildStack
(ListNode l)
en/445.add-two-numbers-ii.java:65
↓ 2 callersMethoddfs
(TreeNode root, List<Integer> list)
en/872.leaf-similar-trees.java:57
↓ 2 callersMethodextend
(String s, int j, int k)
en/5.longest-palindromic-substring.java:51
↓ 2 callersMethodinsert
Inserts a value to the set. Returns true if the set did not already contain the specified element.
en/380.insert-delete-get-random-o-1.java:70
↓ 2 callersMethodisAllZeros
(int[] count)
en/567.permutation-in-string.java:76
↓ 2 callersMethodisFull
Checks whether the circular deque is full or not.
en/641.design-circular-deque.java:142
↓ 2 callersMethodisLetterOrDigit
(char ch)
en/125.valid-palindrome.java:59
↓ 2 callersMethodmatchOne
(String str, int strIndex, String pattern, int patternIndex)
en/10.regular-expression-matching.java:133
↓ 2 callersMethodpalindromic
(String s, int left, int right)
en/647.palindromic-substrings.java:61
↓ 2 callersMethodpush
Push element x to the back of queue.
en/232.implement-queue-using-stacks.java:58
↓ 2 callersMethodswap
(int[] nums, int i, int j)
en/47.permutations-ii.java:58
↓ 2 callersMethodswap
(int[] data, int i, int j)
en/169.majority-element.java:61
↓ 2 callersMethodswap
(int[] data, int i, int j)
en/215.kth-largest-element-in-an-array.java:59
↓ 2 callersMethodswap
(int[] nums, int i, int j)
en/75.sort-colors.java:58
↓ 1 callersMethodBST
(int[] nums, int start, int end)
en/108.convert-sorted-array-to-binary-search-tree.java:51
↓ 1 callersMethodaddFirst
(Node x)
en/146.lru-cache.java:71
↓ 1 callersMethodbacktrace
(List<List<Integer>> list, List<Integer> track, int[] candidates, int remain, int start)
en/39.combination-sum.java:61
↓ 1 callersMethodbacktrace
(TreeNode root)
en/1022.sum-of-root-to-leaf-binary-numbers.java:67
↓ 1 callersMethodbacktrace
(int[] nums, List<Integer> track, List<List<Integer>> answer)
en/46.permutations.java:42
↓ 1 callersMethodbacktrace
(List<List<Integer>> answer, List<Integer> track, int start, int end, int k)
en/77.combinations.java:43
↓ 1 callersMethodbacktrace
(int[] nums, int start, List<Integer> track, List<List<Integer>> answer)
en/78.subsets.java:45
↓ 1 callersMethodbacktrack
(List<List<Integer>> list, List<Integer> track, int[] candidates, int remain, int start)
en/40.combination-sum-ii.java:62
↓ 1 callersMethodbacktrack
(List<String> list, String str, int open, int close, int n)
en/22.generate-parentheses.java:13
↓ 1 callersMethodbacktrack
(int[] nums, List<Integer> track)
zh/46.全排列.java:43
↓ 1 callersMethodbsearch
(int[] nums, int target, int low, int high)
en/33.search-in-rotated-sorted-array.java:11
↓ 1 callersMethodbsearch
(int[] nums, int target)
zh/349.两个数组的交集.2.java:63
↓ 1 callersMethodbsearchFirst
(int[] nums, int target, int low, int high)
en/34.find-first-and-last-position-of-element-in-sorted-array.java:51
↓ 1 callersMethodbsearchLast
(int[] nums, int target, int low, int high)
en/34.find-first-and-last-position-of-element-in-sorted-array.java:69
↓ 1 callersMethodbuildString
(TreeNode root, StringBuilder sb)
en/449.serialize-and-deserialize-bst.java:51
↓ 1 callersMethodbuildTree
(Queue<Integer> queue)
en/449.serialize-and-deserialize-bst.java:73
↓ 1 callersMethodcheck
(TreeNode node1, TreeNode node2)
zh/101.对称二叉树.1.java:63
↓ 1 callersMethodcommonPrefix
(String a, String b)
en/14.longest-common-prefix.java:57
↓ 1 callersMethodcompare
(ListNode a, ListNode b)
en/23.merge-k-sorted-lists.java:41
↓ 1 callersMethodconstruct
(int[] result, int n)
en/51.n-queens.java:45
↓ 1 callersMethodcount
(TreeNode root, int sum)
en/437.path-sum-iii.java:69
↓ 1 callersMethoddfs
(TreeNode root, int prevSum)
en/1022.sum-of-root-to-leaf-binary-numbers.1.java:63
↓ 1 callersMethoddfs
(char[][] grid, int i, int j)
en/200.number-of-islands.java:65
↓ 1 callersMethoddfs
(List<String> list, String path, TreeNode root)
en/257.binary-tree-paths.java:54
↓ 1 callersMethoddfs
(int[][] grid, int i, int j, int area)
en/695.max-area-of-island.java:67
↓ 1 callersMethoddfs
(TreeNode root, int sum)
en/112.path-sum.java:52
↓ 1 callersMethoddfs
(List<String> list, String path, TreeNode root)
zh/257.二叉树的所有路径.java:55
↓ 1 callersMethoddivideHelper
(int dividend, int divisor)
en/29.divide-two-integers.java:71
↓ 1 callersMethodgenTrees
(int start, int end)
en/95.unique-binary-search-trees-ii.java:23
↓ 1 callersMethodgetDepth
(TreeNode root)
en/110.balanced-binary-tree.java:70
↓ 1 callersMethodgetList
(int digit)
en/17.letter-combinations-of-a-phone-number.java:58
↓ 1 callersMethodhelper
(int[] postorder, int postIndex, int inStart, int inEnd)
en/106.construct-binary-tree-from-inorder-and-postorder-traversal.java:30
↓ 1 callersMethodhelper
(int[] preorder, int preIndex, int inStart, int inEnd)
en/105.construct-binary-tree-from-preorder-and-inorder-traversal.java:30
↓ 1 callersMethodhelper
(int[] preorder, int preIndex, int inStart, int inEnd)
zh/105.从前序与中序遍历序列构造二叉树.java:61
↓ 1 callersMethodhelper
(int[] postorder, int postIndex, int inStart, int inEnd)
zh/106.从中序与后序遍历序列构造二叉树.java:62
↓ 1 callersMethodisFull
Checks whether the circular queue is full or not.
en/622.design-circular-queue.java:132
↓ 1 callersMethodisMatch
(TreeNode s, TreeNode t)
en/572.subtree-of-another-tree.java:89
↓ 1 callersMethodisOk
(int[] result, int n, int row, int column)
en/51.n-queens.java:28
↓ 1 callersMethodisOk
(int[] result, int n, int row, int column)
en/52.n-queens-ii.java:28
↓ 1 callersMethodisSym
(TreeNode r1, TreeNode r2)
en/101.symmetric-tree.java:60
↓ 1 callersMethodlca
(TreeNode root, TreeNode p, TreeNode q)
en/235.lowest-common-ancestor-of-a-binary-search-tree.java:20
↓ 1 callersMethodlcp
(String[] strs, int i, int j)
en/14.longest-common-prefix.java:48
↓ 1 callersMethodmatchInternal
(String str, int strIndex, String pattern, int patternIndex)
en/10.regular-expression-matching.java:94
↓ 1 callersMethodmaxDepth
(TreeNode root)
en/543.diameter-of-binary-tree.java:60
↓ 1 callersMethodmergeList
(ListNode l1, ListNode l2)
en/148.sort-list.java:64
↓ 1 callersMethodminusOne
(String str, int i)
zh/752.打开转盘锁.java:134
↓ 1 callersMethodpartition
(int[] data, int low, int high)
en/169.majority-element.java:41
↓ 1 callersMethodpartition
(int[] data, int k, int low, int high)
en/215.kth-largest-element-in-an-array.java:39
↓ 1 callersMethodpermute
(int[] nums, int begin, List<List<Integer>> answer)
en/47.permutations-ii.java:39
↓ 1 callersMethodplusOne
(String str, int i)
zh/752.打开转盘锁.java:124
↓ 1 callersMethodpop
Removes the element from in front of queue and returns that element.
en/232.implement-queue-using-stacks.java:63
↓ 1 callersMethodrand
(int min, int max)
en/384.shuffle-an-array.java:62
↓ 1 callersMethodremoveLast
()
en/146.lru-cache.java:85
↓ 1 callersMethodsearch
(int[][] matrix, int row, int target)
en/74.search-a-2-d-matrix.java:65
↓ 1 callersMethodsearchLastLess
(int[][] matrix, int target)
en/74.search-a-2-d-matrix.java:83
↓ 1 callersMethodsearchLeft
(int[] nums, int target, int start, int end)
zh/34.在排序数组中查找元素的第一个和最后一个位置.java:46
↓ 1 callersMethodsearchRight
(int[] nums, int target, int start, int end)
zh/34.在排序数组中查找元素的第一个和最后一个位置.java:64
↓ 1 callersMethodsolve
(List<List<String>> list, int[] result, int n, int row)
en/51.n-queens.java:14
↓ 1 callersMethodsumOfDigits
(int n)
en/202.happy-number.java:46
↓ 1 callersMethodswap
(int[] nums, int i, int j)
en/384.shuffle-an-array.java:66
↓ 1 callersMethodtotal
(int[] result, int n, int row)
en/52.n-queens-ii.java:12
MethodBSTIterator
(TreeNode root)
en/173.binary-search-tree-iterator.java:19
MethodDoubleList
()
en/146.lru-cache.java:63
MethodFront
Get the front item from the queue.
en/622.design-circular-queue.java:111
MethodLRUCache
(int capacity)
en/146.lru-cache.java:104
MethodMedianFinder
()
en/295.find-median-from-data-stream.java:64
MethodMinStack
initialize your data structure here.
en/155.min-stack.java:51
MethodMyCircularDeque
Initialize your data structure here. Set the size of the deque to be k.
en/641.design-circular-deque.java:75
MethodMyCircularQueue
Initialize your data structure here. Set the size of the queue to be k.
en/622.design-circular-queue.java:76
MethodMyQueue
Initialize your data structure here.
en/232.implement-queue-using-stacks.java:52
MethodMyStack
Initialize your data structure here.
en/225.implement-stack-using-queues.java:51
MethodNode
(int k, int v)
en/146.lru-cache.java:53
MethodRandomizedSet
Initialize your data structure here.
en/380.insert-delete-get-random-o-1.java:63
MethodRear
Get the last item from the queue.
en/622.design-circular-queue.java:119
next →1–100 of 374, ranked by callers