Design Tic-Tac-Toe

 1 public class TicTacToe {
 2     private int[] rows;
 3     private int[] cols;
 4     private int diag;
 5     private int antidiag;
 6     private int n;
 7     /** Initialize your data structure here. */
 8     public TicTacToe(int n) {
 9         this.n = n;
10         rows = new int[n];
11         cols = new int[n];
12         diag = 0;
13         antidiag = 0;
14     }
15
16     /** Player {player} makes a move at ({row}, {col}).
17         @param row The row of the board.
18         @param col The column of the board.
19         @param player The player, can be either 1 or 2.
20         @return The current winning condition, can be either:
21                 0: No one wins.
22                 1: Player 1 wins.
23                 2: Player 2 wins. */
24     public int move(int row, int col, int player) {
25         int toAdd = player == 1 ? 1 : -1;
26         rows[row] += toAdd;
27         cols[col] += toAdd;
28         diag += row == col ? toAdd : 0;
29         antidiag += row == (n - col - 1) ? toAdd : 0;
30
31         if (Math.abs(rows[row]) == n ||
32             Math.abs(cols[col]) == n ||
33             Math.abs(diag) == n ||
34             Math.abs(antidiag) == n) {
35                 return player;
36             }
37         return 0;
38     }
39 }
40
41 /**
42  * Your TicTacToe object will be instantiated and called as such:
43  * TicTacToe obj = new TicTacToe(n);
44  * int param_1 = obj.move(row,col,player);
45  */

1. One thing need to be notice that if player put to wrong place...

时间: 2024-12-06 00:09:34

Design Tic-Tac-Toe的相关文章

tic tac toe

井字棋 tic tac toe,布布扣,bubuko.com

amazon.设计1. tic tac toe

//不觉中 已经全力找工作好久好久了.大概有1年半了.身心疲惫,不要放弃.曙光快来了. 1.tic tac toe //http://www.ntu.edu.sg/home/ehchua/programming/java/JavaGame_TicTacToe.html 类似相关棋牌坐标对战游戏 一通百通 /** * Enumerations for the various states of the game */ public enum GameState { // to save as "G

Principle of Computing (Python)学习笔记(7) DFS Search + Tic Tac Toe use MiniMax Stratedy

1. Trees Tree is a recursive structure. 1.1 math nodes https://class.coursera.org/principlescomputing-001/wiki/view? page=trees 1.2 CODE无parent域的树 http://www.codeskulptor.org/#poc_tree.py class Tree: """ Recursive definition for trees plus

2019 GDUT Rating Contest III : Problem C. Team Tic Tac Toe

题面: C. Team Tic Tac Toe Input ?le: standard input Output ?le: standard output Time limit: 1 second Memory limit: 256 megabytes Farmer John owns 26 cows, which by happenstance all have names starting with different letters of the alphabet, so Farmer J

【leetcode】1275. Find Winner on a Tic Tac Toe Game

题目如下: Tic-tac-toe is played by two players A and B on a 3 x 3 grid. Here are the rules of Tic-Tac-Toe: Players take turns placing characters into empty squares (" "). The first player A always places "X" characters, while the second pl

[CareerCup] 17.2 Tic Tac Toe 井字棋游戏

17.2 Design an algorithm to figure out if someone has won a game oftic-tac-toe. 这道题让我们判断玩家是否能赢井字棋游戏,有下面几点需要考虑: 1. 判断是否能赢hasWon函数是调用一次还是多次,如果是多次,我们可能为了优化而需要加入一些预处理. 2. 井字棋游戏通常是3x3的大小,我们是否想要实现NxN的大小? 3. 我们需要在代码紧凑,执行速度和代码清晰之间做出选择. #include <iostream> #

Epic - Tic Tac Toe

N*N matrix is given with input red or black.You can move horizontally, vertically or diagonally. If 3 consecutive samecolor found, that color will get 1 point. So if 4 red are vertically then pointis 2. Find the winner. def tic_tac_toe(board,n) red,

Learn Python 015: Tic Tac Toe Game

board = [' ' for i in range(9)] def print_board(): row_1 = '|{}|{}|{}|'.format(board[0], board[1], board[2]) row_2 = '|{}|{}|{}|'.format(board[3], board[4], board[5]) row_3 = '|{}|{}|{}|'.format(board[6], board[7], board[8]) print('\n') print(row_1)

UVa 10363 - Tic Tac Toe

题目:给你一个井字棋的状态,判断是否合法. 分析:枚举.直接枚举多有情况判断即可. 合法状态有三种情况:(X先下子) 1.X赢,则O不能赢,且X比O多一子: 2.O赢,则X不能赢,且O和X子一样多: 3.没人赢,此时O的子和可能和X一样多,也可能少一个. 说明:简单题(⊙_⊙). #include <algorithm> #include <iostream> #include <cstdlib> #include <cstring> #include &l

ACM-Team Tic Tac Toe

我的代码: #include <bits/stdc++.h> using namespace std; int main() { char a[3][3]; int i,j=0; for(i=0;i<3;i++){ for(j=0;j<3;j++){ cin>>a[i][j]; } } int count1,count2; int len1,len2; len1=len2=0; char b[50],c[2][50]; count1=count2=0; for( i=0