package com.liangpeng.data.structure;
import java.util.LinkedList;
import java.util.Scanner;
public class TestQueue {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
int n = scan.nextInt(); // 输入一个正整数;
yanghui(n);
}
public static void yanghui(int n) {
LinkedList<QueueNode> nodes = new LinkedList<QueueNode>(); //队列
nodes.add(new QueueNode(1));
nodes.add(new QueueNode(1));
nodes.add(new QueueNode(1));
for (int i = 1; i <= n; i++) {
int j = i;
while (j > 0) {
if (j == 1 && i >= 2) {
System.out.print(nodes.removeFirst().getId());
nodes.add(new QueueNode(1));
j--;
} else {
int a = nodes.removeFirst().getId();
System.out.print(a + " ");
if (i >= 2) {
if (j == i) {
nodes.add(new QueueNode(1));
}
nodes.add(new QueueNode(a + nodes.getFirst().getId()));
}
j--;
/*
* if (j == 0 && i >= 2) { nodes.add(new QueueNode(1)); }
*/
}
}
System.out.println();
}
}
}
class QueueNode { // 队列中的结点
int id;
public QueueNode(int id) {
this.id = id;
}
public int getId() {
return id;
}
public void setId(int id) {
this.id = id;
}
}
java版 打印杨辉三角
最新推荐文章于 2023-01-05 19:13:21 发布