foundation

package

v0.0.0-...-67fb0f9 Latest Latest Go to latest Published: Mar 31, 2024 License: MIT Imports: 5 Imported by: 0

Details

Valid go.mod file

The Go module system was introduced in Go 1.11 and is the official dependency management solution for Go.
Redistributable license

Redistributable licenses place minimal restrictions on how software can be used, modified, and redistributed.
Tagged version

Modules with tagged versions give importers more predictable builds.
Stable version

When a project reaches major version v1 it is considered stable.
Learn more about best practices

Repository

github.com/llzzrrr1997/leetcode-go

Links

Open Source Insights

Documentation ¶

Index ¶

type ArrHeap
- func (h ArrHeap) Len() int
- func (h ArrHeap) Less(i, j int) bool
- func (h *ArrHeap) Pop() interface{}
- func (h *ArrHeap) Push(x interface{})
- func (h ArrHeap) Swap(i, j int)
type BSTIterator
- func BSTIteratorConstructor(root *TreeNode) BSTIterator
- func (this *BSTIterator) HasNext() bool
- func (this *BSTIterator) Next() int
type Codec
- func CodecConstructor() Codec
type Heap
- func (h Heap) Len() int
- func (h Heap) Less(i, j int) bool
- func (h *Heap) Pop() interface{}
- func (h *Heap) Push(x interface{})
- func (h Heap) Swap(i, j int)
type ListNode
type MinStack
- func MinStackConstructor() MinStack
- func (this *MinStack) GetMin() int
- func (this *MinStack) Pop()
- func (this *MinStack) Push(val int)
- func (this *MinStack) Top() int
type MyHashMap
- func Constructor() MyHashMap
- func (m *MyHashMap) Get(key int) int
- func (m *MyHashMap) Put(key int, value int)
- func (m *MyHashMap) Remove(key int)
type MyLinkedList
- func MyLinkedListConstructor() MyLinkedList
- func (this *MyLinkedList) AddAtHead(val int)
- func (this *MyLinkedList) AddAtIndex(index int, val int)
- func (this *MyLinkedList) AddAtTail(val int)
- func (this *MyLinkedList) DeleteAtIndex(index int)
- func (this *MyLinkedList) Get(index int) int
type Node
type PointHeap
- func (h PointHeap) Len() int
- func (h PointHeap) Less(i, j int) bool
- func (h *PointHeap) Pop() interface{}
- func (h *PointHeap) Push(x interface{})
- func (h PointHeap) Swap(i, j int)
type TreeNode

Constants ¶

This section is empty.

Variables ¶

This section is empty.

Functions ¶

This section is empty.

Types ¶

type ArrHeap ¶

type ArrHeap [][2]int

func (ArrHeap) Len ¶

func (h ArrHeap) Len() int

func (ArrHeap) Less ¶

func (h ArrHeap) Less(i, j int) bool

func (*ArrHeap) Pop ¶

func (h *ArrHeap) Pop() interface{}

func (*ArrHeap) Push ¶

func (h *ArrHeap) Push(x interface{})

func (ArrHeap) Swap ¶

func (h ArrHeap) Swap(i, j int)

type BSTIterator ¶

type BSTIterator struct {
	// contains filtered or unexported fields
}

no173

func BSTIteratorConstructor ¶

func BSTIteratorConstructor(root *TreeNode) BSTIterator

func (*BSTIterator) HasNext ¶

func (this *BSTIterator) HasNext() bool

func (*BSTIterator) Next ¶

func (this *BSTIterator) Next() int

type Codec ¶

type Codec struct {
}

func CodecConstructor ¶

func CodecConstructor() Codec

type Heap ¶

type Heap []int

func (Heap) Len ¶

func (h Heap) Len() int

func (Heap) Less ¶

func (h Heap) Less(i, j int) bool

func (*Heap) Pop ¶

func (h *Heap) Pop() interface{}

func (*Heap) Push ¶

func (h *Heap) Push(x interface{})

func (Heap) Swap ¶

func (h Heap) Swap(i, j int)

type ListNode ¶

