C#循环链表 约瑟夫问题

    public class Program
    {
        static void Main(string[] args)
        {
            GetLastOne(2, 6);
            Console.ReadKey();
        }


        static void GetLastOne(int m, int n)
        {
            //构造循环单向链表
            var firstNode = new Node(1);
            var tmpNode = firstNode;
            for (int i = 2; i <= n; i++)
            {
                var next = new Node(i);
                tmpNode.Next = next;
                tmpNode = next;
            }
            tmpNode.Next = firstNode;

            while (firstNode != firstNode.Next)
            {
                //获取自杀节点前一位N1 
                var n1 = firstNode;
                for (int i = 1; i < m-1; i++)
                {
                    n1 = n1.Next;
                }
                //自杀节点
                var killNode = n1.Next;
                Console.WriteLine($"死亡:{killNode.Position}");
                //移除自杀节点
                n1.Next = n1.Next.Next;
                firstNode = n1.Next;
            }
            Console.WriteLine($"幸存：{firstNode.Position}");
        }
    }

    class Node
    {
        public int Position;
        public Node Next;

        public Node(int position)
        {
            Position = position;
        }
    }