竞赛讨论区 > 同一份代码交第一次可以,交第二次就超时了,哈哈哈哈
头像
DragonOne713
发布于 2021-11-05 19:04
+ 关注

同一份代码交第一次可以,交第二次就超时了,哈哈哈哈

    import java.io.*;
    import java.util.*;

    /**
     * @Author DragonOne
     * @Date 2021/9/4 19:40
     */
    public class Main {
        public static void main(String[] args) throws Exception {
            Scanner Scin = new Scanner(System.in);
            StreamTokenizer STcin = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
            BufferedReader BRcin = new BufferedReader(new InputStreamReader(System.in));
            PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));


            char[][] ch = new char[1005][1005];
            int[][] ans = new int[1005][1005];


            int n, m;
            n = Scin.nextInt();
            m = Scin.nextInt();
    //        for (int i = 0; i < n; i++) {
    //            Arrays.fill(ans[i], 0);
    //        }
            for (int i = 0; i < n; i++) {
                String s = Scin.next();
                ch[i] = s.toCharArray();
                int len = s.length();
                for (int j = 0; j < len; j++) {
                    if(ch[i][j]=='*'){
                        ans[i+1][j+1]=1;
                    }
                }
            }
    //        for (int i = 0; i < n+10; i++) {
    //            for (int j = 0; j < m+10; j++) {
    //                    ans[i][j]=0;
    //            }
    //        }
    //        for (int i = 0; i < n; i++) {
    //            for (int j = 0; j < m; j++) {
    //                if(ch[i][j]=='*'){
    //                    ans[i+1][j+1]=1;
    //                }
    //            }
    //        }
    //        for (int i = 0; i < n; i++) {
    //            for (int j = 0; j < m; j++) {
    //                System.out.print(ans[i+1][j+1]);
    //            }
    //            System.out.println();
    //        }
            for (int i = 1; i <= n; i++) {
                for (int j = 1; j <= m; j++) {
                    if(ans[i][j]==1){
                        System.out.print('*');
                    }else{
                        System.out.print(ans[i][j+1]+ans[i][j-1]+ans[i+1][j]+ans[i+1][j-1]+ans[i+1][j+1]+ans[i-1][j]+ans[i-1][j-1]+ans[i-1][j+1]);
                    }
                }
                System.out.println();
            }


        }
    }

全部评论

(0) 回帖
加载中...
话题 回帖

本文相关内容

等你来战

查看全部

热门推荐