正确的的实现列的逐渐递减
目录:程序员成长之旅/Java学习/笔记
public class Java_2{
public static void main(String[] args){
//Found*
int [][] aMatrix = new int[4][];
int i = 0;
int j = 0;
int k = 4;
for(i = 0; i < 4; i++){//控制行
//Found*
aMatrix[i] = new int[k--];//这里在开辟数组的时候就逐渐缩小列的长度
//Found*
for (j = 0; j < aMatrix[i].length; j++) {//控制列 输出的时候直接调用列的长长度输出即可
aMatrix[i][j] = i+1;
System.out.print(aMatrix[i][j] + " ");
}
//Found*
System.out.println();
}
}
}
🖼 图片占位(归档模式)图片见原始导出:
%E6%AD%A3%E7%A1%AE%E7%9A%84%E7%9A%84%E5%AE%9E%E7%8E%B0%E5%88%97%E7%9A%84%E9%80%90%E6%B8%90%E9%80%92%E5%87%8F.assets/f7ec2daa-71fc-4cd1-9f85-dedf7f8a06a3.png原题