[原创]c#,单链表,数据结构
2007-08-13 14:34
465 查看
//链表结点
class SingleLink
{
private int idata;
public int Data
{
get
{ return idata; }
set
{ idata = value; }
}
public SingleLink next;
public SingleLink()
{
idata = -1;
next = null;
}
public SingleLink(int data)
{
idata = data;
next = null;
}
}
//链表
class SingleLinkList
{
private SingleLink head;
private SingleLink rear;
private SingleLinkList[] my=new SingleLinkList[100];
public SingleLinkList()
{
head = new SingleLink();
rear = new SingleLink();
}
public SingleLinkList this [int index]
{
get
{
return my[index];
}
}
public bool IsEmpty()
{
return (head.next==null);
}
public SingleLink FindSingleLink(int search)
{
SingleLink p = new SingleLink();
p = head;
if (p.next == null)
{
Console.WriteLine("the link is empty.");
return null;
}
while (p.next != null)
{
if (p.Data == search)
{
return p;
}
p=p.next;
}
Console.WriteLine("the link have not the "+search+".");
return null;
}
public bool Insert(int data)
{
if (head.next == null)
{
return InsertAfterHead(data);
}
SingleLink newlink = new SingleLink(data);
newlink.Data = data;
rear.next = newlink;
rear = newlink;
return true;
}
public bool InsertAfter(int search, int data)
{
if (head.next == null)
{
Console.WriteLine("this link is empty.");
return false;
//return InsertAfterHead(data);
}
SingleLink x =FindSingleLink(search);
if (x == null)
{
Console.WriteLine("this link have not the " + search+".");
return false;
}
SingleLink newlink = new SingleLink(data);
newlink.Data = data;
newlink.next = x.next;
x.next = newlink;
Console.WriteLine("insert is successful.");
return true;
}
private bool InsertAfterHead(int data)
{
Console.WriteLine("this is the first element.");
SingleLink newlink = new SingleLink(data);
newlink.Data = data;
head.next = newlink;
rear = newlink;
Console.WriteLine("the first element insert successful!");
return true;
}
public void Display()
{
SingleLink p=new SingleLink();
p=head;
if (p.next == null)
{
Console.WriteLine("this link is empty.");
return;
}
p = head.next;
do
{
Console.WriteLine(p.Data.ToString());
p = p.next;
} while (p != null);
}
}
class Program
{
static void Main(string[] args)
{
SingleLinkList list = new SingleLinkList();
Console.WriteLine(list.IsEmpty());
list.InsertAfter(4, 4);
list.Display();
list.Insert(4);
list.Display();
list.Insert(7);
list.Insert(3);
list.Insert(9);
list.InsertAfter(5, 2);
list.InsertAfter(7, 8);
list.Display();
Console.ReadLine();
}
}
class SingleLink
{
private int idata;
public int Data
{
get
{ return idata; }
set
{ idata = value; }
}
public SingleLink next;
public SingleLink()
{
idata = -1;
next = null;
}
public SingleLink(int data)
{
idata = data;
next = null;
}
}
//链表
class SingleLinkList
{
private SingleLink head;
private SingleLink rear;
private SingleLinkList[] my=new SingleLinkList[100];
public SingleLinkList()
{
head = new SingleLink();
rear = new SingleLink();
}
public SingleLinkList this [int index]
{
get
{
return my[index];
}
}
public bool IsEmpty()
{
return (head.next==null);
}
public SingleLink FindSingleLink(int search)
{
SingleLink p = new SingleLink();
p = head;
if (p.next == null)
{
Console.WriteLine("the link is empty.");
return null;
}
while (p.next != null)
{
if (p.Data == search)
{
return p;
}
p=p.next;
}
Console.WriteLine("the link have not the "+search+".");
return null;
}
public bool Insert(int data)
{
if (head.next == null)
{
return InsertAfterHead(data);
}
SingleLink newlink = new SingleLink(data);
newlink.Data = data;
rear.next = newlink;
rear = newlink;
return true;
}
public bool InsertAfter(int search, int data)
{
if (head.next == null)
{
Console.WriteLine("this link is empty.");
return false;
//return InsertAfterHead(data);
}
SingleLink x =FindSingleLink(search);
if (x == null)
{
Console.WriteLine("this link have not the " + search+".");
return false;
}
SingleLink newlink = new SingleLink(data);
newlink.Data = data;
newlink.next = x.next;
x.next = newlink;
Console.WriteLine("insert is successful.");
return true;
}
private bool InsertAfterHead(int data)
{
Console.WriteLine("this is the first element.");
SingleLink newlink = new SingleLink(data);
newlink.Data = data;
head.next = newlink;
rear = newlink;
Console.WriteLine("the first element insert successful!");
return true;
}
public void Display()
{
SingleLink p=new SingleLink();
p=head;
if (p.next == null)
{
Console.WriteLine("this link is empty.");
return;
}
p = head.next;
do
{
Console.WriteLine(p.Data.ToString());
p = p.next;
} while (p != null);
}
}
class Program
{
static void Main(string[] args)
{
SingleLinkList list = new SingleLinkList();
Console.WriteLine(list.IsEmpty());
list.InsertAfter(4, 4);
list.Display();
list.Insert(4);
list.Display();
list.Insert(7);
list.Insert(3);
list.Insert(9);
list.InsertAfter(5, 2);
list.InsertAfter(7, 8);
list.Display();
Console.ReadLine();
}
}
相关文章推荐
- [原创]数据结构学习笔记之一:链表
- 数据结构之链表:实现单链表的k逆序(2)
- 数据结构(java)——单向链表
- 暑假集训第1天链表-数据结构上机测试2-1:单链表操作A
- 数据结构实验之链表一:顺序建立链表
- 数据结构实验之链表七:单链表中重复元素的删除
- 数据结构实验之链表三:链表的逆置
- 【嵌入式Linux C编程】数据结构之链表
- JAVA数据结构之线性表的链式存储结构——单链表
- 算法学习之数据结构之双向链表
- 【数据结构作业】实验三 单链表的基本操作(必做,设计性实验,4学时)
- 数据结构实验之链表六:有序链表的建立
- 数据结构之栈的链表实现
- 数据结构1 -- 链表的基本方法实现
- 数据结构实现之无序符号表SequentialSearchST(使用链表实现)
- 【2118】数据结构实验之链表三:链表的逆置 (SDUT)
- 数据结构之链表六:有序链表的建立
- 2054数据结构实验之链表九:双向链表
- 数据结构实验之链表五:单链表的拆分
- 数据结构实验之链表三:链表的逆置