MCPcopy Create free account

hub / github.com/DmrfCoder/AlgorithmAndDataStructure / functions

Functions192 in github.com/DmrfCoder/AlgorithmAndDataStructure

⨍ Functions 192◇ Types & classes 113
↓ 12 callersMethodpush
(self, node)
SwordToOffer/Code/5.py:7
↓ 10 callersMethodpop
(self)
SwordToOffer/Code/5.py:11
↓ 9 callersMethodGetMedian
(self,n=None)
SwordToOffer/Code/58.py:98
↓ 9 callersMethodInsert
(self, num)
SwordToOffer/Code/58.py:14
↓ 6 callersMethodFirstAppearingOnce
(self)
SwordToOffer/Code/53.py:15
↓ 6 callersMethodInsert
(self, char)
SwordToOffer/Code/53.py:32
↓ 4 callersFunctionFirstBrowse
(pRoot)
SwordToOffer/Code/17.py:54
↓ 3 callersMethodMirror
(self, root)
SwordToOffer/Code/17.py:11
↓ 3 callersMethodminHeapInsert
(self, num)
SwordToOffer/Code/58.py:85
↓ 2 callersMethodMirror2
(self, root)
SwordToOffer/Code/17.py:26
↓ 2 callersMethodPermutationHelper
(self, ss, Mylist)
SwordToOffer/Code/26.py:63
↓ 2 callersMethodchange
(self, Node)
SwordToOffer/Code/17.py:47
↓ 2 callersMethodgetSum
(self, x)
SwordToOffer/Code/55.py:29
↓ 2 callersMethodmaxHeapInsert
(self, num)
SwordToOffer/Code/58.py:32
↓ 2 callersMethodmin
(self)
SwordToOffer/Code/19.py:34
↓ 2 callersMethodsiftDown
(self, a, index)
SwordToOffer/Code/28.py:18
↓ 1 callersMethodAdd
(self, num1, num2)
SwordToOffer/Code/48.py:7
↓ 1 callersMethodClone
(self, pHead)
SwordToOffer/Code/24.py:11
↓ 1 callersMethodDeserialize
(self, s)
SwordToOffer/Code/66.py:37
↓ 1 callersMethodEntryNodeOfLoop
(self, pHead)
SwordToOffer/Code/60.py:9
↓ 1 callersMethodFind2
(self, target, array)
SwordToOffer/Code/1.py:16
↓ 1 callersMethodFindContinuousSequence
(self, tsum)
SwordToOffer/Code/41.py:10
↓ 1 callersMethodFindFirstCommonNode
(self, pHead1, pHead2)
SwordToOffer/Code/36.py:9
↓ 1 callersMethodFindGreatestSumOfSubArray
(self, array)
SwordToOffer/Code/29.py:3
↓ 1 callersMethodFindKthToTail
(self, head, k)
SwordToOffer/Code/13.py:9
↓ 1 callersMethodFindNumbersWithSum
(self, array, tsum)
SwordToOffer/Code/42.py:9
↓ 1 callersMethodFindNumsAppearOnce
(self, array)
SwordToOffer/Code/40.py:4
↓ 1 callersMethodFindPath
(self, root, expectNumber)
SwordToOffer/Code/23.py:22
↓ 1 callersMethodFirstNotRepeatingChar
(self, s)
SwordToOffer/Code/33.py:3
↓ 1 callersMethodGetLeastNumbers_Solution
(self, tinput, k)
SwordToOffer/Code/28.py:39
↓ 1 callersMethodGetNumberOfK
(self, data, k)
SwordToOffer/Code/37.py:3
↓ 1 callersMethodGetUglyNumber_Solution
(self, index)
SwordToOffer/Code/32.py:3
↓ 1 callersMethodHasSubtree
(self, pRoot1, pRoot2)
SwordToOffer/Code/16.py:19
↓ 1 callersMethodHelper
(self, array, startIndex, m)
SwordToOffer/Code/46.py:17
↓ 1 callersMethodInversePairs
(int[] array)
SwordToOffer/Code/34.java:38
↓ 1 callersMethodIsContinuous
(self, numbers)
SwordToOffer/Code/45.py:7
↓ 1 callersMethodIsPopOrder
(self, pushV, popV)
SwordToOffer/Code/20.py:3
↓ 1 callersMethodKthNode
(self, pRoot, k)
SwordToOffer/Code/67.py:11
↓ 1 callersMethodLastRemaining_Solution
(self, n, m)
SwordToOffer/Code/46.py:7
↓ 1 callersMethodLeftRotateString
(self, s, n)
SwordToOffer/Code/43.py:7
↓ 1 callersMethodMerge
(self, pHead1, pHead2)
SwordToOffer/Code/15.py:13
↓ 1 callersFunctionMidPrint
(root)
SwordToOffer/Code/25.py:41
↓ 1 callersMethodMoreThanHalfNum_Solution
(self, numbers)
SwordToOffer/Code/27.py:3
↓ 1 callersMethodNumberOf1Between1AndN_Solution
(self, n)
SwordToOffer/Code/30.py:3
↓ 1 callersMethodNumberOf1_2
(self, n)
SwordToOffer/Code/10.py:16
↓ 1 callersMethodPartition
(int[][] v, int low, int high)
LeetCode/src/seventeen/Solution.java:70
↓ 1 callersMethodPermutationHelper2
(self, ss)
SwordToOffer/Code/26.py:26
↓ 1 callersMethodPower
(self, base, exponent)
SwordToOffer/Code/11.py:3
↓ 1 callersMethodPrint
(self, pRoot)
SwordToOffer/Code/64.py:10
↓ 1 callersMethodPrintFromTopToBottom
(self, root)
SwordToOffer/Code/21.py:13
↓ 1 callersMethodPrintMinNumber
(self, numbers)
SwordToOffer/Code/31.py:14
↓ 1 callersMethodQSort
(int[][] v, int low, int high)
LeetCode/src/seventeen/Solution.java:60
↓ 1 callersMethodQuickSort
(int[][] v, int length)
LeetCode/src/seventeen/Solution.java:56
↓ 1 callersMethodReverseList
(self, pHead)
SwordToOffer/Code/14.py:10
↓ 1 callersMethodReverseSentence
(self, s)
SwordToOffer/Code/44.py:7
↓ 1 callersMethodSerialize
(self, root)
SwordToOffer/Code/66.py:10
↓ 1 callersMethodStrToInt
(self, s)
SwordToOffer/Code/49.py:33
↓ 1 callersMethodSum_Solution
(self, n)
SwordToOffer/Code/47.py:9
↓ 1 callersMethodTreeDepth
(self, pRoot)
SwordToOffer/Code/39.py:10
↓ 1 callersMethodVerifySquenceOfBST
(self, sequence)
SwordToOffer/Code/22.py:6
↓ 1 callersFunctionbfs
(array, x, y, tempSum, sizeX, sizeY)
SwordToOffer/Code/54.py:48
↓ 1 callersMethodcanCompleteCircuit
(int[] gas, int[] cost)
LeetCode/src/seventeen/Solution.java:8
↓ 1 callersMethodcandy
(int[] ratings)
LeetCode/src/sixteen/Solution.java:8
↓ 1 callersMethodcmpRoot
(self, root1, root2)
SwordToOffer/Code/63.py:15
↓ 1 callersMethodcommonDivisor
求最大公约数 @param a @param b @return
LeetCode/src/three/Solution.java:94
↓ 1 callersMethodcopyRandomList
(RandomListNode head)
LeetCode/src/thirteen/Solution.java:21
↓ 1 callersMethoddeleteDuplication
(self, pHead)
SwordToOffer/Code/61.py:9
↓ 1 callersMethoddetectCycle
(ListNode head)
LeetCode/src/nine/Solution.java:23
↓ 1 callersFunctiondfs
(array, x, y)
SwordToOffer/Code/54.py:26
↓ 1 callersMethoddfs
(String s, Set<String> dict, Map<String, ArrayList<String>> map)
LeetCode/src/twelve/Solution.java:17
↓ 1 callersMethoddfs
(self, matrix, x, y, rows, cols, path)
SwordToOffer/Code/56.py:38
↓ 1 callersMethoddfs
(self, array, x, y, threshold)
SwordToOffer/Code/55.py:15
↓ 1 callersMethoddoseNode1HasNode2
(self, Node1, Node2)
SwordToOffer/Code/16.py:35
↓ 1 callersMethodduplicate
(self, numbers, duplication)
SwordToOffer/Code/50.py:8
↓ 1 callersMethodevalRPN
(String[] tokens)
LeetCode/src/two/Solution.java:10
↓ 1 callersMethodfindway
(self, arr, i, j, k)
SwordToOffer/Code/55.py:49
↓ 1 callersMethodhasPath
(self, matrix, rows, cols, path)
SwordToOffer/Code/56.py:26
↓ 1 callersMethodhelper
(int[] gas, int[] cost, int startIndex)
LeetCode/src/seventeen/Solution.java:41
↓ 1 callersMethodinsertionSortList
(ListNode head)
LeetCode/src/five/Solution.java:19
↓ 1 callersMethodisBit
(self, data, index)
SwordToOffer/Code/40.py:29
↓ 1 callersMethodisSymmetrical
(self, pRoot)
SwordToOffer/Code/63.py:10
↓ 1 callersMethodjumpFloor
(self, number)
SwordToOffer/Code/7.py:3
↓ 1 callersMethodjumpFloorII
(self, number)
SwordToOffer/Code/8.py:3
↓ 1 callersMethodmakeHeap
(self, a, k)
SwordToOffer/Code/28.py:34
↓ 1 callersMethodmatch
(self, s, pattern)
SwordToOffer/Code/52.py:9
↓ 1 callersFunctionmaxArea
(array)
SwordToOffer/Code/54.py:13
↓ 1 callersMethodmaxHeapDeleteTop
(self)
SwordToOffer/Code/58.py:46
↓ 1 callersMethodmaxPoints
(Point[] points)
LeetCode/src/three/Solution.java:26
↓ 1 callersMethodmergeList
(ListNode left, ListNode right)
LeetCode/src/four/Solution.java:45
↓ 1 callersMethodminHeapDeleteTop
(self)
SwordToOffer/Code/58.py:65
↓ 1 callersMethodminNumberInRotateArray
(self, rotateArray)
SwordToOffer/Code/6.py:3
↓ 1 callersMethodmovingCount
(self, threshold, rows, cols)
SwordToOffer/Code/55.py:9
↓ 1 callersMethodmultiply
(self, A)
SwordToOffer/Code/51.py:6
↓ 1 callersFunctionpartation
(data, low, high)
SwordToOffer/Code/35.py:56
↓ 1 callersMethodpop
(self)
SwordToOffer/Code/19.py:22
↓ 1 callersMethodpostorderTraversal
(TreeNode root)
LeetCode/src/six/Solution.java:23
↓ 1 callersMethodpreorderTraversal
(TreeNode root)
LeetCode/src/seven/Solution.java:26
↓ 1 callersMethodprintListFromTailToHead
(self, listNode)
SwordToOffer/Code/3.py:10
↓ 1 callersMethodprintMatrix
(self, matrix)
SwordToOffer/Code/18.py:9
↓ 1 callersMethodpush
(self, node)
SwordToOffer/Code/19.py:8
next →1–100 of 192, ranked by callers