go实现排序的链表

package codeforfun
import (
 "container/list"
)
type SortedLinkedList struct {
 *list.List
 Limit int
 compareFunc func (old, new interface{}) bool
}
func NewSortedLinkedList(limit int, compare func (old, new interface{}) bool) *SortedLinkedList {
 return &SortedLinkedList{list.New(), limit, compare}
}
func (this SortedLinkedList) findInsertPlaceElement(value interface{}) *list.Element {
 for element := this.Front(); element != nil; element = element.Next() {
 tempValue := element.Value
 if this.compareFunc(tempValue, value) {
 return element
 }
 }
 return nil
}
func (this SortedLinkedList) PutOnTop(value interface{}) {
 if this.List.Len() == 0 {
 this.PushFront(value)
 return
 }
 if this.List.Len() < this.Limit && this.compareFunc(value, this.Back().Value) {
 this.PushBack(value)
 return
 }
 if this.compareFunc(this.List.Front().Value, value) {
 this.PushFront(value)
 } else if this.compareFunc(this.List.Back().Value, value) && this.compareFunc(value, this.Front().Value) {
 element := this.findInsertPlaceElement(value)
 if element != nil {
 this.InsertBefore(value, element)
 }
 }
 if this.Len() > this.Limit {
 this.Remove(this.Back())
 }
}

package main
import (
 "fmt"
 "codeforfun"
)
type WordCount struct {
 Word string
 Count int
}
func compareValue(old, new interface {}) bool {
 if new.(WordCount).Count > old.(WordCount).Count {
 return true
 }
 return false
}
func main() {
 wordCounts := []WordCount{
 WordCount{"kate", 87},
 WordCount{"herry", 92},
 WordCount{"james", 81}}
 var aSortedLinkedList = codeforfun.NewSortedLinkedList(10, compareValue)
 for _, wordCount := range wordCounts {
 aSortedLinkedList.PutOnTop(wordCount)
 }
 for element := aSortedLinkedList.List.Front(); element != nil; element = element.Next() {
 fmt.Println(element.Value.(WordCount))
 }
}

有疑问加站长微信联系(非本文作者)

• 请尽量让自己的回复能够对别人有帮助
• 支持 Markdown 格式, **粗体**、~~删除线~~、`单行代码`
• 支持 @ 本站用户;支持表情(输入 : 提示),见 Emoji cheat sheet
• 图片支持拖拽、截图粘贴等方式上传