C#實現排列組合演算法

來源:互聯網
上載者:User

數學中排列組合,排列P(N,R)

其實排列實現了,組合也就實現了組合C(N,R)就是P(N,R)/P(R,R) ,比較簡單的是遞迴演算法,但考慮到遞迴的效能,下面採用了2種非遞迴的方法,代碼如下

using System;using System.Collections.Generic;namespace Test{    class Program     {        static void Main(string[] args)        {            Console.WriteLine(P1(6, 3));            Console.WriteLine(P2(6, 3));            Console.WriteLine(C(6, 2));        }        /// <summary>        /// 排列迴圈方法        /// </summary>        /// <param name="N"></param>        /// <param name="R"></param>        /// <returns></returns>        static long P1(int N, int R)        {            if (R > N || R <= 0 || N <= 0 ) throw new ArgumentException("params invalid!");            long t = 1;            int i = N;                        while (i!=N-R)            {                try                {                    checked                    {                        t *= i;                    }                }                catch                {                    throw new OverflowException("overflow happens!");                }                --i;            }            return t;        }        /// <summary>        /// 排列堆棧方法        /// </summary>        /// <param name="N"></param>        /// <param name="R"></param>        /// <returns></returns>        static long P2(int N, int R)        {            if (R > N || R <= 0 || N <= 0 ) throw new ArgumentException("arguments invalid!");            Stack<int> s = new Stack<int>();            long iRlt = 1;            int t;            s.Push(N);            while ((t = s.Peek()) != N - R)            {                try                {                    checked                    {                        iRlt *= t;                    }                }                catch                {                    throw new OverflowException("overflow happens!");                }                s.Pop();                s.Push(t - 1);            }            return iRlt;        }        /// <summary>        /// 組合        /// </summary>        /// <param name="N"></param>        /// <param name="R"></param>        /// <returns></returns>        static long C(int N, int R)        {            return P1(N, R) / P1(R, R);        }    }    }

  

相關文章

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.