递归实现二维数组输出

非递归实现:

       
    private static void findWords(int[][]board ,int index){//index可以不需要了
          for (int i = 0; i <board.length ; i++) {
           for (int j = 0; j <board[0].length ; j++) {
                System.out.print((char)(board[i][j]));
           }
        }

    }

    public static void main(String[] args) {
        int[][] board = {
                {'A', 'B', 'C', 'E'},
                {'S', 'F', 'C', 'S'},
                {'A', 'D', 'E', 'E'}
        };
        findWords(board,0);
    }
}

递归实现:

package train;

public class train_2 {
    private static void findWords(int[][]board ,int index){
          if(index ==board.length){
              return ;
          }
        for (int i = 0; i < 4 ; i++) {
            System.out.print((char)board[index][i]);
        }
        findWords(board ,index+1);

    }

    public static void main(String[] args) {
        int[][] board = {
                {'A', 'B', 'C', 'E'},
                {'S', 'F', 'C', 'S'},
                {'A', 'D', 'E', 'E'}
        };
        findWords(board,0);
    }
}