DFS-找单词

傷城~ 2023-07-11 08:43 71阅读 0赞

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MzY3MzE1Ng_size_16_color_FFFFFF_t_70]

![在这里插入图片描述][watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MzY3MzE1Ng_size_16_color_FFFFFF_t_70 1]

import java.util.Scanner;
    
    public class 单词2 {
        
        static int maxn=102;
        static char s[][]=new char[maxn][maxn];
        static int vis[][]=new int[maxn][maxn];
        static int[] dx={
        1,-1,0,0,1,-1,-1,1};
        static int dy[] = {
        0,0,1,-1,1,1,-1,-1};
        static char ans[]="izhong".toCharArray();
        static int n=0;
        public static void fun(int x,int y) {
        
            for (int i = 0; i <8 ; i++) {
        
                int aa=0;
                int flag=1;
                int x1=x,y1=y;
                for (int j = 0; j <6 ; j++) {
        
                    x1+=dx[i];
                    y1+=dy[i];
                    if (x1<0||y1<0||x1>=n||y1>=n) {
        
    //                    flag = 0;
                        aa=1;
                        break;
                    }
                    if (s[x1][y1]!=ans[j]) flag=0;
                }
                if (aa==1) continue;
                x1 = x;y1 = y;
                if(flag == 1)		//如果7个字符都符合，把位置存储进vis[][]
                {
        
                    vis[x][y] = 1;
                    for(int j=0;j<6;j++)
                    {
        
                        x1 += dx[i];
                        y1 += dy[i];
                        vis[x1][y1] = 1;
                    }
                }
            }
        }
    
        public static void main(String[] args) {
        
            Scanner sc=new Scanner(System.in);
            n=sc.nextInt();
            for (int i = 0; i <n ; i++) {
        
                s[i]=sc.next().toCharArray();
            }
            for (int i = 0; i <n ; i++) {
        
                for (int j = 0; j <n ; j++) {
        
                    if ('y'==s[i][j]){
        
                        fun(i,j);
                    }
                }
    
            }
            for(int i=0; i<n; i++)
            {
        
                for(int j=0; j<n; j++)
                {
        
                    if(vis[i][j]==1) System.out.print(s[i][j]);
                    else System.out.print("*");
                }
                System.out.println();
            }
        }
    }

[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MzY3MzE1Ng_size_16_color_FFFFFF_t_70]: https://img-blog.csdnimg.cn/20200304205624554.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MzY3MzE1Ng==,size_16,color_FFFFFF,t_70
[watermark_type_ZmFuZ3poZW5naGVpdGk_shadow_10_text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MzY3MzE1Ng_size_16_color_FFFFFF_t_70 1]: https://img-blog.csdnimg.cn/20200304205629821.png?x-oss-process=image/watermark,type_ZmFuZ3poZW5naGVpdGk,shadow_10,text_aHR0cHM6Ly9ibG9nLmNzZG4ubmV0L3dlaXhpbl80MzY3MzE1Ng==,size_16,color_FFFFFF,t_70