双向链表(golang)

package main

import (
	"errors"
	"fmt"
)

type LinkNode struct {
	Value interface{}
	Last  *LinkNode //上一个节点地址
	Next  *LinkNode //下一个节点地址
}

type LinkList struct {
	Head *LinkNode
	Size int //链表的中的元素个数
	Num  int //链表最大度
}

func NewLinkList(num int) *LinkList {
	if num <= 0 {
		num = 1000
	}

	return &LinkList{
		Num: num,
	}
}

//在头部插入
func (this *LinkList) First(value interface{}) (bool, error) {
	if this.Size >= this.Num {
		return false, errors.New("please expand,capacity reached the upper limit")
	}

	if this.Head == nil {
		node := &LinkNode{
			Value: value,
		}
		this.Head = node
		this.Size++
	} else {
		node := &LinkNode{
			Value: value,
			Last:  nil,
			Next:  this.Head,
		}
		this.Head.Last = node
		this.Head = node
		this.Size++
	}
	return true, nil
}

//在尾部插入
func (this *LinkList) After(value interface{}) (bool, error) {
	if this.Size >= this.Num {
		return false, errors.New("please expand,capacity reached the upper limit")
	}
	head := this.Head
	for {
		if head.Next != nil {
			head = head.Next
		} else {
			break
		}
	}

	node := &LinkNode{
		Value: value,
		Last:  head,
	}
	head.Next = node
	this.Size++
	return true, nil
}

//遍历链表
func (this *LinkList) LRange() (list []interface{}) {
	head := this.Head
	if head == nil {
		return
	}
	list = append(list, head.Value)
	for {
		if head.Next != nil {
			head = head.Next
			list = append(list, head.Value)
		} else {
			break
		}
	}
	return
}

//检查链表是否为空
func (this *LinkList) IsEmpty() bool {
	if this.Head == nil {
		return true
	}
	return false
}

func (this *LinkList) GetSize() int {
	return this.Size
}

//根据索引位置删除
func (this *LinkList) DeleteByIndex(index int) (bool, error) {
	if index < 0 || index >= this.Size {
		return false, errors.New("index out of bounds")
	}
	head := this.Head
	if head == nil {
		return false, errors.New("list is nil")
	}

	if index == 0 {
		//fmt.Printf("%#v\n",head)
		if head.Next != nil {
			this.Head = head.Next
			this.Head.Last = nil
			this.Size--
		} else {
			this.Head = nil
			this.Size--
		}
		return true, nil
	}

	var count int = 1
	for {
		head = head.Next
		//head = head.Next
		if count == index {
			break
		}
		count++
	}

	if head.Next != nil {
		head.Value = head.Next.Value
		head.Next = head.Next.Next
	} else {
		head.Last.Next = nil
	}
	this.Size--
	return true, nil
}

//根据值来删除
func (this *LinkList) DeleteByValue(value interface{}) (bool, error) {
	head := this.Head
	if head == nil {
		return false, errors.New("list is nil")
	}

	if head.Value == value {
		if head.Next != nil {
			this.Head = this.Head.Next
			this.Head.Last = nil
		} else {
			this.Head = nil
		}
		this.Size--
		return true, nil
	}

	for {
		head = head.Next

		if head == nil {
			break
		}

		if head.Value == value {
			break
		}
	}

	if head.Value != value {
		return false, errors.New("%v not found in list")
	}

	if head.Next != nil {
		head.Value = head.Next.Value
		head.Next = head.Next.Next
	} else {
		head.Last.Next = nil
		//head.Last = nil
	}

	this.Size--
	return true, nil
}

