如何批量创建二维向量列表，无需逐个单独定义？

Hey Connor! Great question—avoiding repetitive code is always a smart move, and leaning on those pre-defined constants will make your code way easier to maintain down the line. Let's walk through the cleanest ways to pull this off:

First, Let's Confirm Your Constants #

I’ll assume your header file has something like this (adjust names if yours differ):

// In your header file
const int VECTOR_DIMENSION = 15;
const int NUMBER_OF_VECTORS = 12;

Method 1: One-Liner Initialization (Default Values) #

If you want all your 15×15 vectors to start with a default value (like 0), you can create a nested std::vector in a single line. This is the simplest, most concise approach:

#include <vector> // Don't forget this header!

// Create your list of vectors
std::vector<std::vector<int>> vectorList(NUMBER_OF_VECTORS, std::vector<int>(VECTOR_DIMENSION, 0));

• The first argument (NUMBER_OF_VECTORS) tells the outer vector how many inner vectors to create.
• The second argument is the template for each inner vector: a 15-element vector initialized to 0. Swap out 0 for any default value you need.

Accessing & Editing Vectors #

• The index of the vector in the list acts as its number (0-based by default). If you prefer 1-based numbering, just subtract 1 when accessing:
  • To edit the 3rd vector (1-based), use vectorList[2][7] = 42; (this sets the 8th element of the 3rd vector to 42).
  • To read the 1st vector's 5th element: int value = vectorList[0][4];

Method 2: Custom Initialization Per Vector #

If you need each vector to have unique initial values tied to its number, use a loop. This gives you full control over how each vector is set up:

#include <vector>

std::vector<std::vector<int>> vectorList;
vectorList.reserve(NUMBER_OF_VECTORS); // Preallocate space for better performance

for (int vecNum = 0; vecNum < NUMBER_OF_VECTORS; ++vecNum) {
    // Create a new 15-element vector
    std::vector<int> currentVec(VECTOR_DIMENSION);
    
    // Example: Initialize each element to the vector's 1-based number
    for (int elementIdx = 0; elementIdx < VECTOR_DIMENSION; ++elementIdx) {
        currentVec[elementIdx] = vecNum + 1;
    }
    
    // Add the vector to your list
    vectorList.push_back(currentVec);
}

• Here, vecNum is the 0-based index (so vecNum + 1 is your 1-based number). You can tweak the inner loop to set values however you need—random numbers, calculated values, etc.

Bonus: Using std::array (Fixed-Size Alternative) #

If your vector dimensions and count will never change at runtime, you can use std::array instead of std::vector for a tiny performance boost:

#include <array>

std::array<std::array<int, VECTOR_DIMENSION>, NUMBER_OF_VECTORS> vectorArray;

• Access works the same way: vectorArray[0][5] = 100;
• The downside is that std::array has a fixed size determined at compile time, so it’s less flexible if you might need to adjust counts/dimensions later.

Why This Is Better Than Defining Each Vector Separately #

• Maintainability: If you ever need to change the vector size (say, from 15 to 20) or the number of vectors (from 12 to 15), you only need to update the constants in your header file—no need to rewrite 12 separate variable definitions.
• Cleanliness: No repetitive code cluttering up your implementation.
• Easy Access: The list structure lets you loop through all vectors easily (e.g., for processing all of them at once).

内容的提问来源于stack exchange，提问作者Connor M