91 lines
2.9 KiB
C#
91 lines
2.9 KiB
C#
using System;
|
|
using System.Collections.Generic;
|
|
|
|
namespace ClassTestExerise2B
|
|
{
|
|
class Program
|
|
{
|
|
static void Main(string[] args)
|
|
{
|
|
int upperLimit;
|
|
int lowerLimit;
|
|
int randListLen;
|
|
int spaceBetween;
|
|
int counter;
|
|
int biggestUneven;
|
|
|
|
List<int> numberCount = new List<int>();
|
|
List<int> randList = new List<int>();
|
|
|
|
Random rand = new Random();
|
|
|
|
do
|
|
{
|
|
Console.WriteLine("Gib die untere Grenze des Zufallsarrays ein:");
|
|
lowerLimit = Convert.ToInt32(Console.ReadLine());
|
|
Console.WriteLine("Gib die obere Grenze des Zufallsarrays an:");
|
|
upperLimit = Convert.ToInt32(Console.ReadLine());
|
|
} while (lowerLimit > upperLimit);
|
|
|
|
Console.WriteLine("Gib die Länge des Zufallsarrays ein:");
|
|
randListLen = Convert.ToInt32(Console.ReadLine());
|
|
|
|
for (int number = 0; number < randListLen; number++)
|
|
{
|
|
randList.Add(rand.Next(lowerLimit,upperLimit));
|
|
}
|
|
|
|
foreach (int number in randList)
|
|
{
|
|
Console.Write(number + " ");
|
|
}
|
|
Console.WriteLine();
|
|
|
|
randList.Sort();
|
|
|
|
foreach (int number in randList)
|
|
{
|
|
Console.Write(number + " ");
|
|
}
|
|
Console.WriteLine();
|
|
|
|
upperLimit = randList[randListLen - 1];
|
|
lowerLimit = randList[0];
|
|
spaceBetween = upperLimit - lowerLimit;
|
|
|
|
Console.WriteLine("Unteres Limit:" + lowerLimit);
|
|
Console.WriteLine("Oberes Limit:" + upperLimit);
|
|
Console.WriteLine("Zahlenraum: " + spaceBetween);
|
|
|
|
for (int number = 0; number <= spaceBetween; number++)
|
|
{
|
|
counter = 0;
|
|
for (int randnumber = 0; randnumber < randListLen; randnumber++)
|
|
{
|
|
if (randList[randnumber] == number + lowerLimit)
|
|
{
|
|
counter++;
|
|
}
|
|
}
|
|
numberCount.Add(counter);
|
|
}
|
|
|
|
for (int number = 0; number <= spaceBetween; number++)
|
|
{
|
|
Console.Write(numberCount[number] + " ");
|
|
}
|
|
Console.WriteLine();
|
|
|
|
biggestUneven = lowerLimit;
|
|
for (int number = 0; number <= spaceBetween; number++)
|
|
{
|
|
if (numberCount[number] % 2 != 0 && numberCount[number] > biggestUneven)
|
|
{
|
|
biggestUneven = number + lowerLimit;
|
|
}
|
|
}
|
|
|
|
Console.WriteLine(biggestUneven + " ist die Zahl die am meisten ungerade oft vorkommt.");
|
|
}
|
|
}
|
|
} |