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 callersFunctiontripleToSparse
(triple, m, n)
Target Offer/multiSparse.py:25
↓ 1 callersMethodtwoSum
(self, nums, target)
leetcode/1. Two Sum.py:10
↓ 1 callersMethodwidthOfTree
(self, pRoot)
Target Offer/树的宽度.py:13
↓ 1 callersMethodzigzagLevelOrder
(self, root)
leetcode/103. Binary Tree Zigzag Level Order Traversal.py:26
MethodAdd
(self, num1, num2)
Target Offer/不用加减乘除做加法.py:23
FunctionDec2Bin
(decNumber)
Stack.py:83
MethodDeserialize
(self, s)
Target Offer/序列化二叉树.py:28
MethodFindContinuousSequence
(self, tsum)
Target Offer/和为s的连续整数序列.py:6
MethodFindFirstCommonNode
(self, pHead1, pHead2)
Target Offer/两个链表的第一个公共结点.py:11
MethodFindGreatestSumOfSubArray
(self, array)
Target Offer/连续子数组的最大和.py:9
MethodFindNumsAppearOnce
(self, array)
Target Offer/数组中只出现一次的数字.py:37
MethodFirstAppearingOnce
(self)
Target Offer/字符流中第一个不重复的字符.py:13
MethodGetMedian
(self, x)
Target Offer/数据流中的中位数.py:19
MethodGetNext
(self, pNode)
Target Offer/二叉树的下一个结点.py:13
MethodGetNext
(self, pNode)
Target Offer/二叉树的下一个结点.py:32
MethodInsert
(self, num)
Target Offer/数据流中的中位数.py:12
MethodInsert
(self, char)
Target Offer/字符流中第一个不重复的字符.py:20
MethodInversePairs
(self, data)
Target Offer/数组中的逆序对.py:8
MethodIsBalanced_Solution
(self, pRoot)
Target Offer/判断平衡二叉树.py:15
MethodIsBalanced_Solution
(self, pRoot)
Target Offer/判断平衡二叉树.py:34
MethodIsPopOrder
(self, pushV, popV)
Target Offer/栈的压入弹出序列.py:11
MethodKthNode
(self, pRoot, k)
Target Offer/二叉搜索树的第k个结点.py:29
MethodKthNode2
(self, pRoot, k)
Target Offer/二叉搜索树的第k个结点.py:37
MethodLastRemaining_Solution
(self, n, m)
Target Offer/约瑟夫环.py:8
MethodMirror
(self, root)
Target Offer/二叉树的镜像.py:13
MethodMirrorNoRecursion
(self, root)
Target Offer/二叉树的镜像.py:46
MethodMoreThanHalfNum_Solution
(self, numbers)
Target Offer/数组中出现次数超过一半的数字.py:9
MethodPermutation
(self, ss)
Target Offer/字符串的排列和组合.py:11
FunctionPrint1ToMaxOfNDigits
(n)
Target Offer/打印1到最大的n位数.py:6
MethodPrintMatrix
(self, matrix)
Target Offer/顺时针打印矩阵.py:53
MethodPrintMinNumber2
(self, numbers)
Target Offer/把数组排成最小的数.py:21
MethodReverseListRec
(self, pHead)
Target Offer/反转链表.py:28
MethodReverseSentence
(self, s)
Target Offer/翻转单词顺序.py:12
MethodSerialize
(self, root)
Target Offer/序列化二叉树.py:12
MethodSum_Solution2
(self, n)
Target Offer/求前n项和.py:21
MethodTreeDepth
(self, pRoot)
Target Offer/二叉树的深度.py:14
MethodTreeDepth2
(self, pRoot)
Target Offer/二叉树的深度.py:20
Method__contains__
(self, key)
AVL.py:168
Method__contains__
(self, key)
BinarySearchTree.py:103
Method__delitem__
(self, key)
AVL.py:188
Method__delitem__
(self, key)
BinarySearchTree.py:123
Method__getitem__
(self, key)
AVL.py:165
Method__getitem__
(self, key)
Hash.py:79
Method__getitem__
(self, key)
BinarySearchTree.py:100
Method__init__
(self)
BinaryHeap.py:3
Method__init__
(self, key, val, left = None, right = None, parent = None)
AVL.py:3
Method__init__
(self)
AVL.py:45
Method__init__
(self)
Stack.py:5
Method__init__
(self)
Hash.py:27
Method__init__
(self)
Queue.py:2
Method__init__
(self)
Queue.py:39
Method__init__
(self, rootObj)
BinaryTree.py:2
Method__init__
(self, initdata)
Lists.py:2
Method__init__
(self)
Lists.py:25
Method__init__
(self, key, val, left = None, right = None, parent = None)
BinarySearchTree.py:3
Method__init__
(self)
BinarySearchTree.py:45
Method__init__
(self, x)
Target Offer/递归和非递归实现二叉搜索树的三种遍历.py:7
Method__init__
(self, aList)
Target Offer/分治法解决最近对问题.py:2
Method__init__
(self, x=None)
Target Offer/在O(1)时间内删除链表结点.py:5
Method__init__
(self, x)
Target Offer/对称的二叉树.py:8
Method__init__
(self, x)
Target Offer/序列化二叉树.py:7
Method__init__
(self, x)
Target Offer/按之字形顺序打印二叉树.py:8
Method__init__
(self, x)
Target Offer/两个链表的第一个公共结点.py:7
Method__init__
(self, x)
Target Offer/链表中环的入口结点.py:7
Method__init__
(self, x)
Target Offer/二叉搜索树与双向链表.py:8
Method__init__
(self)
Target Offer/数据流中的中位数.py:8
Method__init__
(self, x)
Target Offer/合并两个排序的链表.py:6
Method__init__
(self, x)
Target Offer/二叉树的深度.py:8
Method__init__
(self, x)
Target Offer/树的子结构.py:8
Method__init__
(self)
Target Offer/字符流中第一个不重复的字符.py:10
Method__init__
(self)
Target Offer/包含min函数的栈.py:7
Method__init__
(self, x)
Target Offer/树的宽度.py:8
Method__init__
(self, x)
Target Offer/从上往下打印二叉树.py:11
Method__init__
(self, x)
Target Offer/复杂链表的复制.py:8
Method__init__
(self, x=None)
Target Offer/反向打印链表.py:5
Method__init__
(self, x)
Target Offer/二叉树的镜像.py:7
Method__init__
(self, x)
Target Offer/二叉搜索树的第k个结点.py:13
Method__init__
(self)
Target Offer/二叉搜索树的第k个结点.py:19
Method__init__
(self, x)
Target Offer/判断平衡二叉树.py:7
Method__init__
(self)
Target Offer/判断平衡二叉树.py:12
Method__init__
(self, x)
Target Offer/反转链表.py:8
Method__init__
(self)
Target Offer/用两个栈实现队列.py:7
Method__init__
(self, x)
Target Offer/二叉树中和为某一值的路径.py:7
Method__init__
(self, x = 0)
Target Offer/Singleton.py:75
Method__init__
(self, x)
Target Offer/二叉树的下一个结点.py:7
Method__init__
(self, x)
Target Offer/重建二叉树.py:9
Method__init__
(self, x)
Target Offer/删除链表中重复的结点.py:9
Method__init__
(self, x)
Target Offer/二叉搜索树的最低公共祖先.py:7
Method__init__
(self, x)
Target Offer/链表中倒数第k个结点.py:16
Method__init__
(self)
Target Offer/用两个队列实现栈.py:6
Method__init__
(self, val)
Target Offer/二叉树的最低公共祖先.py:6
Method__init__
(self, x)
Target Offer/把二叉树打印成多行.py:7
Method__init__
(self, x)
leetcode/21. Merge Two Sorted Lists.py:7
Method__init__
(self, x)
leetcode/226. Invert Binary Tree.py:20
Method__init__
(self, x)
leetcode/2. Add Two Numbers.py:7
Method__init__
(self, x)
leetcode/24. Swap Nodes in Pairs.py:11
Method__init__
(self, x)
leetcode/19. Remove Nth Node From End of List.py:8
Method__init__
(self, x)
leetcode/106. Construct Binary Tree from Inorder and Postorder Traversal.py:7
Method__init__
(self, x)
leetcode/83. Remove Duplicates from Sorted List.py:11
Method__init__
(self, x)
leetcode/203. Remove Linked List Elements.py:9
← previousnext →301–400 of 495, ranked by callers