r1nc / go-algorithm

Implementations of data structures & algorithms written in Golang.

Data Structures:

• Matrix:

func spiralTraverse(m [][]string) {}

• LinkedList:

func (list *LinkedList) Size() int {}
func (list *LinkedList) Reverse() {}
func (list *LinkedList) IndexOf(value interface{}) int {}
func (list *LinkedList) Get(index int) interface{} {}
func (list *LinkedList) GetFirst() interface{} {}
func (list *LinkedList) GetLast() interface{} {}
func (list *LinkedList) Add(value interface{}, index int) {}
func (list *LinkedList) AddToFirst(value interface{}) {}
func (list *LinkedList) AddToLast(value interface{}) {}
func (list *LinkedList) RemoveAt(index int) {}
func (list *LinkedList) RemoveFirst() {}
func (list *LinkedList) RemoveLast() {}

• LinkedStack:

func (stack *LinkedStack) Size() int {}
func (stack *LinkedStack) Push(value interface{}) {}
func (stack *LinkedStack) Pop() {}
func (stack *LinkedStack) Peek() interface{} {}

• LinkedQueue:

func (queue *LinkedQueue) Size() int {}
func (queue *LinkedQueue) Add(value interface{}) {}
func (queue *LinkedQueue) Remove() {}
func (queue *LinkedQueue) Peek() interface{} {}

• LinkedHashMap:

func (hashMap *LinkedHashMap) Put(key int, value interface{}) {}
func (hashMap *LinkedHashMap) Get(key int) interface{} {}
func (hashMap *LinkedHashMap) Remove(key int) {}
func (hashMap *LinkedHashMap) Clear() {}

• BinarySearchTree

func (tree *BinarySearchTree) Add(value int) {}
func (tree *BinarySearchTree) Remove(value int) {}
func (tree *BinarySearchTree) Search(value int) *BinarySearchTree {}
func (tree *BinarySearchTree) Traverse() {}
func (tree *BinarySearchTree) TraverseByLevel() {}

• BinaryHeap

func (heap *BinaryHeap) Size() int {}
func (heap *BinaryHeap) Add(data int) {}
func (heap *BinaryHeap) RemoveMinimum() int {}

• Graph:

func (graph *Graph) BreadthFirstSearch(startVertex *Vertex) {}
func (graph *Graph) DepthFirstSearch(startVertex *Vertex) {}
func (graph *Graph) PrimMinimumSpanningTree(startVertex *Vertex) {}
func (graph *Graph) KruskalMinimumSpanningTree() {}
func (graph *Graph) DijkstraShortestPath(startVertex *Vertex, endVertex *Vertex) {}
func (graph *Graph) TopologicalSort() {}

Sorting Algorithms:

• BubbleSort:

func SimpleBubbleSort(array []int) {}
func FlagSwapBubbleSort(array []int) {}
func FlagSwapPositionBubbleSort(array []int) {}

• InsertSort:

func InsertSort(array []int) {}

• SelectSort:

func SelectSort(array []int) {}

• QuickSort:

func QucikSort(array []int) {}

Searching Algorithms:

• BinarySearch:

func RecursionBinarySearch(sorted_array []int, target int) int {}
func NonRecursionBinarySearch(sorted_array []int, target int) int {}

String Algorithms:

• Single Pattern Search:

func KMPSearch(source string, pattern string) int {}
func BMSearch(source string, pattern string) int {}

go-algorithm's Issues

hash remove方法问题

作者你好，目前我初学go语言，看到你的项目hashMap删除方法好像有问题，你的代码：

func (hashMap *LinkedHashMap) Remove(key int) {
	hashMap.checkTable()
	hash := getHashValue(key)
	e := hashMap.table[hash]
	if e != nil {
		for e.next != nil {
			if e.key == key {
				e.key = e.next.key
				e.value = e.next.value
				e.next = e.next.next
				return
			}
			e = e.next
		}
		if e.key == key {
                         // 此处e=nil只是对e指针类型的引用置为nil,并非将next值置为空
                         // 应该是将元素的值置为空
			e = nil
		}
	}
}