[LeetCode],Pascal's Triangle, 解题报告 - c++编程基础

题目

Given numRows, generate the first numRows of Pascal's triangle.
For example, given numRows = 5,
Return

vceho7y0tdpuJiM0Mzsx0NC1xLXaabj2yv21yNPatdpu0NC1xLXaaS0xuPbK/brNtdppuPbK/dauus2jrNXi0rLKx9fpus/K/bXE0NTWytau0rs8YnI+Cgo8YnI+Cgo8aDI+QUO0+sLrPC9oMj4KPHByZSBjbGFzcz0="brush:java;">import java.util.*; public class PascalTriangle { public static ArrayList > generate(int numRows) { ArrayList > result = new ArrayList >(); if (numRows < 1) { return result; } ArrayList start = new ArrayList (); start.add(1); result.add(start); for (int i = 1; i < numRows; i ++) { ArrayList pre = result.get(i - 1); ArrayList cur = new ArrayList (); cur.add(1); for (int j = 1; j < i; j ++) { int tmp = pre.get(j - 1) + pre.get(j); cur.add(tmp); } cur.add(1); result.add(cur); } return result; } public static void main(String args[]) { int n; ArrayList > list; Scanner cin = new Scanner(System.in); while (cin.hasNext()) { n = cin.nextInt(); list = generate(n); for (int i = 0; i < list.size(); i ++) { for (int j = 0; j < list.get(i).size(); j ++) { System.out.printf("%d ", list.get(i).get(j)); } System.out.println(); } } cin.close(); } }

后记

本来想再写一道LeetCode上题目再睡觉，但是突然LeetCode OJ访问速度超慢，我是用GAE翻墙的，按理说不应该出现这种情况啊，诡异！！