在C语言中使用NULL数组为二维数组分配内存的技术问询

Hey there! Let's break down how to work with this variable-length 2D array setup you've described—since each inner vector can have a different length, we need to use the sizes array to keep track of each one's length properly.

1. Iterating Through All Elements #

If you need to loop through every integer in all vectors, here's how you'd do it safely in C (accounting for NULL entries like your example includes):

#include <stdio.h>

void print_all_vectors(int** vectors, int size, int* sizes) {
    for (int i = 0; i < size; i++) {
        // Skip NULL vectors to avoid crashes
        if (vectors[i] == NULL) {
            printf("Vector %d: NULL\n", i);
            continue;
        }
        printf("Vector %d (length %d): ", i, sizes[i]);
        for (int j = 0; j < sizes[i]; j++) {
            printf("%d ", vectors[i][j]);
        }
        printf("\n");
    }
}

This code uses the sizes array to know exactly how many elements to iterate over in each inner vector, preventing out-of-bounds errors.

2. Allocating Memory for the Vector Array #

If you need to create this structure from scratch, here's a robust way to allocate memory (with cleanup for partial failures):

#include <stdlib.h>

int** create_vector_array(int size, int* sizes) {
    int** vectors = malloc(size * sizeof(int*));
    if (vectors == NULL) {
        return NULL; // Handle outer array allocation failure
    }
    
    for (int i = 0; i < size; i++) {
        if (sizes[i] == 0) {
            vectors[i] = NULL; // Represent empty vectors as NULL
            continue;
        }
        vectors[i] = malloc(sizes[i] * sizeof(int));
        if (vectors[i] == NULL) {
            // Clean up already allocated memory if one inner vector fails
            for (int k = 0; k < i; k++) {
                free(vectors[k]);
            }
            free(vectors);
            return NULL;
        }
    }
    return vectors;
}

3. Freeing the Vector Array #

Always clean up allocated memory to avoid leaks—this works safely even for NULL entries:

void free_vector_array(int** vectors, int size) {
    for (int i = 0; i < size; i++) {
        free(vectors[i]); // NULL is safe to free in standard C
    }
    free(vectors); // Free the outer array of pointers
}

Quick Example Usage #

Let's replicate your sample structure and test the code:

int main() {
    int size = 4;
    int sizes[] = {4, 6, 0, 1};
    int** vectors = create_vector_array(size, sizes);
    
    if (vectors != NULL) {
        // Populate the vectors with your sample values
        vectors[0][0] = 4; vectors[0][1] = 3; vectors[0][2] = 4; vectors[0][3] = 3;
        vectors[1][0] = 11; vectors[1][1] = 22; vectors[1][2] = 33;
        vectors[1][3] = 44; vectors[1][4] = 55; vectors[1][5] = 66;
        vectors[3][0] = 5;
        
        print_all_vectors(vectors, size, sizes);
        
        free_vector_array(vectors, size);
    }
    return 0;
}

This will output exactly the structure you provided!

One critical note: Always keep the sizes array in perfect sync with the actual length of each inner vector. Mismatches here will cause out-of-bounds memory access, leading to crashes or undefined behavior.

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