10010 - Where's Waldorf?

最新推荐文章于 2021-07-27 23:49:32 发布

__starGonnaSnow

最新推荐文章于 2021-07-27 23:49:32 发布

阅读量350

点赞数

CC 4.0 BY-SA版权

分类专栏： UVa

本文链接：https://blog.youkuaiyun.com/march511/article/details/42934883

UVa 专栏收录该内容

7 篇文章

订阅专栏

本文介绍了一个用于二维字符网格中搜索特定字符串的C语言程序。该程序实现了八种不同的方向搜索，并通过布尔标志跟踪搜索状态，一旦找到目标字符串即停止搜索过程。文章通过具体的代码示例详细解释了如何初始化二维字符数组、读取目标字符串并进行大小写不敏感的匹配。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>
#include <string.h>

#define PENDING 2

void try_search( char * tab, char * target, int row, int col, int len, int d_r, int d_c, int * res_r, int * res_c, bool * searched ) {
	if( * searched ) return;
	
	int r, c;

	for( r = 0; r < row; r++ )
	for( c = 0; c < col; c++ ) {
		int r1 = r, c1 = c;
		int l;
		for( l = 0; l < len; l++ ) {
			if( r1 < 0 || r1 >= row || c1 < 0 || c1 >= col || tab[ r1 * col + c1 ] != target[l] ) {
				l = len + 1;
			}
			r1 += d_r;
			c1 += d_c;
		}
		if( l == len ) {
			* searched = true;
			* res_r = r;
			* res_c = c;

			r = row;
			c = col;

		}
	
	}
}

int main( int argc, char * argv[] ) {
	int z, Z;
	scanf( "%d", &Z );
	
	for( z = 0; z < Z; z++ ) {
		if( z ) printf( "\n" );

		int row, col;
		scanf( "%d %d", &row, &col );

		char * tab = malloc( sizeof( char ) * row * col + PENDING );

		int i, j;
		
		for( i = 0; i < row; i++ ) scanf( "%s", tab + i * col );
		for( i = 0; i < row * col; i++ ) tab[ i ] = toupper( tab [ i ] );

		int x, X;
		scanf( "%d", &X );
		for( x = 0; x < X; x++ ) {
			char target[64];

			scanf( "%s", target );
			int len = strlen( target );
			for( i = 0; i < len; i++ ) target[ i ] = toupper( target[ i ] );

			bool searched = false;
			int res_r = 0, res_c = 0;
			try_search( tab, target, row, col, len,  0,  1, &res_r, &res_c, &searched );
			try_search( tab, target, row, col, len,  0, -1, &res_r, &res_c, &searched );
			try_search( tab, target, row, col, len,  1, -1, &res_r, &res_c, &searched );
			try_search( tab, target, row, col, len,  1,  0, &res_r, &res_c, &searched );
			try_search( tab, target, row, col, len,  1,  1, &res_r, &res_c, &searched );
			try_search( tab, target, row, col, len, -1, -1, &res_r, &res_c, &searched );
			try_search( tab, target, row, col, len, -1,  0, &res_r, &res_c, &searched );
			try_search( tab, target, row, col, len, -1,  1, &res_r, &res_c, &searched );

			printf( "%d %d\n", res_r + 1, res_c + 1 );
		
		}


		free( tab );
	
	}
	return 0;
}