题解 | #井字棋#

井字棋

https://www.nowcoder.com/practice/0375c1d206ef48a3894f72aa07b2fdde

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {

        Scanner in = new Scanner(System.in);

        Character[][] tic = new Character[3][3];
        char ch = 'O';
        for (int i = 0; i < 3; i++) {
            int j;
            for (j = 0; j < 3; j++) {
                tic[i][j] = in.next().charAt(0);
            }
            if (tic[i][0] == tic[i][1] && tic[i][1] == tic[i][2]){
                ch = tic[i][0];
                break;
            }
        }

        for (int j = 0; j < 3; j++) {
            if (tic[0][j] == tic[1][j] && tic[1][j] == tic[2][j]){
                ch = tic[0][j];
                break;
            }
        }

            if (tic[0][0] ==tic[1][1]&& tic[1][1] == tic[2][2]){
                ch = tic[1][1];

        }

        int m =0;
            if (tic[2][0] ==tic[1][1]&& tic[1][1] == tic[0][2]){
                ch = tic[1][1];

        }

        for (int j = 0; j < 3; j++) {
            if (tic[0][j] == tic[1][j] && tic[1][j] == tic[2][j]){
                ch = tic[0][j];
                break;
            }
        }
        
        if (ch == 'K'){
            System.out.println("KiKi wins!");
        }else if (ch == 'O'){
            System.out.println("No winner!");
        }else if (ch == 'B'){
            System.out.println("BoBo wins!");
        }
    }
}

全部评论

相关推荐

09-25 00:00
已编辑
电子科技大学 Java
球球与墩墩:这不是前端常考的对象扁平化吗,面试官像是前端出来的 const flattern = (obj) => { const res = {}; const dfs = (curr, path) => { if(typeof curr === 'object' && curr !== null) { const isArray = Array.isArray(curr); for(let key in curr) { const newPath = path ? isArray ? `${path}[${key}]` : `${path}.${key}` : key; dfs(curr[key], newPath); } } else { res[path] = curr } } dfs(obj); return res; }
查看3道真题和解析
点赞 评论 收藏
分享
点赞 评论 收藏
分享
评论
点赞
收藏
分享

创作者周榜

更多
牛客网
牛客网在线编程
牛客网题解
牛客企业服务