Commitac27b27

applewjg

committed

Pascal'sTriangle

Change-Id: I205969737b5316955a2c4c79420e9588f4b1650d

1 parent038ecf9 commitac27b27Copy full SHA for ac27b27

File tree

+39

-0

lines changed

+39

-0

lines changed

Lines changed: 39 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,39 @@`
	`1`	`+/*`
	`2`	`+ Author: Andy, nkuwjg@gmail.com`
	`3`	`+ Date: Apr 16, 2013`
	`4`	`+ Problem: Pascal's Triangle`
	`5`	`+ Difficulty: Easy`
	`6`	`+ Source: http://leetcode.com/onlinejudge#question_118`
	`7`	`+ Notes:`
	`8`	`+ Given numRows, generate the first numRows of Pascal's triangle.`
	`9`	`+ For example, given numRows = 5,`
	`10`	`+ Return`
	`11`	`+ [`
	`12`	`+ [1],`
	`13`	`+ [1,1],`
	`14`	`+ [1,2,1],`
	`15`	`+ [1,3,3,1],`
	`16`	`+ [1,4,6,4,1]`
	`17`	`+ ]`
	`18`	`+`
	`19`	`+ Solution: .....`
	`20`	`+ */`
	`21`	`+publicclassSolution {`
	`22`	`+publicList<List<Integer>>generate(intnumRows) {`
	`23`	`+List<List<Integer>>res =newArrayList<List<Integer>>();`
	`24`	`+if (numRows <1)returnres;`
	`25`	`+List<Integer>temp =newArrayList<Integer>();`
	`26`	`+temp.add(1);`
	`27`	`+res.add(temp);`
	`28`	`+for (inti =1;i <numRows; ++i) {`
	`29`	`+List<Integer>t =newArrayList<Integer>();`
	`30`	`+t.add(1);`
	`31`	`+for (intj =1;j <i; ++j) {`
	`32`	`+t.add(res.get(i-1).get(j-1) +res.get(i-1).get(j));`
	`33`	`+ }`
	`34`	`+t.add(1);`
	`35`	`+res.add(t);`
	`36`	`+ }`
	`37`	`+returnres;`
	`38`	`+ }`
	`39`	`+}`

Comments

(0)