二维数组tip-tac-toe游戏
来源:互联网 发布:怎样经营淘宝网店 编辑:程序博客网 时间:2024/06/05 15:38
- 读入一个3*3的矩阵,矩阵中的数字为1表示该位置上有一个X,为0表示为O
- 程序判断这个矩阵中是否有获胜的一方,输出表示获胜一方的字符X或O,或输出无人获胜
package welcome;import java.util.Scanner;public class 二维数组tip_tac_toe {public static void main(String[] args) {// TODO Auto-generated method stubScanner in = new Scanner(System.in);final int SIZE = 3; //程序的可扩展性***int [][] board = new int[SIZE][SIZE];boolean gotresult = false;int numOfX = 0;int numOfO = 0;for(int i = 0; i < board.length; i++) //程序的可扩展性*** {for(int j = 0; j < board[i].length; j++){board[i][j] = in.nextInt();}}//检查行for(int i = 0; i < board.length; i++){numOfX = 0;numOfO = 0;for(int j = 0; j < board[i].length; j++){if(board[i][j] == 1)numOfX++;elsenumOfO++;}if(numOfX== SIZE || numOfO== SIZE){gotresult = true;break;}}//检查列if(!gotresult){for(int i = 0; i < board.length; i++){numOfX = 0;numOfO = 0;for(int j = 0; j < board[i].length; j++){if(board[j][i] == 1)numOfX++;elsenumOfO++;}if(numOfX== SIZE || numOfO== SIZE){gotresult = true;break;}}} //检查对角线if(!gotresult){numOfX = 0;numOfO = 0;for(int i = 0; i < board.length; i++){if(board[i][i] == 1)numOfX++;elsenumOfO++;}if(numOfX== SIZE || numOfO== SIZE){gotresult = true;}}//检查反对角线if(!gotresult){numOfX = 0;numOfO = 0;for(int i = 0; i < board.length; i++){if(board[i][SIZE-i-1] == 1)numOfX++;elsenumOfO++;}if(numOfX== SIZE || numOfO== SIZE){gotresult = true;}}if(gotresult){if(numOfX == SIZE)System.out.println("X赢了");if(numOfO == SIZE)System.out.println("O赢了");}elseSystem.out.println("无人获胜");}
阅读全文
0 0
- 二维数组tip-tac-toe游戏
- 二维数组应用举例:游戏“一担挑”(tic-tac-toe)
- tic-tac-toe游戏
- 机器博弈:tic-tac-toe游戏
- Android 联网 tic-tac-toe 游戏
- 打造一款 Android 联网 tic-tac-toe 游戏
- CodeForces 3C Tic-tac-toe 井字棋盘游戏
- (未完成!)LeetCode 348. Design Tic-Tac-Toe 设计井字棋游戏
- Tic-Tac-Toe
- [cf]Tic-tac-toe
- C - Tic-tac-toe
- CF_3C_Tic-tac-toe
- Minimax-Tic Tac Toe
- Design Tic-Tac-Toe
- Design Tic-Tac-Toe
- Design Tic-Tac-Toe
- FZU Tic-Tac-Toe
- Tic-Tac-Toe FZU
- Java中守护线程的总结
- int long long long 的取值范围
- GMM-HMM理解
- ambari-server setup过程
- 数据库原理 —— 关系数据库的三范式与BCNF
- 二维数组tip-tac-toe游戏
- 组原--动态RAM(DRAM)刷新方式
- OGNL的jar档、文档和源代码
- 如何在Qt中使用boost库
- Qt中文文档-QAbstractAxis类
- leetcode编程记录15 #442 Find All Duplicates in an Array
- 转载一篇文章:MNIST机器学习入门
- H3C交换机日常安全配置
- Qt之实现好友列表