您的位置:首页 > 其它

LeetCode:Pascal's Triangle

2016-01-10 17:38 274 查看


Pascal's Triangle

Total Accepted: 69445 Total
Submissions: 217681 Difficulty: Easy

Given numRows, generate the first numRows of Pascal's triangle.
For example, given numRows = 5,

Return
[
     [1],
    [1,1],
   [1,2,1],
  [1,3,3,1],
 [1,4,6,4,1]
]


Subscribe to see which companies asked this question

Hide Tags
Array

code:

class Solution {
public:
    vector<vector<int>> generate(int numRows) {
        vector<vector<int>> ivec(numRows);
        for(int i=0;i<numRows;i++) {
            ivec[i].resize(i + 1);
            ivec[i][0] = ivec[i][i] = 1;
            for(int j=1;j<i;j++)
                ivec[i][j] = ivec[i-1][j-1] + ivec[i-1][j];
        }
        return ivec;
    }
};
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: