Java Tic Tac Toe

i wrote a homework assigment due in about 10 hours now, thats tic tac toe in java

it almost works, i didnt program it in how to tell when there is a winner or not.

if i have a grid like

XXX
00X
X00

for a tic tac toe board, each row in an array board[0], board[1], and board[2] respectively, is there an easy way to tell if there are 3 in a row?

 

nevermind, i just typed out every possibility

 

I recently did this problem in c

what is did was i have something like this

Code:

begin
' Board is an array nine elements holding player tokens
' Let us assume 0 = empty, 1 = player 1 has place a token
' 2 = player 2 has left a token
' Pseudo code
        Loop x = 1 to 3
                counter = 0
                token = board[x]
                Loop y = x to (x+6) step 3
                       if  board[y] ==  token then
                                couter++
                        end if
                next
                if counter = 3 then: winner = true and break
        next
if winner = true then
        alert("The winner!")
else
' I use a similar method for check the verticle rows
' then i ust checked both diagonals manualy
' good luck
end