C#数组解决约瑟夫环问题

最新推荐文章于 2023-04-08 17:14:42 发布

weixin_34191734

最新推荐文章于 2023-04-08 17:14:42 发布

阅读量311

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/shuanglangdeliubei/p/5704097.html

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;

namespace 约瑟夫环
{
    class Program
    {
        static int[] Jose(int total, int start, int alter)
        {

            int j, k = 0;
            int[] intCounts = new int[total + 1];
            int[] intPers = new int[total + 1];
            for (int i = 0; i < total; i++)
            {
                intPers[i] = i;

            }
            for (int i = total; i >= 2; i--)
            {
                start = (start + alter - 1) % i;
                if (start == 0)
                {
                    start = i;
                }
                intCounts[k] = intPers[start];
                k++;
                for (j = start + 1; j <= i; j++)
                {
                    intPers[j - 1] = intPers[j];

                }
            }
            intCounts[k] = intPers[1];

            return intCounts;

        }
        static void Main(string[] args)
        {
            int[] intPers = Jose(12, 3, 4);
            Console.WriteLine("出列顺序");
            for (int i = 0; i < intPers.Length; i++)
            {
                Console.Write(intPers[i] + " ");

            }
            Console.ReadLine();
        }
    }
}