如題，c#版電商SKU排列組合結(jié)果查詢算法示例代碼

 class Program
    {
        static void sku(string nn,int c,List<string> L, List<List<string>> ooop)
        {
            c = c + 1;
            foreach (var value in L)
            {  
                if (ooop.Count > c)
                {
                    var mm = nn + "," + value;
                    sku(mm, c, ooop[c], ooop);
                }
                else
                { 
                    Console.WriteLine(nn + "," + value);
                }
            }
        }
 
        static void Main(string[] args)
        {
            List<string> L1 = new List<string>() { "藍(lán)色", "灰色", "紅色" };
            List<string> L2 = new List<string>() { "S", "M", "L" };
            List<string> L3 = new List<string>() { "圓領(lǐng)", "心領(lǐng)" }; 
            List<List<string>> ooop = new List<List<string>>() { L1, L2, L3}; 
 
 
            if (ooop.Count>0)
            {
                sku("", 0, ooop[0], ooop);
            } 
            Console.Read(); 
        }
    }

延伸閱讀：js版電商SKU排列組合結(jié)果查詢算法代碼示例