generated from freudenreichan/info2Praktikum-Wortsalat
Compare commits
| Author | SHA1 | Date | |
|---|---|---|---|
|
|
4821287319 | ||
|
|
634c15ff32 | ||
|
|
85934a0661 |
No files matched your search
+52
-2
@@ -11,7 +11,57 @@
|
|||||||
* restliche Felder mit zufälligen Buchstaben füllen */
|
* restliche Felder mit zufälligen Buchstaben füllen */
|
||||||
|
|
||||||
// Creates the word salad by placing words randomly and filling empty spaces
|
// Creates the word salad by placing words randomly and filling empty spaces
|
||||||
int createWordSalad(char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN], unsigned int searchFieldLen, const char words[][MAX_WORD_LEN], unsigned int wordCount)
|
int createWordSalad(
|
||||||
|
char salad[MAX_SEARCH_FIELD_LEN][MAX_SEARCH_FIELD_LEN],
|
||||||
|
unsigned int searchFieldLen,
|
||||||
|
const char words[][MAX_WORD_LEN],
|
||||||
|
unsigned int wordCount)
|
||||||
{
|
{
|
||||||
|
unsigned int placedWords = 0;
|
||||||
|
|
||||||
}
|
// 1. Spielfeld leeren
|
||||||
|
for (unsigned int i = 0; i < searchFieldLen; i++) {
|
||||||
|
for (unsigned int j = 0; j < searchFieldLen; j++) {
|
||||||
|
salad[i][j] = EMPTY_CHAR;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
// 2. Alle Wörter durchlaufen
|
||||||
|
for (unsigned int i = 0; i < wordCount; i++) {
|
||||||
|
|
||||||
|
size_t wordLen = strlen(words[i]);
|
||||||
|
|
||||||
|
// Leere oder zu lange Wörter überspringen
|
||||||
|
if (wordLen == 0 || wordLen > searchFieldLen) {
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
|
||||||
|
// 3. Platzierungsversuche
|
||||||
|
for (int attempt = 0;
|
||||||
|
attempt < MAX_RAND_TRIES_PER_WORD;
|
||||||
|
attempt++) {
|
||||||
|
unsigned int row = rand() % searchFieldLen;
|
||||||
|
unsigned int col = rand() % searchFieldLen;
|
||||||
|
int direction = rand() % 2;
|
||||||
|
int canPlace = 1;
|
||||||
|
|
||||||
|
// 4. Horizontale Platzierung prüfen
|
||||||
|
if (direction == 0) {
|
||||||
|
|
||||||
|
if (col + wordLen > searchFieldLen) {
|
||||||
|
continue;
|
||||||
|
}
|
||||||
|
|
||||||
|
for (size_t j = 0; j < wordLen; j++) {
|
||||||
|
|
||||||
|
if (salad[row][col + j] != EMPTY_CHAR &&
|
||||||
|
salad[row][col + j] != words[i][j]) {
|
||||||
|
|
||||||
|
canPlace = 0;
|
||||||
|
break;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
// 5. Vertikale Platzierung prüfen
|
||||||
+35
-29
@@ -4,43 +4,49 @@
|
|||||||
|
|
||||||
// TODO:
|
// TODO:
|
||||||
// eine Funktion implementieren, die ein einzelnes Wort aus einer Textdatei (words.txt) einliest und als C-String zurückgibt.
|
// eine Funktion implementieren, die ein einzelnes Wort aus einer Textdatei (words.txt) einliest und als C-String zurückgibt.
|
||||||
// Test 123
|
|
||||||
// Read words from file and store in 'words' array
|
// Read words from file and store in 'words' array
|
||||||
int readWords(FILE *file, char words[][MAX_WORD_LEN], unsigned int maxWordCount)
|
int readWords(FILE *file, char words[][MAX_WORD_LEN],
|
||||||
|
unsigned int maxWordCount)
|
||||||
{
|
{
|
||||||
int c = 0;
|
unsigned int wordCount = 0;
|
||||||
int count = 0;
|
unsigned int charIndex = 0;
|
||||||
int letterCount = 0;
|
int c;
|
||||||
while (count < maxWordCount)
|
|
||||||
{
|
if (file == NULL) {
|
||||||
while ((c = fgetc(file)) != EOF) //Leerzeichen prüfen
|
return 0;
|
||||||
{
|
|
||||||
if (isspace(c) || !isalpha(c)) {
|
|
||||||
if (letterCount > 0) {
|
|
||||||
break; //Wort fertig eingelesen
|
|
||||||
}
|
}
|
||||||
|
|
||||||
continue; // mehrere Leerzeichen oder Sonderzeichen überspringen
|
while ((c = fgetc(file)) != EOF) {
|
||||||
}
|
|
||||||
|
|
||||||
if (letterCount < MAX_WORD_LEN - 1) //wörter Buchstabenweise einlesen
|
if (c == ',' || c == ';' || c == ' ' ||
|
||||||
{
|
c == '\n' || c == '\t' || c == '\r') {
|
||||||
words[count][letterCount] = (char)toupper(c);
|
|
||||||
letterCount++;
|
if (charIndex > 0) {
|
||||||
|
words[wordCount][charIndex] = '\0';
|
||||||
|
|
||||||
|
wordCount++;
|
||||||
|
charIndex = 0;
|
||||||
|
|
||||||
|
if (wordCount >= maxWordCount) {
|
||||||
|
return (int)wordCount;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
else {
|
||||||
|
if (wordCount < maxWordCount &&
|
||||||
|
charIndex < MAX_WORD_LEN - 1) {
|
||||||
|
|
||||||
|
words[wordCount][charIndex] = (char)c;
|
||||||
|
charIndex++;
|
||||||
|
}
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
if (letterCount == 0) {
|
if (charIndex > 0 && wordCount < maxWordCount) {
|
||||||
break; //kein weiteres Wort gefunden
|
words[wordCount][charIndex] = '\0';
|
||||||
|
wordCount++;
|
||||||
}
|
}
|
||||||
|
|
||||||
words[count][letterCount] = '\0';
|
return (int)wordCount;
|
||||||
letterCount = 0;
|
|
||||||
count++;
|
|
||||||
|
|
||||||
if (c == EOF) {
|
|
||||||
break;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
return count;
|
|
||||||
}
|
}
|
||||||
File renamed without changes.
+4
-14
@@ -1,15 +1,5 @@
|
|||||||
Yeti
|
Yeti,Nessie Werwolf; Vampir
|
||||||
Nessie
|
|
||||||
Werwolf
|
|
||||||
Vampir
|
|
||||||
Monster
|
Monster
|
||||||
Hydra
|
Hydra;Frankenstein
|
||||||
Frankenstein
|
Dracula;KingKong;Gremlin;Kobold,Hexe;Poltergeist
|
||||||
Dracula
|
Gespenst, Oger
|
||||||
KingKong
|
|
||||||
Gremlin
|
|
||||||
Kobold
|
|
||||||
Hexe
|
|
||||||
Poltergeist
|
|
||||||
Gespenst
|
|
||||||
Oger
|
|
||||||
Reference in new issue
Block a user