將三個數(shù)組的每個元素重新加進一個hashSet然后將？HashSet元素總個數(shù)與三個數(shù)組的元素總個數(shù)比較，
如果相等則沒有重復(fù)元素，反之則有重復(fù)元素。
//3個array里面的內(nèi)容不能有任何重復(fù)
int totalc = 0;
var hashSet = new HashSet<int>();
if (guiArray != null)
{
foreach (var i in GuiArray)
{
hashSet.Add(i);
}
totalc += guiArray.Length;
}
if (extraFlowerArray != null)
{
foreach (var i in extraFlowerArray)
{
hashSet.Add(i);
}
totalc += extraFlowerArray.Length;
}
if (IgnoredCardIndexes != null)
{
foreach (var i in IgnoredCardIndexes)
{
hashSet.Add(i);
}
totalc += IgnoredCardIndexes.Length;
}
Assert.AreEqual(totalc,hashSet.Count,"dupe card in array");