LEETCODE: Pascal's Triangle II

来源:互联网 发布:手机兼职淘宝客服招聘 编辑:程序博客网 时间:2024/05/06 11:24

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

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

对上一题稍作修改的结果。


class Solution {public:    vector<int> getRow(int rowIndex) {        vector<int> results;        results.push_back(1);        if(rowIndex == 0) return results;        for(int ii = 1; ii <= rowIndex; ii ++) {            vector<int> last = results;            vector<int> newnum;            newnum.push_back(1);            for(int ii = 0; ii < last.size() - 1; ii ++) {                newnum.push_back(last[ii] + last[ii + 1]);            }            newnum.push_back(1);            results = newnum;        }        return results;    }};




0 0
原创粉丝点击