Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/Blankj/awesome-java-leetcode
/ functions
Functions
156 in github.com/Blankj/awesome-java-leetcode
⨍
Functions
156
◇
Types & classes
70
↓ 17 callers
Method
createTestData
创建测试数据 @param data [XX,XX,null,xx] @return {@link TreeNode}
src/com/blankj/structure/TreeNode.java:27
↓ 12 callers
Method
createTestData
创建测试数据 @param data [XX,XX,XX] @return {@link ListNode}
src/com/blankj/structure/ListNode.java:26
↓ 11 callers
Method
print
(ListNode listNode)
src/com/blankj/structure/ListNode.java:40
↓ 9 callers
Method
myAtoi
(String str)
src/com/blankj/medium/_0008/Solution.java:12
↓ 8 callers
Method
print
竖向打印二叉树 @param root 二叉树根节点
src/com/blankj/structure/TreeNode.java:61
↓ 7 callers
Method
isMatch
(String s, String p)
src/com/blankj/hard/_0010/Solution.java:42
↓ 6 callers
Method
insert
(List<Interval> intervals, Interval newInterval)
src/com/blankj/hard/_0057/Solution.java:18
↓ 6 callers
Method
isPalindrome
(int x)
src/com/blankj/easy/_0009/Solution.java:22
↓ 4 callers
Method
lengthOfLongestSubstring
(String s)
src/com/blankj/medium/_0003/Solution.java:12
↓ 4 callers
Method
reverse
(int x)
src/com/blankj/easy/_0007/Solution.java:12
↓ 4 callers
Method
searchInsert
(int[] nums, int target)
src/com/blankj/easy/_0035/Solution.java:12
↓ 3 callers
Method
createTestData
创建测试数据 @param data [[X,X],[X,X],[X,X]] @return {@link List<Interval>}
src/com/blankj/structure/Interval.java:34
↓ 3 callers
Method
findSubstring
(String s, String[] words)
src/com/blankj/hard/_0030/Solution.java:20
↓ 3 callers
Method
fullJustify
(String[] words, int maxWidth)
src/com/blankj/hard/_0044/Solution.java:58
↓ 3 callers
Method
helper
(int[] nums1, int m, int[] nums2, int n, int k)
src/com/blankj/hard/_0004/Solution.java:20
↓ 3 callers
Method
isSymmetric
(TreeNode root)
src/com/blankj/easy/_0101/Solution.java:27
↓ 3 callers
Method
levelOrderBottom
(TreeNode root)
src/com/blankj/easy/_0107/Solution.java:18
↓ 3 callers
Method
maxDepth
(TreeNode root)
src/com/blankj/easy/_0104/Solution.java:15
↓ 3 callers
Method
print
(List<Interval> list)
src/com/blankj/structure/Interval.java:44
↓ 2 callers
Method
convert
(String s, int numRows)
src/com/blankj/medium/_0006/Solution.java:35
↓ 2 callers
Method
deleteDuplicates
(ListNode head)
src/com/blankj/easy/_0083/Solution.java:14
↓ 2 callers
Method
findMedianSortedArrays
(int[] nums1, int[] nums2)
src/com/blankj/hard/_0004/Solution.java:12
↓ 2 callers
Method
helper
(double x, int n)
src/com/blankj/medium/_0050/Solution.java:17
↓ 2 callers
Method
intToRoman
(int num)
src/com/blankj/medium/_0012/Solution.java:12
↓ 2 callers
Method
isSameTree
(TreeNode p, TreeNode q)
src/com/blankj/easy/_0100/Solution.java:15
↓ 2 callers
Method
isValid
(String s)
src/com/blankj/easy/_0020/Solution.java:12
↓ 2 callers
Method
lengthOfLastWord
(String s)
src/com/blankj/easy/_0058/Solution.java:12
↓ 2 callers
Method
longestPalindrome
(String s)
src/com/blankj/medium/_0005/Solution.java:61
↓ 2 callers
Method
maxArea
(int[] height)
src/com/blankj/medium/_0011/Solution.java:12
↓ 2 callers
Method
maxProfit
(int[] prices)
src/com/blankj/easy/_0121/Solution.java:13
↓ 2 callers
Method
maxProfit
(int[] prices)
src/com/blankj/easy/_0122/Solution.java:13
↓ 2 callers
Method
printSpace
(int count)
src/com/blankj/structure/TreeNode.java:77
↓ 2 callers
Method
recoverFromPreorder
(String S)
src/com/blankj/hard/_1028/Solution.java:43
↓ 2 callers
Method
removeNthFromEnd
(ListNode head, int n)
src/com/blankj/medium/_0019/Solution.java:14
↓ 2 callers
Method
romanToInt
(String s)
src/com/blankj/easy/_0013/Solution.java:15
↓ 2 callers
Method
strStr
(String haystack, String needle)
src/com/blankj/easy/_0028/Solution.java:12
↓ 1 callers
Method
addBinary
(String a, String b)
src/com/blankj/easy/_0067/Solution.java:12
↓ 1 callers
Method
addTwoNumbers
(ListNode l1, ListNode l2)
src/com/blankj/medium/_0002/Solution.java:14
↓ 1 callers
Method
climbStairs
(int n)
src/com/blankj/easy/_0070/Solution.java:12
↓ 1 callers
Method
countAndSay
(int n)
src/com/blankj/easy/_0038/Solution.java:12
↓ 1 callers
Method
diameterOfBinaryTree
(TreeNode root)
src/com/blankj/easy/_0543/Solution.java:17
↓ 1 callers
Method
divide
(int dividend, int divisor)
src/com/blankj/medium/_0029/Solution.java:12
↓ 1 callers
Method
divingBoard
(int shorter, int longer, int k)
src/com/blankj/easy/_16_11/Solution.java:14
↓ 1 callers
Method
fourSum
(int[] nums, int target)
src/com/blankj/medium/_0018/Solution.java:57
↓ 1 callers
Method
fullJustify
(String[] words, int maxWidth)
src/com/blankj/hard/_0068/Solution.java:16
↓ 1 callers
Method
generate
(int numRows)
src/com/blankj/easy/_0118/Solution.java:17
↓ 1 callers
Method
generateParenthesis
(int n)
src/com/blankj/medium/_0022/Solution.java:32
↓ 1 callers
Method
getRow
(int rowIndex)
src/com/blankj/easy/_0119/Solution.java:16
↓ 1 callers
Method
groupAnagrams
(String[] strs)
src/com/blankj/medium/_0049/Solution.java:19
↓ 1 callers
Method
hasPathSum
(TreeNode root, int sum)
src/com/blankj/easy/_0112/Solution.java:15
↓ 1 callers
Method
helper
(TreeNode root)
src/com/blankj/easy/_0543/Solution.java:22
↓ 1 callers
Method
helper
(TreeNode node)
src/com/blankj/easy/_0110/Solution.java:19
↓ 1 callers
Method
helper
(int[] nums, int left, int right)
src/com/blankj/easy/_0108/Solution.java:20
↓ 1 callers
Method
helper
(List<List<Integer>> list, TreeNode root, int level)
src/com/blankj/easy/_0107/Solution.java:24
↓ 1 callers
Method
helper
(int[] nums, int left, int right)
src/com/blankj/easy/_0053/Solution.java:24
↓ 1 callers
Method
isBalanced
(TreeNode root)
src/com/blankj/easy/_0110/Solution.java:15
↓ 1 callers
Method
kSum
(int[] nums, int start, int k, int target)
src/com/blankj/medium/_0018/Solution.java:66
↓ 1 callers
Method
leastBricks
(List<List<Integer>> wall)
src/com/blankj/medium/_0554/Solution.java:18
↓ 1 callers
Method
letterCombinations
(String digits)
src/com/blankj/medium/_0017/Solution.java:37
↓ 1 callers
Method
longestCommonPrefix
(String[] strs)
src/com/blankj/easy/_0014/Solution.java:12
↓ 1 callers
Method
maxScoreSightseeingPair
(int[] A)
src/com/blankj/medium/_1014/Solution.java:13
↓ 1 callers
Method
maxSubArray
(int[] nums)
src/com/blankj/easy/_0053/Solution.java:20
↓ 1 callers
Method
merge
(List<Interval> intervals)
src/com/blankj/medium/_0056/Solution.java:18
↓ 1 callers
Method
merge
(int[] nums1, int m, int[] nums2, int n)
src/com/blankj/easy/_0088/Solution.java:14
↓ 1 callers
Method
mergeKLists
(ListNode[] lists)
src/com/blankj/hard/_0023/Solution.java:46
↓ 1 callers
Method
mergeTwoLists
(ListNode l1, ListNode l2)
src/com/blankj/easy/_0021/Solution.java:14
↓ 1 callers
Method
minDepth
(TreeNode root)
src/com/blankj/easy/_0111/Solution.java:25
↓ 1 callers
Method
minSubArrayLen
(int s, int[] nums)
src/com/blankj/medium/_0209/Solution.java:44
↓ 1 callers
Method
multiply
(String num1, String num2)
src/com/blankj/medium/_0043/Solution.java:12
↓ 1 callers
Method
myPow
(double x, int n)
src/com/blankj/medium/_0050/Solution.java:12
↓ 1 callers
Method
mySqrt
(int x)
src/com/blankj/easy/_0069/Solution.java:12
↓ 1 callers
Method
plusOne
(int[] digits)
src/com/blankj/easy/_0066/Solution.java:14
↓ 1 callers
Method
printNode
(int val)
src/com/blankj/structure/TreeNode.java:83
↓ 1 callers
Method
removeDuplicates
(int[] nums)
src/com/blankj/easy/_0026/Solution.java:12
↓ 1 callers
Method
removeElement
(int[] nums, int val)
src/com/blankj/easy/_0027/Solution.java:12
↓ 1 callers
Method
reverse
(ListNode pre, ListNode next)
src/com/blankj/hard/_0025/Solution.java:29
↓ 1 callers
Method
reverseKGroup
(ListNode head, int k)
src/com/blankj/hard/_0025/Solution.java:14
↓ 1 callers
Method
search
(int[] nums, int target)
src/com/blankj/medium/_0033/Solution.java:12
↓ 1 callers
Method
sortedArrayToBST
(int[] nums)
src/com/blankj/easy/_0108/Solution.java:15
↓ 1 callers
Method
swapPairs
(ListNode head)
src/com/blankj/medium/_0024/Solution.java:22
↓ 1 callers
Method
threeSum
(int[] nums)
src/com/blankj/medium/_0015/Solution.java:16
↓ 1 callers
Method
threeSumClosest
(int[] nums, int target)
src/com/blankj/medium/_0016/Solution.java:14
↓ 1 callers
Method
twoSum
(int[] nums, int target)
src/com/blankj/easy/_0001/Solution.java:26
↓ 1 callers
Method
uniquePathsWithObstacles
(int[][] obstacleGrid)
src/com/blankj/medium/_0067/Solution.java:12
Method
Interval
()
src/com/blankj/structure/Interval.java:18
Method
ListNode
(int x)
src/com/blankj/structure/ListNode.java:16
Method
TreeNode
(int x)
src/com/blankj/structure/TreeNode.java:17
Method
compare
(ListNode o1, ListNode o2)
src/com/blankj/hard/_0023/Solution.java:49
Method
compare
(Interval o1, Interval o2)
src/com/blankj/medium/_0056/Solution.java:21
Method
main
(String[] args)
src/com/blankj/hard/_0068/Solution.java:57
Method
main
(String[] args)
src/com/blankj/hard/_0057/Solution.java:41
Method
main
(String[] args)
src/com/blankj/hard/_1028/Solution.java:73
Method
main
(String[] args)
src/com/blankj/hard/_0030/Solution.java:71
Method
main
(String[] args)
src/com/blankj/hard/_0023/Solution.java:68
Method
main
(String[] args)
src/com/blankj/hard/_0004/Solution.java:35
Method
main
(String[] args)
src/com/blankj/hard/_0025/Solution.java:41
Method
main
(String[] args)
src/com/blankj/hard/_0044/Solution.java:101
Method
main
(String[] args)
src/com/blankj/hard/_0010/Solution.java:70
Method
main
(String[] args)
src/com/blankj/medium/_0018/Solution.java:101
Method
main
(String[] args)
src/com/blankj/medium/_0043/Solution.java:37
next →
1–100 of 156, ranked by callers