OJ Practice 29--t119 Pascal's Triangle II

Print Yang Hui triangle specified row,

Returns the vector<int> type.

Ideas

1. Copy the previous question and save all the rows;

2. Minimum space complexity of 0 (N), is also a topic requirement.

That is, each row overwrites the previous row, in order to ensure that the valid values are not overwritten beforehand, you need to calculate from the back forward.

"Other Code"

vector<int> GetRow (intRowIndex) {Vector<int>ret; Ret.resize (RowIndex+1); //ret[0]=1; //ret[rowindex]=1;        inti,j;  for(i=0; i<=rowindex; i++) {Ret[i]=1; if(i>1){                 for(j=i-1; J>0; j--) Ret[j]=ret[j]+ret[j-1]; }        }        returnret; }

Results

3MS, actually very simple, do not repeat.

OJ Practice 29--t119 Pascal's Triangle II