在C++中存储不同长度的子数组

int main() {
    int n;
    cout << "请输入子数组的个数：";
    cin >> n;

    int** subArrays = new int*[n]; // 创建一个指针数组，用于存储子数组的指针

    for (int i = 0; i < n; i++) {
        int length;
        cout << "请输入第" << i+1 << "个子数组的长度：";
        cin >> length;

        subArrays[i] = new int[length]; // 创建一个长度为length的子数组
        cout << "请输入第" << i+1 << "个子数组的元素：";
        for (int j = 0; j < length; j++) {
            cin >> subArrays[i][j]; // 输入子数组的元素
        }
    }

    // 输出子数组的内容
    for (int i = 0; i < n; i++) {
        int length = sizeof(subArrays[i]) / sizeof(int); // 获取子数组的长度
        cout << "第" << i+1 << "个子数组的内容：";
        for (int j = 0; j < length; j++) {
            cout << subArrays[i][j] << " ";
        }
        cout << endl;
    }

    // 释放内存
    for (int i = 0; i < n; i++) {
        delete[] subArrays[i];
    }
    delete[] subArrays;

    return 0;
}

#include <iostream>
#include <vector>
using namespace std;

int main() {
    int n;
    cout << "请输入子数组的个数：";
    cin >> n;

    vector<vector<int>> subArrays; // 创建一个二维向量，用于存储子数组

    for (int i = 0; i < n; i++) {
        int length;
        cout << "请输入第" << i+1 << "个子数组的长度：";
        cin >> length;

        vector<int> subArray(length); // 创建一个长度为length的子数组
        cout << "请输入第" << i+1 << "个子数组的元素：";
        for (int j = 0; j < length; j++) {
            cin >> subArray[j]; // 输入子数组的元素
        }

        subArrays.push_back(subArray); // 将子数组添加到二维向量中
    }

    // 输出子数组的内容
    for (int i = 0; i < subArrays.size(); i++) {
        cout << "第" << i+1 << "个子数组的内容：";
        for (int j = 0; j < subArrays[i].size(); j++) {
            cout << subArrays[i][j] << " ";
        }
        cout << endl;
    }

    return 0;
}