[英]Check if word exists in the matrix of random characters in C
我目前正在用 C 語言創建一個單詞搜索/boggle 游戲。 玩家將輸入一個單詞,程序將檢查輸入的單詞是否存在於隨機字符的二維矩陣中。 我在 C 語言上有困難。 如果我做得對,有人可以幫忙嗎? 或者我需要更改我的代碼。 非常感謝幫助。
所以這是我的整個代碼。 當我試圖猜測它總是打印Not Found
即使這個詞是隨機字符的二維矩陣。 那么,我需要幫助解決什么問題? 檢查單詞是否存在的正確代碼是什么?
#include <stdlib.h>
#include <stdio.h>
#include <time.h>
#include <string.h>
#include <ctype.h>
#define SIZE 6
#define MAX 10
typedef enum { true, false } bool;
// Draw the board with random characters
void board(char matrix[SIZE][SIZE]) {
int i, j;
for (i = 0; i < SIZE; i++) {
for (j = 0; j < SIZE; j++) {
matrix[i][j] = 'A' + rand() % ('Z' - 'A' + 1);
}
}
}
// Prints the board
void printBoard(char matrix[SIZE][SIZE]) {
int i, j;
srand((unsigned int)time(NULL));
board(matrix);
for (i = 0; i < SIZE; i++) {
for (j = 0; j < SIZE; j++) {
printf(" %c ", matrix[i][j]);
}
printf("\n");
}
}
bool adjacentSearch(char matrix[SIZE][SIZE], char *find, int i, int j, int index) {
if (index == strlen(find))
return true;
if (i < 0 || j < 0 || i > SIZE - 1 || j > strlen(matrix[0]) - 1) {
return true;
}
if (matrix[i][j] != find[index]) {
return false;
}
matrix[i][j] = '*';
bool searchFurther = adjacentSearch(matrix, find, i + 1, j, index + 1) ||
adjacentSearch(matrix, find, i - 1, j, index + 1) ||
adjacentSearch(matrix, find, i, j - 1, index + 1) ||
adjacentSearch(matrix, find, i, j + 1, index + 1);
matrix[i][j] = find[index];
return searchFurther;
}
bool exist(char matrix[SIZE][SIZE], char *find, int r, int c) {
int len = strlen(find);
if (len > r * c)
return false;
for (int i = 0; i < SIZE; i++) {
for (int j = 0; j < strlen(matrix[0]); j++) {
if (matrix[i][j] == find[0]) {
if (adjacentSearch(matrix, find, i, j, 0)) {
return true;
}
}
}
}
return false;
}
// Driver
int main() {
char matrix[SIZE][SIZE];
char word[MAX];
printBoard(matrix);
printf("\nThink of a word> ");
fgets(word, MAX, stdin);
//printf("word: %s", word);
if (exist(matrix, word, SIZE, SIZE)) {
printf("Found\n");
} else {
printf("Not Found\n");
}
return 0;
}
數組索引問題。 檢查此代碼
#include <stdio.h>
#include <time.h>
#include <string.h>
#include <ctype.h>
#define SIZE 6
#define MAX 10
// typedef enum {true, false} bool;
// Draw the board with random characters
void board(char* matrix){
int i, j;
for(i=0; i<SIZE; i++){
for(j=0; j<SIZE; j++){
matrix[i*SIZE + j] = 'A'+(50 *i *j)%('Z'-'A'+1);
}
}
}
// Prints the board
void printBoard(char* matrix){
int i, j;
srand((unsigned int)time(NULL));
board(matrix);
for(i=0; i<SIZE; i++){
for(j=0; j<SIZE; j++){
printf(" %c ", matrix[i*SIZE + j]);
}
printf("\n");
}
}
enum class Direction : int
{
Left = 0,
Right,
Up,
Down,
Unknown
};
bool SearchGivenStart(char* matrix,
char* find, int length,
int startRowIndex,
int startColumnIndex,
Direction direction)
{
printf("Start %d %d\n", startRowIndex, startColumnIndex);
int nextRowIndex = startRowIndex;
int nextColumnIndex = startColumnIndex;
for(int i = 1; i< length - 1 ;i++)
{
if(direction == Direction::Left)
{
nextColumnIndex -= 1;
}
else if (direction == Direction::Right)
{
nextColumnIndex += 1;
}
else if (direction == Direction::Up)
{
nextRowIndex -= 1;
}
else if (direction == Direction::Down)
{
nextRowIndex += 1;
}
else
{
// Assert error
}
printf("Next %d %d\n", nextRowIndex, nextColumnIndex);
// Check bounds
if(nextRowIndex < 0 ||
nextRowIndex > SIZE ||
nextColumnIndex < 0 ||
nextColumnIndex > SIZE )
{
printf("returning false out of bound\n");
return false;
}
if (matrix [nextRowIndex * SIZE + nextColumnIndex] != find [i])
{
printf("returning false\n");
return false;
}
}
printf("returning true\n");
return true;
}
bool Search(char* matrix, char* find, int length)
{
// Find start
// For each start candidate, serach all possible direction
printf("%s %d\n", find, length);
bool found = false;
for (int i = 0; i < SIZE; i++)
{
for(int j= 0; j< SIZE; j++)
{
if ( matrix[i*SIZE + j] == find[0] )
{
printf("%d %d\n", i, j);
found = SearchGivenStart(matrix,
find,
length,
i,
j,
Direction::Left);
if (found)
return true;
found = SearchGivenStart(matrix,
find,
length,
i,
j,
Direction::Right);
if (found)
return true;
found = SearchGivenStart(matrix,
find,
length,
i,
j,
Direction::Up);
if (found)
return true;
found = SearchGivenStart(matrix,
find,
length,
i,
j,
Direction::Down);
if (found)
return true;
}
}
}
return found;
}
bool adjacentSearch(char* matrix, char* find, int i, int j, int index){
if(index == strlen(find))
return true;
if(i < 0 || j < 0 || i > SIZE-1 || j > SIZE - 1){
return true;
}
if(matrix[i *SIZE + j] != find[index]){
return false;
}
matrix[i*SIZE + j] = '*';
bool searchFurther = adjacentSearch(matrix, find, i+1, j, index+1) || adjacentSearch(matrix, find, i-1, j, index+1) || adjacentSearch(matrix, find, i, j-1, index+1) || adjacentSearch(matrix, find, i, j+1, index+1);
matrix[i * SIZE + j] = find[index];
return searchFurther;
}
bool exist(char* matrix, char* find, int r, int c){
int len = strlen(find);
if(len > r * c)
return false;
for(int i=0; i<SIZE; i++){
for(int j=0; j<SIZE; j++){
if(matrix[i*SIZE + j] == find[0]){
if(adjacentSearch(matrix, find, i, j, 0)){
return true;
}
}
}
}
return false;
}
// Driver
int main(){
char matrix[SIZE][SIZE];
char word[MAX] = "SOKK";
printBoard((char *)matrix);
printf("\nThink of a word> ");
fgets(word, MAX, stdin);
printf("word: %s", word);
/*if(exist((char *)matrix, word, SIZE, SIZE)){
printf("Found\n");
}*/
if(Search((char *)matrix, word, strlen(word)))
{
printf("%s Found\n", word);
}
/*if(found)
{
printf("%s Found\n", word);
}*/
else{
printf("%s Not Found\n", word);
}
return 0;
}
代碼中存在多個問題:
true
和false
的定義是不正確的:你應該寫:
typedef enum { false, true } bool;
您不會通過fgets()
緩沖區中留下的尾隨換行符。 程序無法找到該單詞,因為矩陣中不存在換行符。 刪除此字符:
word[strcspn(word, "\\n")] = '\\0';
測試j > strlen(matrix[0]) - 1
不正確:您應該只測試j >= SIZE
以驗證坐標是否在矩陣內。
當i
或j
位於矩陣之外時, adjacentSearch()
應返回 false。
這是一個更正的版本:
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#define SIZE 6
#define MAX 40
typedef enum { false, true } bool;
// Draw the board with random characters
void board(char matrix[SIZE][SIZE]) {
for (int i = 0; i < SIZE; i++) {
for (int j = 0; j < SIZE; j++) {
matrix[i][j] = 'A' + rand() % ('Z' - 'A' + 1);
}
}
}
// Prints the board
void printBoard(char matrix[SIZE][SIZE]) {
for (int i = 0; i < SIZE; i++) {
for (int j = 0; j < SIZE; j++) {
printf(" %c ", matrix[i][j]);
}
printf("\n");
}
}
bool adjacentSearch(char matrix[SIZE][SIZE], const char *find, int i, int j, int index) {
if (find[index] == '\0')
return true;
if (i < 0 || j < 0 || i >= SIZE || j >= SIZE || matrix[i][j] != find[index])
return false;
matrix[i][j] = '*';
bool found = (adjacentSearch(matrix, find, i + 1, j, index + 1) ||
adjacentSearch(matrix, find, i - 1, j, index + 1) ||
adjacentSearch(matrix, find, i, j - 1, index + 1) ||
adjacentSearch(matrix, find, i, j + 1, index + 1));
matrix[i][j] = find[index];
return found;
}
bool exist(char matrix[SIZE][SIZE], const char *find) {
int len = strlen(find);
if (len > SIZE * SIZE)
return false;
for (int i = 0; i < SIZE; i++) {
for (int j = 0; j < SIZE; j++) {
if (adjacentSearch(matrix, find, i, j, 0)) {
return true;
}
}
}
return false;
}
// Driver
int main() {
char matrix[SIZE][SIZE], word[MAX];
srand((unsigned int)time(NULL));
board(matrix);
printBoard(matrix);
for (;;) {
printf("\nThink of a word> ");
if (!fgets(word, sizeof word, stdin))
break;
word[strcspn(word, "\n")] = '\0';
if (exist(matrix, word)) {
printf("Found\n");
} else {
printf("Not Found\n");
}
}
return 0;
}
聲明:本站的技術帖子網頁,遵循CC BY-SA 4.0協議,如果您需要轉載,請注明本站網址或者原文地址。任何問題請咨詢:yoyou2525@163.com.