MCPcopy Create free account

hub / github.com/course-dasheng/fe-algorithm / functions

Functions267 in github.com/course-dasheng/fe-algorithm

↓ 107 callersMethodpush
(item)
interview/heap.js:11
↓ 36 callersMethodpop
()
interview/heap.js:23
↓ 5 callersFunctiongetNum
* @param {number} n * @return {boolean}
other/202.快乐数.js:12
↓ 5 callersFunctionsleep
(n,name='test')
interview/limit-promise.js:19
↓ 5 callersFunctionsleep
(n,name='test')
interview/limit.js:45
↓ 4 callersFunctioncalcLaunchTime
(arr,k)
interview/calc-launch-time.js:7
↓ 4 callersMethodpeek
()
interview/295.数据流的中位数.js:52
↓ 4 callersMethodpush
(item)
interview/295.数据流的中位数.js:17
↓ 3 callersFunctionsolution
(blocks)
interview/frog-jump.js:21
↓ 3 callersMethodswap
(i,j)
interview/295.数据流的中位数.js:65
↓ 3 callersMethodswap
(i,j)
interview/502.ipo.js:72
↓ 3 callersMethodswap
(i,j)
interview/347.前-k-个高频元素.js:70
↓ 3 callersMethodswap
(i,j)
interview/heap.js:59
↓ 3 callersMethodswap
(i,j)
interview/215.数组中的第k个最大元素.js:69
↓ 2 callersFunctionfn
(item)
interview/limit-promise.js:40
↓ 2 callersFunctionlast
* @param {number} val * @return {void}
interview/155.最小栈.js:19
↓ 2 callersFunctionleftpad
(str,length,ch)
interview/leftpad.js:8
↓ 2 callersFunctionleftpad2
(str,length,ch)
interview/leftpad.js:24
↓ 2 callersMethodpop
()
interview/295.数据流的中位数.js:29
↓ 2 callersFunctionprintMatrix
(n, m)
interview/matrix.js:2
↓ 2 callersFunctionrobRange
(nums,start,end)
dynamic/213.打家劫舍-ii.js:28
↓ 2 callersFunctionsend
()
count.js:43
↓ 2 callersMethodsinkDown
(k)
interview/347.前-k-个高频元素.js:42
↓ 1 callersFunctionasyncPool
({ limit, items, fn })
interview/limit-promise.js:1
↓ 1 callersFunctionbacktrack
(digits,l,i)
recursion/17.电话号码的字母组合.js:28
↓ 1 callersFunctionbacktrack
(index)
recursion/78.子集.js:17
↓ 1 callersFunctionbacktrack
(i,sum)
recursion/39.组合总和.js:20
↓ 1 callersFunctionbacktrack
(list,temp,nums)
recursion/46.全排列.js:21
↓ 1 callersFunctionbacktrack
(i)
recursion/93.复原-ip-地址.js:22
↓ 1 callersFunctionbacktrack
(n,k,i)
recursion/77.组合.js:19
↓ 1 callersFunctionbacktrack
(row,tmp)
recursion/51.n-皇后.js:18
↓ 1 callersFunctionbacktrack
(used)
recursion/47.全排列-ii.js:20
↓ 1 callersFunctionbacktrack
(i)
recursion/131.分割回文串.js:34
↓ 1 callersFunctiondfs
(node, level)
interview/剑指offer045.剑指 Offer II 045. 二叉树最底层最左边的值.js:21
↓ 1 callersFunctiondfs
(index,count,target)
interview/18.四数之和.js:21
↓ 1 callersFunctiondfs
(node)
dynamic/337.打家劫舍-iii.js:24
↓ 1 callersFunctiondfs
(root1,root2)
tree/617.合并二叉树.js:23
↓ 1 callersFunctiondfs
(root)
tree/543.二叉树的直径.js:22
↓ 1 callersFunctiondfs
(root)
tree/94.二叉树的中序遍历.js:23
↓ 1 callersFunctiondfs
(root)
tree/145.二叉树的后序遍历.js:22
↓ 1 callersFunctionfind
(i,j,cur)
recursion/79.单词搜索.js:43
↓ 1 callersFunctiongenerateHtml
(arr)
interview/简历格式生成.js:25
↓ 1 callersFunctiongenerateResume
(str)
interview/简历格式生成.js:5
↓ 1 callersFunctiongetMoney
( number)
interview/coins.js:4
↓ 1 callersFunctiongetMoney1
( number,option={})
interview/coins.js:33
↓ 1 callersFunctionisPalindrome
* @param {string} s * @return {string[][]}
recursion/131.分割回文串.js:12
↓ 1 callersFunctionisSameTree
(p, q)
tree/572.另一棵树的子树.js:36
↓ 1 callersFunctionisValid
(board, row,col,k)
recursion/37.解数独.js:41
↓ 1 callersFunctionlimit
(maxCount)
interview/limit.js:7
↓ 1 callersFunctionmerge
(head1,head2)
interview/23.合并k个升序链表.js:61
↓ 1 callersFunctionmergeLists
(lists,start,end)
interview/23.合并k个升序链表.js:51
↓ 1 callersFunctionnext
()
interview/limit.js:13
↓ 1 callersMethodpeek
()
interview/347.前-k-个高频元素.js:57
↓ 1 callersMethodpeek
()
interview/215.数组中的第k个最大元素.js:56
↓ 1 callersMethodpop
()
interview/502.ipo.js:36
↓ 1 callersMethodpop
()
interview/215.数组中的第k个最大元素.js:33
↓ 1 callersFunctionpreTravese
(root,list)
tree/114.二叉树展开为链表.js:33
↓ 1 callersFunctionpush
(fn,resolve,args)
interview/limit.js:28
↓ 1 callersMethodpush
(item)
interview/502.ipo.js:24
↓ 1 callersMethodpush
(item)
interview/347.前-k-个高频元素.js:22
↓ 1 callersMethodpush
(item)
interview/215.数组中的第k个最大元素.js:21
↓ 1 callersFunctionquick1
(arr,start,end)
sort/sort.js:59
↓ 1 callersFunctionquickSort1
(arr,start,end)
sort/sort.js:80
↓ 1 callersMethodshiftUp
(k)
interview/295.数据流的中位数.js:22
↓ 1 callersMethodshiftUp
(k)
interview/502.ipo.js:29
↓ 1 callersMethodshiftUp
(k)
interview/347.前-k-个高频元素.js:27
↓ 1 callersMethodshiftUp
(k)
interview/heap.js:16
↓ 1 callersMethodshiftUp
(k)
interview/215.数组中的第k个最大元素.js:26
↓ 1 callersMethodsinkDown
(k)
interview/295.数据流的中位数.js:37
↓ 1 callersMethodsinkDown
(k)
interview/502.ipo.js:44
↓ 1 callersMethodsinkDown
(k)
interview/heap.js:31
↓ 1 callersMethodsinkDown
(k)
interview/215.数组中的第k个最大元素.js:41
↓ 1 callersFunctionsortArr
(arr)
interview/字符串排序.js:7
↓ 1 callersFunctionstart
()
interview/limit-promise.js:30
↓ 1 callersFunctionstart
()
interview/limit.js:55
↓ 1 callersFunctiontravese
(node)
tree/99.恢复二叉搜索树.js:26
↓ 1 callersFunctiontravese
(node)
tree/404.左叶子之和.js:22
↓ 1 callersFunctiontravese
(root1,root2)
tree/101.对称二叉树.js:21
↓ 1 callersFunctiontravese
(head,tail)
tree/109.有序链表转换二叉搜索树.js:36
↓ 1 callersFunctiontravese
(node)
tree/222.完全二叉树的节点个数.js:21
↓ 1 callersFunctiontravese
(node,path=[])
tree/257.二叉树的所有路径.js:23
↓ 1 callersFunctiontravese
(node)
tree/98.验证二叉搜索树.js:23
↓ 1 callersFunctiontravese
(node)
tree/110.平衡二叉树.js:22
FunctionAuthenticationManager
(timeToLive)
interview/1797.设计一个验证系统.js:11
FunctionBrowserHistory
(homepage)
interview/1472.设计浏览器历史记录.js:11
FunctionLFUCache
(capacity)
interview/460.lfu-缓存.js:11
FunctionLRUCache
(capacity)
linklist/146.lru-缓存.js:12
FunctionLinkNode
(val,next)
interview/707.设计链表.js:14
FunctionMedianFinder
()
interview/295.数据流的中位数.js:71
FunctionMinStack
()
interview/155.最小栈.js:9
FunctionMyLinkedList
()
interview/707.设计链表.js:18
FunctionMyQueue
()
stack/232.用栈实现队列.js:11
FunctionMyStack
()
stack/225.用队列实现栈.js:9
FunctionNestedIterator
(nestedList)
interview/341.扁平化嵌套列表迭代器.js:38
FunctionRandomizedSet
()
interview/380.o-1-时间插入、删除和获取随机元素.js:9
FunctionRecentCounter
()
interview/933.最近的请求次数.js:9
FunctionSolution
(nums)
interview/384.打乱数组.js:11
FunctionTrie
()
interview/208.实现-trie-前缀树.js:9
FunctionaddTwoNumbers
(l1, l2)
interview/2.两数相加.js:21
FunctionaverageOfLevels
(root)
tree/637.二叉树的层平均值.js:20
next →1–100 of 267, ranked by callers