需要帮助简化我的扑克评估代码

我目前正在创建一个扑克评估器，用于比较来自多个玩家的手牌并决定谁是赢家。然而，实际比较和平分的方法比它应该做的要多得多。有什么方法可以简化我的代码吗?由于我没有发布所有的源代码，我将讨论在

int handdeval (Card[] hand)获取一个纸牌数组并返回一个int值，该值代表手牌的分数。三对比一对得分高)

int GetHighCard(Card[] hand)获取一组牌并返回用于破局的高牌的牌位。如果是同一类型的三个，则返回这三个类型中的一个的秩)

 public void FindWinner()
    {
        int maxScore = 0;
        int maxRank = 0;
        List<String> potentialWinners = new List<string>();
        List<Card[]> candHand = new List<Card[]>();
        Dictionary<string, Card[]> deckTable = new Dictionary<string, Card[]>();
        Dictionary<string, int> scoreTable = new Dictionary<string, int>();
        Dictionary<string, int> highTable = new Dictionary<string, int>();
        //place each player to deckTable which holds the player name and their hand
        //place each player to scoreTable which holds the player name and the score of their hand
        for (int i = 0; i < players.Count; i++)
        {
            deckTable.Add(players[i].GetName(), players[i].GetSorted());
            scoreTable.Add(players[i].GetName(), HandEval(players[i].GetSorted()));
        }
        //display the player name and the score of their hand
        foreach (KeyValuePair<string, int> pair in scoreTable)
        {
            Console.WriteLine("{0}, {1}", pair.Key, +pair.Value);
        }
        //find the max score of the current game
        foreach (var kvp in scoreTable)
        {
            if (kvp.Value > maxScore)
            {
                maxScore = kvp.Value;
            }
        }
        //display the max score
        Console.WriteLine("The maximum score is " + maxScore);
        //for all players with the max score, add them to the potential winners list
        foreach (var kvp in scoreTable)
        {
            if (kvp.Value == maxScore)
            {
                potentialWinners.Add(kvp.Key);
            }
        }
        //if there are more than one potential winner, run the tie-break checks
        if (potentialWinners.Count > 1)
        {
            Console.WriteLine("Potential winners include: ");
            for (int i = 0; i < potentialWinners.Count(); i++)
            {
                Console.WriteLine("" + potentialWinners[i] + "");
            }
            //add the name of the potential winners and the rank of the high card as a key value pair to highTable
            for (int i = 0; i < potentialWinners.Count(); i++)
            {
                if (deckTable.ContainsKey(potentialWinners[i]))
                {
                    Card[] cHand = deckTable[potentialWinners[i]];
                    highTable.Add(potentialWinners[i], GetHighCard(cHand));
                }
            }
            Console.WriteLine("Displaying potential winners with their high card rank.");
            foreach (KeyValuePair<string, int> pair in highTable)
            {
                Console.WriteLine("{0}, {1}", pair.Key, pair.Value);
            }
            //find the max rank of high card from all potential winners
            foreach (var kvp in highTable)
            {
                if (kvp.Value > maxRank)
                {
                    maxRank = kvp.Value;
                }
            }
            Console.WriteLine("The final winner after tie-breaking is");
            //display the winner(s) with the highest rank of card
            foreach (var kvp in highTable)
            {
                if (kvp.Value == maxRank)
                {
                    Console.WriteLine("" + kvp.Key + "");
                }
            }
        }
        //if there is only one potential winner, display the name
        else
        {
            Console.WriteLine("The final winner is");
            Console.WriteLine(potentialWinners[0]);
        }
    }
}

任何帮助或提示将非常感激!