asp.net C# 實現任意List的全組合演算法代碼

代碼如下

複製代碼

using System; using System.Collections.Generic; using System.Linq; using System.Text; namespace 演算法 {     class 全組合演算法     {         [Flags]         public enum PersonType         {             Audit = 1,             Child = 2,             Senior = 4         }         public static void Run(string[] args)         {             var lstSource = GetEnumList<PersonType>();             var lstComb = FullCombination(lstSource);             var lstResult = new List<PersonType>();             lstComb.ForEach(item =>             {                 lstResult.Add(item.Aggregate((result, source) => result | source));             });         }         public static List<T> GetEnumList<T>()         {             var lst = new List<T>();             foreach (T item in Enum.GetValues(typeof(T)))             {                 lst.Add(item);             }             return lst;         }         //全組合演算法         public static List<List<T>> FullCombination<T>(List<T> lstSource)         {             var n = lstSource.Count;             var max = 1 << n;             var lstResult = new List<List<T>>();             for (var i = 0; i < max; i++)             {                 var lstTemp = new List<T>();                 for (var j = 0; j < n; j++)                 {                     if ((i >> j & 1) > 0)                     {                         lstTemp.Add(lstSource[j]);                     }                 }                 lstResult.Add(lstTemp);             }             lstResult.RemoveAt(0);             return lstResult;         }     } }