2016届 华为公司校园招聘华为软件开发工程师 提前批上机笔试题

....WordMaze if，你必if。但现在你的任务可没有这么简单，你现在处于一个迷宫Maze（n×m的矩阵）当中，里面到处都是以字母标注的食物，但你只能吃掉能连成给定单词W的食物。W“SOLO”，标注了单词“SOLO”。注意区分英文字母大小写,你只能上下左右行走。运行时间限制:内存限制:样例输入:

无限制无限制输入第一行包含两个整数n、m(0<n,m<21)nm100W，3n+3m如果能在地图中连成给定的单词，则输出“YES”，否则输出“NO”一次。55SOLOCPUCYEKLQHCRSOL....EKLQOPGRBCEKLQOPGRBCYES{inti,j,w=0;intx,y;for(i=0;i<m;i++){x=i;for(j=0;j<n;j++){y=j;if(array[x][y]==word[w]){while('\0'!=word[w]){w++;if((x>0)&&(x<m-1)&&(y>0)&&(y<n-1)){if(array[x-1][y]==word[w]){x=x-1;}elseif(array[x+1][y]==word[w]){x=x+1;}elseif(array[x][y-1]==word[w]){y=y-1;}elseif(array[x][y+1]==word[w]){}else}

y=y+1;break;elseif((x<m-1)&&(y>0)&&(y<n-1)){if(array[x+1][y]==word[w]){x=x+1;}elseif(array[x][y-1]==word[w]){y=y-1;}elseif(array[x][y+1]==word[w]){}else}

y=y+1;break;elseif((x>0)&&(y>0)&&(y<n-1)){if(array[x-1][y]==word[w]){x=x-1;}elseif(array[x][y-1]==word[w]){y=y-1;}elseif(array[x][y+1]==word[w]){}else}

y=y+1;break;elseif((x>0)&&(x<m-1)&&(y<n-1)){if(array[x-1][y]==word[w]){x=x-1;}elseif(array[x+1][y]==word[w]){x=x+1;}elseif(array[x][y+1]==word[w]){}else

y=y+1;break;}elseif((x>0)&&(x<m-1)&&(y>0)){if(array[x-1][y]==word[w]){x=x-1;}elseif(array[x+1][y]==word[w]){x=x+1;}elseif(array[x][y-1]==word[w]){}else}

y=y-1;break;elseif((x<m-1)&&(y<n-1)){if(array[x+1][y]==word[w]){x=x+1;}elseif(array[x][y+1]==word[w]){}else

y=y+1;break;}elseif((x<m-1)&&(y>0)){if(array[x+1][y]==word[w]){x=x+1;}elseif(array[x][y-1]==word[w]){}else}

y=y-1;break;elseif((x>0)&&(y<n-1)){if(array[x-1][y]==word[w]){x=x-1;}elseif(array[x][y+1]==word[w]){}else}

y=y+1;break;elseif((x>0)&&(y>0)){if(array[x-1][y]==word[w]){x=x-1;}elseif(array[x][y-1]==word[w]){}else}

y=y-1;break;}if('\0'==word[w]){return1;}}}}return0;}intmain(void){intm,n;charword[100];charinput[21][21]={'0'};scanf("%d%d",&m,&n);scanf("%s",word);for(inti=0;i<m;i++){scanf("%s",input[i]);}// for(intk=0;k<m;k++)// {// for(intl=0;l<n;l++)// {// printf("%c",input