随机不重复序列的产生

随机不重复序列就是比如：

 

1 3 4 2 7 8 5 6 9 10 15 14 11 13 12的序列，每个不重复，1-N的序列

 

 

在MATLAB，有函数randperm

 

MATLAB中，函数实现的原理是，首先产生一个随机序列A，然后对随机序列进行排序得到B，查找B中A序列的位置，输出C

 

附C#实现程序如下：

 using System; using System.Collections.Generic; using System.Linq; using System.Text; namespace ConsoleApplication7 { class Program { static void Main(string[] args) { List<int> OrderDeck = new List<int>(); OrderDeck.Add(5); OrderDeck.Add(3); OrderDeck.Add(4); foreach (int primer in OrderDeck) { Console.WriteLine(primer); } OrderDeck.Sort(); foreach (int primer in OrderDeck) { Console.WriteLine(primer); } Random ra = new Random(); int id; id = ra.Next(1,100); Console.WriteLine("ID is " + id); OrderDeck.Clear(); for (int i = 0; i < 10; i++) { id = ra.Next(1,100); OrderDeck.Add(id); } for (int i = 0; i < OrderDeck.Count; i++) { Console.WriteLine(OrderDeck[i]); } List<int> temp = new List<int>(); List<int> output = new List<int>(); temp.Clear(); output.Clear(); // initialize output for (int i = 0; i < OrderDeck.Count; i++) { output.Add(0); } for (int i = 0; i < OrderDeck.Count; i++) { temp.Add(OrderDeck[i]); } temp.Sort(); for (int i = 0; i < temp.Count; i++) { Console.Write( " "+temp[i]); } List<bool> YesNo = new List<bool>(); YesNo.Clear(); for (int i = 0; i < temp.Count; i++) { YesNo.Add(true); } for (int i = 0; i < temp.Count; i++) { for (int j = 0; j < temp.Count; j++) { if (OrderDeck[j]==temp[i]&&YesNo[j]==true) { output[i] = j; YesNo[j] = false; break; } } } for (int i = 0; i < OrderDeck.Count; i++) { Console.WriteLine(output[i]); } } } }

 

例子：

 

随机洗牌程序，数字1-10 J Q K 梅花 方块 红桃 黑桃 随机产生一个顺序表

CARD.CS

 

CARD.CS using System; using System.Collections.Generic; using System.Linq; using System.Text; namespace Ch10CardLib { public enum Suit { Club, Diamond, Heart, Spade } public enum Rank { Ace=1, Deuce, Three, Four, Five, Six, Seven, Eight, Nine, Ten, Jack, Queen, King } class Card { public readonly Suit suit; public readonly Rank rank; //这段没有看太懂 public override string ToString() { return "The "+rank+" of"+suit+"s"; } private Card() { } public Card(Suit newSuit,Rank newRank) { suit = newSuit; rank = newRank; } } }

 

 

DECK.CS

using System; using System.Collections.Generic; using System.Linq; using System.Text; namespace Ch10CardLib { class Deck { //List<Card> cards = new List<Card>(); //TO BE MODIFIDE //...... private Card[] cards; public List<int> shuffleOrder = new List<int>(); public Deck() { cards=new Card[52]; for (int suitVal = 0; suitVal < 4; suitVal++) { for (int rankVal = 1; rankVal < 14; rankVal++) { cards[suitVal * 13 + rankVal - 1] = new Card((Suit)(suitVal), (Rank)(rankVal)); } } } public Card GetCard(int cardNum) { if (cardNum >= 0 && cardNum <= 51) return cards[cardNum]; else throw (new System.ArgumentOutOfRangeException("cardNum", cardNum, "Value must be between 0 and 51")); } public void Shuffle() { RandOrder(52, shuffleOrder); for (int i = 0; i < shuffleOrder.Count; i++) { Console.Write(" "+shuffleOrder[i]); } } public void RandOrder( int number,List<int> order) { List<int> OrderDeck = new List<int>(); Random ra = new Random(); int id; id = ra.Next(1, 100); for (int i = 0; i < number; i++) { id = ra.Next(1, 100); OrderDeck.Add(id); } List<int> temp = new List<int>(); // initialize order for (int i = 0; i < OrderDeck.Count; i++) { order.Add(0); } for (int i = 0; i < OrderDeck.Count; i++) { temp.Add(OrderDeck[i]); } temp.Sort(); List<bool> YesNo = new List<bool>(); YesNo.Clear(); for (int i = 0; i < temp.Count; i++) { YesNo.Add(true); } for (int i = 0; i < temp.Count; i++) { for (int j = 0; j < temp.Count; j++) { if (OrderDeck[j] == temp[i] && YesNo[j] == true) { order[i] = j; YesNo[j] = false; break; } } } } } }

 

MAIN

 

using System; using System.Collections.Generic; using System.Linq; using System.Text; using Ch10CardLib; namespace ConsoleApplication6 { class Program { static void Main(string[] args) { Deck myDeck = new Deck(); myDeck.Shuffle(); for (int i = 0; i < myDeck.shuffleOrder.Count; i++) { int index=myDeck.shuffleOrder[i]; Card tempcard = myDeck.GetCard(index); Console.WriteLine(tempcard.ToString()); } } } }