diagonal row of ones

i posted this in the new to java section already but i have only got views and no replies so i am hoping that you guys and gals can help

hey i am writing a program that is suppose to check and see how many rows are in the diagonal, however if there is a zero separating ones the counter is reset. so i understand that from the starting position the counter has to go up one and then over one, i thought i had it. whats wrong with it? can you guys help. oh i know that i am goin to need another loop for the bottom horizontal row right now i am working with the left column.

here is my code:

import java.util.*;

import java.io.*;

import javax.swing.*;

class arf{

publicstaticvoid main(String args[]){

int[][] numberofones =newint[3][4] ;

numberofones[0][2]=1;

//numberofones[1][2]=1;

numberofones[1][1]=1;

numberofones[2][0]=1;

//numberofones[2][2]=1;

numberofones[2][1]=1;

//numberofones[1][2]=1;

numberofones[0][3]=1;

for (int row=0; row < numberofones.length; row++ ){

for (int col=0; col < numberofones[row].length; col++ )

System.out.print( numberofones[row][col] +" ");

System.out.println();

}

System.out.println();

int three,upper;

three=0;

upper=0;

for (int numrows=2;numrows>-1;numrows--){

//System.out.println("Row "+numrows);

three=0;

upper=0;

for (int numcols=0; numcols<3;numcols++){

//System.out.println("Col "+numcols);

if ((numrows+upper<numberofones.length)){

if (numberofones[numrows+upper][numcols]==1){

three=three+1;

//System.out.println("found 1");

}

else{

//System.out.println("found 0");

three=0;

}

upper=upper+1;

}

}

System.out.println(three);

}

if (three==3){

System.out.println("p1 wins");

}

}

}

>

[3456 byte] By [link33333a] at [2007-11-26 15:05:19]