定义整数范围的组合/排列的C#算法

using System;
using System.Collections.Generic;

class Program
{
    static void Main(string[] args)
    {
        int[] nums = { 1, 2, 3 }; // 整数范围
        List<List<int>> result = new List<List<int>>();
        List<int> temp = new List<int>();

        // 组合
        Combine(nums, result, temp, 0);

        // 排列
        Permute(nums, result, temp);

        // 输出结果
        Console.WriteLine("组合结果：");
        foreach (List<int> combination in result)
        {
            Console.WriteLine(string.Join(", ", combination));
        }

        Console.WriteLine("排列结果：");
        foreach (List<int> permutation in result)
        {
            Console.WriteLine(string.Join(", ", permutation));
        }
    }

    // 组合算法
    static void Combine(int[] nums, List<List<int>> result, List<int> temp, int start)
    {
        result.Add(new List<int>(temp));

        for (int i = start; i < nums.Length; i++)
        {
            temp.Add(nums[i]);
            Combine(nums, result, temp, i + 1);
            temp.RemoveAt(temp.Count - 1);
        }
    }

    // 排列算法
    static void Permute(int[] nums, List<List<int>> result, List<int> temp)
    {
        if (temp.Count == nums.Length)
        {
            result.Add(new List<int>(temp));
        }
        else
        {
            for (int i = 0; i < nums.Length; i++)
            {
                if (temp.Contains(nums[i]))
                {
                    continue;
                }
                temp.Add(nums[i]);
                Permute(nums, result, temp);
                temp.RemoveAt(temp.Count - 1);
            }
        }
    }
}