[Leetcode] pascal& #39; s Triangle

Title: Row number n, generating n Pascal Triangle row

Algorithm: Step through array operations

public class Solution {public list<list<integer>> generate (int numrows) {if (NumRows < 0) {        return null;        } list<list<integer>> Pascaltriangle = new arraylist<list<integer>> (); for (int i=0; i<numrows; ++i) {if (i = = 0) {list<integer> currtriangle = new Arraylis                T<integer> ();                Currtriangle.add (1);            Pascaltriangle.add (i, currtriangle);                } else {list<integer> currtriangle = new arraylist<integer> ();                                list<integer> Lasttriangle = Pascaltriangle.get (i-1);                int lastinteger = 0;                    for (int j=0; j<lasttriangle.size (); ++j) {Currtriangle.add (Lastinteger + lasttriangle.get (j));                Lastinteger = Lasttriangle.get (j);                } currtriangle.add (1); Pascaltriangle.add(Currtriangle);    }}//end of the for return pascaltriangle; }}

Copyright notice: This article blog original articles, blogs, without consent, may not be reproduced.

[Leetcode] pascal& #39; s Triangle