Documentation
¶
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type CQueue ¶
type CQueue struct {
// contains filtered or unexported fields
}
func Constructor1 ¶
func Constructor1() CQueue
type MaxQueue ¶
type MaxQueue struct {
// contains filtered or unexported fields
}
*
@author: CodeWater @since: 2023/6/15 @desc: 队列的最大值
*
func Constructor3 ¶
func Constructor3() MaxQueue
type MedianFinder ¶
type MedianFinder struct {
// contains filtered or unexported fields
}
*
@author: CodeWater @since: 2023/6/26 @desc: 数据流中的中位数
*
func (*MedianFinder) AddNum ¶
func (mf *MedianFinder) AddNum(num int)
func (*MedianFinder) FindMedian ¶
func (mf *MedianFinder) FindMedian() float64
type MinStack ¶
type MinStack struct {
// contains filtered or unexported fields
}
method a================================================================
Source Files
¶
- 03_RepeatNumbersInTheArray.go
- 04II_TheNumberOfOnlyOnce.go
- 04_ATwo-dimensionalArrayOfLookup.go
- 05_ReplaceTheBlankSpace.go
- 06_PrintListFromTheTailEnd.go
- 07_ReconstructionOfBinaryTree.go
- 09_TwoStackIsUsedToImplementAQueue.go
- 10II_TheFrogJumpedTheSteps.go
- 10I_TheFibonacciSequence.go
- 11_MinimumNumberOfRotatingArray.go
- 12_MatrixOfPath.go
- 13_TheRobotSMovement.go
- 14II_CutTheRope.go
- 14I_CutTheRope.go
- 15_1InTheBinaryNumber.go
- 16_ValueOfIntegerPower.go
- 17_PrintNDigitsFrom_1ToTheMaximum.go
- 18_DeleteListNode.go
- 19_RegularExpressionMatch.go
- 20_NumericalValueOfAString.go
- 21_AdjustTheArrayInOrderToMakeOddInEvenTheFront.go
- 22_BottomFirstKNodeInTheLinkedList.go
- 24_ReverseALinkedList.go
- 25_MergingTwoSortedLists.go
- 26_TheTreeOfTheSubstructure.go
- 27_AMirrorImageOfABinaryTree.go
- 28_SymmetricBinaryTree.go
- 29_ClockwiseToPrintMatrix.go
- 30_ContainsTheMinFunctionOfStack.go
- 31_StackPressureIntoTheSequenceAndPop-up.go
- 32III_PrintBinaryTreeFromTopToBottom.go
- 32II_PrintBinaryTreeFromTopToBottom.go
- 32I_PrintBinaryTreeFromTopToBottom.go
- 33_AfterTheBinarySearchTreeTraversalSequence.go
- 34_TheBinaryTreeAndForThePathOfACertainValue.go
- 35_TheComplexListCopy.go
- 36_BinarySearchTreesWithTwoWayChainTable.go
- 37_SerializationBinaryTree.go
- 38_TheArrangementOfString.go
- 39_InMoreThanHalfOfTheArrayNumber.go
- 40_TheSmallestNumberOfK.go
- 41_TheMedianOfTheDataStream.go
- 42_TheBiggestAndContinuousSubarray.go
- 43_1TheNumberOfOccurrencesOf_1NIntegers.go
- 44_OneOfTheNumbersInNumericalSequence.go
- 45_TheArrayInTheSmallestNumber.go
- 46_TranslateNumberIntoAString.go
- 47_TheGreatValueOfTheGift.go
- 48_TheLongestWithoutRepetitionOfTheCharacterString.go
- 49_NumberOfUgly.go
- 50_TheFirstCharacterAppearsOnlyOnce.go
- 51_TheReverseOfOfTheArray.go
- 52_TheFirstPublicNodeOfTheTwoLists.go
- 53II_MissingNumbersFrom0ToN-1.go
- 53I_ILookForInTheSortedArrayNumber.go
- 54_TheFirstBigNodeKBinarySearchTrees.go
- 55II_BalancedBinaryTree.go
- 55I_TheDepthOfABinaryTree.go
- 56II_TheNumberOfNumbersAppearInTheArray.go
- 56I_TheNumberOfNumbersAppearInTheArray.go
- 57_AndForSContinuousPositiveSequence.go
- 57_AndForTheSOfTwoNumbers.go
- 58II_LeftRotatingString.go
- 58I_FlipTheWordOrder.go
- 59II_TheMaximumQueue.go
- 59I_TheMaximumNumberOfSlidingWindow.go
- 60_NTheDicePoints.go
- 61_PlayingCardsInShunza.go
- 62_LastTheRestOfTheNumbersInTheCircle.go
- 63_ShareTheBiggestProfits.go
- 64_Sum.go
- 65_AddWithoutAdditionSubtractionMultiplicationAndDivision.go
- 66_BuildProductArray.go
- 67_ConvertsAStringIntoAnInteger.go
- 68II_RecentCommonAncestorOfBinaryTre.go
- 68I_BinarySearchTreeInRecentCommonAncestor.go
Click to show internal directories.
Click to hide internal directories.