static void Main()
{
GetRemoveNumbers(1000, 3).ForEach(n => Console.WriteLine("{0}", n));
}
public static List<int> GetRemoveNumbers(int count,int removeCount)
{
List<int> preNumbers = new List<int>();
int start = 1;
while (start < count)
{
preNumbers.Add(start);
start++;
}
var updateNumbers = (from number in preNumbers
select number).ToList();
int random = int.MinValue;
Random rd = new Random();
for (int i = 0; i < removeCount; i++)
{
random = (rd.Next(1, count));
updateNumbers.Remove(random);
}
return preNumbers.Except(updateNumbers).ToList();
}
有一组数字,从1到n,从中减少了3个数,顺序也被打乱,放在一个n-3的数组里,请找出丢失的数字,最好能有程序,最好算法比较快
最新推荐文章于 2020-10-17 23:40:04 发布