Neewbie question on time complexity

Question

in the following code what would be the time complexity and would this work for a project with the following question:
i have to write a code that gets a variable of an array n x n with only 1 or 0 where i have to find the k row which all the cells are 0 and in the k column all the values are 1 besides for [k][k] which has to be 0 if non is found then -1 is returned. and i need to do it in O(n) time complexity! so heres my code that i wrote up but im not sure about the time complexity.
public static int isSink(int[][] mat)
int row=0,col=0;
boolean found=false;
while(row<mat.length && !found)
//check if its not the connecting spot
if(row != col)
if(mat[row][col]==0 && mat[col][row]==1)
col++;
else
//if the row is not 0 or if the column is not 1
col=0;
row++;
else
// Is the connecting spot and need to check if its 0 otherwise continue to next row
if(mat[row][col]==0)
col++;
else
col=0;
row++;
}//end of if row == col
//if the row is completed then there is a hole
if(col==mat.length)
return row;
}//end of while
return -1;
}// end of method

Answer 1

    public static int isSink(int[][] mat)
        int row=0,col=0;
        boolean found=false;
        while(row<mat.length && !found)
            //check if its not the connecting spot
            if(row != col)
                if(mat[row][col]==0 && mat[col][row]==1)
                    col++;
                else
                    //if the row is not 0 or if the column is not 1
                    col=0;
                    row++;
            else
            // Is the connecting spot and need to check if its 0 otherwise continue to next row
                if(mat[row][col]==0)
                    col++;
                else
                    col=0;
                    row++;
            }//end of if row == col
            //if the row is completed then there is a hole
            if(col==mat.length)
                return row;
        }//end of while
        return -1;
    }// end of method