118. Pascal's Triangle (Graph; WFS)

來源:互聯網
上載者:User

標籤:

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]]
  
class Solution {public:    vector<vector<int> > generate(int numRows) {        vector<vector<int>> result(numRows, vector<int>());        if(numRows == 0) return result;        result[0].push_back(1);        for(int i =1; i < numRows; i++) //深度其次        {            result[i].push_back(1);            for(int j = 1; j<i;j++) //廣度優先            {                result[i].push_back(result[i-1][j-1]+result[i-1][j]);            }            result[i].push_back(1);        }        return result;    }};

 

118. Pascal's Triangle (Graph; WFS)

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.