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
Method
main
(String[] args)
4_HappyNumber.java:32
Method
main
(String[] args)
1_Gloves.java:43
Method
main
(String[]args)
17_TreeisIdentical.java:25
Method
main
(String[]args)
115_numSquares.java:51
Method
main
(String[]args)
6_BitSwapRequired.java:17
Method
main
(String[] args)
7_isValidParentheses.java:30
Method
main
(String []args)
3_LengthOfLastWord.java:32
Method
main
(String[]args)
53_spiralOrder.java:40
Method
majorityNumber
@param nums: a list of integers @return: find a majority number
8_majorityNumber.java:6
Method
majorityNumber
@param nums: A list of integers @return: The majority number that occurs more than 1/3
118_majorityNumber.java:6
Method
maxProfit
@param prices: Given an integer array @return: Maximum profit
117_maxProfit1.java:6
Method
maxProfit
@param prices: Given an integer array @return: Maximum profit
116_maxProfit.java:6
Method
maxSquare
@param matrix: a matrix of 0 and 1 @return: an integer
113_maxSquare.java:6
Method
maxSubArray
@param nums: A list of integers @return: A integer indicate the sum of max subarray
56_maxSubArray.java:6
Method
mergeSortedArray
(int[] A, int m, int[] B, int n)
129_mergesortedArray.java:11
Method
mergeSortedArray
@param A and B: sorted integer array A and B. @return: A new sorted integer array
92_mergeSortedArray.java:6
Method
mergeTwoLists
@param ListNode l1 is the head of the linked list @param ListNode l2 is the head of the linked list @return: ListNode head of linked list
44_mergeTwoLists.java:7
Method
min
()
51_minstack.java:27
Method
minCost
@param costs n x 3 cost matrix @return an integer, the minimum cost to paint all houses
100_paintingHouseMinCost.java:6
Method
minDepth
@param root: The root of binary tree. @return: An integer.
96_minDepth.java:17
Method
minDistance
@param word1 & word2: Two string. @return: The minimum number of steps.
26_minDistance.java:6
Method
minPathSum
@param grid: a list of lists of integers. @return: An integer, minimizes the sum of all numbers along its path
29_minPathSum.java:6
Method
minSubArray
@param nums: a list of integers @return: A integer indicate the sum of minimum subarray
114_minSubArray.java:6
Method
minimumTotal
@param triangle: a list of lists of integers. @return: An integer, minimum path sum.
22_minimumTotal.java:6
Method
missNum
(int[] array)
64_missNum.java:1
Method
modify
@param root, index, value: The root of segment tree and @ change the node's value with [index, index] to the new given value @return: void
85_modifySegmentTree.java:20
Method
nextPermutation
@param nums: an array of integers @return: return nothing (void), do not return anything, modify nums in-place instead
102_nextPermutation.java:6
Method
nthSuperUglyNumber
@param n a positive integer @param primes the given prime list @return the nth super ugly number
111_nthSuperUglyNumber.java:7
Method
nthToLast
@param head: The first node of linked list. @param n: An integer. @return: Nth to last node of a singly linked list.
79_nthToLast.java:7
Method
numWays
@param n non-negative integer, n posts @param k non-negative integer, k colors @return an integer, the total number of ways
104_numWays.java:7
Method
numbersByRecursion
@param n: An integer. return : An array storing 1 to the largest number with n digits.
46_numbersByRecursion.java:6
Method
partition
@param head: The first node of linked list. @param x: an integer @return: a ListNode
78_listpartition.java:7
Method
partitionArray
@param nums: The integer array you should partition @param k: As description return: The index after partition
70_partitionArray.java:7
Method
partitionArray
@param nums: an array of integers @return: nothing
42_partitionArray.java:6
Method
permutationIndex
@param A an integer array @return a long integer
5_PermutationIndex.java:6
Method
permute
@param nums: A list of integers. @return: A list of permutations.
65_permute.java:6
Method
pop
()
51_minstack.java:21
Method
postorderTraversal
@param root: The root of binary tree. @return: Postorder in ArrayList which contains node values.
50_postorderTraversal.java:7
Method
productExcludeItself
(ArrayList<Integer> A)
131_productExcludeItself.java:9
Method
push
(int number)
51_minstack.java:12
Method
query
@param root, start, end: The root of segment tree and an segment / interval @return: The maximum number in the interval [start
84_segmentTreeQuery.java:20
Method
query
@param root, start, end: The root of segment tree and an segment / interval @return: The count number in the interval [start,
90_segmentTreequery2.java:20
Method
removeElements
@param head a ListNode @param val an integer @return a ListNode
82_removeElements.java:7
Method
removeNthFromEnd
@param head: The first node of linked list. @param n: An integer. @return: The head of linked list.
43_removeNthFromEnd.java:7
Method
reverse
@param head: The head of linked list. @return: The new head of reversed linked list.
45_reverse.java:6
Method
reverseInteger
@param n the integer to be reversed @return the reversed integer
87_reverseInteger.java:6
Method
reversePairs
@param A an array @return total of reverse pairs
105_reversePairs.java:6
Method
rotateString
@param str: an array of char @param offset: an integer @return: nothing
94_rotateString.java:7
Method
searchInsert
param A : an integer sorted array param target : an integer to be inserted return : an integer
112_searchInsert.java:7
Method
searchMatrix
@param matrix: A list of lists of integers @param: A number you want to search in the matrix @return: An integer indicate the occurrence of target in
40_searchMatrix.java:7
Method
simplifyPath
@param path the original path @return the simplified path
121_simplifyPath.java:6
Method
singleNumber
@param A : an integer array return : a integer
16_1_singleNumber.java:6
Method
singleNumberII
@param A : An integer array @return : An integer
120_singleNumberII.java:6
Method
solveNQueens
Get all distinct N-Queen solutions @param n: The number of queens @return: All distinct solutions For example, A string '...Q' shows a queen on forth
133.solveNQueens.java:8
Method
sortLetters
@param chars: The letter array you should sort by Case @return: void
68_sortLetters.java:6
Method
sortedArrayToBST
@param A: an integer array @return: a tree node
95_sortedArrayToBST.java:17
Method
strStr
Returns a index to the first occurrence of target in source, or -1 if target is not part of source. @param source string to be scanned. @param target
108_strStr.java:8
Method
stringPermutation
@param A a string @param B a string @return a boolean
49_stringPermutation.java:7
Method
subarraySum
@param nums: A list of integers @return: A list of integers includes the index of the first number and the index of the last number
127_subarraySum.java:7
Method
swapPairs
@param head a ListNode @return a ListNode
106_swapPairs.java:14
Method
talk
()
99_ToyFactory.java:2
Method
talk
()
99_ToyFactory.java:7
Method
talk
()
99_ToyFactory.java:14
Method
threeSum
@param numbers : Give an array numbers of n integer @return : Find all unique triplets in the array which gives the sum of zero.
72_threeSum.java:6
Method
top
()
33_QueueByStack.java:30
Method
trailingZeros
(long n)
103_trailingZeros.java:6
Method
twoSum
(int[] numbers, int target)
71_twosum.java:7
Method
uniquePaths
@param n, m: positive integer (1 <= n ,m <= 100) @return an integer
30_uniquePaths.java:6
Method
uniquePathsWithObstacles
@param obstacleGrid: A list of lists of integers @return: An integer
31_uniquePathsWithObstacles.java:6
← previous
201–269 of 269, ranked by callers