c++实现求指定层数的杨辉三角（帕斯卡三角）

第一次来这里发代码，提供一个求指定层数的杨辉三角（帕斯卡三角）c++版代码：

#include <iostream>
#include <vector>
using namespace std;
int main() {
    int a;
    vector<int> YangHui_triangle1, YangHui_triangle2;
    cin >> a;
    for (int i = 0; i <= a; ++i) {
        YangHui_triangle2 = {};
        for (int j = 0; j < i; ++j) {
            if (j == 0 || j == i - 1) {
                YangHui_triangle2.push_back(1);
            } else {
                YangHui_triangle2.push_back(YangHui_triangle1[j-1] + YangHui_triangle1[j]);
            }
        }
        for (int j = 0; j < i; ++j) {
            cout << YangHui_triangle2[j] << ' ';
        }
        cout << endl;
        YangHui_triangle1 = YangHui_triangle2;
    }
    return 0;
}

运行示例：