我知道有很多關于Connect 4 Check獲勝的問題。問題在于大多數其他算法使我的程序出現運行時錯誤，因為它們嘗試訪問數組之外的索引。我的算法是這樣的：private int checkWin(int[][] gridTable,int rowNum,int colNum, int maxRow, int maxCol) {//  For checking whether any win or lose condition is reached. Returns 1 if win or lose is reached. else returns 0//  gridTable[][] is the game matrix(can be any number of rows and columns between 4 and 40)//  colNum is the column number where the last token was placed//  rowNum is the row number where the last token was placed//  maxRow is the number of rows in my grid//  maxCol is the number of columns in my gridint player = gridTable[rowNum][colNum]; //player IDint count=0;// Horizontal checkfor (int i=0;i<maxCol;i++){    if (gridTable[rowNum][i]==player)        count++;    else        count=0;    if (count>=4)        return 1;}//Vertical checkfor (int i=0;i<maxRow;i++){    if (gridTable[i][colNum]==player)        count++;    else        count=0;    if (count>=4)        return 1;} count=0;// 4 in a row diagonallyfor(int i=colNum+1,j=rowNum+1;i<maxRow && j<maxCol;i++,j++) {     if(gridTable[j][i]!=player)    {        count=1;        break;            }    count++;}// 4 in a row diagonallyfor(int i=colNum-1,j=rowNum-1;i>=0 && j>=0;i--,j--) {     if(gridTable[j][i]!=player)    {        count=1;        break;            }    count++;}// 4 in a row diagonallyfor(int i=colNum+1,j=rowNum-1;i<maxRow && j>=0;i++,j--) {     if(gridTable[j][i]!=player)    {        count=1;        break;            }    count++;}for(int i=colNum-1,j=rowNum+1;i>=0 && j<maxCol;i--,j++) { // 4 in a row diagonally    if(gridTable[j][i]!=player)    {        count=1;        break;            }    count++;}if(count>=4)    return 1;return 0;}count是用于檢查是否等于或大于4的勝利的變量，這意味著它們應為同一玩家的4個或更多連續標記。問題：有時該方法檢查獲勝的順序是否為4個令牌，而有時不檢查獲勝的順序為4個令牌。