blocks|key|1279236|text|我认为最简单的方法是：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1279237|答:覆盖GetHashCode()函数，并使用卡片值和纸牌套装创建一个哈希。B:实现IEquatable<Card>并比较套装和值。|offset|length|style|CODE|1279238|然后，只需要一个包含所有已发牌的HashSet<Card>+(不需要字典)，并让您的卡片生成器检查卡片是否已经存在。|1279239|entityMap^0|0|4|D|16|G|0|G|D|0^^$0|@$1|2|3|4|5|6|7|L|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|M|8|@$D|N|E|O|F|G]|$D|P|E|Q|F|G]]|9|@]|A|$]]|$1|H|3|I|5|6|7|R|8|@$D|S|E|T|F|G]]|9|@]|A|$]]|$1|J|3|-4|5|6|7|U|8|@]|9|@]|A|$]]]|K|$]]

I think the simplest way would be to:

A: Override the <code>GetHashCode()</code> function, and create a hash using the card value and card suit.
B: Implement <code>IEquatable&lt;Card&gt;</code> and compare both the suits and the values.

Then, just have a single <code>HashSet&lt;Card&gt;</code> which contains all dealt cards (no need for a dictionary), and have your card generator check whether or not the card already exists.

blocks|key|3670626|text|您的Dictionary方法应该是有效的，但我认为最简单的方法是生成一个卡片的List，最初以某种自然的顺序，然后对它们进行洗牌。然后，简单地记录一下列表中你发了多少张牌。当涉及到洗牌时，你(和其他所有还没有读过它的人)应该阅读这篇excellent+article+on+the+pitfalls+of+shuffling。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|3670627|entityMap|0|LINK|mutability|MUTABLE|url|http://www.codinghorror.com/blog/2007/12/the-danger-of-naivete.html^0|2|A|13|4|38|1A|0|0^^$0|@$1|2|3|4|5|6|7|N|8|@$9|O|A|P|B|C]|$9|Q|A|R|B|C]]|D|@$9|S|A|T|1|U]]|E|$]]|$1|F|3|-4|5|6|7|V|8|@]|D|@]|E|$]]]|G|$H|$5|I|J|K|E|$L|M]]]]

Your <code>Dictionary</code> approach should work, but I think the simplest way will be to generate a <code>List</code> of cards, initially in some natural order, and then shuffle them. Then, simply keep track of how many cards from the list you have dealt out. When it comes to shuffling the cards, you (and everyone else who hasn't read it yet) should read this <a href="http://www.codinghorror.com/blog/2007/12/the-danger-of-naivete.html" rel="nofollow">excellent article on the pitfalls of shuffling</a>.

blocks|key|1354445|text|这通常不是这样做的。我见过的大多数纸牌游戏都有一副牌结构，它通常是一个0..51范围内的值的数组。对于每个值，suit为(cardValue+/+13)，value为(cardValue+%25+13)。通过将数组初始化为0..51，然后随机地将每个位置的牌与另一个随机位置的牌交换，您可以初始地为新游戏创建牌组。一旦你这样做了，你只需要从一端挑选纸牌，并根据需要‘发牌’给玩家。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1354446|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|D|8|@]|9|@]|A|$]]|$1|B|3|-4|5|6|7|E|8|@]|9|@]|A|$]]]|C|$]]

This is not how it's usually done. Most card games that I've seen have a Deck structure, which is usually an array[0..51] of values in the 0..51 range. For each value, suit is (cardValue / 13) and value is (cardValue % 13). You initally create the deck for a new game by initializing your array to 0..51 and then randomly exchanging the card at each position with a card at another, random position. Once you've done this, you just pick cards from one end and 'deal' to the players as needed.

blocks|key|1354458|text|为什么不只是预先生成一个卡片列表，然后洗牌并将它们推送到堆叠中。|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1354459|当您在发牌时，只需从堆叠中弹出下一张牌。|1354460|关于如何在C#中混洗列表，here还有另一个问题。|offset|length|1354461|entityMap|0|LINK|mutability|MUTABLE|url|https://stackoverflow.com/questions/375351/most-efficient-way-to-randomly-sort-shuffle-a-list-of-integers-in-c^0|0|0|D|4|0|0^^$0|@$1|2|3|4|5|6|7|P|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|Q|8|@]|9|@]|A|$]]|$1|D|3|E|5|6|7|R|8|@]|9|@$F|S|G|T|1|U]]|A|$]]|$1|H|3|-4|5|6|7|V|8|@]|9|@]|A|$]]]|I|$J|$5|K|L|M|A|$N|O]]]]

Why not just have a list of cards pre-generated, then shuffle the deck and push them onto a stack. 

When you are dealing the cards simply pop the next card off the stack.

There is another SO question <a href="https://stackoverflow.com/questions/375351/most-efficient-way-to-randomly-sort-shuffle-a-list-of-integers-in-c">here</a> on how to shuffle a list in C#.

I am trying to create a basic poker game using c#.

So far I have got the cards randomly dealt using these three lines:

<pre><code>Suit suit = (Suit)randomCardSelector.Next(4);
Value value = (Value)randomCardSelector.Next(13);
Card abc = new Card(suit, value);
</code></pre>

Now what I am trying to achieve is that the dealing of cards only of those who haven't been dealt already. Now to do this I have created two 'dictionary' collections, one called 'deck' and one called 'dealt'. I thought about adding all the cards to deck originally and then when dealt on the table they shall be deleted from deck and added to dealt using the cards unique key.

What do you believe will be the best way of going about this? I basically do not want duplicate cards, example Ace Hearts and Ace Hearts combination being in the same deck. How can I prevent this?

using Dictionary trying to search for a value and key (poker game)

翻译质量差，导致语言生硬或混乱。

没有提供实际的解决方法或示例。

解答不清晰，无法理解或解决问题。

页面排版不美观，阅读体验差。

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

腾讯iOA零信任安全管理系统专区

腾讯云架构师技术同盟交流圈

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

涵盖代码开发、场景应用、自动测试全流程，助你从零构建专属AI助手

一站式MCP教程库，解锁AI应用新玩法

我正在尝试创建一个基本的扑克游戏使用c#。到目前为止，我已经使用以下三行代码随机得到了卡片：Suit suit = (Suit)randomCardSelector.Next(4);Value value = (Value)randomCardSelector.Next(13);Card abc = new Card(...

问使用字典尝试搜索值和键(扑克游戏)
EN

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问使用字典尝试搜索值和键(扑克游戏)EN