【转】数组行列递归转换

static void populateArray(int minValue, int rowNum, int colNum, int[][] toBePopulatedArray) {          for (int colIdx = 0; colIdx < colNum; colIdx++) {              toBePopulatedArray[0][colIdx] = minValue++;          }                    //Recursive population          if (rowNum > 1 || colNum > 1) {                            int newRowNum = colNum;              int newcolNum = rowNum - 1;              int[][] subArray = new int[newRowNum][newcolNum];                            populateArray(minValue, newRowNum, newcolNum, subArray);                            for (int colIdx = colNum - 1; colIdx > -1; colIdx--) {                  for (int rowIdx = 1; rowIdx < rowNum; rowIdx++) {                      toBePopulatedArray[rowIdx][colIdx] = subArray[newRowNum - colIdx - 1][rowIdx - 1];                  }              }          }      }