单链表类(C#)

public class Node<T>
    {
        public T Data { get; set; }

        public Node<T> Next { get; set; }

        public Node(T item)
        {
            this.Data = item;
            this.Next = null;
        }

        public Node()
        {
            this.Data = default(T);
            this.Next = null;
        }
    }[/mw_shl_code


[mw_shl_code=csharp,true]public class LinkList<T>
    {
        public Node<T> Head { get; set; }

        public LinkList()
        {
            Head = null;
        }
        

        /// <summary>
        /// 增加新元素到链尾
        /// </summary>
        /// <param name="item"></param>
        public void Append(T item)
        {
            Node<T> foot = new Node<T>();
            Node<T> A = new Node<T>();
            if (Head==null)
            {
                Head = foot;
                return;
            }

            A = Head;

            while (A.Next!=null)
            {
                A = A.Next;
            }
            A.Next = foot;
        }
        
        /// <summary>
        /// 删除链表元素
        /// </summary>
        public void  Delete(int i)
        {
            if (i==1)//表头
            {
                Head = Head.Next;
                return;
            }
            Node<T> A = new Node<T>();
            Node<T> B = new Node<T>();
            B = Head;
            int j = 1;
            while (B.Next != null&&j<i)
            {
                A = B;
                B = B.Next;
                j++;
            }
            if (j==i)
            {
                A.Next = B.Next;
            }  
        }

        /// <summary>
        /// 计算链表元素个数
        /// </summary>
        /// <returns></returns>
        public int GetLength()
        {
            Node<T> p = Head;
            int length = 0;
            while (p!=null)
            {
                p = p.Next;
                length++;
            }
            return length;
        }

        /// <summary>
        /// 判断链表是否为空
        /// </summary>
        /// <returns></returns>
        public bool IsEmpty()
        {
            if (Head == null)
                return true;
            else
                return false;
        }

        /// <summary>
        /// 清空链表
        /// </summary>
        public void Clear()
        {
            Head = null;
        }

        /// <summary>
        /// 获取当前位置的结点值
        /// </summary>
        /// <param name="i"></param>
        /// <returns></returns>
        public T GetNodeValue(int i)
        {
            if (IsEmpty()||i<1||i>GetLength())
            {
                Console.WriteLine("单链表为空或结点位置有误！");
                return default(T);
            }

            Node<T> A = new Node<T>();
            A = Head;
            int j = 1;

            while (A.Next!=null&&j<i)
            {
                A = A.Next;
                j++;
            }

            return A.Data;
        }

        /// <summary>
        /// 增加单链表插入的位置
        /// </summary>
        /// <param name="item"></param>
        /// <param name="n"></param>
        public void Insert(T item,int n)
        {
            if (IsEmpty()||n<1||n>GetLength())
            {
                Console.WriteLine("单链表为空或结点位置有误！");
                return;
            }

            if (n==1)
            {
                Node<T> H = new Node<T>();
                H.Next = Head;
                Head = H;
                return;
            }
            //========================== 取n结点的值 ===============
            Node<T> A = new Node<T>();
            Node<T> B = new Node<T>();
            B = Head;
            int j = 1;
            while (B.Next != null && j < n)
            {
                A = B;
                B = B.Next;
                j++;
            }
            //end======================= 取n结点的值 ===============
            if (j==n)
            {
                Node<T> C = new Node<T>(item);
                A.Next = C;
                C.Next = B;
            }
        }


    }