【C】104.柔性数组

柔性数组
方法一：

#include <stdio.h>
#include<stdlib.h>
struct S {
	int n;
	int arr[];//柔性数组
};
int main() {
	struct S* ps = (struct S*)malloc(sizeof(struct S) + 5 * sizeof(int));
	if (ps != NULL) {
		ps->n = 100;
		int i = 0;
		for (i = 0; i < 5; i++) {
			ps->arr[i] = i;
		}
	}
	struct S* p = (struct S*)realloc(ps, 44);
	if (p != NULL) {
		ps = p;
	}
	int i = 0;
	for (i = 5; i < 10; i++) {
		ps->arr[i] = i;
	}
	for (i = 0; i < 10; i++) {
		printf("%d ", ps->arr[i]);
	}
	free(ps);
	ps = NULL;
	return 0;
}

方法二：

#include <stdio.h>
#include <stdlib.h>
struct S {
	int n;
	int* arr;
};
int main() {
	struct S* ps = (struct S*)malloc(sizeof(struct S));
	ps->n = 100;
	ps->arr = (int*)malloc(5 * sizeof(int));
	int i = 0;
	for (i = 0; i < 5; i++) {
		ps->arr[i] = i;
	}
	for (i = 0; i < 5; i++) {
		printf("%d ", ps->arr[i]);
	}
	int* ptr = (int*)realloc(ps->arr, 10 * sizeof(int));
	if (ptr != NULL) {
		ps->arr = ptr;
	}
		for (i = 5; i < 10; i++) {
			ps->arr[i] = i;
		}
	for (i = 0; i < 10; i++) {
		printf("%d ", ps->arr[i]);
	}
	free(ps->arr);
	ps->arr = NULL;
	free(ps);
	ps = NULL;
	return 0;
}

但更加推荐使用方法一，因为方法一使用的malloc次数较少，可能产生的内存碎片相对较少，内存利用率较高，也方便内存的释放；同时第一种内存空间是连续的，提高内存访问速度