Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/andavid/leetcode-java
/ functions
Functions
374 in github.com/andavid/leetcode-java
⨍
Functions
374
◇
Types & classes
256
Method
inorderTraversal
(TreeNode root)
zh/94.二叉树的中序遍历.1.java:44
Method
inorderTraversal
(TreeNode root)
zh/94.二叉树的中序遍历.java:44
Method
insertFront
Adds an item at the front of Deque. Return true if the operation is successful.
en/641.design-circular-deque.java:83
Method
insertLast
Adds an item at the rear of Deque. Return true if the operation is successful.
en/641.design-circular-deque.java:93
Method
intToRoman
(int num)
en/12.integer-to-roman.java:83
Method
intersect
(int[] nums1, int[] nums2)
en/350.intersection-of-two-arrays-ii.java:52
Method
intersect
(int[] nums1, int[] nums2)
zh/350.两个数组的交集-ii.java:48
Method
intersect
(int[] nums1, int[] nums2)
zh/350.两个数组的交集-ii.1.java:48
Method
intersection
(int[] nums1, int[] nums2)
en/349.intersection-of-two-arrays.java:42
Method
intersection
(int[] nums1, int[] nums2)
zh/349.两个数组的交集.1.java:44
Method
intersection
(int[] nums1, int[] nums2)
zh/349.两个数组的交集.2.java:44
Method
intersection
(int[] nums1, int[] nums2)
zh/349.两个数组的交集.java:44
Method
invertTree
(TreeNode root)
en/226.invert-binary-tree.java:55
Method
invertTree
(TreeNode root)
zh/226.翻转二叉树.java:54
Method
isAnagram
(String s, String t)
en/242.valid-anagram.java:40
Method
isBalanced
(TreeNode root)
en/110.balanced-binary-tree.java:65
Method
isHappy
(int n)
en/202.happy-number.java:37
Method
isIsomorphic
(String s, String t)
en/205.isomorphic-strings.java:46
Method
isMatch
(String s, String p)
en/10.regular-expression-matching.java:87
Method
isPalindrome
(int x)
en/9.palindrome-number.java:50
Method
isPalindrome
(ListNode head)
en/234.palindrome-linked-list.java:41
Method
isPalindrome
(String s)
en/125.valid-palindrome.java:36
Method
isPowerOfThree
(int n)
en/326.power-of-three.java:45
Method
isPowerOfTwo
(int n)
en/231.power-of-two.java:39
Method
isSameTree
(TreeNode p, TreeNode q)
en/100.same-tree.java:16
Method
isSubtree
(TreeNode s, TreeNode t)
en/572.subtree-of-another-tree.java:74
Method
isSymmetric
(TreeNode root)
en/101.symmetric-tree.java:53
Method
isSymmetric
(TreeNode root)
zh/101.对称二叉树.1.java:59
Method
isSymmetric
(TreeNode root)
zh/101.对称二叉树.java:59
Method
isValid
(String s)
en/20.valid-parentheses.java:63
Method
isValidBST
(TreeNode root)
en/98.validate-binary-search-tree.java:61
Method
isValidSudoku
(char[][] board)
en/36.valid-sudoku.java:83
Method
kthSmallest
(TreeNode root, int k)
en/230.kth-smallest-element-in-a-bst.java:16
Method
largestValues
(TreeNode root)
en/515.find-largest-value-in-each-tree-row.java:43
Method
largestValues
(TreeNode root)
zh/515.在每个树行中找最大值.java:45
Method
leafSimilar
(TreeNode root1, TreeNode root2)
en/872.leaf-similar-trees.java:49
Method
leastInterval
(char[] tasks, int n)
en/621.task-scheduler.java:49
Method
lengthLongestPath
(String input)
zh/388.文件的最长绝对路径.java:67
Method
lengthOfLIS
(int[] nums)
en/300.longest-increasing-subsequence.java:39
Method
lengthOfLIS
(int[] nums)
zh/300.最长上升子序列.2.java:37
Method
lengthOfLIS
(int[] nums)
zh/300.最长上升子序列.java:37
Method
lengthOfLastWord
(String s)
en/58.length-of-last-word.java:35
Method
lengthOfLongestSubstring
(String s)
en/3.longest-substring-without-repeating-characters.java:50
Method
lengthOfLongestSubstring
(String s)
zh/3.无重复字符的最长子串.java:44
Method
lengthOfLongestSubstring
(String s)
zh/3.无重复字符的最长子串.1.java:44
Method
letterCombinations
(String digits)
en/17.letter-combinations-of-a-phone-number.java:38
Method
levelOrder
(TreeNode root)
en/102.binary-tree-level-order-traversal.java:49
Method
levelOrder
(TreeNode root)
zh/102.二叉树的层序遍历.java:52
Method
levelOrderBottom
(TreeNode root)
en/107.binary-tree-level-order-traversal-ii.java:16
Method
levelOrderBottom
(TreeNode root)
zh/107.二叉树的层次遍历-ii.java:50
Method
longestCommonPrefix
(String[] strs)
en/14.longest-common-prefix.java:40
Method
longestPalindrome
(String s)
en/409.longest-palindrome.java:38
Method
longestPalindrome
(String s)
en/5.longest-palindromic-substring.java:37
Method
lowestCommonAncestor
(TreeNode root, TreeNode p, TreeNode q)
en/235.lowest-common-ancestor-of-a-binary-search-tree.java:16
Method
lowestCommonAncestor
(TreeNode root, TreeNode p, TreeNode q)
en/236.lowest-common-ancestor-of-a-binary-tree.java:16
Method
lowestCommonAncestor
(TreeNode root, TreeNode p, TreeNode q)
zh/236.二叉树的最近公共祖先.java:63
Method
majorityElement
(int[] nums)
en/169.majority-element.java:37
Method
maxArea
(int[] height)
en/11.container-with-most-water.java:42
Method
maxArea
(int[] height)
zh/11.盛最多水的容器.java:38
Method
maxAreaOfIsland
(int[][] grid)
en/695.max-area-of-island.java:48
Method
maxDepth
(TreeNode root)
en/104.maximum-depth-of-binary-tree.java:45
Method
maxDepth
(TreeNode root)
zh/104.二叉树的最大深度.java:46
Method
maxDepth
(TreeNode root)
zh/104.二叉树的最大深度.1.java:48
Method
maxProfit
(int[] prices)
en/122.best-time-to-buy-and-sell-stock-ii.java:57
Method
maxProfit
(int k, int[] prices)
en/188.best-time-to-buy-and-sell-stock-iv.java:45
Method
maxProfit
(int[] prices)
en/121.best-time-to-buy-and-sell-stock.java:43
Method
maxProfit
(int[] prices)
en/123.best-time-to-buy-and-sell-stock-iii.java:55
Method
maxSlidingWindow
(int[] nums, int k)
en/239.sliding-window-maximum.java:7
Method
maxSubArray
(int[] nums)
en/53.maximum-subarray.java:32
Method
merge
(int[] nums1, int m, int[] nums2, int n)
en/88.merge-sorted-array.java:38
Method
merge
(int[][] intervals)
en/56.merge-intervals.java:39
Method
mergeKLists
(ListNode[] lists)
en/23.merge-k-sorted-lists.java:39
Method
mergeTrees
(TreeNode t1, TreeNode t2)
en/617.merge-two-binary-trees.java:58
Method
mergeTwoLists
(ListNode l1, ListNode l2)
en/21.merge-two-sorted-lists.java:29
Method
middleNode
(ListNode head)
en/876.middle-of-the-linked-list.java:66
Method
minDepth
(TreeNode root)
en/111.minimum-depth-of-binary-tree.java:45
Method
minDepth
(TreeNode root)
zh/111.二叉树的最小深度.java:47
Method
minDistance
(String word1, String word2)
en/72.edit-distance.java:51
Method
minWindow
(String s, String t)
zh/76.最小覆盖子串.java:34
Method
minimumTotal
(List<List<Integer>> triangle)
en/120.triangle.java:37
Method
missingNumber
(int[] nums)
en/268.missing-number.java:36
Method
moveZeroes
(int[] nums)
en/283.move-zeroes.java:31
Method
myAtoi
(String str)
en/8.string-to-integer-atoi.java:87
Method
myPow
(double x, int n)
en/50.pow-x-n.java:49
Method
mySqrt
(int x)
en/69.sqrt-x.java:42
Method
next
@return the next smallest number
en/173.binary-search-tree-iterator.java:29
Method
nextGreaterElement
(int[] nums1, int[] nums2)
en/496.next-greater-element-i.java:62
Method
nextGreaterElements
(int[] nums)
en/503.next-greater-element-ii.java:40
Method
numDecodings
(String s)
en/91.decode-ways.java:45
Method
numIslands
(char[][] grid)
en/200.number-of-islands.java:46
Method
numTrees
(int n)
en/96.unique-binary-search-trees.java:7
Method
oddEvenList
(ListNode head)
en/328.odd-even-linked-list.java:55
Method
openLock
(String[] deadends, String target)
zh/752.打开转盘锁.java:78
Method
pathSum
(TreeNode root, int sum)
en/437.path-sum-iii.java:57
Method
permute
(int[] nums)
en/46.permutations.java:35
Method
permute
(int[] nums)
zh/46.全排列.java:37
Method
permuteUnique
(int[] nums)
en/47.permutations-ii.java:33
Method
plusOne
(int[] digits)
en/66.plus-one.java:40
Method
pop
Removes the element on top of the stack and returns that element.
en/225.implement-stack-using-queues.java:66
Method
postorderTraversal
(TreeNode root)
en/145.binary-tree-postorder-traversal.java:42
← previous
next →
201–300 of 374, ranked by callers