//获得单链表的第i个数据元素
public T GetElem(int index)
{
if (IsEmpty())
{
Console.WriteLine("The LinkList is empty,you can not get any element!");
return(default(T));
}
if (index < 0)
{
Console.WriteLine("The element's position want to get is littler than head,you can not do this! ");
return(default(T));
}
else if (index > GetLength() - 1)
{
Console.WriteLine("The element's position want to get is bigger than this LinkList's length,you can not do this!");
return(default(T));
}
Node1 <T> p = head;
int len = 0;
while (p.Next != null && len < index)
{
p = p.Next;
len++;
}
return(p.Data);
}
//删除单链表中相同值的节点(未完成)
public LinkList1 <int> Purge(LinkList1 <int> a)
{
LinkList1 <int> b = new LinkList1 <int>();
Node1 <int> p = new Node1 <int>();
Node1 <int> s = new Node1 <int>();
p = a.head;
s = p;
p = p.Next;
s.Next = null;
b.head = s;
while (p != null)
{
while (s != null)
{
if (p.Data != s.Data)
{
s = p;
p = p.Next;
Node1 <int> q = b.head;
b.head = s;
s.Next = q;
s.Next.Next = null;
}
s = s.Next;
}
}
return(b);
}
//求单链表的长度(最大索引+1)
public int GetLength()
{
Node1 <T> p = head;
int len = 0;
while (p.Next != null)
{
p = p.Next;
len++;
}
return(len + 1);
}
//在单链表的索引为i的结点的位置前插入一个值为item的结点
public void Insert(T item, int index)
{
//单链表为空，切插入元素位置不为0
if (IsEmpty() && index != 0)
{
Console.WriteLine("The LinkList is empty,but the position you want to insert is not head,it is not allow!");
return;
}
if (index < 0)
{
Console.WriteLine("The position you want to insert is smaller than the head , it is not allow!(The index you input must be bigger than 0)");
return;
}
else if (index > GetLength() - 1)
{
Console.WriteLine("The position you want to insert is bigger than this LinkList's length,you have to let the index littler than this LinkList's length");
return;
}
//插入单链表头部
if (index == 0)
{
Node1 <T> p = head;
head.Data = item;
head.Next = p;
return;
}
//不插入单链表头部
int i = 0;
Node1 <T> q = head;
Node1 <T> r = new Node1 <T>();
while (q.Next != null && i < index)
{
r = q;
q = q.Next;
i++;
}
if (i == index)
{
Node1 <T> k = new Node1 <T>(item);
k.Next = q;
r.Next = k;
}
}
//删除单链表的第i个结点
public void Delete(int index)
{
if (IsEmpty())
{
Console.WriteLine("The LinkList is empty,you can not do this!");
return;
}
if (index < 0)
{
Console.WriteLine("The position you want to delete is littler than head,you can not do this!(You have to make the index bigger than 0)");
return;
}
else if (index > GetLength())
{
Console.WriteLine("The position you want to delete is bigger than this LinkList's length,you can not do this!");
return;
}
int i = 0;
Node1 <T> p = head;
Node1 <T> r = new Node1 <T>();
while (p.Next != null && i < index)
{
r = p;
p = p.Next;
i++;
}
if (i == index && index != 0)
{
if (index == 0)
{
head = head.Next;
}
else if (index == GetLength() - 1)
{
r.Next = null;
}
else
{
r.Next = p.Next;
}
}
}
//在单链表的末尾添加新元素
public void Append(T item)
{
Node1 <T> p = new Node1 <T>(item);
Node1 <T> q = new Node1 <T>();
if (head == null)
{
head = p;
return;
}
q = head;
while (q.Next != null)
{
q = q.Next;
}
q.Next = p;
}
//在单链表中查找值为value的结点
public int Locate(T item)
{
if (IsEmpty())
{
Console.WriteLine("The LinkList is empty,you can not do this!");
return(-1);
}
Node1 <T> p = head;
int len = 0;
while (p.Next != null && !p.Data.Equals(item))
{
p = p.Next;
len++;
}
if (!p.Data.Equals(item) && len == GetLength() - 1)
{
return(-1);
}
return(len);
}
public Node1()
{
this.data = default(T);
this.next = null;
}
public Node1(Node1 <T> p)
{
this.data = default(T);
this.next = p;
}
public Node1(T val)
{
this.data = val;
this.next = null;
}
//构造
public Node1(T val, Node1 <T> p)
{
this.data = val;
this.next = p;
}
//清空单链表
public void Clear()
{
head = null;
}
//将升序排列的两表合并成一个升序排列的表
public LinkList1 <int> Merge(LinkList1 <int> Ha, LinkList1 <int> Hb)
{
#region 把节点插入到链表尾部合并，时间复杂度为O((m+n)*k),m是Ha的表长,n是Hb的表长，k是Hc的表长
//LinkList1<int> Hc = new LinkList1<int>();
//Node1<int> p = Ha.head;
//Node1<int> q = Hb.head;
//Node1<int> c = Hc.head;
//if (p.Data<q.Data)
//{
// Hc.Append(p.Data);
// p = p.Next;
//}
//else
//{
// Hc.Append(q.Data);
// q = q.Next;
//}
//while (p!=null&&q!=null)
//{
// if (p.Data<q.Data)
// {
// Hc.Append(p.Data);
// p = p.Next;
// }
// else
// {
// Hc.Append(q.Data);
// q = q.Next;
// }
//}
//if (p==null&&q!=null)
//{
// while (q!=null)
// {
// Hc.Append(q.Data);
// q = q.Next;
// }
//}else if (p!=null&&q==null)
//{
// while (p!=null)
// {
// Hc.Append(p.Data);
// p = p.Next;
// }
//}
//return Hc;
#endregion
#region 把节点插入到链表头部合并
LinkList1 <int> Hc = new LinkList1 <int>();
Node1 <int> p = Ha.head;
Node1 <int> q = Hb.head;
Node1 <int> c = new Node1 <int>();
if (p.Data < q.Data)
{
Hc.head = p;
p = p.Next;
Hc.head.Next = null;
}
else
{
Hc.head = q;
q = q.Next;
}
while (p != null && q != null)
{
if (p.Data < q.Data)
{
c = Hc.head;
Hc.head = p;
p = p.Next;
Hc.head.Next = c;
}
else
{
c = Hc.head;
Hc.head = q;
q = q.Next;
Hc.head.Next = c;
}
}
if (p == null && q != null)
{
while (q != null)
{
c = Hc.head;
Hc.head = q;
q = q.Next;
Hc.head.Next = c;
}
}
else if (p != null && q == null)
{
while (p != null)
{
c = Hc.head;
Hc.head = p;
p = p.Next;
Hc.head.Next = c;
}
}
if (p == null && q == null)
{
Hc.ReversLinkList();
}
return(Hc);
#endregion
}
//倒置，头插法
public void ReversLinkList()
{
#region MyMethod
//if (IsEmpty())
//{
// Console.WriteLine("The LinkList is empty,you can not do this!");
// return;
//}
//else if (GetLength() == 1)
//{
// Console.WriteLine("The LinkList just has one element,it do not need to revers!");
// return;
//}
//else if (GetLength() == 2)
//{
// Node1<T> k = head.Next;
// head.Next = null;
// k.Next = head;
// head = k;
// return;
//}
//Node1<T> p = head.Next;
//Node1<T> q = new Node1<T>();
//head.Next = null;
//int len = 0;
//while (p.Next != null)
//{
// q = p;
// p = p.Next;
// q.Next = head;
// head = q;
// len++;
// if (p.Next == null)
// {
// p.Next = head;
// head = p;
// break;
// }
//}
#endregion
#region TheMethodInBook
if (IsEmpty())
{
Console.WriteLine("The LinkList is empty,you can not do this!");
return;
}
Node1 <T> p = head.Next;
Node1 <T> q = new Node1 <T>();
head.Next = null;
//int len = 0;
while (p != null)
{
q = p;
p = p.Next;
q.Next = head;
head = q;
}
#endregion
}
//构造器
public LinkList1()
{
head = null;
}
