Go实现LinkedTable

[HNUlixinze]

1.数据结构定义

type LinkNode struct {
    Next *LinkNode
    Data     int 
}
 
type LinkedList struct {
	head   *LinkNode
	length int
}

2.链表初始化

func Create() newList LinkedList {
    newList = new(MyLinkedList)
    newList -> length = 0
    mewList -> head = NULL
	return
}

3.获取指定位置元素

func (this *LinkedList) Get(index int) int {
	if index < 0 || index >= this.length {
		return -1
	}
	p := this.head
	for i := 0; i <= index; i++ {
		p = p.next
	}
	return p.val
}

4.增加节点

func (this *LinkedList)AddNewNode(Node *LinkTableNode, position int) bool{
    if this == nil || Node == nil {
        return false
    }
 
    if position > this.length {
        fmt.Printf("out of range\n")
        return false
    }
 
    if position == 0 {
        if this.length != 0 {
            Node.next = LinkTable.head.next
        }
        this.head = Node
    } else {
        var tmpNodepointer *LinkTableNode = this.head
        for position != 1 {
            tmpNodepointer = tmpNodepointer.next
            position -= 1
        }
        Node.next = tmpNodepointer.next
        tmpNodepointer.next = Node
    }
    this.length += 1
    return true
}

5.删除指定位置元素

func (this *LinkedList) DeleteAtIndex(index int) bool {
	if index < 0 || index >= this.length {
		return false
	}
	p := this.head
	//找到第index-1个结点
	for i := 0; i < index; i++ {
		p = p.next
	}
	q := p.next
	p.next = q.next
	q.next = nil
	this.length--
    return true
}

6. 打印链表3

func (this *MyLinkedList) PrintList() {
	p := this.head.next
	for p != nil {
		fmt.Println(p.val)
		fmt.Print(" ")
		p = p.next
	}
}

学号：279李昕泽