二维数组求和问题，大神请进

Question

定义的一个二维数组
int rangle[][] = {
new int[] {
0
}, new int[] {
0, 0
}, new int[] {
0, 0, 0
}, new int[] {
0, 0, 0, 0
}, new int[] {
4, 5, 2, 6, 5
}
};

要的结果是把下面最相邻的两个相加赋值到前面一个位置上，最终结果是
int rangle[][] = {
    new int[] {
        65
    }, new int[] {
        31, 34
    }, new int[] {
        16, 15,19
    }, new int[] {
        9, 7, 8, 11
    }, new int[] {
        4, 5, 2, 6, 5
    }
};


求代码

Answer 1

代码：

import java.util.Arrays;

public class Test1 {
public static void main(String[] args) {
int rangle[][] = {
new int[] {
0
}, new int[] {
0, 0
}, new int[] {
0, 0, 0
}, new int[] {
0, 0, 0, 0
}, new int[] {
4, 5, 2, 6, 5
}
};
for (int i = rangle.length-1; i > 0; i--) {
int arr [] = new int [rangle[i].length-1];
for (int j = 0; j < rangle[i].length-1; j++) {
arr[j] = rangle[i][j]+rangle[i][j+1];
}
rangle[i-1] = arr;
}
for (int i = 0; i < rangle.length; i++) {
System.out.println(Arrays.toString(rangle[i]));
}
}
}

>运行结果：

[65]
[31, 34]
[16, 15, 19]
[9, 7, 8, 11]
[4, 5, 2, 6, 5]