package com.crack;
public class HasWon {
int hasWon(int[][] board)
{
int N=board.length;
int row=0;
int col=0;
for(row=0;row<N;row++)
{
for(col=1;col<N;col++)
{
if(board[row][col]!=board[row][col-1])
break;
}
if(col==N)
return board[row][0];
}
for(col=0;col<N;col++)
{
for(row=1;row<N;row++)
{
if(board[row][col]!=board[row-1][col])
break;
}
if(row==N)
return board[0][col];
}
for(row=1;row<N;row++)
{
if(board[row][row]!=board[row-1][row-1])
break;
}
if(row==N)
return board[0][0];
for(row=1;row<N;row++)
{
if(board[N-1-row][row]!=board[N-row][row-1])
break;
}
if(row==N)
return board[N-1][0];
}
}
public class HasWon {
int hasWon(int[][] board)
{
int N=board.length;
int row=0;
int col=0;
for(row=0;row<N;row++)
{
for(col=1;col<N;col++)
{
if(board[row][col]!=board[row][col-1])
break;
}
if(col==N)
return board[row][0];
}
for(col=0;col<N;col++)
{
for(row=1;row<N;row++)
{
if(board[row][col]!=board[row-1][col])
break;
}
if(row==N)
return board[0][col];
}
for(row=1;row<N;row++)
{
if(board[row][row]!=board[row-1][row-1])
break;
}
if(row==N)
return board[0][0];
for(row=1;row<N;row++)
{
if(board[N-1-row][row]!=board[N-row][row-1])
break;
}
if(row==N)
return board[N-1][0];
}
}