MCPcopy Create free account

hub / github.com/chenxiangcyr/leetcode-answers / functions

Functions225 in github.com/chenxiangcyr/leetcode-answers

↓ 38 callersMethodget
(int key)
146-LRUCache/Solution.java:50
↓ 24 callersMethodput
(int key, int value)
146-LRUCache/Solution.java:65
↓ 20 callersMethodpop
()
155-MinStack/Solution.java:22
↓ 18 callersMethodpush
(int x)
155-MinStack/Solution.java:14
↓ 5 callersMethodreverse
(char[] str, int left, int right)
151-ReverseWordsinaString/Solution.java:30
↓ 4 callersMethodboundaryDFS
(char[][] board, int i, int j)
130-SurroundedRegions/Solution.java:34
↓ 3 callersMethodaddToHead
(Node node)
146-LRUCache/Solution.java:43
↓ 3 callersMethoddeleteNode
(Node node)
146-LRUCache/Solution.java:38
↓ 3 callersMethodisMatch
(String text, String pattern)
10-RegularExpressionMatching/Solution.java:4
↓ 2 callersMethodbinarySearchRange
(int[] nums, int start, int end, int target, boolean isLeft)
34-FindFirstandLastPositionofElementinSortedArray/Solution.java:11
↓ 2 callersMethoddepth
(TreeNode root)
110-BalancedBinaryTree/Solution.java:17
↓ 2 callersMethodexpandAroundCenter
(String s, int left, int right)
5-LongestPalindromicSubstring/Solution.java:56
↓ 2 callersMethodfindNextNode
(TreeLinkNode node)
117-PopulatingNextRightPointersinEachNodeII/Solution.java:33
↓ 2 callersFunctionswap
31-NextPermutation/Solution.c:38
↓ 2 callersFunctionswap
60-PermutationSequence/Solution.c:82
↓ 1 callersMethodGCD
(int a, int b)
149-MaxPointsonaLine/Solution.java:51
↓ 1 callersMethodbacktrack
(List<String> ans, String cur, int open, int close, int n)
22-GenerateParentheses/Solution.java:8
↓ 1 callersMethodbfs
(String start, String end, Set<String> dict, HashMap<String, ArrayList<String>> nodeNeighbors, HashMap<String,
126-WordLadderII/Solution.java:20
↓ 1 callersMethodbinarySearch
(int[] nums, int start, int end, int target)
81-SearchinRotatedSortedArrayII/Solution.java:7
↓ 1 callersMethodbinarySearch
(int[] nums, int start, int end, int target)
33-SearchinRotatedSortedArray/Solution.java:7
↓ 1 callersMethodcanJumpToPostionIterative
(int[] nums)
55-JumpGame/Solution.java:7
↓ 1 callersMethodclone
(UndirectedGraphNode node)
133-CloneGraph/Solution.java:16
↓ 1 callersMethodcloneNodes
(RandomListNode head)
138-CopyListwithRandomPointer/Solution.java:23
↓ 1 callersMethodconnectRandomNodes
(RandomListNode head)
138-CopyListwithRandomPointer/Solution.java:40
↓ 1 callersFunctiondfs
95-UniqueBinarySearchTreesII/Solution.c:22
↓ 1 callersMethoddfs
(String cur, String end, Set<String> dict, HashMap<String, ArrayList<String>> nodeNeighbors, HashMap<String, I
126-WordLadderII/Solution.java:75
↓ 1 callersMethoddfs
(TreeNode root)
129-SumRoottoLeafNumbers/Solution.java:20
↓ 1 callersMethoddfs
(char[][] board, char[] wordArr, int i, int j, int rows, int columns, int curWordIdx)
79-WordSearch/Solution.java:21
↓ 1 callersMethodfastPow
(double x, long n)
50-Powxn/Solution.java:12
↓ 1 callersMethodflattenRecursive
(TreeNode root)
114-FlattenBinaryTreetoLinkedList/Solution.java:16
↓ 1 callersMethodgetAllPath
(TreeNode root)
113-PathSumII/Solution.java:34
↓ 1 callersMethodgetNeighbors
(String node, Set<String> dict)
126-WordLadderII/Solution.java:55
↓ 1 callersMethodisOverlapped
(Interval i1, Interval i2)
57-InsertInterval/Solution.java:46
↓ 1 callersMethodisPalindrome
(char[] arr, int startIdx, int endIdx)
131-PalindromePartitioning/Solution.java:33
↓ 1 callersMethodisPalindrome
(String s)
132-PalindromePartitioningII/Solution.java:29
↓ 1 callersMethodisValid
(char[][] board, int row, int col, char c)
37-SudokuSolver/Solution.java:39
↓ 1 callersMethodisValidPosition
(int[][] board, int n, int rowIdx, int colIdx)
51-N-Queens/Solution.java:58
↓ 1 callersMethodkSum
(int[] nums, int target, int k, int startIndex, int len)
18-4Sum/Solution.java:11
↓ 1 callersMethodlongestPalindromeManacher
(String s)
5-LongestPalindromicSubstring/Solution.java:68
↓ 1 callersMethodmaxPathDown
(TreeNode node)
124-BinaryTreeMaximumPathSum/Solution.java:19
↓ 1 callersMethodmerge2Lists
(ListNode l1, ListNode l2)
23-MergekSortedLists/Solution.java:60
↓ 1 callersMethodmergeOverlapped
(Interval i1, Interval i2)
57-InsertInterval/Solution.java:55
↓ 1 callersMethodminimumTotalDP
(List<List<Integer>> triangle)
120-Triangle/Solution.java:7
↓ 1 callersFunctionnextPermutation
60-PermutationSequence/Solution.c:45
↓ 1 callersMethodreverse
(int x)
7-ReverseInteger/Solution.java:2
↓ 1 callersMethodreverse
(ListNode begin, ListNode end)
25-ReverseNodesink-Group/Solution.java:36
↓ 1 callersMethodsolve
(char[][] board)
37-SudokuSolver/Solution.java:10
↓ 1 callersMethodsplitRandomList
(RandomListNode head)
138-CopyListwithRandomPointer/Solution.java:56
↓ 1 callersMethodswap
(int[] nums, int i, int j)
41-FirstMissingPositive/Solution.java:36
↓ 1 callersMethodtop
()
155-MinStack/Solution.java:30
↓ 1 callersMethodtotalNQueensHelper
(int row, int count, int n)
52-N-QueensII/Solution.java:10
↓ 1 callersMethodtravel
(int[] nums)
46-Permutations/Solution.java:11
↓ 1 callersMethodtravel
(int[][] board, int n, int rowIdx)
51-N-Queens/Solution.java:15
↓ 1 callersMethodtravel
(char[] digitsArr, int curIdx)
17-LetterCombinationsofaPhoneNumber/Solution.java:23
↓ 1 callersMethodtravel
(int[] candidates, int target, int startIdx)
39-CombinationSum/Solution.java:14
↓ 1 callersMethodtravel
(int n, int k, int start)
77-Combinations/Solution.java:12
↓ 1 callersMethodtravel
(char[] arr, int startIdx)
131-PalindromePartitioning/Solution.java:12
↓ 1 callersMethodtravel
(int[] candidates, int target, int startIdx)
40-CombinationSumII/Solution.java:14
↓ 1 callersMethodtravel
(int[] nums, boolean [] visited)
47-PermutationsII/Solution.java:13
↓ 1 callersMethodtravel
(int[] nums, int startIdx)
90-SubsetsII/Solution.java:16
↓ 1 callersMethodtravel
(String s, int startIdx)
93-RestoreIPAddresses/Solution.java:13
↓ 1 callersMethodtravel
(int[] nums, int startIdx)
78-Subsets/Solution.java:13
↓ 1 callersMethodtravel
(String s, int pos, int cut, Map<Integer,Integer> cache)
132-PalindromePartitioningII/Solution.java:6
↓ 1 callersMethoduniquePathsIterative
(int m, int n)
62-UniquePaths/Solution.java:8
↓ 1 callersMethoduniquePathsWithObstaclesIterative
(int[][] obstacleGrid, int m, int n)
63-UniquePathsII/Solution.java:15
↓ 1 callersMethodwordBreakIterative
(String s, List<String> wordDict)
139-WordBreak/Solution.java:7
MethodLRUCache
(int capacity)
146-LRUCache/Solution.java:22
MethodMinStack
initialize your data structure here.
155-MinStack/Solution.java:9
MethodNode
(int key, int value)
146-LRUCache/Solution.java:8
MethodaddBinary
(String a, String b)
67-AddBinary/Solution.java:2
MethodaddTwoNumbers
(ListNode l1, ListNode l2)
2-AddTwoNumbers/Solution.java:10
MethodbuildTree
(int[] inorder, int[] postorder)
106-ConstructBinaryTreefromInorderandPostorderTraversal/Solution.java:11
MethodbuildTree
(int[] preorder, int[] inorder)
105-ConstructBinaryTreefromPreorderandInorderTraversal/Solution.java:11
MethodcanCompleteCircuit
(int[] gas, int[] cost)
134-GasStation/Solution.java:2
MethodcanJump
(int[] nums)
55-JumpGame/Solution.java:2
MethodcanJumpToPostionRecursive
(int[] nums, int position)
55-JumpGame/Solution.java:30
Methodcandy
(int[] ratings)
135-Candy/Solution.java:2
MethodclimbStairs
(int n)
70-ClimbingStairs/Solution.java:18
MethodcloneGraph
(UndirectedGraphNode node)
133-CloneGraph/Solution.java:12
MethodcombinationSum
(int[] candidates, int target)
39-CombinationSum/Solution.java:6
MethodcombinationSum2
(int[] candidates, int target)
40-CombinationSumII/Solution.java:6
Methodcombine
(int n, int k)
77-Combinations/Solution.java:6
Methodcompare
(Interval i1, Interval i2)
56-MergeIntervals/Solution.java:15
Methodcompare
(ListNode n1, ListNode n2)
23-MergekSortedLists/Solution.java:19
Methodconnect
(TreeLinkNode root)
117-PopulatingNextRightPointersinEachNodeII/Solution.java:10
Methodconnect
(TreeLinkNode root)
116-PopulatingNextRightPointersinEachNode/Solution.java:10
Methodconvert
(String s, int numRows)
6-ZigZagConversion/Solution.java:2
MethodcopyRandomList
(RandomListNode head)
138-CopyListwithRandomPointer/Solution.java:10
MethodcountAndSay
(int n)
38-CountandSay/Solution.java:2
MethoddeleteDuplicates
(ListNode head)
83-RemoveDuplicatesfromSortedList/Solution.java:10
MethoddeleteDuplicates
(ListNode head)
82-RemoveDuplicatesfromSortedListII/Solution.java:10
MethoddetectCycle
(ListNode head)
142-LinkedListCycleII/Solution.java:13
Methoddivide
(int dividend, int divisor)
29-DivideTwoIntegers/Solution.java:2
MethodevalRPN
(String[] tokens)
150-EvaluateReversePolishNotation/Solution.java:2
Methodexist
(char[][] board, String word)
79-WordSearch/Solution.java:2
MethodfindLadders
(String start, String end, List<String> wordList)
126-WordLadderII/Solution.java:2
MethodfindMin
(int[] nums)
154-FindMinimuminRotatedSortedArrayII/Solution.java:2
MethodfindMin
(int[] nums)
153-FindMinimuminRotatedSortedArray/Solution.java:2
MethodfindSubstring
(String s, String[] words)
30-SubstringwithConcatenationofAllWords/Solution.java:2
MethodfirstMissingPositive
(int[] nums)
41-FirstMissingPositive/Solution.java:2
next →1–100 of 225, ranked by callers