Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/chenxiangcyr/leetcode-answers
/ functions
Functions
225 in github.com/chenxiangcyr/leetcode-answers
⨍
Functions
225
◇
Types & classes
148
Method
flatten
(TreeNode root)
114-FlattenBinaryTreetoLinkedList/Solution.java:11
Method
fourSum
(int[] nums, int target)
18-4Sum/Solution.java:2
Method
fullJustify
(String[] words, int L)
68-TextJustification/Solution.java:2
Method
generate
(int numRows)
118-PascalsTriangle/Solution.java:2
Method
generateMatrix
(int n)
59-SpiralMatrixII/Solution.java:2
Method
generateParenthesis
(int n)
22-GenerateParentheses/Solution.java:2
Method
getIntersectionNode
(ListNode headA, ListNode headB)
160-IntersectionofTwoLinkedLists/Solution.java:13
Method
getMin
()
155-MinStack/Solution.java:34
Method
getRow
(int rowIndex)
119-PascalsTriangleII/Solution.java:2
Method
grayCode
(int n)
89-GrayCode/Solution.java:2
Method
groupAnagrams
(String[] strs)
49-GroupAnagrams/Solution.java:2
Method
hasCycle
(ListNode head)
141-LinkedListCycle/Solution.java:13
Method
hasPathSum
(TreeNode root, int sum)
112-PathSum/Solution.java:11
Method
inorderTraversal
(TreeNode root)
94-BinaryTreeInorderTraversal/Solution.java:11
Method
insert
(List<Interval> intervals, Interval newInterval)
57-InsertInterval/Solution.java:11
Method
insertionSortList
(ListNode head)
147-InsertionSortList/Solution.java:10
Method
intToRoman
(int num)
12-IntegertoRoman/Solution.java:2
Method
isBalanced
(TreeNode root)
110-BalancedBinaryTree/Solution.java:11
Method
isInterleave
(String s1, String s2, String s3)
97-InterleavingString/Solution.java:2
Method
isMatch
(String s, String p)
44-WildcardMatching/Solution.java:2
Method
isMatchRecursive
(String text, String pattern)
10-RegularExpressionMatching/Solution.java:28
Method
isNumber
(String s)
65-ValidNumber/Solution.java:2
Method
isPalindrome
(String s)
125-ValidPalindrome/Solution.java:2
Method
isPalindrome
(int x)
9-PalindromeNumber/Solution.java:2
Method
isScramble
(String s1, String s2)
87-ScrambleString/Solution.java:2
Method
isSymmetric
(TreeNode root)
101-SymmetricTree/Solution.java:11
Method
isValid
(String s)
20-ValidParentheses/Solution.java:2
Method
isValidBST
(TreeNode root)
98-ValidateBinarySearchTree/Solution.java:11
Method
isValidSudoku
(char[][] board)
36-ValidSudoku/Solution.java:2
Method
jump
(int[] nums)
45-JumpGameII/Solution.java:2
Method
ladderLength
(String beginWord, String endWord, List<String> wordList)
127-WordLadder/Solution.java:2
Method
largestRectangleArea
(int[] heights)
84-LargestRectangleinHistogram/Solution.java:2
Method
lengthOfLastWord
(String s)
58-LengthofLastWord/Solution.java:2
Method
lengthOfLongestSubstring
(String s)
3-LongestSubstringWithoutRepeatingCharacters/Solution.java:2
Method
lengthOfLongestSubstringRecursive
(String s)
3-LongestSubstringWithoutRepeatingCharacters/Solution.java:48
Method
letterCombinations
(String digits)
17-LetterCombinationsofaPhoneNumber/Solution.java:6
Method
levelOrder
(TreeNode root)
102-BinaryTreeLevelOrderTraversal/Solution.java:11
Method
levelOrderBottom
(TreeNode root)
107-BinaryTreeLevelOrderTraversalII/Solution.java:11
Method
longestCommonPrefix
(String[] strs)
14-LongestCommonPrefix/Solution.java:2
Method
longestConsecutive
(int[] nums)
128-LongestConsecutiveSequence/Solution.java:2
Method
longestPalindrome
(String s)
5-LongestPalindromicSubstring/Solution.java:2
Method
longestPalindromeCenter
(String s)
5-LongestPalindromicSubstring/Solution.java:30
Method
longestPalindromeDP
(String s)
5-LongestPalindromicSubstring/Solution.java:7
Method
longestValidParentheses
(String s)
32-LongestValidParentheses/Solution.java:2
Method
maxArea
(int[] height)
11-ContainerWithMostWater/Solution.java:2
Method
maxDepth
(TreeNode root)
104-MaximumDepthofBinaryTree/Solution.java:11
Method
maxPathSum
(TreeNode root)
124-BinaryTreeMaximumPathSum/Solution.java:13
Method
maxPoints
(Point[] points)
149-MaxPointsonaLine/Solution.java:11
Method
maxProduct
(int[] nums)
152-MaximumProductSubarray/Solution.java:2
Method
maxProfit
(int[] prices)
121-BestTimetoBuyandSellStock/Solution.java:2
Method
maxProfit
(int[] prices)
122-BestTimetoBuyandSellStockII/Solution.java:2
Method
maxProfit
(int[] prices)
123-BestTimetoBuyandSellStockIII/Solution.java:2
Method
maxSubArray
(int[] nums)
53-MaximumSubarray/Solution.java:2
Method
maxSubArrayOld
(int[] nums)
53-MaximumSubarray/Solution.java:19
Method
maximalRectangle
(char[][] matrix)
85-MaximalRectangle/Solution.java:2
Method
merge
(List<Interval> intervals)
56-MergeIntervals/Solution.java:11
Method
merge
(int[] nums1, int m, int[] nums2, int n)
88-MergeSortedArray/Solution.java:2
Method
mergeKLists
(ListNode[] lists)
23-MergekSortedLists/Solution.java:10
Method
mergeTwoLists
(ListNode l1, ListNode l2)
21-MergeTwoSortedLists/Solution.java:10
Method
minCut
(String s)
132-PalindromePartitioningII/Solution.java:2
Method
minDepth
(TreeNode root)
111-MinimumDepthofBinaryTree/Solution.java:11
Method
minDistance
(String word1, String word2)
72-EditDistance/Solution.java:2
Method
minPathSum
(int[][] grid)
64-MinimumPathSum/Solution.java:2
Method
minWindow
(String s, String t)
76-MinimumWindowSubstring/Solution.java:2
Method
minimumTotal
(List<List<Integer>> triangle)
120-Triangle/Solution.java:2
Method
multiply
(String num1, String num2)
43-MultiplyStrings/Solution.java:2
Method
myAtoi
(String str)
8-StringtoIntegeratoi/Solution.java:2
Method
myPow
(double x, int n)
50-Powxn/Solution.java:2
Method
mySqrt
(int x)
69-Sqrtx/Solution.java:2
Method
numDecodings
(String s)
91-DecodeWays/Solution.java:2
Method
numDistinct
(String S, String T)
115-DistinctSubsequences/Solution.java:3
Method
numTrees
(int n)
96-UniqueBinarySearchTrees/Solution.java:2
Method
partition
(String s)
131-PalindromePartitioning/Solution.java:5
Method
partition
(ListNode head, int x)
86-PartitionList/Solution.java:10
Method
pathSum
(TreeNode root, int sum)
113-PathSumII/Solution.java:14
Method
permute
(int[] nums)
46-Permutations/Solution.java:5
Method
permuteUnique
(int[] nums)
47-PermutationsII/Solution.java:5
Method
plusOne
(int[] digits)
66-PlusOne/Solution.java:2
Method
postorderTraversal
(TreeNode root)
145-BinaryTreePostorderTraversal/Solution.java:11
Method
preorderTraversal
(TreeNode root)
144-BinaryTreePreorderTraversal/Solution.java:11
Method
removeDuplicates
(int[] nums)
26-RemoveDuplicatesfromSortedArray/Solution.java:2
Method
removeDuplicates
(int[] nums)
80-RemoveDuplicatesfromSortedArrayII/Solution.java:2
Method
removeElement
(int[] nums, int val)
27-RemoveElement/Solution.java:2
Method
removeNthFromEnd
(ListNode head, int n)
19-RemoveNthNodeFromEndofList/Solution.java:10
Method
reorderList
(ListNode head)
143-ReorderList/Solution.java:10
Method
restoreIpAddresses
(String s)
93-RestoreIPAddresses/Solution.java:6
Method
reverseKGroup
(ListNode head, int k)
25-ReverseNodesink-Group/Solution.java:10
Method
reverseWords
(String s)
151-ReverseWordsinaString/Solution.java:2
Method
romanToInt
(String s)
13-RomantoInteger/Solution.java:2
Method
rotate
(int[][] matrix)
48-RotateImage/Solution.java:2
Method
rotateRight
(ListNode head, int k)
61-RotateList/Solution.java:10
Method
search
(int[] nums, int target)
81-SearchinRotatedSortedArrayII/Solution.java:2
Method
search
(int[] nums, int target)
33-SearchinRotatedSortedArray/Solution.java:2
Function
searchInsert
35-SearchInsertPosition/Solution.c:1
Method
searchMatrix
(int[][] matrix, int target)
74-Searcha2DMatrix/Solution.java:2
Method
searchMatrixOriginal
(int[][] matrix, int target)
74-Searcha2DMatrix/Solution.java:27
Method
searchRange
(int[] nums, int target)
34-FindFirstandLastPositionofElementinSortedArray/Solution.java:2
Method
setZeroes
(int[][] matrix)
73-SetMatrixZeroes/Solution.java:2
Method
simplifyPath
(String path)
71-SimplifyPath/Solution.java:2
Method
singleNumber
(int[] nums)
137-SingleNumberII/Solution.java:2
← previous
next →
101–200 of 225, ranked by callers