MCPcopy Create free account

hub / github.com/Jack-Lee-Hiter/AlgorithmsByPython / functions

Functions495 in github.com/Jack-Lee-Hiter/AlgorithmsByPython

⨍ Functions 495◇ Types & classes 172
↓ 1 callersMethodConvert
(self, pRootOfTree)
Target Offer/二叉搜索树与双向链表.py:13
↓ 1 callersMethodDoesTree1haveTree2
(self, pRoot1, pRoot2)
Target Offer/树的子结构.py:26
↓ 1 callersMethodEntryNodeOfLoop
(self, pHead)
Target Offer/链表中环的入口结点.py:27
↓ 1 callersMethodFibonacci
(self, n)
Target Offer/斐波那契数列.py:8
↓ 1 callersMethodFindContinuousSequence2
(self, tsum)
Target Offer/和为s的连续整数序列.py:26
↓ 1 callersMethodFindFirstBitIs1
(self, num)
Target Offer/数组中只出现一次的数字.py:24
↓ 1 callersMethodFindGreatestSumOfSubArray2
(self, array)
Target Offer/连续子数组的最大和.py:26
↓ 1 callersMethodFindKthToTail
(self, head, k)
Target Offer/链表中倒数第k个结点.py:21
↓ 1 callersMethodFindNumbersWithSum
(self, array, tsum)
Target Offer/和为s的两个数字.py:12
↓ 1 callersMethodFindNumsAppearOnce
(self, array)
Target Offer/数组中只出现一次的数字.py:8
↓ 1 callersMethodFindPath
(self, root, sum)
Target Offer/二叉树中和为某一值的路径.py:13
↓ 1 callersMethodFirstNotRepeatingChar
(self, s)
Target Offer/第一个只出现一次的字符.py:7
↓ 1 callersMethodGetFirstK
(self, data, length, k, start, end)
Target Offer/数字在排序数组中出现的次数.py:17
↓ 1 callersMethodGetLastK
(self, data, length, k, start, end)
Target Offer/数字在排序数组中出现的次数.py:35
↓ 1 callersMethodGetLeastNumbers_Solution
(self, tinput, k)
Target Offer/最小的k个数.py:8
↓ 1 callersMethodGetNumberOfK
(self, data, k)
Target Offer/数字在排序数组中出现的次数.py:7
↓ 1 callersMethodGetUglyNumber_Solution
(self, index)
Target Offer/丑数.py:8
↓ 1 callersFunctionHanoi
(fromPole, withPole, toPole, diskNum)
Recursion.py:30
↓ 1 callersMethodHasSubtree
(self, pRoot1, pRoot2)
Target Offer/树的子结构.py:13
↓ 1 callersFunctionIncrement
(number)
Target Offer/打印1到最大的n位数.py:14
↓ 1 callersMethodInversePairs2
(self, data)
Target Offer/数组中的逆序对.py:55
↓ 1 callersMethodInversePairsCore
(self, data, copy, start, end)
Target Offer/数组中的逆序对.py:18
↓ 1 callersMethodIsBit1
(self, num, indexBit)
Target Offer/数组中只出现一次的数字.py:31
↓ 1 callersMethodIsContinuous
(self, numbers)
Target Offer/扑克牌的顺子.py:8
↓ 1 callersMethodIsPopOrder2
(self, pushV, popV)
Target Offer/栈的压入弹出序列.py:33
↓ 1 callersMethodJudge
(self, alist)
Target Offer/八皇后问题.py:37
↓ 1 callersMethodLCSLength
(self, A, B)
AwesomeAlgorithms/最长公共子序列LCS_DP问题.py:16
↓ 1 callersMethodLeftRotateString
(self, s, n)
Target Offer/字符串的左旋转.py:9
↓ 1 callersMethodMeetingNode
(self, pHead)
Target Offer/链表中环的入口结点.py:11
↓ 1 callersMethodMerge
(self, leftList, rightList, axis)
Target Offer/分治法解决最近对问题.py:22
↓ 1 callersMethodMerge
(self, pHead1, pHead2)
Target Offer/合并两个排序的链表.py:11
↓ 1 callersMethodMinInOrder
(self, array, front, end)
Target Offer/旋转数组的最小数字.py:51
↓ 1 callersMethodMirror2
(self, root)
Target Offer/二叉树的镜像.py:27
↓ 1 callersMethodNumberOf1
(self, n)
Target Offer/二进制中1的个数.py:6
↓ 1 callersMethodNumberOf1Between1AndN2
(self, n)
Target Offer/整数中1出现的次数.py:15
↓ 1 callersMethodNumberOf1Between1AndN_Solution
(self, n)
Target Offer/整数中1出现的次数.py:8
↓ 1 callersMethodNumberOf2
(self, n)
Target Offer/二进制中1的个数.py:15
↓ 1 callersMethodPermutation
(self, pointArr)
Target Offer/八皇后问题.py:16
↓ 1 callersMethodPermutation
(self, pointArr)
Target Offer/正方体对面和相同.py:13
↓ 1 callersMethodPower
(self, base, exponent)
Target Offer/数值的整数次方.py:20
↓ 1 callersFunctionPrint1ToMaxOfNDigits2
(n)
Target Offer/打印1到最大的n位数.py:50
↓ 1 callersFunctionPrint1ToMaxOfNDigitsRecursively
(number, length, index)
Target Offer/打印1到最大的n位数.py:59
↓ 1 callersMethodPrintFromTopToBottom
(self, root)
Target Offer/从上往下打印二叉树.py:17
↓ 1 callersMethodPrintMatrixInCircle
(self, matrix, columns, rows, start)
Target Offer/顺时针打印矩阵.py:25
↓ 1 callersMethodPrintMinNumber
(self, numbers)
Target Offer/把数组排成最小的数.py:9
↓ 1 callersFunctionPrintNodeAtLevel
(treeNode, level)
Target Offer/重建二叉树.py:32
↓ 1 callersFunctionPrintNodeByLevel
(treeNode, depth)
Target Offer/重建二叉树.py:42
↓ 1 callersFunctionPrintProbability
(number)
Target Offer/n个骰子的点数.py:7
↓ 1 callersMethodReconnectNodes
(self, pHead)
Target Offer/复杂链表的复制.py:42
↓ 1 callersMethodReorder
(self, pData, length, func)
Target Offer/调整数组顺序使奇数位于偶数前面.py:47
↓ 1 callersMethodReorderOddEven
(self, pData)
Target Offer/调整数组顺序使奇数位于偶数前面.py:70
↓ 1 callersMethodReverseSentence2
(self, s)
Target Offer/翻转单词顺序.py:55
↓ 1 callersFunctionSieve
(n)
Target Offer/输出连续质数序列.py:6
↓ 1 callersMethodStrToInt
(self, s)
Target Offer/把字符串转换成整数.py:8
↓ 1 callersFunctionSunday
(str1, str2)
AwesomeAlgorithms/Sunday算法.py:5
↓ 1 callersMethod_Symmetrical
(self, pRoot1, pRoot2)
leetcode/101. Symmetric Tree.py:29
↓ 1 callersMethod__new__
(cls, *args, **kwargs)
Target Offer/Singleton.py:41
↓ 1 callersMethod_put
(self, key, val, currentNode)
AVL.py:65
↓ 1 callersMethod_put
(self, key, val, currentNode)
BinarySearchTree.py:65
↓ 1 callersMethodaddBinary
(self, a, b)
leetcode/67. AddBinary.py:9
↓ 1 callersMethodaddFront
(self, item)
Queue.py:48
↓ 1 callersMethodanagramSolution1
(self, s1, s2)
AnagramDetection.py:5
↓ 1 callersMethodanagramSolution2
(self, s1, s2)
AnagramDetection.py:26
↓ 1 callersMethodanagramSolution3
(self, s1, s2)
AnagramDetection.py:52
↓ 1 callersMethodandOr
(self, m, n)
Target Offer/二进制中1的个数.py:29
↓ 1 callersFunctionbadCharTable
(pattern)
AwesomeAlgorithms/BoyerMoore算法.py:38
↓ 1 callersFunctionbinarySearch
(alist, item)
BinarySearch.py:4
↓ 1 callersMethodbitIs1
(self, n, i)
Target Offer/数组中只出现一次的数字.py:60
↓ 1 callersMethodbuild
(self, start, end, inorder, postorder, ind)
leetcode/106. Construct Binary Tree from Inorder and Postorder Traversal.py:31
↓ 1 callersMethodbuild
(self, start, end, preorder, inorder, ind)
leetcode/105. Construct Binary Tree from Preorder and Inorder Traversal.py:27
↓ 1 callersMethodbuildHeap
(self, alist)
BinaryHeap.py:49
↓ 1 callersFunctionbuildParseTree
(fpexp)
ParseTree.py:11
↓ 1 callersMethodbuildTree2
(self, inorder, postorder)
leetcode/106. Construct Binary Tree from Inorder and Postorder Traversal.py:25
↓ 1 callersMethodbulidTree
(self, s, sp)
leetcode/297. Serialize and Deserialize Binary Tree.py:43
↓ 1 callersMethodcalculate
(self)
Target Offer/分治法解决最近对问题.py:5
↓ 1 callersMethodcheck
(self, threshold, rows, cols, row, col, visited)
Target Offer/机器人的运动范围.py:24
↓ 1 callersFunctionclassifyVector
(inX, weights)
Logistic regression/Logistic.py:76
↓ 1 callersFunctionclipAlpha
(aj, H, L)
SVM/SVM.py:19
↓ 1 callersFunctioncoinRow
(coinrow)
Dynamic Programming.py:19
↓ 1 callersFunctioncolicTest
()
Logistic regression/Logistic.py:81
↓ 1 callersMethodcomlen
(self, s, p, q)
AwesomeAlgorithms/最长公共子串_DP问题.py:53
↓ 1 callersMethodcompareSum
(self, alist)
Target Offer/正方体对面和相同.py:33
↓ 1 callersFunctionconvertString2
(string)
Target Offer/转换字符串格式.py:22
↓ 1 callersMethoddelete
(self, key)
AVL.py:174
↓ 1 callersMethoddelete
(self, key)
BinarySearchTree.py:109
↓ 1 callersMethoddeleteDuplication
(self, pHead)
Target Offer/删除链表中重复的结点.py:13
↓ 1 callersMethoddeserialize
(self, s, sp)
Target Offer/序列化二叉树.py:33
↓ 1 callersMethodduplicate
(self, numbers, duplication)
Target Offer/数组中重复的数字.py:12
↓ 1 callersMethodduplicate2
(self, numbers)
Target Offer/数组中重复的数字.py:28
↓ 1 callersFunctionfindCommonLCS
(s)
Target Offer/字符串具有相同字符的最长子串.py:5
↓ 1 callersMethodfindMin
(self)
AVL.py:225
↓ 1 callersMethodfindMin
(self)
BinarySearchTree.py:160
↓ 1 callersMethodfindParent
(self, pNode1, pNode2, root)
Target Offer/二叉搜索树的最低公共祖先.py:12
↓ 1 callersMethodfindSuccessor
(self)
AVL.py:211
↓ 1 callersMethodfindSuccessor
(self)
BinarySearchTree.py:146
↓ 1 callersMethodfoo
(self)
mysingleton.py:3
↓ 1 callersFunctiongapInsertionSort
(alist, start, gap)
ShellSort.py:10
↓ 1 callersMethodget
(self, key)
AVL.py:145
↓ 1 callersMethodget
(self, key)
BinarySearchTree.py:80
↓ 1 callersMethodgetGray
(self, n)
Target Offer/格雷码.py:9
← previousnext →101–200 of 495, ranked by callers