c# - 生成所有7张纸牌组合吗？

我正在尝试生成扑克手的所有不同组合，如下所述：

Generating all 5 card poker hands

但是我一直被困住。当在上述URL上尝试NickLarsen的C＃答案时，在第49行出现未处理的异常错误。（https://stackoverflow.com/a/3832781/689881）

我想要的非常简单：生成所有卡片组合，并在一个简单的.txt文件中一次打印一行

另外，我实际上希望所有7张卡组合（而不是5张）。
例如，前两行可能如下所示：

2c2d2h2s3c3d3h
2c2d2h2s3c3d3s

我该如何实现？速度并不重要。

以下是NickLarsen的代码（经过我的修改）失败了：

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

namespace ConsoleApplication20
{
struct Card
{
    public int Suit { get; set; }
    public int Rank { get; set; }
}

class Program
{
    static int ranks = 13;
    static int suits = 4;
    static int cardsInHand = 7;

    static void Main(string[] args)
    {
        List<Card> cards = new List<Card>();
        //cards.Add(new Card() { Rank = 0, Suit = 0 });
        int numHands = GenerateAllHands(cards);

        Console.WriteLine(numHands);
        Console.ReadLine();
    }

    static int GenerateAllHands(List<Card> cards)
    {
        if (cards.Count == cardsInHand) return 1;

        List<Card> possibleNextCards = GetPossibleNextCards(cards);

        int numSubHands = 0;

        foreach (Card card in possibleNextCards)
        {
            List<Card> possibleNextHand = cards.ToList(); // copy list
            possibleNextHand.Add(card);
            numSubHands += GenerateAllHands(possibleNextHand);
        }

        return numSubHands;
    }

    static List<Card> GetPossibleNextCards(List<Card> hand)
    {
        int maxRank = hand.Max(x => x.Rank);

        List<Card> result = new List<Card>();

        // only use ranks >= max
        for (int rank = maxRank; rank < ranks; rank++)
        {
            List<int> suits = GetPossibleSuitsForRank(hand, rank);
            var possibleNextCards = suits.Select(x => new Card { Rank = rank, Suit = x });
            result.AddRange(possibleNextCards);
        }

        return result;
    }

    static List<int> GetPossibleSuitsForRank(List<Card> hand, int rank)
    {
        int maxSuit = hand.Max(x => x.Suit);

        // select number of ranks of different suits
        int[][] card = GetArray(hand, rank);

        for (int i = 0; i < suits; i++)
        {
            card[i][rank] = 0;
        }

        int[][] handRep = GetArray(hand, rank);

        // get distinct rank sets, then find which ranks they correspond to
        IEnumerable<int[]> distincts = card.Distinct(new IntArrayComparer());

        List<int> possibleSuits = new List<int>();

        foreach (int[] row in distincts)
        {
            for (int i = 0; i < suits; i++)
            {
                if (IntArrayComparer.Compare(row, handRep[i]))
                {
                    possibleSuits.Add(i);
                    break;
                }
            }
        }

        return possibleSuits;
    }

    class IntArrayComparer : IEqualityComparer<int[]>
    {
        #region IEqualityComparer<int[]> Members

        public static bool Compare(int[] x, int[] y)
        {
            for (int i = 0; i < x.Length; i++)
            {
                if (x[i] != y[i]) return false;
            }

            return true;
        }

        public bool Equals(int[] x, int[] y)
        {
            return Compare(x, y);
        }

        public int GetHashCode(int[] obj)
        {
            return 0;
        }

        #endregion
    }

    static int[][] GetArray(List<Card> hand, int rank)
    {
        int[][] cards = new int[suits][];
        for (int i = 0; i < suits; i++)
        {
            cards[i] = new int[ranks];
        }

        foreach (Card card in hand)
        {
            cards[card.Suit][card.Rank] = 1;
        }

        return cards;
    }
}
}

最佳答案

这是因为您已注释掉//cards.Add(new Card() { Rank = 0, Suit = 0 });。您的cards列表为空，并且您的代码找不到空数组的max-这是可以预见的。

关于c# - 生成所有7张纸牌组合吗？，我们在Stack Overflow上找到一个类似的问题：https://stackoverflow.com/questions/26575312/