Documentation
¶
Index ¶
- Variables
- type Array2BTINFT
- type ArraySortINTF
- type BT2ArrayINFT
- type CacheINTF
- type CalculatorINTF
- type CombineINTF
- type FindNum
- type GraphINTF
- type HeapINTF
- type LCSINTF
- type LISINTF
- type LMGINTF
- type LMSINTF
- type LNSINTF
- type LSGINTF
- type LSSINTF
- type LastKINTF
- type ListINTF
- type MinStackINTF
- type MonotonousStackINTF
- type OverHalfNumINTF
- type PermuteINTF
- type QueueINTF
- type ReturnKMinINTF
- type SlidingWindowINTF
- type StackINTF
- type TreeINTF
Constants ¶
This section is empty.
Variables ¶
View Source
var ArraySortINTFAssemble = map[string][]interface{}{ "Sort": { &inner_sort.BubbleSort{}, &inner_sort.InsertSort{}, &inner_sort.SelectSort{}, &inner_sort.MergeSort{}, &inner_sort.QuickSortSimplex{}, &inner_sort.QuickSortDuplex{}, &inner_sort.QuickSortNonRecursive{}, inner_sort.NewHeapSort(), inner_sort.NewHeapSort2(), }, "ReturnKMin": { &heap.ReturnKMinByQuickSort{}, &heap.ReturnKMinByHeapSort{}, }, "Xor": { &xor.FindNum_Twice_One{}, &xor.FindNum_Twice_Two{}, &xor.FindNum_Treble_One{}, }, }
View Source
var BTAssemble = map[string][]interface{}{ "bt2array": { &bt2array.PreOrderByRecursion{}, &bt2array.PreOrderByStack{}, &bt2array.PreOrderByStack2{}, &bt2array.InOrderByRecursion{}, &bt2array.InOrderByStack{}, &bt2array.PostOrderByRecursion{}, &bt2array.PostOrderByDoubleStack{}, }, "array2bt": {}, }
View Source
var CacheAssemble = map[string][]interface{}{ "Cache": { &list.LFUCache{}, &list.LRUCache{}, }, }
View Source
var CalculatorAssemble = map[string][]interface{}{ "Calculator": { &stack.Calculator{}, &stack.CalculatorWithBracket{}, &stack.CalculatorWithOutBracket{}, }, }
View Source
var DynamicAssemble = map[string][]interface{}{ "LIS": { lis.LIS_Backtrack{}, lis.LIS_Bisection{}, lis.LIS_Dynamic{}, lis.LIS_LCS{}, lis.LIS_Poker{}, lis.LIS_TwoPoint{}, lis.LIS_Violence{}, }, "LCS": { &lcs.LCS_Dynamic{}, &lcs.LCS_Optimize{}, }, "LMS": {lms.LMS_Dynamic{}}, "LNS": {lns.LNS_Queue{}}, "LSG": { lsg.LSG_BackTrack{}, lsg.LSG_Dynamic{}, }, "LSS": { lss.LSS_Bisection{}, lss.LSS_Dynamic{}}, }
View Source
var ListAssemble = map[string][]interface{}{ "List": { &list.SkipList{}, &list.SimplexList{}, &list.DuplexList{}, }, "LastK": { &list.LastKRecursion{}, &list.LastKTwoPoint{}, }, }
View Source
var PermuteAndCombineAssemble = []interface{}{ &permute_combine.Permutation{}, &permute_combine.PermutationByChange{}, &permute_combine.PermutationWithRepeatNum{}, &permute_combine.PermutationWithRepeatNumReduce{}, &permute_combine.PermutationTime{}, &two_point.TwoSum{}, &two_point.TwoSumByMap{}, &backtrack.CombinationRepeatNum_BackTrack{}, &dynamic.CombinationNum_Dynamic{}, }
View Source
var QueueAssemble = map[string][]interface{}{ "Queue": { &queue.ArrayQueue{}, &queue.LinkedQueue{}, queue.NewStackQueue(), }, }
View Source
var StackAssemble = map[string][]interface{}{ "Stack": { &stack.ArrayStack{}, &stack.LinkedStack{}, &stack.QueueStack{}}, "MinStack": {&stack.MinStack{}, &stack.MinStackOpt{}}, "MonotonousStack": {&monotonousStack.DailyTemperatures{}, &monotonousStack.DailyTemperatures2{}, &monotonousStack.GetMinValueByRemoveK{}, &monotonousStack.MonotonousStack{}}, }
Functions ¶
This section is empty.
Types ¶
type Array2BTINFT ¶
type ArraySortINTF ¶
所有排序算法的接口
type BT2ArrayINFT ¶
type CacheINTF ¶
type CacheINTF interface {
Set(key, value interface{})
Get(key interface{}) interface{}
Delete(key interface{})
Length() int
Clear()
GetAttribute() *C.Attribute
}
*
- @author ljfirst
- @version V1.0
- @date 2023/6/28 17:17
- @author-Email ljfirst@mail.ustc.edu.cn
- @blogURL https://blog.csdn.net/ljfirst
- @description *
type CalculatorINTF ¶
*
- @author ljfirst
- @version V1.0
- @date 2023/6/28 17:11
- @author-Email ljfirst@mail.ustc.edu.cn
- @blogURL https://blog.csdn.net/ljfirst
- @description *
type CombineINTF ¶
type CombineINTF interface {
}
type GraphINTF ¶
type GraphINTF interface {
}
*
- @author ljfirst
- @version V1.0
- @date 2023/6/26 08:25
- @author-Email ljfirst@mail.ustc.edu.cn
- @blogURL https://blog.csdn.net/ljfirst
- @description *
type HeapINTF ¶
type HeapINTF interface {
}
*
- @author ljfirst
- @version V1.0
- @date 2023/6/26 08:25
- @author-Email ljfirst@mail.ustc.edu.cn
- @blogURL https://blog.csdn.net/ljfirst
- @description *
type LISINTF ¶
*
- @author ljfirst
- @version V1.0
- @date 2023/7/10 00:03
- @author-Email ljfirst@mail.ustc.edu.cn
- @blogURL https://blog.csdn.net/ljfirst
- @description *
type ListINTF ¶
type ListINTF interface {
Insert(...*list.Node) // 默认插在最后面
InsertIndex(int, ...*list.Node) // 当index=0的时候,默认插在最前面
Delete(*list.Node)
DeleteIndex(int)
ValueSet() []interface{}
Equals(*list.Node)
Size() int
Clear()
GetAttribute() *C.Attribute
}
*
- @author ljfirst
- @version V1.0
- @date 2023/6/28 16:56
- @author-Email ljfirst@mail.ustc.edu.cn
- @blogURL https://blog.csdn.net/ljfirst
- @description 链表 *
type MinStackINTF ¶
type MinStackINTF interface {
StackINTF // grammar接口之间的继承关系
GetMin() int
GetAttribute() *C.Attribute
}
最小栈 和 单调栈
type MonotonousStackINTF ¶
type OverHalfNumINTF ¶
超过半数的数
type PermuteINTF ¶
type PermuteINTF interface {
PermuteMethod(arrayI interface{}) [][]interface{}
}
*
- @author ljfirst
- @version V1.0
- @date 2023/7/7 13:29
- @author-Email ljfirst@mail.ustc.edu.cn
- @blogURL https://blog.csdn.net/ljfirst
- @description 排列组合 *
type QueueINTF ¶
type QueueINTF interface {
Offer(interface{}) // insert into queue
Poll() interface{} // pop from queue
Peak() interface{} // get the ahead value from queue
Size() int
Resize() // extension the capacity of the queue
StructName() string
}
*
- @author ljfirst
- @version V1.0
- @date 2023/6/25 20:51
- @author-Email ljfirst@mail.ustc.edu.cn
- @blogURL https://blog.csdn.net/ljfirst
- @description queue *
type SlidingWindowINTF ¶
type SlidingWindowINTF interface {
}
*
- @author ljfirst
- @version V1.0
- @date 2023/7/7 13:24
- @author-Email ljfirst@mail.ustc.edu.cn
- @blogURL https://blog.csdn.net/ljfirst
- @description 滑动窗口 *
type TreeINTF ¶
type TreeINTF interface {
}
*
- @author ljfirst
- @version V1.0
- @date 2023/6/26 08:25
- @author-Email ljfirst@mail.ustc.edu.cn
- @blogURL https://blog.csdn.net/ljfirst
- @description *
Click to show internal directories.
Click to hide internal directories.