首页 > 其他 > 详细

Pascal's Triangle II

时间:2015-06-20 16:55:51      阅读:286      评论:0      收藏:0      [点我收藏+]

Description:

Given an index k, return the kth row of the Pascal‘s triangle.

For example, given k = 3,
Return [1,3,3,1].

Note:
Could you optimize your algorithm to use only O(k) extra space?

Code:

 1   vector<int> getRow(int rowIndex) {
 2         vector<int>lastRow;
 3         vector<int>cur;
 4         
 5         if (rowIndex >= 0)
 6         {
 7             cur.push_back(1);
 8             lastRow = cur;
 9             
10             for (int i = 1; i <= rowIndex; ++i)
11             {
12                 cur.clear();
13                 for (int j = 0; j <= i; ++j)
14                 {
15                     if (j == 0)
16                         cur.push_back(lastRow[0]);
17                     else if (j==lastRow.size())
18                         cur.push_back(lastRow[j-1]);
19                     else
20                         cur.push_back(lastRow[j]+lastRow[j-1]);
21                 }
22                 lastRow = cur;
23             }
24         }
25         return lastRow;
26     }

 

Pascal's Triangle II

原文:http://www.cnblogs.com/happygirl-zjj/p/4590690.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!