121 lines
2.9 KiB
C
121 lines
2.9 KiB
C
#include <stdlib.h>
|
|
#include <stdio.h>
|
|
#include <time.h>
|
|
#include <string.h>
|
|
#include "numbers.h"
|
|
#include "bintree.h"
|
|
|
|
//TODO: getDuplicate und createNumbers implementieren
|
|
/* * * Erzeugen eines Arrays mit der vom Nutzer eingegebenen Anzahl an Zufallszahlen.
|
|
* Sicherstellen, dass beim Befüllen keine Duplikate entstehen.
|
|
* Duplizieren eines zufälligen Eintrags im Array.
|
|
* in `getDuplicate()`: Sortieren des Arrays und Erkennen der doppelten Zahl durch Vergleich benachbarter Elemente. */
|
|
|
|
// Returns len random numbers between 1 and 2x len in random order which are all different, except for two entries.
|
|
// Returns NULL on errors. Use your implementation of the binary search tree to check for possible duplicates while
|
|
// creating random numbers.
|
|
|
|
static int compareUInt(const void *a, const void *b)
|
|
{
|
|
unsigned int A = *(unsigned int*)a;
|
|
unsigned int B = *(unsigned int*)b;
|
|
if (A < B) return -1;
|
|
if (A > B) return 1;
|
|
return 0;
|
|
}
|
|
|
|
static int existsInTree(TreeNode *root, unsigned int value)
|
|
{
|
|
if (!root) return 0;
|
|
|
|
unsigned int *data;
|
|
|
|
// Traversierung initialisieren
|
|
nextTreeData(root);
|
|
|
|
while ((data = nextTreeData(NULL)) != NULL)
|
|
{
|
|
if (*data == value)
|
|
return 1;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
unsigned int *createNumbers(unsigned int len)
|
|
{
|
|
if (len < 2) return NULL;
|
|
|
|
srand((unsigned int)time(NULL));
|
|
|
|
unsigned int *numbers = malloc(sizeof(unsigned int) * len);
|
|
if (!numbers) return NULL;
|
|
|
|
TreeNode *root = NULL;
|
|
unsigned int value;
|
|
|
|
// Array mit eindeutigen Zufallszahlen füllen
|
|
for (unsigned int i = 0; i < len; i++)
|
|
{
|
|
do
|
|
{
|
|
value = (rand() % (2 * len)) + 1;
|
|
}
|
|
while (existsInTree(root, value));
|
|
|
|
// Baum wie highscore benutzen (immer NULL)
|
|
root = addToTree(
|
|
root,
|
|
&value,
|
|
sizeof(unsigned int),
|
|
compareUInt,
|
|
NULL
|
|
);
|
|
|
|
numbers[i] = value;
|
|
}
|
|
|
|
// genau eine Zufallszahl duplizieren
|
|
unsigned int idx1 = rand() % len;
|
|
unsigned int idx2;
|
|
|
|
do
|
|
{
|
|
idx2 = rand() % len;
|
|
}
|
|
while (idx2 == idx1);
|
|
|
|
numbers[idx2] = numbers[idx1];
|
|
|
|
clearTree(root);
|
|
return numbers;
|
|
}
|
|
|
|
|
|
// Returns only the only number in numbers which is present twice. Returns zero on errors.
|
|
unsigned int getDuplicate(const unsigned int numbers[], unsigned int len)
|
|
{
|
|
if (!numbers || len < 2) return 0;
|
|
|
|
unsigned int *copy = malloc(len * sizeof(unsigned int));
|
|
if (!copy) return 0;
|
|
|
|
// Array kopieren
|
|
memcpy(copy, numbers, len * sizeof(unsigned int));
|
|
|
|
// Sortieren
|
|
qsort(copy, len, sizeof(unsigned int), compareUInt);
|
|
|
|
// Doppelte Zahl finden
|
|
unsigned int duplicate = 0;
|
|
for (unsigned int i = 0; i < len - 1; i++)
|
|
{
|
|
if (copy[i] == copy[i + 1])
|
|
{
|
|
duplicate = copy[i];
|
|
break;
|
|
}
|
|
}
|
|
|
|
free(copy);
|
|
return duplicate;
|
|
} |