Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
Create free account
hub
/
github.com/Jensenczx/CodeEveryday
/ functions
Functions
269 in github.com/Jensenczx/CodeEveryday
⨍
Functions
269
◇
Types & classes
150
↓ 1 callers
Method
travel
(ArrayList<Integer> nums,ArrayList<ArrayList<Integer>> result,int start,int end)
65_permute.java:17
↓ 1 callers
Method
travelTree
(TreeNode root,List<Integer> list)
55_bstToDoublyList.java:40
↓ 1 callers
Method
traverTheTree
(List<TreeNode> list,ArrayList<ArrayList<Integer>> result)
52_levelOrder.java:51
Method
DoublyListNode
(int val)
55_bstToDoublyList.java:12
Method
Interval
(int start, int end)
14_countOfAirplanes.java:3
Method
ListNode
(int val)
10_DeleteNode.java:4
Method
MinAdjustmentCost
@param A: An integer array. @param target: An integer.
24_MinAdjustmentCost.java:7
Method
MinStack
()
51_minstack.java:6
Method
Queue
()
33_QueueByStack.java:5
Method
RandomListNode
(int x)
54_copyRandomList.java:4
Method
SegmentTree
(int start,int end,int max)
91_countOfSmallerNumber.java:5
Method
SegmentTree
(int start,int end,long sum)
89_intervalSum.java:14
Method
SegmentTree
(int start,int end,int min)
88_intervalMinNumber.java:13
Method
Solution
()
38_singleton.java:7
Method
TreeNode
(int val)
11_BinaryTreePaths.java:6
Method
TreeNode
(int val)
48_binaryTreePathSum.java:6
Method
TreeNode
(int val)
17_TreeisIdentical.java:4
Method
TreeNode
(int val)
55_bstToDoublyList.java:4
Method
TreeNode
(int val)
39_buildTree.java:4
Method
addBinary
@param a a number @param b a number @return the result
61_addBinary.java:7
Method
addLists
@param l1: the first list @param l2: the second list @return: the sum list of l1 and l2
80_addLists.java:7
Method
anagram
@param s: The first string @param b: The second string @return true or false
76_anagram.java:7
Method
aplusb
(int a, int b)
16_2_aplusb.java:7
Method
backPack
@param m: An integer m denotes the size of a backpack @param A: Given n items with size A[i] @return: The maximum size
18_backPack.java:7
Method
backPackII
@param m: An integer m denotes the size of a backpack @param A & V: Given n items with size A[i] and value V[i] @return: The maximum value
19_backPackII.java:7
Method
binarySearch
@param nums: The integer array. @param target: Target to find. @return: The first position of target. Position starts from 0.
73_binarySearch.java:7
Method
binaryTreePathSum
@param root the root of binary tree @param target an integer @return all valid paths
48_binaryTreePathSum.java:17
Method
binaryTreePaths
@param root the root of the binary tree @return all root-to-leaf paths
11_BinaryTreePaths.java:17
Method
bstToDoublyList
@param root: The root of tree @return: the head of doubly list node
55_bstToDoublyList.java:23
Method
build
@param A: a list of integer @return: The root of Segment Tree
86_buildSegmetTree.java:19
Method
build
@param start, end: Denote an segment / interval @return: The root of Segment Tree
83_segmentTreeNodeBuild.java:17
Method
buildTree
@param preorder : A list of integers that preorder traversal of a tree @param inorder : A list of integers that inorder traversal of a tree @return :
39_buildTree.java:16
Method
calSubStringNum
(String str)
untitled.java:6
Method
canJump
@param A: A list of integers @return: The boolean answer
28_canJump.java:6
Method
climbStairs
@param n: An integer @return: An integer
32_climstair.java:6
Method
combine
@param n: Given the range of numbers @param k: Given the numbers of combinations @return: All the combinations of k numbers out of 1..n
69_combine.java:7
Method
compareStrings
@param A : A string includes Upper Case letters @param B : A string includes Upper Case letter @return : if string A contains all of the characters i
81_compareStrings.java:7
Method
copyRandomList
@param pHead: The pHead of linked list with a random pointer. @return: A new pHead of a deep copy of the list.
54_copyRandomList.java:11
Method
countOfAirplanes
@param intervals: An interval array @return: Count of airplanes are in the sky.
14_countOfAirplanes.java:14
Method
countOfSmallerNumber
@param A: An integer array @return: The number of element in the array that are smaller that the given integer
91_countOfSmallerNumber.java:20
Method
countOnes
@param num: an integer @return: an integer, the number of ones in num
36_countOnes.java:6
Method
deleteDuplicates
@param ListNode head is the head of the linked list @return: ListNode head of linked list
119_deleteDuplicates.java:17
Method
deleteNode
@param node: the node in the list should be deleted @return: nothing
10_DeleteNode.java:15
Method
digitCounts
(int k, int n)
60_digitCounts.java:7
Method
draw
()
101_shapeFactory.java:8
Method
draw
()
101_shapeFactory.java:13
Method
draw
()
101_shapeFactory.java:23
Method
draw
()
101_shapeFactory.java:32
Method
fastPower
(int a, int b, int n)
47_fastPower.java:6
Method
fibonacci
@param n: an integer @return an integer f(n)
35_fibonacci.java:6
Method
findFirstBadVersion
@param n: An integers. @return: An integer which is the first bad version.
93_findFirstBadVersion.java:13
Method
findMin
@param num: a rotated sorted array @return: the minimum number in the array
37_findMinNumInRrveseArray.java:6
Method
findMissing
@param nums: an array of integers @return: an integer
12_findMissing.java:6
Method
findPeak
@param A: An integers array. @return: return any of peek positions.
74_findPeak.java:6
Method
firstWillWin
@param n: an integer @return: a boolean which equals to true if the first player will win
25_firstWillWin1.java:6
Method
fizzBuzz
param n: As description. return: A list of strings.
34_fizzBuzz.java:6
Method
flatten
@param root: a TreeNode, the root of the binary tree @return: nothing
62_flatten.java:6
Method
generateParenthesis
@param n n pairs @return All combinations of well-formed parentheses
107_generateParenthesis.java:6
Method
getInstance
()
38_singleton.java:10
Method
getIntersectionNode
@param headA: the first list @param headB: the second list @return: a ListNode
58_getIntersectionNode.java:7
Method
getLongest
(int n,String s)
2_Periods.java:27
Method
getLongest1
(int n, String s)
2_Periods.java:4
Method
getShape
@param shapeType a string @return Get object of type Shape
101_shapeFactory.java:44
Method
getTheArrayByNum
(int num)
13_plusOne.java:47
Method
getTheMinStartTime
(List<Interval> airplanes)
14_countOfAirplanes.java:43
Method
getTheRealNumByArray
(int[] array)
13_plusOne.java:39
Method
getToy
@param type a string @return Get object of the type
99_ToyFactory.java:24
Method
grayCode
@param n a number @return Gray code
123_grayCode.java:6
Method
hanoi
(int n)
67_hanoi.java:1
Method
hashCode
(char[] key, int HASH_SIZE)
132_hashcode.java:17
Method
houseRobber
@param A: An array of non-negative integers. return: The maximum amount of money you can rob tonight
23_houseRobber.java:6
Method
intersection
@param nums1 an integer array @param nums2 an integer array @return an integer array
125_intersection.java:7
Method
intersection
@param nums1 an integer array @param nums2 an integer array @return an integer array
124.intersection.java:8
Method
intervalMinNumber
@param A, queries: Given an integer array and an query list @return: The result list
88_intervalMinNumber.java:26
Method
intervalSum
@param A, queries: Given an integer array and an query list @return: The result list
89_intervalSum.java:28
Method
isHappy
@param n an integer @return true if this is a happy number or false
126_isHappy.java:7
Method
isPalindrome
@param s A string @return Whether the string is a valid palindrome
98_isPalindrome.java:6
Method
isSubtree
@param T1, T2: The roots of binary tree. @return: True if T2 is a subtree of T1, or false.
41_isSubtree.java:6
Method
isUgly
@param num an integer @return true if num is an ugly number or false
110_isugly.java:6
Method
isUnique
@param str: a string @return: a boolean
77_isUnique.java:6
Method
kthLargestElement
(int k, int[] nums)
57_kthLargestElement.java:7
Method
kthPrimeNumber
(int k)
59_kthPrimeNumber.java:7
Method
leftPad
@param originalStr the string we want to append to with spaces @param size the target length of the string @return a string
122_leftPad.java:7
Method
letterCombinations
@param digits A digital string @return all posible letter combinations
109_letterCombination.java:6
Method
levelOrder
(TreeNode root)
52_levelOrder.java:8
Method
levelOrder
@param root: The root of binary tree. @return: Level order a list of lists of integer
52_levelOrder.java:41
Method
longestCommonSubsequence
(String A, String B)
20_longestCommonSubstring.java:39
Method
longestCommonSubstring
@param A, B: Two string. @return: the length of the longest common substring.
20_longestCommonSubstring.java:6
Method
longestIncreasingContinuousSubsequence
@param A an array of Integer @return an integer
27_longestIncreasingContinuousSubsequence.java:6
Method
longestIncreasingSubsequence
@param nums: The integer array @return: The length of LIS (longest increasing subsequence)
21_longestIncreasingSubsequence.java:6
Method
longestWords
@param dictionary: an array of strings @return: an arraylist of strings
9_longestWords.java:6
Method
main
(String[]args)
63_median.java:50
Method
main
(String[]args)
97_transformString.java:41
Method
main
(String[]args)
11_BinaryTreePaths.java:44
Method
main
(String[]args)
13_plusOne.java:62
Method
main
(String[]args)
15_restoreIpAddresses.java:51
Method
main
(String []args)
2_Periods.java:66
Method
main
(String[] args)
75_countAndSay.java:38
Method
main
(String[]args)
28_canJump.java:44
Method
main
(String[] args)
untitled.java:2
← previous
next →
101–200 of 269, ranked by callers