题目为:
要求为:
不采用递归,思路为从先从上到下,然后从左到右这块找到对应规律,具体的JAVA实现代码为:
Scanner scanner = new Scanner(System.in);
System.out.println("请输入值:");
int a = scanner.nextInt();
int n=scanner.nextInt();
int f=scanner.nextInt();
int[][] arr=new int[n+1][n+1];
for (int i=1;i<=n;i++){
for (int j=1;i<=n;i++){
arr[i][j]=0;
}
}
arr[1][1]=a;
int x,y;
for (int i=2;i<n+1;i++){
for (int j=1;j<=i;j++){