type ListNode struct {
	Val  int
	Next *ListNode
}

type MinStack ¶

type MinStack struct {
	Data []int
	Min  []int
}

no155

func MinStackConstructor ¶

func MinStackConstructor() MinStack

func (*MinStack) GetMin ¶

func (this *MinStack) GetMin() int

func (*MinStack) Pop ¶

func (this *MinStack) Pop()

func (*MinStack) Push ¶

func (this *MinStack) Push(val int)

func (*MinStack) Top ¶

func (this *MinStack) Top() int

type MyHashMap ¶

type MyHashMap struct {
	// contains filtered or unexported fields
}

no706

func Constructor ¶

func Constructor() MyHashMap

func (*MyHashMap) Get ¶

func (m *MyHashMap) Get(key int) int

func (*MyHashMap) Put ¶

func (m *MyHashMap) Put(key int, value int)

func (*MyHashMap) Remove ¶

func (m *MyHashMap) Remove(key int)

type MyLinkedList ¶

type MyLinkedList struct {
	// contains filtered or unexported fields
}

func MyLinkedListConstructor ¶

func MyLinkedListConstructor() MyLinkedList

func (*MyLinkedList) AddAtHead ¶

func (this *MyLinkedList) AddAtHead(val int)

func (*MyLinkedList) AddAtIndex ¶

func (this *MyLinkedList) AddAtIndex(index int, val int)

func (*MyLinkedList) AddAtTail ¶

func (this *MyLinkedList) AddAtTail(val int)

func (*MyLinkedList) DeleteAtIndex ¶

func (this *MyLinkedList) DeleteAtIndex(index int)

func (*MyLinkedList) Get ¶

func (this *MyLinkedList) Get(index int) int

type Node ¶

type Node struct {
	Val  int
	Next *Node
}

type PointHeap ¶

type PointHeap [][]int

func (PointHeap) Len ¶

func (h PointHeap) Len() int

func (PointHeap) Less ¶

func (h PointHeap) Less(i, j int) bool

func (*PointHeap) Pop ¶

func (h *PointHeap) Pop() interface{}

func (*PointHeap) Push ¶

func (h *PointHeap) Push(x interface{})

func (PointHeap) Swap ¶

func (h PointHeap) Swap(i, j int)

type TreeNode ¶

type TreeNode struct {
	Val   int
	Left  *TreeNode
	Right *TreeNode
}

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL

Documentation ¶

Index ¶

Constants ¶

Variables ¶

Functions ¶

Types ¶

type ArrHeap ¶

func (ArrHeap) Len ¶

func (ArrHeap) Less ¶

func (*ArrHeap) Pop ¶

func (*ArrHeap) Push ¶

func (ArrHeap) Swap ¶

type BSTIterator ¶

func BSTIteratorConstructor ¶

func (*BSTIterator) HasNext ¶

func (*BSTIterator) Next ¶

type Codec ¶

func CodecConstructor ¶

type Heap ¶

func (Heap) Len ¶

func (Heap) Less ¶

func (*Heap) Pop ¶

func (*Heap) Push ¶

func (Heap) Swap ¶

type ListNode ¶

type MinStack ¶

func MinStackConstructor ¶

func (*MinStack) GetMin ¶

func (*MinStack) Pop ¶

func (*MinStack) Push ¶

func (*MinStack) Top ¶

type MyHashMap ¶

func Constructor ¶

func (*MyHashMap) Get ¶

func (*MyHashMap) Put ¶

func (*MyHashMap) Remove ¶

type MyLinkedList ¶

func MyLinkedListConstructor ¶

func (*MyLinkedList) AddAtHead ¶

func (*MyLinkedList) AddAtIndex ¶

func (*MyLinkedList) AddAtTail ¶

func (*MyLinkedList) DeleteAtIndex ¶

func (*MyLinkedList) Get ¶

type Node ¶

type PointHeap ¶

func (PointHeap) Len ¶

func (PointHeap) Less ¶

func (*PointHeap) Pop ¶

func (*PointHeap) Push ¶

func (PointHeap) Swap ¶

type TreeNode ¶

Source Files ¶