leetcode Pascal's Triangle && Pascal's Triangle II

最新推荐文章于 2020-08-13 00:37:00 发布

Do_Cool_Thing

最新推荐文章于 2020-08-13 00:37:00 发布

阅读量286

点赞数

分类专栏： leetcode Fighting

本文链接：https://blog.csdn.net/menyangyang/article/details/38587889

版权

leetcode Fighting 专栏收录该内容

133 篇文章 0 订阅

订阅专栏

Pascal's Triangle

代码

class Solution {
public:
    vector<vector<int> > generate(int numRows) {
        
        vector<vector<int> > result;
        
        for(int i = 0; i < numRows; ++i)
        {
            vector<int> tempRow;
            for(int j = 0; j < i+1; ++j)
            {
                if(j==0||j==i)
                    tempRow.push_back(1);
                else
                    tempRow.push_back(result[i-1][j-1]+result[i-1][j]);
                
            }
            
            result.push_back(tempRow);
            
        }
        
        return result;
        
    }
};

Pascal's Triangle ||

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