链表

 1.线性表是由n(n >= 0)个相同类型的数据元素构成的有限序列.　有限指的是线性表中的数据元素的个数是有限的,　线性表中的每一个数据元素都有自己的位置.　相同类型指的是线性表中的数据元素都属于同一种类型.

2.线性表中的数据元素之间存在着前后次序的位置关系,　将ai-1称为ai的直接前驱,　将ai+1称为ai的直接后继.　除a1外,其余元素只有一个直接前驱, 除an外,其余元素只有一个直接后继.

3.线性表接口哦定义:

public interface IListDS<T> { int GetLength(); void Clear(); bool IsEmpty(); bool IsFull(); void Append(T item); void Insert(T item, int i); T Delete(int i); T GetElem(int i); int Locate(T value); void Reverse(); }

4.顺序表:指在内存中用一块地址连续的空间依次存放线性表的数据元素.如:数组

类定义:

public class SeqList<T> : IListDS<T> { private int maxsize; private T[] data; private int last; // 索引器 public T this[int index] { get { return data[index]; } set { data[index] = value; } } // 最后一个元素位置 public int Last { get { return last; } } public int Maxsize { get { return maxsize; } set { maxsize = value; } } public SeqList(int size) { data = new T[size]; maxsize = size; last = -1; } #region IListDS<T> 成员 public int GetLength() { return last + 1; } public void Clear() { last = -1; } public bool IsEmpty() { if (last == -1) { return true; } else { return false; } } public bool IsFull() { if (last == maxsize - 1) { return true; } else { return false; } } public void Append(T item) { if (IsFull()) { Console.WriteLine("List is full"); return; } data[++last] = item; } public void Insert(T item, int i) { if (IsFull()) { Console.WriteLine("List is full"); return; } if (i < 1 || i > last + 2) { Console.WriteLine("Position is error!"); return; } if (i == last + 2) { data[last + 1] = item; } else { for (int j = last; j >= i - j; --j) { data[j + 1] = data[j]; } data[i - 1] = item; } ++last; } public T Delete(int i) { T tmp = default(T); if (IsEmpty()) { Console.WriteLine("List is Empty"); return tmp; } if (i < 1 || i > last + 1) { Console.WriteLine("Position is error!"); return tmp; } if (i == last + 1) { tmp = data[last--]; } else { tmp = data[i - 1]; for (int j = i; j <= last; ++j) { data[j] = data[j + 1]; } } --last; return tmp; } public T GetElem(int i) { if (IsEmpty() || i < 1 || i > (last + 1)) { return default(T); } return data[i - 1]; } public int Locate(T value) { if (IsEmpty()) { Console.WriteLine("List is empty!"); return -1; } int i = 0; for (int j = 0; j <= last; j++) { if (value.Equals(data[i])) { i = j; break; } } if (i > last) { return -1; } return i; } public void Reverse() { T tmp = default(T); int len = GetLength(); for (int i = 0; i <= len / 2; i++) { tmp = data[i]; data[i] = data[len - i]; data[len - i] = tmp; } } #endregion }

类应用:(链表合并,删除链表重复元素)

public class SeqListApply { public SeqListApply() { } public SeqList<int> Merge(SeqList<int> La, SeqList<int> Lb) { SeqList<int> Lc = new SeqList<int>(La.Maxsize + Lb.Maxsize); int i = 0; int j = 0; int k = 0; while ((i <= (La.GetLength() - 1)) && (j <= (Lb.GetLength() - 1))) { if (La[i] < Lb[j]) { Lc.Append(La[i++]); } else { Lc.Append(Lb[j++]); } } while (i <= (La.GetLength() - 1)) { Lc.Append(La[i++]); } while (j <= (Lb.GetLength() - 1)) { Lc.Append(Lb[j++]); } return Lc; } public SeqList<int> Purge(SeqList<int> La) { SeqList<int> Lb = new SeqList<int>(La.Maxsize); Lb.Append(La[0]); for (int i = 1; i <= La.GetLength() - 1; ++i) { int j = 0; for (j = 0; j <= Lb.GetLength() - 1; ++j) { if (La[i].CompareTo(Lb[j]) == 0) { break; } } if (j > Lb.GetLength() - 1) { Lb.Append(La[i]); } } return Lb; } }

5.单链表:　用一组任意的存储单元类存储线性表中的数据元素.

节点定义:

public class Node<T> { private T data; private Node<T> next; public Node(T val, Node<T> p) { data = val; next = p; } public Node(Node<T> p) { next = p; } public Node(T val) { data = val; next = null; } public Node() { data = default(T); next = null; } public T Data { get { return data; } set { data = value; } } public Node<T> Next { get { return next; } set { next = value; } } }

6.链表定义:

public class LinkList<T> : IListDS<T> { private Node<T> head; public Node<T> Head { get { return head; } set { head = value; } } public LinkList() { head = null; } #region IListDS<T> 成员 public int GetLength() { Node<T> p = head; int len = 0; while (p != null) { ++len; p = p.Next; } return len; } public void Clear() { head = null; } public bool IsEmpty() { if (head == null) { return true; } else { return false; } } public void Append(T item) { Node<T> q = new Node<T>(item); Node<T> p = new Node<T>(); if (head == null) { head = q; return; } p = head; while (p.Next != null) { p = p.Next; } p.Next = q; } public void Insert(T item, int i) { if (IsEmpty() || i < 1) { Console.WriteLine("List is empty or position is error!"); return; } if (i == 1) { Node<T> q = new Node<T>(item); q.Next = head; head = q; return; } Node<T> p = head; Node<T> r = new Node<T>(); int j = 1; while (p.Next != null && j < i) { r = p; p = p.Next; ++j; } if (j == i) { Node<T> q = new Node<T>(item); q.Next = p; r.Next = q; } } public void InsertPost(T item, int i) { if (IsEmpty() || i < 1) { Console.WriteLine("List is empty or position is error!"); return; } if (i == 1) { Node<T> q = new Node<T>(item); q.Next = head.Next; head.Next = q; return; } Node<T> p = head; int j = 1; while (p != null && j < i) { p = p.Next; ++j; } if (j == i) { Node<T> q = new Node<T>(item); q.Next = p.Next; p.Next = q; } } public T Delete(int i) { if (IsEmpty() || i < 0) { Console.WriteLine("List is empty or position is error!"); return default(T); } Node<T> q = new Node<T>(); if (i == 1) { q = head; head = head.Next; return q.Data; } Node<T> p = head; int j = i; while (p.Next != null && j < i) { ++j; q = p; p = p.Next; } if (j == i) { q.Next = p.Next; return p.Data; } else { Console.WriteLine("The ith node is not exist!"); return default(T); } } public T GetElem(int i) { if (IsEmpty()) { Console.WriteLine("List is empty!"); return default(T); } Node<T> p = new Node<T>(); p = head; int j = 1; while (p.Next != null && j < i) { ++j; p = p.Next; } if (j == i) { return p.Data; } else { Console.WriteLine("The ith node is not exist"); return default(T); } } public int Locate(T value) { if (IsEmpty()) { Console.WriteLine("List is empty!"); return -1; } Node<T> p = new Node<T>(); p = head; int i = 1; while (!p.Data.Equals(value)) { p = p.Next; ++i; } return i; } public void Reverse() { Node<T> p = head.Next; Node<T> q = new Node<T>(); head.Next = null; while (p != null) { q = p; p = p.Next; q.Next = head.Next; head.Next = q; } } public bool IsFull() { throw new Exception("The method or operation is not implemented."); } #endregion }

7.链表应用(合并和删除重复元素)

public class LinkListApply { public LinkListApply() { } LinkList<int> CreateLListHead() { int d; LinkList<int> L = new LinkList<int>(); d = Int32.Parse(Console.ReadLine()); while (d != -1) { Node<int> p = new Node<int>(d); p.Next = L.Head; L.Head = p; d = Int32.Parse(Console.ReadLine()); } return L; } LinkList<int> CreateListTail() { Node<int> R = new Node<int>(); int d; LinkList<int> L = new LinkList<int>(); R = L.Head; d = Int32.Parse(Console.ReadLine()); while (d != -1) { Node<int> p = new Node<int>(d); if (L.Head == null) { L.Head = p; } else { R.Next = p; } R = p; d = Int32.Parse(Console.ReadLine()); } if (R != null) { R.Next = null; } return L; } public LinkList<int> Merge(LinkList<int> Ha, LinkList<int> Hb) { LinkList<int> Hc = new LinkList<int>(); Node<int> p = Ha.Head; Node<int> q = Hb.Head; Node<int> s = new Node<int>(); Hc = Ha; Hc.Head = null; while (p != null && q != null) { if (p.Data < q.Data) { s = p; p = p.Next; } else { s = q; q = q.Next; } s.Next = Hc.Head; Hc.Head = s; } if (p == null) { p = q; } while (p != null) { s = p; p = p.Next; s.Next = Hc.Head; Hc.Head = s; } return Hc; } public LinkList<int> Purge(LinkList<int> Ha) { LinkList<int> Hb = new LinkList<int>(); Node<int> p = Ha.Head; Node<int> q = new Node<int>(); Node<int> s = new Node<int>(); s = p; p = p.Next; s.Next = null; Hb.Head = s; while (p != null) { s = p; p = p.Next; q = Hb.Head; while (q != null && q.Data != s.Data) { q = q.Next; } if (q == null) { s.Next = Hb.Head; Hb.Head = s; } } return Hb; } }