码迷,mamicode.com
首页 > 其他好文 > 详细

[LeetCode] Pascal's Triangle II

时间:2014-08-03 23:10:36      阅读:179      评论:0      收藏:0      [点我收藏+]

标签:style   blog   color   strong   io   for   div   amp   

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?

class Solution {
public:
    vector<int> getRow(int rowIndex) {
        vector<int> temp;;
        temp.push_back(1);
        if(rowIndex==0)
            return temp;
        temp.push_back(1);
        if(rowIndex==1)
            return temp;
        for(int i=2;i<=rowIndex;i++){
          vector<int> res(i+1,1);
          for(int j=1;j<i;j++)
              res[j]=temp[j]+temp[j-1];
          temp = res;
        
        }


        return temp;
    }
};

 

[LeetCode] Pascal's Triangle II,布布扣,bubuko.com

[LeetCode] Pascal's Triangle II

标签:style   blog   color   strong   io   for   div   amp   

原文地址:http://www.cnblogs.com/Xylophone/p/3888982.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!