go语言编程编写程序基于结构体和指针定义单链表和双向循环链表。
时间: 2023-06-15 21:05:37 浏览: 49
好的,下面给出 Go 语言实现单链表和双向循环链表的代码。
## 单链表
```go
package main
import "fmt"
// 定义单链表结点
type ListNode struct {
Val int
Next *ListNode
}
// 定义单链表
type LinkedList struct {
Head *ListNode
Tail *ListNode
}
// 添加结点
func (list *LinkedList) AddNode(val int) {
node := &ListNode{Val: val}
if list.Head == nil {
list.Head = node
list.Tail = node
} else {
list.Tail.Next = node
list.Tail = node
}
}
// 删除结点
func (list *LinkedList) RemoveNode(val int) {
if list.Head == nil {
return
}
if list.Head.Val == val {
list.Head = list.Head.Next
if list.Head == nil {
list.Tail = nil
}
return
}
prev, curr := list.Head, list.Head.Next
for curr != nil {
if curr.Val == val {
prev.Next = curr.Next
if curr.Next == nil {
list.Tail = prev
}
return
}
prev, curr = curr, curr.Next
}
}
// 打印链表
func (list *LinkedList) PrintList() {
curr := list.Head
for curr != nil {
fmt.Printf("%d -> ", curr.Val)
curr = curr.Next
}
fmt.Println("nil")
}
func main() {
list := &LinkedList{}
list.AddNode(1)
list.AddNode(2)
list.AddNode(3)
list.PrintList() // 1 -> 2 -> 3 -> nil
list.RemoveNode(2)
list.PrintList() // 1 -> 3 -> nil
}
```
## 双向循环链表
```go
package main
import "fmt"
// 定义双向循环链表结点
type ListNode struct {
Val int
Prev *ListNode
Next *ListNode
}
// 定义双向循环链表
type LinkedList struct {
Head *ListNode
Tail *ListNode
}
// 添加结点
func (list *LinkedList) AddNode(val int) {
node := &ListNode{Val: val}
if list.Head == nil {
node.Prev = node
node.Next = node
list.Head = node
list.Tail = node
} else {
list.Tail.Next = node
node.Prev = list.Tail
node.Next = list.Head
list.Head.Prev = node
list.Tail = node
}
}
// 删除结点
func (list *LinkedList) RemoveNode(val int) {
if list.Head == nil {
return
}
curr := list.Head
for curr != nil {
if curr.Val == val {
if curr == list.Head {
list.Head = curr.Next
}
if curr == list.Tail {
list.Tail = curr.Prev
}
curr.Prev.Next = curr.Next
curr.Next.Prev = curr.Prev
return
}
curr = curr.Next
if curr == list.Head {
return
}
}
}
// 打印链表
func (list *LinkedList) PrintList() {
curr := list.Head
for curr != nil {
fmt.Printf("%d <-> ", curr.Val)
curr = curr.Next
if curr == list.Head {
break
}
}
fmt.Println("head")
}
func main() {
list := &LinkedList{}
list.AddNode(1)
list.AddNode(2)
list.AddNode(3)
list.PrintList() // 1 <-> 2 <-> 3 <-> head
list.RemoveNode(2)
list.PrintList() // 1 <-> 3 <-> head
}
```