func main() {
	this := NewLinkList(-1)
	this.First(10)
	this.First(40)
	this.After(20)
	this.After(30)
	this.First(1)

	/*fmt.Printf("len:%d,arr:%v\n\n", this.GetSize(), this.LRange())
	for i := 5; i > 0; i-- {
		this.DeleteByIndex(this.GetSize()-1)
		fmt.Printf("len:%d,arr:%v\n", this.GetSize(), this.LRange())
	}*/

	fmt.Printf("len:%d,arr:%v\n\n", this.GetSize(), this.LRange())
	for i := 0; i  < 5; i++ {
		this.DeleteByIndex(0)
		fmt.Printf("len:%d,arr:%v\n", this.GetSize(), this.LRange())
	}

	/*fmt.Printf("this size:%d\n",this.GetSize())
	fmt.Println(this.LRange())// 1,40,10,20,30

	fmt.Println()
	this.DeleteByValue(1)
	fmt.Println(this.LRange())// 40,10,20,30
	fmt.Printf("this size:%d\n",this.GetSize())

	fmt.Println()
	this.DeleteByValue(20)
	fmt.Println(this.LRange())// 40,10,30
	fmt.Printf("this size:%d\n",this.GetSize())


	fmt.Println()
	this.DeleteByValue(30)
	fmt.Println(this.LRange())// 40,10
	fmt.Printf("this size:%d\n",this.GetSize())

	fmt.Println()
	this.DeleteByValue(10)
	fmt.Println(this.LRange())// 40
	fmt.Printf("this size:%d\n",this.GetSize())

	fmt.Println()
	this.DeleteByValue(40)
	fmt.Println(this.LRange())// []
	fmt.Printf("this size:%d\n",this.GetSize())
	*/

	fmt.Println("-------------------------------")
	/*
		fmt.Println(this.LRange())//1,40,10,20,30
		this.DeleteByIndex(0)
		//fmt.Printf("this size:%d\n",this.GetSize())
		fmt.Println(this.LRange())//40,10,20,30
		fmt.Println()
		this.DeleteByIndex(this.GetSize()-1)
		fmt.Println(this.LRange())// 40,10,20

		fmt.Println()
		this.DeleteByIndex(1)
		fmt.Println(this.LRange())// 40,20

		fmt.Println()
		this.DeleteByIndex(1)
		fmt.Println(this.LRange())// 40
		fmt.Printf("this size:%d\n",this.GetSize()) //1

		fmt.Println()
		_,err :=this.DeleteByIndex(this.GetSize()-1)
		fmt.Printf("del error:%v\n",err)
		fmt.Println(this.LRange())// 40
		fmt.Printf("this size:%d\n",this.GetSize()) //1

		fmt.Println()
		_,err =this.DeleteByIndex(0)
		fmt.Printf("del error:%v\n",err)
		fmt.Println(this.LRange())// 40
		fmt.Printf("this size:%d\n",this.GetSize()) //1
	*/
}
内容概要:本文档围绕六自由度机械臂的ANN人工神经网络设计展开,涵盖正向与逆向运动学求解、正向动力学控制,并采用拉格朗日-欧拉法推导逆向动力学方程,所有内容均通过Matlab代码实现。同时结合RRT路径规划与B样条优化技术,提升机械臂运动轨迹的合理性与平滑性。文中还涉及多种先进算法与仿真技术的应用,如状态估计中的UKF、AUKF、EKF等滤波方法,以及PINN、INN、CNN-LSTM等神经网络模型在工程问题中的建模与求解,展示了Matlab在机器人控制、智能算法与系统仿真中的强大能力。; 适合人群:具备一定Ma六自由度机械臂ANN人工神经网络设计:正向逆向运动学求解、正向动力学控制、拉格朗日-欧拉法推导逆向动力学方程(Matlab代码实现)tlab编程基础,从事机器人控制、自动化、智能制造、人工智能等相关领域的科研人员及研究生;熟悉运动学、动力学建模或对神经网络在控制系统中应用感兴趣的工程技术人员。; 使用场景及目标:①实现六自由度机械臂的精确运动学与动力学建模;②利用人工神经网络解决传统解析方法难以处理的非线性控制问题;③结合路径规划与轨迹优化提升机械臂作业效率;④掌握基于Matlab的状态估计、数据融合与智能算法仿真方法; 阅读建议:建议结合提供的Matlab代码进行实践操作,重点理解运动学建模与神经网络控制的设计流程,关注算法实现细节与仿真结果分析,同时参考文中提及的多种优化与估计方法拓展研究思路。
评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
红包 添加红包
表情包 插入表情
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值