C#数据结构:单链表
1、自定义单链表结构:
- 单链节点类
using System.Collections;
using System.Collections.Generic;
using UnityEngine;
/// <summary>
/// 单链表节点
/// </summary>
/// <typeparam name="T"></typeparam>
public class Node<T>
{
private T data;//数据
private Node<T> next; //指针,下个元素
public T Data
{
get
{
return data;
}
set
{
data = value;
}
}
public Node<T> Next
{
get
{
return next;
}
set
{
next = value;
}
}
public Node()
{
data = default(T);
next = null;
}
public Node(T _data, Node<T> _next)
{
this.data = _data;
this.next = _next;
}
public Node(T _data)
{
this.data = _data;
this.next = null;
}
public Node(Node<T> _next)
{
this.next = _next;
}
}
- 单链表类
/// <summary>
/// 单链表
/// </summary>
/// <typeparam name="T"></typeparam>
public class LinkList<T>
{
private Node<T> head;//头指针
public LinkList()
{
head = new Node<T>();
}
//判空
public bool IsEmpty()
{
return head.Next == null;
}
//添加操作
public void Add(T item,bool isHeadAdd=false)
{
if(isHeadAdd)
{
Insert(item, 0);
return;
}
if(IsEmpty())
{
head.Next = new Node<T>(item);
}
else
{
Node<T> temp = head;
while (true)
{
if(temp.Next!=null)
{
temp = temp.Next;
}
else
{
break;
}
}
temp.Next = new Node<T>(item);
}
}
//插入操作
public void Insert(T item, int index)
{
if (index < 0 || index > GetLength()) //可以插到尾部
{
Debug.LogError("index不合法!");
return;
}
Node<T> newNode = new Node<T>(item);
if(index==0)//头插入
{
Node<T> temp = head.Next;
head.Next = newNode;
newNode.Next = temp;
}
else
{
Node<T> temp = head;
for (int i = 0; i < index ; i++)
{
temp = temp.Next;
}
Node<T> preNode = temp;
Node<T> currteNode = temp.Next;
preNode.Next = newNode;
newNode.Next = currteNode;
}
}
//删除操作
public T Delete(int index)
{
T data = default(T);
if (index < 0 || index > GetLength()-1)
{
Debug.LogError("index不合法!");
return data;
}
Node<T> temp = head;
for (int i = 0; i < index; i++)
{
temp = temp.Next;
}
Node<T> preNode = temp;
Node<T> currteNode = temp.Next;
preNode.Next = currteNode.Next;
data = currteNode.Data;
currteNode = null;
return data;
}
public T this[int index]//索引器访问值
{
get
{
T data = default(T);
if (index < 0 || index > GetLength() - 1)
{
Debug.LogError("index不合法!");
return data;
}
Node<T> temp = head;
for(int i=0;i<=index;i++)
{
temp = temp.Next;
}
return temp.Data;
}
}
//访问index位置的值
public T GetElem(int index)
{
return this[index];
}
//链表长度
public int GetLength()
{
int length = 0;
if(!IsEmpty())
{
Node<T> temp = head;
while (true)
{
if (temp.Next != null)
{
length++;
temp = temp.Next;
}
else
{
break;
}
}
}
return length;
}
//寻址
public int Locate(T value)//有相同值的返回首次查找到的元素的index
{
if(!IsEmpty())
{
int index = 0;
Node<T> temp = head;
while(true)
{
if(temp.Next!=null)
{
temp = temp.Next;
if (temp.Data.Equals(value))
{
return index;
}
index++;
}
else
{
break;
}
}
Debug.Log("无此值!");
return -1;
}
else
{
Debug.Log("空表!");
return -1;
}
}
//清空操作
public void Clear()
{
head.Next = null;
}
//显示表元素
public void Display()
{
if (IsEmpty())
{
Debug.Log("表空");
return;
}
Debug.Log("表中的值:");
int index = 0;
Node<T> temp = head;
while (true)
{
if (temp.Next != null)
{
temp = temp.Next;
Debug.Log("index:" + index.ToString() + " value:" +temp.Data);
index++;
}
else
{
break;
}
}
}
}
- 单链表测试用例:
using System.Collections;
using System.Collections.Generic;
using UnityEngine;
public class _002_SingleLinkTable : MonoBehaviour {
LinkList<string> sqeList;
void Start()
{
//初始化顺序表
sqeList = new LinkList<string>();
////判空操作
Debug.Log("单链表是否为空:" + sqeList.IsEmpty());
////添加操作
Debug.Log("头插法,添加操作--------------添加'123','456','789'");
sqeList.Add("123",true);
sqeList.Add("456",true);
sqeList.Add("789",true);
sqeList.Display();
Debug.Log("尾插法,添加操作--------------添加'123','456','789'");
sqeList.Add("123");
sqeList.Add("456");
sqeList.Add("789");
sqeList.Display();
Debug.Log("单链表是否为空:" + sqeList.IsEmpty());
////插入操作
Debug.Log("单链表插入操作---------------在index=3处插入字符串:'111'");
sqeList.Insert("111", 3);
sqeList.Display();
////删除操作
sqeList.Delete(2);
Debug.Log("单链表删除操作---------------删除index=2的元素");
sqeList.Display();
////表长
Debug.Log("单链表表长-------------------单链表表长:" + sqeList.GetLength());
////查找
Debug.Log("单链表查找--------------index查value");
Debug.Log("index=0的值:" + sqeList[0]);
Debug.Log("index=2的值:" + sqeList.GetElem(2));
Debug.Log("单链表查找--------------value查index");
////寻址
Debug.Log("'789’的index值:" + sqeList.Locate("789"));
////清空
Debug.Log("清空单链表");
sqeList.Clear();
sqeList.Display();
}
}
运行结果:
注意:
1.单链表在访问值时,只能从头节点访问下去,只能通过前一节点访问到下一节点,很多时候需要借助临时变量来存储需要的节点。
2.单链表的添加可以是尾插方式,也可以是头插法方式.
采用头插法,创建出的是一个逆序表,先输入的在最后。
3.head是表头指针,head.next=null表示该表为空表,表如果不为空,head.next就是首节点,某个节点node.next=null,表示该node为尾节点。