#include<stdio.h>
#include<stdlib.h>
#include<errno.h>
#include<string.h>
struct s {
int n;
char m;
int arr[lbk]0[rbk];
};
int main(void)
{
struct s* ptr = (struct s*)malloc(sizeof(int)+ sizeof(char) + 5 * sizeof(int));//柔性成员五个元素
if (ptr == NULL)
{
printf("%s\n", strerror(errno));
return 0;
}
else
{
ptr->n = 1;
ptr->m = 'a';
int i;
for (i = 0; i < 5; i++)
{
ptr->arr[lbk]i[rbk] = 2 * (i + 1) - 1;
}
printf("初始成员为:\n");
printf("%d\n%c\n", ptr->n, ptr->m);
for (i = 0; i < 5; i++)
{
printf("%d ", ptr->arr[lbk]i[rbk]);
}
}
printf("\n");
struct s* ps = (struct s*)realloc(ptr, sizeof(int)+ sizeof(char) + 10 * sizeof(int));
if (ps == NULL)
{
printf("再分配失败!\n%s\n", strerror(errno));
return 0;
}
else {
ptr = ps;
int i;
for (i = 4; i < 10; i++)
{
ptr->arr[lbk]i[rbk] = 2 * (i + 1) - 1;
}
printf("再分配后的成员为:\n");
printf("%d\n%c\n", ptr->n, ptr->m);
for (i = 0; i < 10; i++)
{
printf("%d ", ptr->arr[lbk]i[rbk]);
}
}
free(ptr);
ptr = NULL;
return 0;
}

#include<stdlib.h>
#include<errno.h>
#include<string.h>
struct s {
int n;
char m;
int arr[lbk]0[rbk];
};
int main(void)
{
struct s* ptr = (struct s*)malloc(sizeof(int)+ sizeof(char) + 5 * sizeof(int));//柔性成员五个元素
if (ptr == NULL)
{
printf("%s\n", strerror(errno));
return 0;
}
else
{
ptr->n = 1;
ptr->m = 'a';
int i;
for (i = 0; i < 5; i++)
{
ptr->arr[lbk]i[rbk] = 2 * (i + 1) - 1;
}
printf("初始成员为:\n");
printf("%d\n%c\n", ptr->n, ptr->m);
for (i = 0; i < 5; i++)
{
printf("%d ", ptr->arr[lbk]i[rbk]);
}
}
printf("\n");
struct s* ps = (struct s*)realloc(ptr, sizeof(int)+ sizeof(char) + 10 * sizeof(int));
if (ps == NULL)
{
printf("再分配失败!\n%s\n", strerror(errno));
return 0;
}
else {
ptr = ps;
int i;
for (i = 4; i < 10; i++)
{
ptr->arr[lbk]i[rbk] = 2 * (i + 1) - 1;
}
printf("再分配后的成员为:\n");
printf("%d\n%c\n", ptr->n, ptr->m);
for (i = 0; i < 10; i++)
{
printf("%d ", ptr->arr[lbk]i[rbk]);
}
}
free(ptr);
ptr = NULL;
return 0;
}

