Documentation
¶
Index ¶
- func DetectCycle(llist *SinglyLinkedList) bool
- func MergingCommunities(n int32, commands []string, params [][]int32) []int32
- func PrintSinglyLinkedList(node *SinglyLinkedListNode, sep string, writer *bufio.Writer)
- type CastleOnGridGraph
- type CastleOnGridNode
- type CastleOnGridQueue
- type ContactsTrie
- type ContactsTrieNode
- type CookiesHeap
- type DoublyLinkedList
- type DoublyLinkedListNode
- type DownToZeroItem
- type DownToZeroQueue
- type EqualStacksStack
- type FindRunningMedianHeap
- type MergingCommunitiesSet
- type NoPrefixSetNode
- type QueueUsingStacksQueue
- type QueueUsingStacksStack
- type SinglyLinkedList
- type SinglyLinkedListNode
- type TreeNode
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func DetectCycle ¶
func DetectCycle(llist *SinglyLinkedList) bool
func MergingCommunities ¶
func PrintSinglyLinkedList ¶
func PrintSinglyLinkedList(node *SinglyLinkedListNode, sep string, writer *bufio.Writer)
Types ¶
type CastleOnGridGraph ¶
type CastleOnGridGraph struct {
// contains filtered or unexported fields
}
type CastleOnGridNode ¶
type CastleOnGridNode struct {
// contains filtered or unexported fields
}
type CastleOnGridQueue ¶
type CastleOnGridQueue struct {
// contains filtered or unexported fields
}
type ContactsTrie ¶
type ContactsTrie struct {
// contains filtered or unexported fields
}
type ContactsTrieNode ¶
type ContactsTrieNode struct {
// contains filtered or unexported fields
}
type CookiesHeap ¶
type CookiesHeap []int32
func (CookiesHeap) Len ¶
func (h CookiesHeap) Len() int
func (CookiesHeap) Less ¶
func (h CookiesHeap) Less(i, j int) bool
func (*CookiesHeap) Peek ¶
func (h *CookiesHeap) Peek() int32
func (*CookiesHeap) Pop ¶
func (h *CookiesHeap) Pop() any
func (*CookiesHeap) Push ¶
func (h *CookiesHeap) Push(x any)
func (CookiesHeap) Swap ¶
func (h CookiesHeap) Swap(i, j int)
type DoublyLinkedList ¶
type DoublyLinkedList struct {
// contains filtered or unexported fields
}
type DoublyLinkedListNode ¶
type DoublyLinkedListNode struct {
// contains filtered or unexported fields
}
func ReverseDoublyLinkedList ¶
func ReverseDoublyLinkedList(head *DoublyLinkedListNode) *DoublyLinkedListNode
type DownToZeroItem ¶
type DownToZeroItem struct {
// contains filtered or unexported fields
}
type DownToZeroQueue ¶
type DownToZeroQueue struct {
// contains filtered or unexported fields
}
type EqualStacksStack ¶
type EqualStacksStack struct {
// contains filtered or unexported fields
}
func NewEqualStacksStack ¶
func NewEqualStacksStack(items []int32) *EqualStacksStack
func (*EqualStacksStack) Pop ¶
func (s *EqualStacksStack) Pop() int32
type FindRunningMedianHeap ¶
type FindRunningMedianHeap struct {
// contains filtered or unexported fields
}
func (FindRunningMedianHeap) Len ¶
func (h FindRunningMedianHeap) Len() int
func (FindRunningMedianHeap) Less ¶
func (h FindRunningMedianHeap) Less(i, j int) bool
func (FindRunningMedianHeap) Peek ¶
func (h FindRunningMedianHeap) Peek() any
func (*FindRunningMedianHeap) Pop ¶
func (h *FindRunningMedianHeap) Pop() any
func (*FindRunningMedianHeap) Push ¶
func (h *FindRunningMedianHeap) Push(x any)
func (FindRunningMedianHeap) Swap ¶
func (h FindRunningMedianHeap) Swap(i, j int)
type MergingCommunitiesSet ¶
type MergingCommunitiesSet struct {
// contains filtered or unexported fields
}
type NoPrefixSetNode ¶
type NoPrefixSetNode struct {
// contains filtered or unexported fields
}
Trie node
type QueueUsingStacksQueue ¶
type QueueUsingStacksQueue struct {
// contains filtered or unexported fields
}
func NewQueueUsingStacksQueue ¶
func NewQueueUsingStacksQueue() *QueueUsingStacksQueue
type QueueUsingStacksStack ¶
type QueueUsingStacksStack struct {
// contains filtered or unexported fields
}
type SinglyLinkedList ¶
type SinglyLinkedList struct {
Head *SinglyLinkedListNode
Tail *SinglyLinkedListNode
}
func (*SinglyLinkedList) InsertNodeIntoSinglyLinkedList ¶
func (singlyLinkedList *SinglyLinkedList) InsertNodeIntoSinglyLinkedList(nodeData int32)
type SinglyLinkedListNode ¶
type SinglyLinkedListNode struct {
Data int32
Next *SinglyLinkedListNode
}
func MergeTwoLinkedLists ¶
func MergeTwoLinkedLists(headOne *SinglyLinkedListNode, headTwo *SinglyLinkedListNode) *SinglyLinkedListNode
Source Files
¶
- binary_search_tree_lca.go
- castle_on_the_grid.go
- contacts.go
- cycle_detection.go
- doubly_linked_list.go
- down_to_zero_ii.go
- equal_stacks.go
- find_running_median.go
- get_node_value.go
- insert_specific_position.go
- is_binary_search_tree.go
- jesse_and_cookies.go
- linked_list.go
- merge_two_sorted_linked_lists.go
- merging_communities.go
- no_prefix_set.go
- queue_using_two_stacks.go
- reverse_doubly_linked_list.go
- tree.go
- utils.go
Click to show internal directories.
Click to hide internal directories.