用Go编写一个Linktable库,并上传到github

2022-07-10 20:13:56 190 阅读 AI 写同款 · GEO 优化AI 选题数据监测一键分发 ›

Qoder Quest 模式实战：从需求到代码的自动化开发本文深入探讨Qoder Quest模式如何实现从需求到代码的自动化开发。通过编写清晰的Spec规格说明，Qoder能智能分解任务并在后台执行，生成高质量代码，大幅提升开发效率，让开发者专注于架构设计等创造性工作。阅读详情

代码

// 定义结点
type Node struct {
	val  int
	next *Node
}
 
// 定义链表
type LinkedList struct {
	dummy *Node
}
 
// 初始化链表
func Constructor() LinkedList {
    return LinkedList {
		&Node{},
	}
}
 
// 获取index位置节点
func (this *LinkedList) Get(index int) int {
    if(index < 0) return -1
	head := this.dummy.next
	if head == nil return -1
	for head.next != nil && index > 0{
		head = head.next
		index--
	}
	return head.val
}
 
// 头插法
func (this *LinkedList) AddAtHead(val int)  {
	dummy := this.dummy
	node := &Node{
		val:  val,
		next: dummy.next,
	}
	this.dummy.next = node
}
 
// 尾插法
func (this *LinkedList) AddAtTail(val int)  {
	dummy := this.dummy
	for dummy.next != nil {
		dummy = dummy.next
	}
	rear := &Node{
		val: val,
		next: nil,
	}
	dummy.next = rear
}
 
// 在index位置插入节点
func (this *LinkedList) AddAtIndex(val int, index int)  {
    if(index < 0) return 
    dummy := this.dummy
	for dummy.next != nil && index > 0 {
		dummy = dummy.next
		index--
	}
	if index != 0 {
		return
	}
	node := &Node{
		val:  val,
	}
	node.next = dummy.next
	dummy.next = node
}
 
// 在index位置删除节点
func (this *LinkedList) DeleteAtIndex(index int)  {
    if(index < 0) return 
	if this.dummy.next == nil {
		return
	}
    dummy := this.dummy
	for dummy.next != nil && index > 0 {
		dummy = dummy.next
		index--
	}
	if dummy.next != nil && index == 0 {
		dummy.next = dummy.next.next
	}
}