blocks|key|1491738|text|有很多方法可以解决这个问题，但我建议使用这个简单的方法：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|1491739|1)使用一个混洗器类来混洗数组。这个使用的是Fisher-Yates+shuffle|offset|length|1491740|public+class+Shuffler
{
++++public+Shuffler()
++++{
++++++++_rng+=+new+Random();
++++}

++++public+void+Shuffle<T>(IList<T>+array)
++++{
++++++++for+(int+n+=+array.Count;+n+>+1;+)
++++++++{
++++++++++++int+k+=+_rng.Next(n);
++++++++++++--n;
++++++++++++T+temp+=+array[n];
++++++++++++array[n]+=+array[k];
++++++++++++array[k]+=+temp;
++++++++}
++++}

++++private+readonly+Random+_rng;
}|code-block|syntax|javascript|1491741|2)你有一个问题集合，你想以随机的顺序访问这些问题。如果问题在数组或列表中，您可以直接对其进行混洗。如果它们不是(我假设是这样)，那么您可以从0..n-1创建一个索引列表，其中n是问题的数量：|1491742|var+indices+=+Enumerable.Range(0,+qAnswer.Count()).ToArray();|1491743|3)然后对这些索引进行混洗：|1491744|var+shuffler+=+new+Shuffler();
shuffler.Shuffle(indices);|1491745|4)最后，您可以使用这些索引(现在是随机顺序)以随机顺序访问问题：|1491746|foreach+(var+index+in+indices)
++++buttons[0].Text+=+qAnswer[questionNumber,+index];|1491747|(从您发布的代码中，我不确定它应该是qAnwser[questionNumber,+index]还是qAnswer[index,+questionNumber]或其他什么，所以您可能必须更改它……)|style|CODE|1491748|entityMap|0|LINK|mutability|MUTABLE|url|http://en.wikipedia.org/wiki/Fisher%25E2%2580%2593Yates_shuffle^0|0|M|K|0|0|0|0|0|0|0|0|0|I|U|1E|U|0^^$0|@$1|2|3|4|5|6|7|18|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|19|8|@]|9|@$D|1A|E|1B|1|1C]]|A|$]]|$1|F|3|G|5|H|7|1D|8|@]|9|@]|A|$I|J]]|$1|K|3|L|5|6|7|1E|8|@]|9|@]|A|$]]|$1|M|3|N|5|H|7|1F|8|@]|9|@]|A|$I|J]]|$1|O|3|P|5|6|7|1G|8|@]|9|@]|A|$]]|$1|Q|3|R|5|H|7|1H|8|@]|9|@]|A|$I|J]]|$1|S|3|T|5|6|7|1I|8|@]|9|@]|A|$]]|$1|U|3|V|5|H|7|1J|8|@]|9|@]|A|$I|J]]|$1|W|3|X|5|6|7|1K|8|@$D|1L|E|1M|Y|Z]|$D|1N|E|1O|Y|Z]]|9|@]|A|$]]|$1|10|3|-4|5|6|7|1P|8|@]|9|@]|A|$]]]|11|$12|$5|13|14|15|A|$16|17]]]]

There are many ways to approach this, but I suggest this simple approach:

1) Use a shuffler class to shuffle arrays. This one uses the <a href="http://en.wikipedia.org/wiki/Fisher%E2%80%93Yates_shuffle" rel="nofollow">Fisher-Yates shuffle</a>:

<pre><code>public class Shuffler
{
 public Shuffler()
 {
 _rng = new Random();
 }

 public void Shuffle&lt;T&gt;(IList&lt;T&gt; array)
 {
 for (int n = array.Count; n &gt; 1; )
 {
 int k = _rng.Next(n);
 --n;
 T temp = array[n];
 array[n] = array[k];
 array[k] = temp;
 }
 }

 private readonly Random _rng;
}
</code></pre>

2) You have a collection of questions which you want to access in a random order. If the questions are in an array or list, you can shuffle them directly. If they are not (which I am assuming) then instead you can create a list of indices from 0..n-1 where n is the number of questions:

<pre><code>var indices = Enumerable.Range(0, qAnswer.Count()).ToArray();
</code></pre>

3) Then you shuffle those indices:

<pre><code>var shuffler = new Shuffler();
shuffler.Shuffle(indices);
</code></pre>

4) Finally, you can use those indices (which are now in a random order) to access the questions in a random order:

<pre><code>foreach (var index in indices)
 buttons[0].Text = qAnswer[questionNumber, index];
</code></pre>

(I'm not sure from the code you posted whether that should be <code>qAnwser[questionNumber, index]</code> or <code>qAnswer[index, questionNumber]</code> or something else, so you may have to change that...)

blocks|key|4097230|text|如果需要按随机顺序对列表进行排序，请使用实现IComaprer<T>的比较器|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|4097231|这是我几年前写的一个RandomComparer，它一次又一次地证明了自己是有用的：|4097232|public+class+RandomComparer<T>+:+IComparer<T>
{
++++private+Random+rnd;
++++public+RandomComparer()+{
++++++++rnd+=+new+Random();
++++}

++++public+RandomComparer(int+Seed)+{
++++++++rnd+=+new+Random(Seed);
++++}
++++public+int+Compare(T+x,+T+y)
++++{
++++++++return+rnd.Next(-1,+2);
++++}
}|code-block|syntax|javascript|4097233|要使用它，只需编写以下代码：listOfButtons.Sort(new+RandomComparer<Button>());|4097234|entityMap^0|M|C|0|0|0|E|1D|0^^$0|@$1|2|3|4|5|6|7|Q|8|@$9|R|A|S|B|C]]|D|@]|E|$]]|$1|F|3|G|5|6|7|T|8|@]|D|@]|E|$]]|$1|H|3|I|5|J|7|U|8|@]|D|@]|E|$K|L]]|$1|M|3|N|5|6|7|V|8|@$9|W|A|X|B|C]]|D|@]|E|$]]|$1|O|3|-4|5|6|7|Y|8|@]|D|@]|E|$]]]|P|$]]

