Java杨辉三角(一维数组和二维数组方法)

public class YFTriangle {

public static void main(String[] args) {
System.out.println("Please Enter:");
Scanner in = new Scanner(System.in);
int lines = in.nextInt();
int data[] = new int[lines + 1];
int previous = 1;
for (int i = 1; i <= lines; i++) {
for (int j = 1; j <= i; j++) {
int current = data[j];
data[j] = current + previous;
previous = current;
System.out.print(data[j] + " ");
}
System.out.println();
}
in.close();
}

}

public class Demo {
public static void main(String[] args) {
System.out.println("Please Enter:");
Scanner in = new Scanner(System.in);
int lines = in.nextInt();
int data[][] = new int[lines][lines];
for (int i = 0; i < lines; i++) {
data[i][0] = 1;
for (int j = 0; j <= i; j++) {
if (j == 0) {
System.out.print(data[i][j] + " ");
continue;
}
data[i][j] = data[i - 1][j] + data[i - 1][j - 1];
System.out.print(data[i][j] + " ");
}
System.out.println();
}
}

}