MCPcopy Create free account

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

Functions374 in github.com/andavid/leetcode-java

⨍ Functions 374◇ Types & classes 256
MethodSolution
(int[] nums)
en/384.shuffle-an-array.java:41
MethodaddBinary
(String a, String b)
en/67.add-binary.java:34
MethodaddNum
(int num)
en/295.find-median-from-data-stream.java:69
MethodaddTwoNumbers
(ListNode l1, ListNode l2)
en/445.add-two-numbers-ii.java:43
MethodaddTwoNumbers
(ListNode l1, ListNode l2)
en/2.add-two-numbers.java:39
MethodbinaryTreePaths
(TreeNode root)
en/257.binary-tree-paths.java:46
MethodbinaryTreePaths
(TreeNode root)
zh/257.二叉树的所有路径.java:47
MethodbstToGst
(TreeNode root)
en/1038.binary-search-tree-to-greater-sum-tree.java:71
MethodbuildTree
(int[] inorder, int[] postorder)
en/106.construct-binary-tree-from-inorder-and-postorder-traversal.java:18
MethodbuildTree
(int[] preorder, int[] inorder)
en/105.construct-binary-tree-from-preorder-and-inorder-traversal.java:18
MethodbuildTree
(int[] preorder, int[] inorder)
zh/105.从前序与中序遍历序列构造二叉树.java:49
MethodbuildTree
(int[] inorder, int[] postorder)
zh/106.从中序与后序遍历序列构造二叉树.java:50
MethodcanJump
(int[] nums)
en/55.jump-game.java:45
MethodcheckInclusion
(String s1, String s2)
en/567.permutation-in-string.java:48
MethodcheckInclusion
(String s1, String s2)
zh/567.字符串的排列.java:50
MethodclimbStairs
(int n)
en/70.climbing-stairs.java:44
MethodcoinChange
(int[] coins, int amount)
en/322.coin-change.java:40
MethodcombinationSum
(int[] candidates, int target)
en/39.combination-sum.java:55
MethodcombinationSum2
(int[] candidates, int target)
en/40.combination-sum-ii.java:55
Methodcombine
(int n, int k)
en/77.combinations.java:36
Methodcompare
(Integer o1, Integer o2)
en/347.top-k-frequent-elements.java:18
Methodcompare
(String o1, String o2)
en/692.top-k-frequent-words.java:18
Methodcompare
(int[] p1, int[] p2)
en/406.queue-reconstruction-by-height.java:43
Methodconnect
(Node root)
en/116.populating-next-right-pointers-in-each-node.java:82
Methodconnect
(Node root)
zh/116.填充每个节点的下一个右侧节点指针.java:80
Methodconnect
(Node root)
zh/117.填充每个节点的下一个右侧节点指针-ii.java:89
MethodcontainsDuplicate
(int[] nums)
en/217.contains-duplicate.java:39
MethodcontainsNearbyDuplicate
(int[] nums, int k)
en/219.contains-duplicate-ii.java:49
Methodconvert
(String s, int numRows)
en/6.zig-zag-conversion.java:55
MethodconvertToTitle
(int n)
en/168.excel-sheet-column-title.java:54
MethodcountAndSay
(int n)
en/38.count-and-say.java:52
MethodcountBits
(int num)
en/338.counting-bits.java:43
MethodcountPrimes
(int n)
en/204.count-primes.java:26
MethodcountSubstrings
(String s)
en/647.palindromic-substrings.java:52
MethoddailyTemperatures
(int[] T)
en/739.daily-temperatures.java:30
MethoddeQueue
Delete an element from the circular queue. Return true if the operation is successful.
en/622.design-circular-queue.java:97
MethoddecodeString
(String s)
en/394.decode-string.java:41
MethoddecodeString
(String s)
zh/394.字符串解码.java:57
MethoddeleteDuplicates
(ListNode head)
en/83.remove-duplicates-from-sorted-list.java:43
MethoddeleteFront
Deletes an item from the front of Deque. Return true if the operation is successful.
en/641.design-circular-deque.java:103
MethoddeleteLast
Deletes an item from the rear of Deque. Return true if the operation is successful.
en/641.design-circular-deque.java:112
MethoddeleteNode
(TreeNode root, int data)
en/450.delete-node-in-a-bst.java:70
MethoddeleteNode
(ListNode node)
en/237.delete-node-in-a-linked-list.java:63
Methoddeserialize
(String data)
en/297.serialize-and-deserialize-binary-tree.java:116
Methoddeserialize
(String data)
en/449.serialize-and-deserialize-bst.java:61
Methoddeserialize
(String s)
zh/385.迷你语法分析器.java:82
Methoddeserialize
(String data)
zh/297.二叉树的序列化与反序列化.1.java:100
Methoddeserialize
(String data)
zh/297.二叉树的序列化与反序列化.java:74
MethoddetectCycle
(ListNode head)
en/142.linked-list-cycle-ii.java:68
MethoddiameterOfBinaryTree
(TreeNode root)
en/543.diameter-of-binary-tree.java:55
Methoddivide
(int dividend, int divisor)
en/29.divide-two-integers.java:48
Methodempty
Returns whether the queue is empty.
en/232.implement-queue-using-stacks.java:83
MethodenQueue
Insert an element into the circular queue. Return true if the operation is successful.
en/622.design-circular-queue.java:84
MethodevalRPN
(String[] tokens)
en/150.evaluate-reverse-polish-notation.java:61
MethodevalRPN
(String[] tokens)
zh/150.逆波兰表达式求值.java:81
Methodexist
(char[][] board, String word)
en/79.word-search.java:39
Methodfib
(int n)
en/509.fibonacci-number.java:59
MethodfindAnagrams
(String s, String p)
zh/438.找到字符串中所有字母异位词.java:60
MethodfindBottomLeftValue
(TreeNode root)
en/513.find-bottom-left-tree-value.java:64
MethodfindDisappearedNumbers
(int[] nums)
en/448.find-all-numbers-disappeared-in-an-array.java:35
MethodfindDuplicate
(int[] nums)
en/287.find-the-duplicate-number.java:45
MethodfindErrorNums
(int[] nums)
en/645.set-mismatch.java:45
MethodfindKthLargest
(int[] nums, int k)
en/215.kth-largest-element-in-an-array.1.java:35
MethodfindKthLargest
(int[] data, int k)
en/215.kth-largest-element-in-an-array.java:35
MethodfindLengthOfLCIS
(int[] nums)
en/674.longest-continuous-increasing-subsequence.java:46
MethodfindMedian
()
en/295.find-median-from-data-stream.java:77
MethodfindMedianSortedArrays
(int[] nums1, int[] nums2)
en/4.median-of-two-sorted-arrays.java:43
MethodfindMin
(int[] nums)
zh/153.寻找旋转排序数组中的最小值.java:38
MethodfindMin
(int[] nums)
zh/154.寻找旋转排序数组中的最小值-ii.java:45
MethodfindPeakElement
(int[] nums)
en/162.find-peak-element.java:50
MethodfindPeakElement
(int[] nums)
zh/162.寻找峰值.java:46
MethodfindSecondMinimumValue
(TreeNode root)
en/671.second-minimum-node-in-a-binary-tree.java:69
MethodfindTheDifference
(String s, String t)
en/389.find-the-difference.java:38
MethodfindUnsortedSubarray
(int[] nums)
en/581.shortest-unsorted-continuous-subarray.java:39
MethodfirstBadVersion
(int n)
en/278.first-bad-version.java:42
MethodfirstBadVersion
(int n)
zh/278.第一个错误的版本.java:41
MethodfirstUniqChar
(String s)
en/387.first-unique-character-in-a-string.java:33
MethodfizzBuzz
(int n)
en/412.fizz-buzz.java:47
MethodfourSum
(int[] nums, int target)
en/18.4-sum.java:39
MethodfractionToDecimal
(int numerator, int denominator)
en/166.fraction-to-recurring-decimal.java:44
Methodgenerate
(int numRows)
en/118.pascals-triangle.java:37
MethodgenerateParenthesis
(int n)
en/22.generate-parentheses.java:7
MethodgenerateTrees
(int n)
en/95.unique-binary-search-trees-ii.java:16
MethodgetFront
Get the front item from the deque.
en/641.design-circular-deque.java:121
MethodgetIntersectionNode
(ListNode headA, ListNode headB)
en/160.intersection-of-two-linked-lists.java:96
MethodgetMin
()
en/155.min-stack.java:74
MethodgetRandom
Get a random element from the set.
en/380.insert-delete-get-random-o-1.java:96
MethodgetRear
Get the last item from the deque.
en/641.design-circular-deque.java:129
MethodgetRow
(int rowIndex)
en/119.pascals-triangle-ii.java:36
MethodgetSum
(int a, int b)
en/371.sum-of-two-integers.java:39
MethodgroupAnagrams
(String[] strs)
en/49.group-anagrams.java:38
MethodguessNumber
(int n)
zh/374.猜数字大小.java:46
MethodhammingDistance
(int x, int y)
en/461.hamming-distance.java:40
MethodhammingWeight
(int n)
en/191.number-of-1-bits.java:68
MethodhasCycle
(ListNode head)
en/141.linked-list-cycle.java:72
MethodhasNext
@return whether we have a next smallest number
en/173.binary-search-tree-iterator.java:41
MethodhasPathSum
(TreeNode root, int sum)
en/112.path-sum.java:48
MethodhasPathSum
(TreeNode root, int sum)
zh/112.路径总和.java:47
MethodincreasingTriplet
(int[] nums)
en/334.increasing-triplet-subsequence.java:47
MethodinorderTraversal
(TreeNode root)
en/94.binary-tree-inorder-traversal.java:41
← previousnext →101–200 of 374, ranked by callers