Java 将一维阵列转换为二维阵列

Java 将一维阵列转换为二维阵列,java,algorithm,Java,Algorithm,我正在尝试打印一个1D数组,给定: int[] D1 = new int[]{ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25}; int n = 5; 我的预期产出是: {11, 7, 4, 2, 1}, {16, 12, 8, 5, 3}, {20, 17, 13, 9, 6}, {23, 21, 18, 14

我正在尝试打印一个1D数组,给定:

int[] D1 = new int[]{ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25};
int n = 5;
我的预期产出是:

    {11,  7,  4,  2,  1},
    {16, 12,  8,  5,  3},
    {20, 17, 13,  9,  6},
    {23, 21, 18, 14, 10},
    {25, 24, 22, 19, 15}
这是我的方法:

cnt = 0;
for (int i = 0; i < n; i++) {
    for (int j = n-1; j >= 0; j--) {
        a[i][j] = D1[cnt];
        cnt++;
    }
}

我在分配正确的位置时遇到问题,正在寻求帮助以更正此问题。

这有两组循环-一组处理对角线右上角(包括)的所有值,另一组处理对角线左下角的值。 测试尺寸为4x4、5x5和6x6

public class SquareMatrix {

public static void main(String[] args) {
    //int[] D1 = new int[]{ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16};
    int[] D1 = new int[]{ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25};
    //int[] D1 = new int[]{ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36};
    int n = 5;
    int[][] m = new int[n][n];

    int cnt = 0;
    // The top right part of the matrix (values 1-15 in a 5x5 scenario)
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j < i; j++) {
            m[j][n+j-i] = D1[cnt++];
        }
    }
    // The bottom left of the matrix (values 16-25 in a 5x5 scenario)
    for (int i = n-1; i >= 1; i--) {
        for (int j = i; j >= 1; j--) {
            m[n-j][i-j] = D1[cnt++];
        }
    }
    printMatrix(m);
}

static void printMatrix(int[][] m) {
    for (int i = 0; i<m.length; i++) {
        for (int j = 0; j<m.length; j++) {
            System.out.printf("%2d ", m[i][j]);
        }
        System.out.println();
    }
}

}
和6x6

16 11  7  4  2  1 
22 17 12  8  5  3 
27 23 18 13  9  6 
31 28 24 19 14 10 
34 32 29 25 20 15 
36 35 33 30 26 21 

Flap将其映射到单个数组,排序,然后重新划分。这里有一个类似的问题,也许它会对您有所帮助。这是在预期的输出中,有点@meowgoesthedog在对角线上看。。。从右边开始,然后是左边,然后是下面,repeat@burrito77这只会使列按升序排列,最下面一行是
1,6,11,16,21
11  7  4  2  1 
16 12  8  5  3 
20 17 13  9  6 
23 21 18 14 10 
25 24 22 19 15 
16 11  7  4  2  1 
22 17 12  8  5  3 
27 23 18 13  9  6 
31 28 24 19 14 10 
34 32 29 25 20 15 
36 35 33 30 26 21