1275|Find Winner on a Tic Tac Toe Game（数组）

最新推荐文章于 2022-03-27 23:07:24 发布

Asteroid 325

最新推荐文章于 2022-03-27 23:07:24 发布

阅读量180

点赞数

分类专栏： leedcode_Algorithm

本文链接：https://blog.csdn.net/weixin_43846020/article/details/109861637

版权

leedcode_Algorithm 专栏收录该内容

36 篇文章 0 订阅

订阅专栏

找出井字棋的获胜者

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 player B always places “O” characters.
“X” and “O” characters are always placed into empty squares, never on filled ones.（在充满的）
The game ends when there are 3 of the same (non-empty) character filling any row, column, or diagonal.（填充任何行，列或对角线。）
The game also ends if all squares are non-empty.
No more moves can be played if the game is over.
Given an array moves where each element is another array of size 2 corresponding to the row and column of the grid where they mark their respective character in the order in which A and B play.

Return the winner of the game if it exists (A or B), in case the game ends in a draw return “Draw”, if there are still movements to play return “Pending”.

You can assume that moves is valid (It follows the rules of Tic-Tac-Toe), the grid is initially empty and A will play first.

Example 1:
Input: moves = [[0,0],[2,0],[1,1],[2,1],[2,2]]
Output: “A”
Explanation: “A” wins, he always plays first.
"X " "X " "X " "X " "X "
" " -> " " -> " X " -> " X " -> " X "
" " "O " "O " "OO " “OOX”

Example 2:
Input: moves = [[0,0],[1,1],[0,1],[0,2],[1,0],[2,0]]
Output: “B”
Explanation: “B” wins.
"X " "X " "XX " “XXO” “XXO” “XXO”
" " -> " O " -> " O " -> " O " -> "XO " -> "XO "
" " " " " " " " " " "O "

Example 3:
Input: moves = [[0,0],[1,1],[2,0],[1,0],[1,2],[2,1],[0,1],[0,2],[2,2]]
Output: “Draw”
Explanation: The game ends in a draw since there are no moves to make.
“XXO”
“OOX”
“XOX”

Example 4:
Input: moves = [[0,0],[1,1]]
Output: “Pending”
Explanation: The game has not finished yet.
"X "
" O "
" "

Constraints:
1 <= moves.length <= 9
moves[i].length == 2
0 <= moves[i][j] <= 2
There are no repeated elements on moves.
moves follow the rules of tic tac toe.

A 和 B 在一个 3 x 3 的网格上玩井字棋。
井字棋游戏的规则如下：
玩家轮流将棋子放在空方格 (" ") 上。
第一个玩家 A 总是用 “X” 作为棋子，而第二个玩家 B 总是用 “O” 作为棋子。
“X” 和 “O” 只能放在空方格中，而不能放在已经被占用的方格上。
只要有 3 个相同的（非空）棋子排成一条直线（行、列、对角线）时，游戏结束。
如果所有方块都放满棋子（不为空），游戏也会结束。
游戏结束后，棋子无法再进行任何移动。
给你一个数组 moves，其中每个元素是大小为 2 的另一个数组（元素分别对应网格的行和列），它按照 A 和 B 的行动顺序（先 A 后 B）记录了两人各自的棋子位置。

如果游戏存在获胜者（A 或 B），就返回该游戏的获胜者；如果游戏以平局结束，则返回 “Draw”；如果仍会有行动（游戏未结束），则返回 “Pending”。

你可以假设 moves 都有效（遵循井字棋规则），网格最初是空的，A 将先行动。

class Solution {
    public String tictactoe(int[][] moves) {
        // win
        //  lose
        //draw
        //pending
        //int[][] arr1 = new int[][]{{1,2}, {2, 3}, {4, 5}};
    int [][]chess=new int[][]{{0,0,0},{0,0,0},{0,0,0}};
    for(int i=0;i<moves.length;i++){
          if(i%2==0){
              chess[moves[i][0]][moves[i][1]]=1;
          }else if(i%2==1){
              chess[moves[i][0]][moves[i][1]]=-1;
          }
          
    }
int one=chess[0][0]+chess[0][1]+chess[0][2];
int two=chess[1][0]+chess[1][1]+chess[1][2];
int three=chess[2][0]+chess[2][1]+chess[2][2];

int four=chess[0][0]+chess[1][0]+chess[2][0];
int five=chess[0][1]+chess[1][1]+chess[2][1];
int six=chess[0][2]+chess[1][2]+chess[2][2];

int seven=chess[0][0]+chess[1][1]+chess[2][2];
int eight=chess[2][0]+chess[1][1]+chess[0][2];

if(one==3||two==3||three==3||four==3||five==3||six==3||seven==3||eight==3)
            return "A";
else if(one==-3||two==-3||three==-3||four==-3||five==-3||six==-3||seven==-3||eight==-3)
          return "B";
else if(moves.length==9)
      return "Draw";
      else
         return "Pending";
   }
}

在这里插入图片描述
我的方法：
先创建一个33数组赋初值为0，
然后根据输入的A和B出的棋的位置在33数组中确定，如果是A输入的
话再33对应输入的位置放1，在B输入的33数组的位置中放-1。
然后要赢的只有8种情况，3条横线，三条竖线，两条对角线，判断这8个有3？A赢，-3?B赢，否则在剩下的情况判断输入是不是输入了9次也就是没有分出胜负平局返回Draw,剩下的就是没有结束的返回 Pending