反转单链表 C#

来源：互联网发布：上海行知教育英语培训编辑：程序博客网时间：2024/06/06 16:49

目前网上关于c#的反转链表的比较少所以发个给学c#的朋友们看看，大家共同进步哈~

//main

namespace 单链表反转
{
    class Program
    {
        static void Main(string[] args)
        {
            int flag = 0;
            LinkedList Lin = new LinkedList();
            Node Current = new Node();
            Current.Element = "header";

            Current=Lin.CreateNodeList(Current,flag);
            Console.WriteLine("原先的链表,包括一个链表头");
            Lin.PrintListByParameter(Current);
            Console.WriteLine("递归方式反转链表，考虑了链表头前置的情况");
            Lin.PrintListByParameter(Lin.ReversalList(Current, Current.Link));
            Console.WriteLine("非递归方式反转链表，没有考虑连表头前置的情况");
            Current = Lin.CreateNodeList(Current, flag);
            Lin.PrintListByParameter(Lin.ReversalList(Current));

Console.Read();

}
}
}

//linkedlist 包括对链表进行操作的类

namespace 单链表反转
{
public class LinkedList
    {

      private Node header;

       public LinkedList()
        {
            header = new Node("header");
        }

       public Node CreateNodeList(Node Nodelist,int i)//建立一个0-9的链表
        {
           if (i != 10)
            {
                Nodelist.Link = new Node(i.ToString());
                i++;
                CreateNodeList(Nodelist.Link, i);
            }

return Nodelist;
}

       public void PrintListByParameter(Node N)//将参数链表打印出来
        {

          Console.WriteLine(N.Element);
           while (!(N.Link == null))
            {
               Console.WriteLine(N.Link.Element);
                N = N.Link;
            }
        }

       public Node ReversalList(Node Node1,Node Node2)// 递归方式考虑了header
        {

                if (Node2 ==null)
                {
                   return null;
                }
               else
                {
                   if (Node2.Link == null)
                    {
                        header.Link = Node2;
                        Node2.Link = Node1;
                        Node1.Link = null;
                       return header;
                    }
                   else
                    {
                        ReversalList(Node2, Node2.Link);
                        Node2.Link = Node1;
                       if (Node2.Link.Element.ToString() == "header")
                        {
                            Node2.Link = null;
                           return header;
                        }
                        Node1.Link = null;
                       return header;
                    }
                }

}

       public Node ReversalList(Node Current)//非递归方式没有考虑header
       {
           Node Medium = new Node();
           Node Medium1 = new Node();

while (Current != null)
{

               Medium1 = Current.Link;
               Current.Link = Medium;
               Medium = Current;
               Current = Medium1;
           }

return Medium;
}
}
}

//用class来定义一个链表

namespace 单链表反转
{
   public class Node
    {
        public Object Element;//用来储存节点数据

        public Node Link;//指向表内下一个节点的引用
        public Node()
        {
            Element = null;
            Link = null;
        }

        public Node(Object theElement)
        {
            Element = theElement;
            Link = null;
        }

}
}