If you need to sort a list in a random order, use a comparer that implements <code>IComaprer&lt;T&gt;</code> 
Here's a RandomComparer I've written some years ago that has proved itself useful time after time:

<pre><code>public class RandomComparer&lt;T&gt; : IComparer&lt;T&gt;
{
 private Random rnd;
 public RandomComparer() {
 rnd = new Random();
 }

 public RandomComparer(int Seed) {
 rnd = new Random(Seed);
 }
 public int Compare(T x, T y)
 {
 return rnd.Next(-1, 2);
 }
}
</code></pre>

To use it simply write this: <code>listOfButtons.Sort(new RandomComparer&lt;Button&gt;());</code>

blocks|key|5565510|text|我认为你遇到了问题，因为listOfButtons.Remove(buttons[rIndex])并没有像你想象的那样检查对象的相等性。|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|5565511|请尝试使用listOfButtons.RemoveAt(rIndex)。|5565512|entityMap^0|C|11|0|5|U|0^^$0|@$1|2|3|4|5|6|7|J|8|@$9|K|A|L|B|C]]|D|@]|E|$]]|$1|F|3|G|5|6|7|M|8|@$9|N|A|O|B|C]]|D|@]|E|$]]|$1|H|3|-4|5|6|7|P|8|@]|D|@]|E|$]]]|I|$]]

I think you're having problems because the <code>listOfButtons.Remove(buttons[rIndex])</code> doesn't check for object equality as you think it does.

Try using <code>listOfButtons.RemoveAt(rIndex)</code> instead.

blocks|key|5565521|text|一种不同的方法，循环通过按钮而不是文本：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|5565522|Button[]+buttons+=+new+Button[]+
{
++++button1,
++++button2,
++++button3
};

List<string>+text+=+new+List<string>()+{"1",+"2",+"3"};

Random+random+=+new+Random();

foreach+(var+button+in+buttons)
{
++++string+str+=+text[random.Next(0,+text.Count()+-+1)];
++++button.Text+=+str;
++++text.Remove(str);
}|code-block|syntax|javascript|5565523|entityMap^0|0|0^^$0|@$1|2|3|4|5|6|7|I|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|J|8|@]|9|@]|A|$E|F]]|$1|G|3|-4|5|6|7|K|8|@]|9|@]|A|$]]]|H|$]]

A different approach that loops through Buttons instead of texts: 

<pre><code>Button[] buttons = new Button[] 
{
 button1,
 button2,
 button3
};

List&lt;string&gt; text = new List&lt;string&gt;() {"1", "2", "3"};

Random random = new Random();

foreach (var button in buttons)
{
 string str = text[random.Next(0, text.Count() - 1)];
 button.Text = str;
 text.Remove(str);
}
</code></pre>

I'm really stuggling with how to phrase this, but I'm creating a program in C# which basically shuffles outputs it, but to avoid duplications I remove it from the ArrayList.

Now it works but sometimes it overrides a current number that's been said and leaves a button blank.

I'll show my code below:

<pre><code>Button[] buttons = new Button[3];
 int questionNumber = 0;
 int qNumber = 0;
 int x = 1;


Random r = new Random();
 List&lt;Button&gt; listOfButtons = new List&lt;Button&gt;();
 listOfButtons.Add(buttons[0]);
 listOfButtons.Add(buttons[1]);
 listOfButtons.Add(buttons[2]);



 int rIndex;

 while (qNumber &lt; 3)
 {
 rIndex = r.Next(0, listOfButtons.Count); //Choose a random object from list
 listOfButtons[rIndex].Text = qAnswer[questionNumber, x++]; // adds text to button
 listOfButtons.Remove(buttons[rIndex]); // removes button from index
 qNumber++;


 }



private void EasyLevel_Load(object sender, EventArgs e)
 {
 buttons[0] = a1; // a1 is button
 buttons[1] = a2;
 buttons[2] = a3;
 }
</code></pre>

Shuffling Array - Missing number c#

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

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

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

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

文章

问答

视频

学习中心

腾讯云实验室

直播

竞赛

腾讯云代码分析专区

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

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

腾讯云数据库专区

腾讯云顾问专区

腾讯云原生专区

腾讯混元专区

腾讯云TCE专区

腾讯云Lighthouse专区

腾讯云HAI专区

腾讯云Edgeone专区

腾讯云存储专区

腾讯云智能专区

腾讯轻联专区 

腾讯云开发专区

TAPD专区

腾讯轻量云游戏服专区

腾讯云最具价值专家

腾讯云架构师技术同盟

腾讯云创作之星

腾讯云开发者先锋

腾讯云代码助手

云原生构建

TAPD 敏捷项目管理

Cloud Studio

SDK中心

API中心

命令行工具

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

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

我真的很纠结于如何表达这一点，但我正在用C#创建一个程序，它基本上是随机输出它，但为了避免重复，我从ArrayList中删除了它。现在它可以工作了，但有时它会覆盖一个已经说过的当前数字，并留下一个空按钮。我将展示我的代码如下：Button[] buttons = new Button[3];        int qu...

问混洗数组-缺少数字c#
EN

Stack Overflow用户

社区

活动

圈层

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问混洗数组-缺少数字c#EN