用java的LinkedList实现杨辉三角

		int n = 10;// 行数
		int temp = 0;
		Integer last;// 最后一行变量
		int k = 0;
		Queue<Integer> query = new LinkedList<Integer>();
		query.offer(1);// 第一行入队
		for (int i = 2; i <= n; i++) {// 产生第n行对象并入队，同时打印第n-1行的对象
			/**
			 * 打印每行开头的空白
			 */
			System.out.print("\t");
			while (k < (n - i) / 2) {
				k++;
				System.out.print("\t" + "\t");
			}
			if (i % 2 == 1) {
				System.out.print("\t");
			}

			query.offer(1);// 第n行的第一个对象入队
			for (int j = 0; j < i - 2; j++) {
				temp = query.poll();
				System.out.print(temp + "\t" + "\t");// 打印n-1行的对象
				temp += query.peek();
				query.offer(temp);// 利用队中第n-1行对象产生第n行对象
			}
			k = 0;
			System.out.println(query.poll());// 第n-1行的最后一个对象出队
			query.offer(1);// 第n行的最后一个对象入队

		}
		// 打印最后一行
		while ((last = query.poll()) != null) {
			System.out.print(last + "\t" + "\t");
		}

打印结果：

                                                      1
                                                1            1
                                          1            2            1
                                    1            3            3            1
                              1            4            6            4            1
                        1            5            10            10            5            1
                  1            6            15            20            15            6            1
            1            7            21            35            35            21            7            1
      1            8            28            56            70            56            28            8            1
1            9            36            84            126            126            84            36            9            1